More on Computation First, and Basic Idea of Realizability
from Iowa Type Theory Commute Hosted by Aaron Stump
Types are specifications whose semantics is explained in terms of computation, which is thus conceptually prior. Realizability is a way of explaining the semantics of types.
Embed this episode
No transcript yet.
Frequently asked questions
How long is this episode of Iowa Type Theory Commute?
This episode is 15 minutes long.
When was this Iowa Type Theory Commute episode published?
This episode was published on January 29, 2020.
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.