Start / Iowa Type Theory Commute

Iowa Type Theory Commute

175 avsnitt • Längd: 15 min • Månadsvis

Matematik • Teknologi • Vetenskap

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

Avsnitt

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

Krivine's Proof of FD, Using Intersection Types

A Measure-Based Proof of Finite Developments

16 april | 23 min

Introduction to the Finite Developments Theorem

27 mars | 16 min

Nominal Isabelle/HOL

31 januari | 16 min

The Locally Nameless Representation

3 januari | 20 min

POPLmark Reloaded, Part 1

23 december 2024 | 15 min

POPLmark Reloaded, Part 2

23 december 2024 | 14 min

Introduction to Formalizing Programming Languages Theory

25 november 2024 | 12 min

Turing's proof of normalization for STLC

21 maj 2024 | 18 min

Introduction to normalization for STLC

14 maj 2024 | 10 min

Arithmetic operations in simply typed lambda calculus

4 maj 2024 | 10 min

The curious case of exponentiation in simply typed lambda calculus

4 maj 2024 | 7 min

More on basics of simple types

29 april 2024 | 16 min

Begin Chapter on Simple Type Theory

19 april 2024 | 16 min

Podden Iowa Type Theory Commute är skapad av Aaron Stump. Poddens innehåll och bilderna på den här webbplatsen hämtas med hjälp av poddens RSS-flöde.

Podcastbild

00:00 -00:00

Podcastbild

00:00 -00:00