Constructive proofs as programs
from Iowa Type Theory Commute Hosted by Aaron Stump
We consider the basic idea of the Curry-Howard isomorphism, that constructive proofs are essentially programs, and vice versa. Several simple examples. Why the law of excluded middle is not a legal constructive proof.
Embed this episode
No transcript yet.
Frequently asked questions
How long is this episode of Iowa Type Theory Commute?
This episode is 9 minutes long.
When was this Iowa Type Theory Commute episode published?
This episode was published on December 22, 2019.
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.