Terminating Computation First?
Update: 2025-08-01
Description
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.
Comments
In Channel
Download from Google Play
Download from App Store
United States00:00
00:00
1.0x
