Schematic Affine Recursion, Oh My!

To solve the problem raised in the last episode, I propose schematic affine recursion. We saw that affine lambda calculus (where lambda-bound variables are used at most once) plus structural recursion does not enforce termination, even if you restrict the recursor so that the function to be iterated is closed when you reduce ("closed at reduction"). You have to restrict it so that recursion terms are disallowed entirely unless the function to be iterated is closed ("closed at construction"). But this prevents higher-order functions like map, which need to repeat a computation involving a variable f to be mapped over the elements of a list. The solution is to allow schematic definition of terms, using schema variables ranging over closed terms.

You can listen to Schematic Affine Recursion, Oh My! online on Radio and Podcast. Open the player on this page to stream the available audio.

Schematic Affine Recursion, Oh My! is an episode from Iowa Type Theory Commute by Aaron Stump.

This episode is 18:49 long.

This episode was published on Aug 22, 2025.

Yes. Use the heart button on the episode page to add it to your favorite episodes list.

Yes. This page shows related episodes from Iowa Type Theory Commute when more episodes are available from the podcast feed.