Cocon: Computation in Contextual Type Theory

We describe a Martin-Löf style dependent type theory, called Cocon, that allows us to mix the intensional function space that is used to represent higher-order abstract syntax (HOAS) trees with the extensional function space that describes (recursive) computations. We mediate between HOAS representa...

Full description

Saved in:
Bibliographic Details
Main Authors Pientka, Brigitte, Abel, Andreas, Ferreira, Francisco, Thibodeau, David, Zucchini, Rebecca
Format Journal Article
LanguageEnglish
Published 10.01.2019
Subjects
Computer Science - Programming Languages
Online AccessGet full text
DOI10.48550/arxiv.1901.03378

Cover

More Information
Summary:We describe a Martin-Löf style dependent type theory, called Cocon, that allows us to mix the intensional function space that is used to represent higher-order abstract syntax (HOAS) trees with the extensional function space that describes (recursive) computations. We mediate between HOAS representations and computations using contextual modal types. Our type theory also supports an infinite hierarchy of universes and hence supports type-level computation -- thereby providing metaprogramming and (small-scale) reflection. Our main contribution is the development of a Kripke-style model for Cocon that allows us to prove normalization. From the normalization proof, we derive subject reduction and consistency. Our work lays the foundation to incorporate the methodology of logical frameworks into systems such as Agda and bridges the longstanding gap between these two worlds.
DOI:10.48550/arxiv.1901.03378