POPLmark Reloaded, Part 1

from Iowa Type Theory Commute · host Aaron Stump

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

Episode metadata supplied by the publisher feed · Published Dec 23, 2024

Embed this episode

Attribution link and audio player

NOW PLAYING

POPLmark Reloaded, Part 1

0:00 15:14

1×

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

Share this episode

Similar Episodes

No similar episodes found.

Similar Podcasts

No similar podcasts found.

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.

URL copied to clipboard!