EPISODE · Aug 1, 2025 · 11 MIN
Terminating Computation First?
from Iowa Type Theory Commute · host Aaron Stump
In this episode, I discuss an intriguing idea proposed by Victor Taelin, to base a logically sound type theory on an untyped but terminating language, upon which one may then erect as exotic a type system as one wishes. By enforcing termination already for the untyped language, we no longer have to make the type system do the heavy work of enforcing termination.
Embed this episode
Ready to play
Terminating Computation First?
0:00
11:27
1×
No transcript for this episode yet
Similar Episodes
No similar episodes found.
Similar Podcasts
No similar podcasts found.
Frequently Asked Questions
How long is this episode of Iowa Type Theory Commute?
This episode is 11 minutes long.
When was this Iowa Type Theory Commute episode published?
This episode was published on August 1, 2025.
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.
URL copied to clipboard!