Explore " lazy graph copying" with insightful episodes like "Lambda graphs with duplicators and start of Lamping's abstract algorithm" and "Duplicating redexes as the central problem of optimal reduction" from podcasts like ""Iowa Type Theory Commute" and "Iowa Type Theory Commute"" and more!
In this episode I talk about how to represent lambda terms as graphs with duplicator nodes for splitting edges corresponding to bound variables. I also start discussing the beginning of Lampings' abstract algorithm for optimal beta-reduction, in particular how we need to push duplicators inside lambda abstractions to initiate a lazy duplication.
We discussed last time how with a graph-sharing implementation of untyped lambda calculus, it can happen that you are forced to break sharing and copy a lambda abstraction. We discuss in this episode the central issue with doing that, namely copying redexes and copying applications which could turn into redexes following other beta reductions. The high-level idea of the proposed solution is also discussed, namely lazy graph duplication.
Stay up to date
For any inquiries, please email us at hello@podcastworld.io