English
Related papers

Related papers: The univalence axiom in cubical sets

200 papers

In this short note we give a glimpse of homotopy type theory, a new field of mathematics at the intersection of algebraic topology and mathematical logic, and we explain Vladimir Voevodsky's univalent interpretation of it. This…

History and Overview · Mathematics 2013-02-20 Steve Awodey , Álvaro Pelayo , Michael A. Warren

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…

Category Theory · Mathematics 2019-02-20 Michael Shulman

In this note we interpret Voevodsky's Univalence Axiom in the language of (abstract) model categories. We then show that any posetal locally Cartesian closed model category $Qt$ in which the mapping $Hom^{(w)}(Z\times B,C):Qt\longrightarrow…

Category Theory · Mathematics 2011-11-16 Misha Gavrilovich , Assaf Hasson , Itay Kaplan

Following a project of developing conventions and notations for informal type theory carried out in the homotopy type theory book for a framework built out of an augmentation of constructive type theory with axioms governing…

Logic in Computer Science · Computer Science 2018-06-25 Bruno Bentzen

We construct a new model category presenting the homotopy theory of presheaves on "inverse EI $(\infty,1)$-categories", which contains universe objects that satisfy Voevodsky's univalence axiom. In addition to diagrams on ordinary inverse…

Algebraic Topology · Mathematics 2017-03-30 Michael Shulman

The category of Cartesian cubical sets is introduced and endowed with a Quillen model structure using ideas coming from recent constructions of cubical systems of univalent type theory.

Category Theory · Mathematics 2023-07-18 Steve Awodey

We give a general technique for constructing a functorial choice of very good paths objects, which can be used to implement identity types in models of type theories in direct manner with little reliance on general coherence results. We…

Category Theory · Mathematics 2018-08-03 Andrew Swan

It is a well-known theorem of homotopy type theory, originally due to Voevodsky, that function extensionality holds inside any univalent universe. We consider a weaker variant of the univalence axiom, asserting that the wild category formed…

Logic in Computer Science · Computer Science 2026-05-04 Evan Cavallo , Jonas Höfer

We prove normalization for (univalent, Cartesian) cubical type theory, closing the last major open problem in the syntactic metatheory of cubical type theory. Our normalization result is reduction-free, in the sense of yielding a bijection…

Logic in Computer Science · Computer Science 2022-02-23 Jonathan Sterling , Carlo Angiuli

In their usual form, representation independence metatheorems provide an external guarantee that two implementations of an abstract interface are interchangeable when they are related by an operation-preserving correspondence. If our…

Programming Languages · Computer Science 2025-06-11 Carlo Angiuli , Evan Cavallo , Anders Mörtberg , Max Zeuner

Homotopy type theory is a modern foundation for mathematics that introduces the univalence axiom and is particularly suitable for the study of homotopical mathematics and its formalization via proof assistants. In order to better comprehend…

Category Theory · Mathematics 2025-08-13 Nima Rasekh

The non-standard identity concept developed in the Homotopy Type theory allows for an alternative analysis of Frege's famous Venus example, which explains how empirical evidences justify judgements about identities and accounts for the…

History and Overview · Mathematics 2012-06-11 Andrei Rodin

We define a computational type theory combining the contentful equality structure of cartesian cubical type theory with internal parametricity primitives. The combined theory supports both univalence and its relational equivalent, which we…

Logic in Computer Science · Computer Science 2023-06-22 Evan Cavallo , Robert Harper

We introduce Voevodsky's univalent foundations and univalent mathematics, and explain how to develop them with the computer system Agda, which is based on Martin-L\"of type theory. Agda allows us to write mathematical definitions,…

Logic in Computer Science · Computer Science 2022-09-05 Martín Hötzel Escardó

We develop a denotational semantics for general reference types in an impredicative version of guarded homotopy type theory, an adaptation of synthetic guarded domain theory to Voevodsky's univalent foundations. We observe for the first…

Logic in Computer Science · Computer Science 2023-11-22 Jonathan Sterling , Daniel Gratzer , Lars Birkedal

In this paper, we analyze and compare three of the many algebraic structures that have been used for modeling dependent type theories: categories with families, split type-categories, and representable maps of presheaves. We study these in…

Logic · Mathematics 2023-06-22 Benedikt Ahrens , Peter LeFanu Lumsdaine , Vladimir Voevodsky

We show that the type $\mathrm{T}\mathbb{Z}$ of $\mathbb{Z}$-torsors has the dependent universal property of the circle, which characterizes it up to a unique homotopy equivalence. The construction uses Voevodsky's Univalence Axiom and…

Logic · Mathematics 2020-11-19 Marc Bezem , Ulrik Buchholtz , Daniel R. Grayson , Michael Shulman

We contribute XTT, a cubical reconstruction of Observational Type Theory which extends Martin-L\"of's intensional type theory with a dependent equality type that enjoys function extensionality and a judgmental version of the unicity of…

Logic in Computer Science · Computer Science 2021-04-20 Jonathan Sterling , Carlo Angiuli , Daniel Gratzer

We construct a model of cubical type theory with a univalent and impredicative universe in a category of cubical assemblies. We show that this impredicative universe in the cubical assembly model does not satisfy a form of propositional…

Logic in Computer Science · Computer Science 2019-11-19 Taichi Uemura

Homotopy Type Theory may be seen as an internal language for the $\infty$-category of weak $\infty$-groupoids which in particular models the univalence axiom. Voevodsky proposes this language for weak $\infty$-groupoids as a new foundation…

Category Theory · Mathematics 2019-02-20 Egbert Rijke , Bas Spitters