Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types

Authors: Valentin Blot and James Laird

Paper Information

Title:Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types
Authors:Valentin Blot and James Laird
Proceedings:LICS PDF files
Editors: Anuj Dawar and Erich Grädel
Keywords:Denotational semantics, Dependent types, Game semantics, Universes, Sequential algorithms, Event structures, Categorical models

ABSTRACT. We describe a dependent type theory, and a denotational model for it, that incorporates both intensional and extensional semantic universes. In the former, terms and types are interpreted as strategies on certain graph games, which are concrete data structures of a generalized form, and in the latter as stable functions on event domains.

The concrete data structures themselves form an event domain, with which we may interpret an (extensional) universe type of (intensional) types. A dependent game corresponds to a stable function into this domain; we use its trace to define dependent product and sum constructions as it captures precisely how unfolding moves combine with the dependency to shape the possible interaction in the game. Since each strategy computes a stable function on CDS states, we can lift typing judgements from the intensional to the extensional setting, giving an expressive type theory with recursively defined type families and type operators.

We define an operational semantics for intensional terms, giving a functional programming language based on our type theory, and prove that our semantics for it is computationally adequate. By extending it with a simple non-local control operator on intensional terms, we can precisely characterize behaviour in the intensional model. We demonstrate this by proving full abstraction and full completeness results.

Talk:Jul 11 11:20 (Session 64E)