Start / Iowa Type Theory Commute / Introduction to the finite developments theorem

Iowa Type Theory Commute

Introduction to the Finite Developments Theorem

16 min • 27 mars 2025

The finite developments theorem in pure lambda calculus says that if you select as set of redexes in a lambda term and reduce only those and their residuals (redexes that can be traced back as existing in the original set), then this process will always terminate. In this episode, I discuss the theorem and why I got interested in it.

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