Program Termination and the Curry-Howard Isomorphism episode artwork

EPISODE · Jan 10, 2020 · 10 MIN

Program Termination and the Curry-Howard Isomorphism

from Iowa Type Theory Commute · host Aaron Stump

For programs to make sense as proofs, they need to be terminating (cannot run forever), since otherwise you can write infinite loops that have any type.  Under Curry-Howard this means any formula is provable, which is one way to define inconsistency.  (And logics have to be consistent to be useful.)

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

For programs to make sense as proofs, they need to be terminating (cannot run forever), since otherwise you can write infinite loops that have any type. Under Curry-Howard this means any formula is provable, which is one way to define inconsistency. (And logics have to be consistent to be useful.)

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

NOW PLAYING

Program Termination and the Curry-Howard Isomorphism

0:00 10:57

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

When was this Iowa Type Theory Commute episode published?

This episode was published on January 10, 2020.

What is this episode about?

For programs to make sense as proofs, they need to be terminating (cannot run forever), since otherwise you can write infinite loops that have any type.  Under Curry-Howard this means any formula is provable, which is one way to define...

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!