A type theory for synthetic -categories
We propose foundations for a synthetic theory of $(\infty, 1) $-categories within homotopy
type theory. We axiomatize a directed interval type, then define higher simplices from it and …
type theory. We axiomatize a directed interval type, then define higher simplices from it and …
The HoTT library: a formalization of homotopy type theory in Coq
We report on the development of the HoTT library, a formalization of homotopy type theory in
the Coq proof assistant. It formalizes most of basic homotopy type theory, including …
the Coq proof assistant. It formalizes most of basic homotopy type theory, including …
Two-level type theory and applications
We define and develop two-level type theory (2LTT), a version of Martin-Löf type theory
which combines two different type theories. We refer to them as the 'inner'and the 'outer'type …
which combines two different type theories. We refer to them as the 'inner'and the 'outer'type …
An experimental library of formalized mathematics based on the univalent foundations
V Voevodsky - Mathematical Structures in Computer Science, 2015 - cambridge.org
This is a short overview of an experimental library of Mathematics formalized in the Coq
proof assistant using the univalent interpretation of the underlying type theory of Coq. I …
proof assistant using the univalent interpretation of the underlying type theory of Coq. I …
[PDF][PDF] Displayed categories
B Ahrens, PLF Lumsdaine - Logical Methods in Computer …, 2019 - lmcs.episciences.org
We introduce and develop the notion of displayed categories. A displayed category over a
category C is equivalent to 'a category D and functor F: D→ C', but instead of having a single …
category C is equivalent to 'a category D and functor F: D→ C', but instead of having a single …
Formalizing category theory in Agda
The generality and pervasiveness of category theory in modern mathematics makes it a
frequent and useful target of formalization. It is however quite challenging to formalize, for a …
frequent and useful target of formalization. It is however quite challenging to formalize, for a …
Extending homotopy type theory with strict equality
In homotopy type theory (HoTT), all constructions are necessarily stable under homotopy
equivalence. This has shortcomings: for example, it is believed that it is impossible to define …
equivalence. This has shortcomings: for example, it is believed that it is impossible to define …
An introduction to univalent foundations for mathematicians
D Grayson - Bulletin of the American Mathematical Society, 2018 - ams.org
We offer an introduction for mathematicians to the univalent foundations of Vladimir
Voevodsky, aiming to explain how he chose to encode mathematics in type theory and how …
Voevodsky, aiming to explain how he chose to encode mathematics in type theory and how …
Homotopy type theory: Univalent foundations of mathematics
TUF Program - arXiv preprint arXiv:1308.0729, 2013 - arxiv.org
Homotopy type theory is a new branch of mathematics, based on a recently discovered
connection between homotopy theory and type theory, which brings new ideas into the very …
connection between homotopy theory and type theory, which brings new ideas into the very …
Bicategories in univalent foundations
We develop bicategory theory in univalent foundations. Guided by the notion of univalence
for (1-) categories studied by Ahrens, Kapulkin, and Shulman, we define and study univalent …
for (1-) categories studied by Ahrens, Kapulkin, and Shulman, we define and study univalent …