
Coercive subtyping and coherence
Jul 1, 2026 - 20:30
Radio and PodcastLive Radio & Podcasts
I discuss the paper POPLmark Reloaded: Mechanizing Proofs by Logical Relations , which proposes a benchmark problem for mechanizing Programming Language theory.
POPLmark Reloaded, Part 1 is an episode from Iowa Type Theory Commute by Aaron Stump. I discuss the paper POPLmark Reloaded: Mechanizing Proofs by Logical Relations , which proposes a benchmark problem for mechanizing Programming Language t...
This episode belongs to Iowa Type Theory Commute.
Use the player on this page to stream the episode online.
Published Dec 23, 2024, 15:14 long, audio available.