Why Curry-Howard for classical proofs is a bad idea for programming
from Iowa Type Theory Commute Hosted by 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.
Embed this episode
No transcript yet.
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.
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.