Introduction to Formalizing Programming Languages Theory episode artwork

EPISODE · Nov 25, 2024 · 12 MIN

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

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.

PodParley-generated summary based on available episode metadata and transcript content.

NOW PLAYING

Introduction to Formalizing Programming Languages Theory

0:00 12:20

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.

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.

What is this episode about?

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.

Can I download this Iowa Type Theory Commute episode?

Yes, you can download this episode by clicking the download button on the episode player, or subscribe to the podcast in your preferred podcast app for automatic downloads.
URL copied to clipboard!