Skip to content
Artwork for Iowa Type Theory Commute
TechnologyScienceMathematics

Iowa Type Theory Commute

Aaron Stump

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

Play
  • 23 episodes
  • Avg 17 min
  • English
Counted on this page — what you have heard stays on this device, so it is not something the list can be paged by.
  • S6 · E6
    Mar 27, 2025 · 15 min

    Introduction to the Finite Developments Theorem

    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.

  • S6 · E5
    Jan 31, 2025 · 16 min

    Nominal Isabelle/HOL

    In this episode, I discuss the paper Nominal Techniques in Isabelle/HOL, by Christian Urban. This paper shows how to reason with terms modulo alpha-equivalence, using ideas from nominal logic. The basic idea is that instead of renamings, one works with permutations of names.

  • S6 · E4
    Jan 3, 2025 · 19 min

    The Locally Nameless Representation

    I discuss what is called the locally nameless representation of syntax with binders, following the first couple of sections of the very nicely written paper "The Locally Nameless Representation," by Charguéraud. I complain due to the statement in the paper that "the theory of λ-calculus identifies terms that are α-equivalent," which is simply not true if one is considering lambda calculus as defined by Church, where renaming is an explicit reduction step, on a par with beta-reduction. I also answer a listener's question about what "computational type theory" means. Feel free to email me any time at aaron.stump@bc.edu, or join the Telegram group for the podcast.

Showing 21–23 of 23 episodes