Terminating Computation First? episode artwork

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.

Episode metadata supplied by the publisher feed · Published Aug 1, 2025

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.

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

NOW PLAYING

Terminating Computation First?

0:00 11:27

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

When was this Iowa Type Theory Commute episode published?

This episode was published on August 1, 2025.

What is this episode about?

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...

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!