POPLmark Reloaded, Part 1
from Iowa Type Theory Commute Hosted by Aaron Stump
I discuss the paper POPLmark Reloaded: Mechanizing Proofs by Logical Relations, which proposes a benchmark problem for mechanizing Programming Language theory.
Embed this episode
No transcript yet.
Frequently asked questions
How long is this episode of Iowa Type Theory Commute?
This episode is 15 minutes long.
When was this Iowa Type Theory Commute episode published?
This episode was published on December 23, 2024.
Can I download this Iowa Type Theory Commute episode?
Yes. Use the download control on the episode player to save the publisher-provided media file.