Iowa Type Theory Commute

Aaron Stump
  • ٥٫٠ (١٩)
  • التكنولوجيا

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

  1. ١٤ نوفمبر

    Measure Functions and Termination of STLC

    In this episode, I talk about what we should consider to be a measure function.  Such functions can be used to show termination of some process or program, by assigning a measure to each program, and showing that as the program computes, the measure decreases in some well-founded ordering.  But what should count as a measure function?  The context for this is RTA Open Problem 19, on showing termination for the simply typed lambda calculus using a measure function. Let's call this the start of season 7, because it seems about time for that.

    ٢٢ من الدقائق

  2. ٢٢ أغسطس

    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.

    ١٩ من الدقائق

  3. ١٩ أغسطس

    The Stunner: Linear System T is Diverging!

    In this episode, I shoot down last episode's proposal -- at least in the version I discussed -- based on an amazing observation from an astonishing paper, "Gödel’s system T revisited", by Alves, Fernández, Florido, and Mackie.  Linear System T is diverging, as they reveal through a short but clever example.  It is even diverging if one requires that the iterator can only be reduced when the function to be iterated is closed (no free variables).  This extraordinary observation does not sink Victor's idea of basing type theory on a terminating untyped core language, but it does sink the specific language he and I were thinking about, namely affine lambda calculus plus structural recursion. My notes are here.

    ٢١ من الدقائق

  4. ١ أغسطس

    Terminating Computation First?

    In this episode, I discuss an intriguing idea proposed by Victor Taelin, to base a logically sound type theory on an untyped but terminating language, upon which one may then erect as exotic a type system as one wishes.  By enforcing termination already for the untyped language, we no longer have to make the type system do the heavy work of enforcing termination.

    ١١ من الدقائق

  5. ١٢ مايو

    Correction: the Correct Author of the Proof from Last Episode, and an AI flop

    I correct what I said in the last episode about the author of the proof of FD from last episode based on intersection types.  I also describe AI flopping when I ask it a question about this.

    ٧ من الدقائق

  6. ٥ مايو

    Krivine's Proof of FD, Using Intersection Types

    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.

    ٢٢ من الدقائق

  7. ١٦ أبريل

    A Measure-Based Proof of Finite Developments

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

    ٢٣ من الدقائق

  8. ٢٧ مارس

    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.

    ١٦ من الدقائق
مشاهدة الكل (١٧٩)

٥
من ٥
‫١٩ من التقييمات‬

حول

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

المعلومات

  • صناع العمل
    Aaron Stump
  • سنوات النشاط
    ٢٠١٩ - ٢٠٢٥
  • الحلقات
    ١٧٩
  • التقييم
    ملائم
  • حقوق النشر
    © 2025 Iowa Type Theory Commute
  • موقع البرنامج على الويب
    Iowa Type Theory Commute