Podcasts Technology Iowa Type Theory Commute Lambda graphs with duplicators and start of Lamping's abstract algorithm

Lambda graphs with duplicators and start of Lamping's abstract algorithm

Published: July 3, 2020, 8 p.m.

b'

In this episode I talk about how to represent lambda terms as graphs with duplicator nodes for splitting edges corresponding to bound variables.\\xa0 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.

'