• Iowa Type Theory Commute

  • 著者: Aaron Stump
  • ポッドキャスト

Iowa Type Theory Commute

著者: Aaron Stump
  • サマリー

  • Aaron Stump talks about type theory, computational logic, and related topics in Computer Science on his short commute.
    © 2025 Iowa Type Theory Commute
    続きを読む 一部表示

あらすじ・解説

Aaron Stump talks about type theory, computational logic, and related topics in Computer Science on his short commute.
© 2025 Iowa Type Theory Commute
エピソード
  • Krivine's Proof of FD, Using Intersection Types
    2025/05/05

    Krivine's book (Section 4.2) has a proof of the Finite Developments Theorem, based on intersection types. I discuss this proof in this episode.

    続きを読む 一部表示
    22 分
  • A Measure-Based Proof of Finite Developments
    2025/04/16

    I discuss the paper "A Direct Proof of the Finite Developments Theorem", by Roel de Vrijer. See also the write-up at my blog.

    続きを読む 一部表示
    23 分
  • Introduction to the Finite Developments Theorem
    2025/03/27

    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.

    続きを読む 一部表示
    16 分

Iowa Type Theory Commuteに寄せられたリスナーの声

カスタマーレビュー:以下のタブを選択することで、他のサイトのレビューをご覧になれます。