Litcius/Paper detail

Syntax and models of Cartesian cubical type theory

Carlo Angiuli, Guillaume Brunerie, Thierry Coquand, Robert Harper, Kuen-Bang Hou, Daniel R. Licata

2021Mathematical Structures in Computer Science28 citationsDOIOpen Access PDF

Abstract

Abstract We present a cubical type theory based on the Cartesian cube category (faces, degeneracies, symmetries, diagonals, but no connections or reversal) with univalent universes, each containing Π, Σ, path, identity, natural number, boolean, suspension, and glue (equivalence extension) types. The type theory includes a syntactic description of a uniform Kan operation, along with judgmental equality rules defining the Kan operation on each type. The Kan operation uses both a different set of generating trivial cofibrations and a different set of generating cofibrations than the Cohen, Coquand, Huber, and Mörtberg (CCHM) model. Next, we describe a constructive model of this type theory in Cartesian cubical sets. We give a mechanized proof, using Agda as the internal language of cubical sets in the style introduced by Orton and Pitts, that glue, Π, Σ, path, identity, boolean, natural number, suspension types, and the universe itself are Kan in this model, and that the universe is univalent. An advantage of this formal approach is that our construction can also be interpreted in a range of other models, including cubical sets on the connections cube category and the De Morgan cube category, as used in the CCHM model, and bicubical sets, as used in directed type theory.

Topics & Concepts

Type theoryCube (algebra)DiagonalUniverseType (biology)Path (computing)Computer scienceConstructiveMathematicsAlgebra over a fieldDiscrete mathematicsPure mathematicsCombinatoricsProgramming languageGeometryEcologyAstrophysicsBiologyProcess (computing)PhysicsLogic, programming, and type systemsAdvanced Algebra and LogicHomotopy and Cohomology in Algebraic Topology
Syntax and models of Cartesian cubical type theory | Litcius