• 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.
    © 2024 Iowa Type Theory Commute
    続きを読む 一部表示

あらすじ・解説

Aaron Stump talks about type theory, computational logic, and related topics in Computer Science on his short commute.
© 2024 Iowa Type Theory Commute
エピソード
  • Turing's proof of normalization for STLC
    2024/05/21

    In this episode, I describe the first proof of normalization for STLC, written by Alan Turing in the 1940s. See this short note for Turing's original proof and some historical comments.

    続きを読む 一部表示
    18 分
  • Introduction to normalization for STLC
    2024/05/14

    In this episode, after a quick review of the preceding couple, I discuss the property of normalization for STLC, and talk a bit about proof methods. We will look at proofs in more detail in the coming episodes. Feel free to join the Telegram group for the podcast if you want to discuss anything (or just email me at aaron.stump@gmail.com).

    続きを読む 一部表示
    10 分
  • The curious case of exponentiation in simply typed lambda calculus
    2024/05/04

    Like addition and multiplication on Church-encoded numbers, exponentiation can be assigned a type in simply typed lambda calculus (STLC). But surprisingly, the type is non-uniform. If we abbreviate (A -> A) -> A -> A as Nat_A, then exponentiation, which is defined as \ x . \ y . y x, can be assigned type Nat_A -> Nat_(A -> A) -> Nat_A. The second argument needs to have type at strictly higher order than the first argument. This has the fascinating consequence that we cannot define self-exponentiation, \ x . exp x x. That term would reduce to \ x . x x, which is provably not typable in STLC.

    続きを読む 一部表示
    7 分

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

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