Iowa Type Theory Commute
Iowa Type Theory Commute
Aaron Stump
Lambda graphs with duplicators and start of Lamping's abstract algorithm
22 minutes Posted Jul 3, 2020 at 8:00 pm.
0:00
22:22
Download MP3
Show notes

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.