A Type Theory for Defining Logics and Proofs

• Published in: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) pp. 1 - 13
• Main Authors: Pientka, Brigitte, Thibodeau, David, Abel, Andreas, Ferreira, Francisco, Zucchini, Rebecca
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2019
• Subjects: Computational modeling; Computer science; Encoding; Pattern matching; Shape; Syntactics; Writing
• DOI: 10.1109/LICS.2019.8785683

We describe a Martin-Lof-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.