<p>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.</p>

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.

<p>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.&nbsp; In this episode, I discuss the theorem and why I got interested in it.</p>

Introduction to the Finite Developments Theorem

Aaron Stump talks about type theory, computational logic, and related topics in Computer Science on his short commute.

Share Introduction to the Finite Developments Theorem

Sign up to save your podcasts

Introduction to the Finite Developments Theorem

Introduction to the Finite Developments Theorem

More shows like Iowa Type Theory Commute

Dwarkesh Podcast

Type Theory Forall