Start / Iowa Type Theory Commute / Introduction to optimal beta reduction

Iowa Type Theory Commute

Introduction to optimal beta reduction

17 min • 16 juni 2020

Some background on optimal beta reduction: Levy, Lamping. The main problem to overcome is duplicating a lambda abstraction that is used in two different places in your term. The solution is to try to duplicate it incrementally.

Senaste avsnitt

Correction: the Correct Author of the Proof from Last Episode, and an AI flop

Krivine's Proof of FD, Using Intersection Types

A Measure-Based Proof of Finite Developments

16 april | 23 min

Introduction to the Finite Developments Theorem

27 mars | 16 min

Nominal Isabelle/HOL

31 januari | 16 min

Podcastbild

00:00 -00:00

Podcastbild

00:00 -00:00