Univalence for inverse diagrams and homotopy canonicity
arXiv:1203.3253 · doi:10.1017/S0960129514000565
Abstract
We describe a homotopical version of the relational and gluing models of type theory, and generalize it to inverse diagrams and oplax limits. Our method uses the Reedy homotopy theory on inverse diagrams, and relies on the fact that Reedy fibrant diagrams correspond to contexts of a certain shape in type theory. This has two main applications. First, by considering inverse diagrams in Voevodsky's univalent model in simplicial sets, we obtain new models of univalence in a number of (infinity,1)-toposes; this answers a question raised at the Oberwolfach workshop on homotopical type theory. Second, by gluing the syntactic category of univalent type theory along its global sections functor to groupoids, we obtain a partial answer to Voevodsky's homotopy-canonicity conjecture: in 1-truncated type theory with one univalent universe of sets, any closed term of natural number type is homotopic to a numeral.
70 pages. v2: greatly expanded and largely rewritten, with more detailed proofs, and new applications to gluing and a partial solution to Voevodsky's homotopy canonicity conjecture. v3: small changes and fixes, final version to appear in MSCS
References in corpus (4)
Cited by in corpus (16)
- Two-Level Type Theory and Applications
- Normalization for Cubical Type Theory
- Semantics of higher inductive types
- The homotopy theory of type theories
- Towards a constructive simplicial model of Univalent Foundations
- Topological Quantum Gates in Homotopy Type Theory
- Univalence and completeness of Segal objects
- Locally Cartesian Closed Quasicategories from Type Theory
- The Hurewicz theorem in Homotopy Type Theory
- Fibred Fibration Categories
- Homotopical inverse diagrams in categories with attributes
- An electrical engineering perspective on naturality in computational physics
- A parametricity-based formalization of semi-simplicial and semi-cubical sets
- Identity types and weak factorization systems in Cauchy complete categories
- Logical Relations as Types: Proof-Relevant Parametricity for Program Modules
- Displayed Type Theory and Semi-Simplicial Types