Why Curry-Howard for classical proofs is a bad idea for programming episode artwork

EPISODE · Jan 7, 2020 · 14 MIN

Why Curry-Howard for classical proofs is a bad idea for programming

from Iowa Type Theory Commute · host Aaron Stump

If you have dependent types, classical reasoning, and the Curry-Howard isomorphism, you can write programs that look like they are invoking oracles for undecidable problems -- but they are not, and this is confusing.

Episode metadata supplied by the publisher feed · Published Jan 7, 2020

If you have dependent types, classical reasoning, and the Curry-Howard isomorphism, you can write programs that look like they are invoking oracles for undecidable problems -- but they are not, and this is confusing.

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

NOW PLAYING

Why Curry-Howard for classical proofs is a bad idea for programming

0:00 14:09

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

When was this Iowa Type Theory Commute episode published?

This episode was published on January 7, 2020.

What is this episode about?

If you have dependent types, classical reasoning, and the Curry-Howard isomorphism, you can write programs that look like they are invoking oracles for undecidable problems -- but they are not, and this is confusing.

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!