Introduction to Formalizing Programming Languages Theory

from Iowa Type Theory Commute · host Aaron Stump

In this episode, I begin discussing the question and history of formalizing results in Programming Languages Theory using interactive theorem provers like Rocq (formerly Coq) and Agda.

Episode metadata supplied by the publisher feed · Published Nov 25, 2024

Embed this episode

Attribution link and audio player

Ready to play

Introduction to Formalizing Programming Languages Theory

0:00 12:20

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 12 minutes long.

When was this Iowa Type Theory Commute episode published?

This episode was published on November 25, 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!