『Terminating Computation First?』のカバーアート

Terminating Computation First?

Terminating Computation First?

無料で聴く

ポッドキャストの詳細を見る

このコンテンツについて

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.

まだレビューはありません