English

Computational Higher Type Theory III: Univalent Universes and Exact Equality

Logic in Computer Science 2017-12-06 v1

Abstract

This is the third in a series of papers extending Martin-L\"of's meaning explanations of dependent type theory to a Cartesian cubical realizability framework that accounts for higher-dimensional types. We extend this framework to include a cumulative hierarchy of univalent Kan universes of Kan types, exact equality and other pretypes lacking Kan structure, and a cumulative hierarchy of pretype universes. As in Parts I and II, the main result is a canonicity theorem stating that closed terms of boolean type evaluate to either true or false. This establishes the computational interpretation of Cartesian cubical higher type theory based on cubical programs equipped with a deterministic operational semantics.

Keywords

Cite

@article{arxiv.1712.01800,
  title  = {Computational Higher Type Theory III: Univalent Universes and Exact Equality},
  author = {Carlo Angiuli and Kuen-Bang Hou and Robert Harper},
  journal= {arXiv preprint arXiv:1712.01800},
  year   = {2017}
}

Comments

71 pages

R2 v1 2026-06-22T23:07:42.199Z