A Strange Deal
The Curry-Howard isomorphism for the law of excluded middle, as a radio drama. I first saw a version of this story performed by Phil Wadler...
Radio and PodcastLive Radio & PodcastsTechnology
Iowa Type Theory Commute
Aaron Stump talks about type theory, computational logic, and related topics in Computer Science on his short commute.
Iowa Type Theory Commute Podcast Guide
Listen to Iowa Type Theory Commute, a Technology podcast by Aaron Stump. Stream 185 episodes in English, follow new audio stories, and play episodes online on Radio and Podcast.
Show Topic
Browse this show under Technology podcasts.
Episodes
20 episodes are loaded now from a catalog of 185. More episodes can be opened from this page.
Discover More
Explore Technology podcasts, Argentina podcasts and English podcasts.
Episodes
20 of 185 episodesGreat paper: The Calculated Typer
I discuss a nice paper I quite enjoyed reading, called The Calculated Typer , by Garby, Bahr, and Hutton. The authors take a very nice gener...
Double-negation translations and CPS conversion, part 2
In this episode, I talk about the control operator callcc, and how it is implemented during compilation using continuation-passing style (CP...
Double-negation translations and CPS conversion, part 1
In this episode, I talk about a somewhat more advanced case of the Curry-Howard isomorphism (the connection between logic and programming la...
What are commuting conversions in proof theory?
Commuting conversions are transformations on proofs in natural deduction, that move certain stuck inferences out of the way, so that the nor...
What is Control Flow Analysis for Lambda Calculus?
I am currently on a frolic into the literature on Control Flow Analysis (CFA), and discuss what this is, for pure lambda calculus. A wonderf...
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 proce...
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-boun...
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...
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...
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...
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...
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.
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...
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 modu...
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 nice...
POPLmark Reloaded, Part 1
I discuss the paper POPLmark Reloaded: Mechanizing Proofs by Logical Relations , which proposes a benchmark problem for mechanizing Programm...
POPLmark Reloaded, Part 2
I continue the discussion of POPLmark Reloaded , discussing the solutions proposed to the benchmark problem. The solutions are in the Beluga...
Introduction to Formalizing Programming Languages Theory
In this episode, I begin discussing the question and history of formalizing results in Programming Languages Theory using interactive theore...
Turing's proof of normalization for STLC
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&a...
Questions About Iowa Type Theory Commute
Where can I listen to Iowa Type Theory Commute episodes?
You can listen to Iowa Type Theory Commute episodes online on Radio and Podcast. Open an episode and the site player will stream the available audio.
What is Iowa Type Theory Commute about?
Iowa Type Theory Commute is listed as a Technology show. The show language is listed as English.
How many Iowa Type Theory Commute episodes are listed?
This page lists 185 episodes for Iowa Type Theory Commute. More episodes are available from the View more button when the list continues.
Quick Answers About Iowa Type Theory Commute
Where can I listen to Iowa Type Theory Commute?
You can listen to Iowa Type Theory Commute episodes on this page by opening an episode and using the site player.
What type of podcast is Iowa Type Theory Commute?
Iowa Type Theory Commute is listed as a Technology show by Aaron Stump.
How many episodes are available?
This page lists 185 episodes for Iowa Type Theory Commute where feed data is available.