Syntax and Models of Cartesian Cubical Type Theory

MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE(2019)

引用 21|浏览2
暂无评分
摘要
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, pushout, and glue (equivalence extension) types. The type theory includes a syntactic description of a uniform Kan operation, along with judgemental 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 the internal language of cubical sets in the style introduced by Orton and Pitts, that glue, Π, Σ, path, identity, boolean, natural number, pushout 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 cubical sets on the connections cube category, and on the de Morgan cube category used in the CCHM model. As a first step towards comparing these approaches, we show that the two Kan operations are interderivable in a setting where both exist (presheaves on the de Morgan cube category, with the additional cofibration required by our construction).
更多
查看译文
关键词
Type theory, homotopy type theory, cubical type theory
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要