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

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.

<p>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.&nbsp; By enforcing termination already for the untyped language, we no longer have to make the type system do the heavy work of enforcing termination.</p>

Terminating Computation First?

Aaron Stump talks about type theory, computational logic, and related topics in Computer Science on his short commute.

Share Terminating Computation First?

Sign up to save your podcasts

Terminating Computation First?

Terminating Computation First?

More shows like Iowa Type Theory Commute

Dwarkesh Podcast

Type Theory Forall