Start / Iowa Type Theory Commute / Poplmark reloaded part 1

Iowa Type Theory Commute

POPLmark Reloaded, Part 1

15 min • 23 december 2024

I discuss the paper POPLmark Reloaded: Mechanizing Proofs by Logical Relations, which proposes a benchmark problem for mechanizing Programming Language theory.

Senaste 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

Podcastbild

00:00 -00:00

Podcastbild

00:00 -00:00