English
Related papers

Related papers: Generating Higher Identity Proofs in Homotopy Type…

200 papers

We present the type theory CaTT, originally introduced by Finster and Mimram to describe globular weak $\omega$-categories, and we formalise this theory in the language of homotopy type theory. Most of the studies about this type theory…

Logic in Computer Science · Computer Science 2024-11-14 Thibaut Benjamin

Weak $\omega$-categories are notoriously difficult to define because of the very intricate nature of their axioms. Various approaches have been explored, based on different shapes given to the cells. Interestingly, homotopy type theory…

Logic in Computer Science · Computer Science 2024-11-14 Thibaut Benjamin

We study the dependent type theory CaTT, introduced by Finster and Mimram, which presents the theory of weak $\omega$-categories, following the idea that type theories can be considered as presentations of generalized algebraic theories.…

Logic in Computer Science · Computer Science 2024-02-05 Thibaut Benjamin , Eric Finster , Samuel Mimram

We present a conservative extension ICaTT of the dependent type theory CaTT for weak $\omega$-categories with a type witnessing coinductive invertibility of cells. This extension allows for a concise description of the "walking equivalence"…

Category Theory · Mathematics 2026-02-19 Thibaut Benjamin , Camil Champin , Ioannis Markakis

We show that in a weak globular $\omega$-category, all composition operations are equivalent and commutative for cells with sufficiently degenerate boundary, which can be considered a higher-dimensional generalisation of the Eckmann-Hilton…

Category Theory · Mathematics 2025-12-22 Thibaut Benjamin , Ioannis Markakis , Wilfred Offord , Chiara Sarti , Jamie Vicary

Two novel descriptions of weak {\omega}-categories have been recently proposed, using type-theoretic ideas. The first one is the dependent type theory CaTT whose models are {\omega}-categories. The second is a recursive description of a…

Category Theory · Mathematics 2024-12-18 Thibaut Benjamin , Ioannis Markakis , Chiara Sarti

Models of dependent type theories are contextual categories with some additional structure. We prove that if a theory $T$ has enough structure, then the category $T\text{-}\mathbf{Mod}$ of its models carries the structure of a model…

Category Theory · Mathematics 2016-07-26 Valery Isaev

We define a naturality construction for the operations of weak omega-categories, as a meta-operation in a dependent type theory. Our construction has a geometrical motivation as a local tensor product with a directed interval, and behaves…

Category Theory · Mathematics 2025-05-15 Thibaut Benjamin , Ioannis Markakis , Wilfred Offord , Chiara Sarti , Jamie Vicary

We show that for any type in Martin-L\"of Intensional Type Theory, the terms of that type and its higher identity types form a weak omega-category in the sense of Leinster. Precisely, we construct a contractible globular operad of definable…

Logic · Mathematics 2015-07-01 Peter LeFanu Lumsdaine

We define a notion of weak omega-category internal to a model of Martin-L\"of type theory, and prove that each type bears a canonical weak omega-category structure obtained from the tower of iterated identity types over that type. We show…

Logic · Mathematics 2011-10-17 Benno van den Berg , Richard Garner

We describe a construction that to each algebraically specified notion of higher-dimensional category associates a notion of homomorphism which preserves the categorical structure only up to weakly invertible higher cells. The construction…

Category Theory · Mathematics 2011-10-17 Richard Garner

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 a type of semi-simplicial types. More generally, it is…

Logic in Computer Science · Computer Science 2016-11-01 Thorsten Altenkirch , Paolo Capriotti , Nicolai Kraus

Higher inductive-inductive types (HIITs) generalize inductive types of dependent type theories in two ways. On the one hand they allow the simultaneous definition of multiple sorts that can be indexed over each other. On the other hand they…

Logic in Computer Science · Computer Science 2023-06-22 Ambrus Kaposi , András Kovács

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…

Logic in Computer Science · Computer Science 2023-06-22 Daniel Gratzer , G. A. Kavvos , Andreas Nuyts , Lars Birkedal

One takes advantage of some basic properties of every homotopic $\lambda$-model (e.g.\ extensional Kan complex) to explore the higher $\beta\eta$-conversions, which would correspond to proofs of equality between terms of a theory of…

Logic in Computer Science · Computer Science 2023-04-27 Daniel O. Martínez-Rivillas , Ruy J. G. B. de Queiroz

Using dependent type theory to formalise the syntax of dependent type theory is a very active topic of study and goes under the name of "type theory eating itself" or "type theory in type theory." Most approaches are at least loosely based…

Logic in Computer Science · Computer Science 2021-02-02 Nicolai Kraus

Weak $\infty$-categories are known to be more expressive than their strict counterparts, but are more difficult to work with, as constructions in such a category involve the manipulation of explicit coherence data. This motivates the search…

Logic in Computer Science · Computer Science 2025-02-25 Alex Rice

The first part of this dissertation defines "dependently typed algebraic theories", which are a strict subclass of the generalised algebraic theories (GATs) of Cartmell. We characterise dependently typed algebraic theories as finitary…

Category Theory · Mathematics 2021-10-07 Chaitanya Leena Subramaniam

We introduce Open Horn Type Theory (OHTT), an extension of dependent type theory with two primitive judgment forms: coherence and gap, subject to a mutual exclusion law. Unlike classical or intuitionistic negation, gap is not defined via…

Logic in Computer Science · Computer Science 2026-01-01 Iman Poernomo

Univalent homotopy type theory (HoTT) may be seen as a language for the category of $\infty$-groupoids. It is being developed as a new foundation for mathematics and as an internal language for (elementary) higher toposes. We develop the…

Category Theory · Mathematics 2023-06-22 Egbert Rijke , Michael Shulman , Bas Spitters
‹ Prev 1 2 3 10 Next ›