Start / Iowa Type Theory Commute / Well founded recursion

Iowa Type Theory Commute

Well-founded recursion

15 min • 19 maj 2020

Well-founded recursion is a technique to turn recursion which decreases along a well-founded ordering into a structural recursion.

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