English
Related papers

Related papers: A category-theoretic version of the identity type …

200 papers

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

In this paper the concept of compatible weak factorization systems in general categories is introduced as a counterpart of compatible complete cotorsion pairs in abelian categories. We describe a method to construct model structures on…

Category Theory · Mathematics 2024-10-02 Zhenxing Di , Liping Li , Li Liang

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

There are a dozen definitions of weak higher categories, all of which loosen the notion of composition of arrows. A new approach is presented here, where instead the notion of identity arrow is weakened -- these are tentatively called fair…

Category Theory · Mathematics 2010-03-09 Joachim Kock

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

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

Recent models of intensional type theory have been constructed in algebraic weak factorization systems (AWFSs). AWFSs give rise to comprehension categories that feature non-trivial morphisms between types; these morphisms are not used in…

Programming Languages · Computer Science 2025-11-18 Niyousha Najmaei , Niels van der Weide , Benedikt Ahrens , Paige Randall North

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

The small object argument is a method for transfinitely constructing weak factorization systems originally motivated by homotopy theory. We establish a variant of the small object argument that is enriched over a cofibrantly generated weak…

Category Theory · Mathematics 2025-05-26 Jan Jurka

Bourke and Garner described how to cofibrantly generate algebraic weak factorisation systems by a small double category of morphisms. However they did not give an explicit construction of the resulting factorisations as in the classical…

Category Theory · Mathematics 2025-12-15 Benno van den Berg , John Bourke , Paul Seip

We define a notion of a weak canonical base for a partial type. This notion is weaker than the usual canonical base for an amalgamation base. We prove that certain family of partial types have a weak canonical base. This family clearly…

Logic · Mathematics 2013-11-14 Ziv Shami

There is an ``algebraisation'' of the notion of weak factorisation system (w.f.s.) known as a natural weak factorisation system. In it, the two classes of maps of a w.f.s. are replaced by two categories of maps-with-structure, where the…

Category Theory · Mathematics 2007-05-23 Richard Garner

In [BaSc2] the authors introduced a much weaker homotopical structure than a model category, called a "weak cofibration category". We further showed that a small weak cofibration category induces in a natural way a model category structure…

Algebraic Topology · Mathematics 2016-10-27 Ilan Barnea , Tomer M. Schlank

We introduce a dependent type theory whose models are weak {\omega}-categories, generalizing Brunerie's definition of {\omega}-groupoids. Our type theory is based on the definition of {\omega}-categories given by Maltsiniotis, himself…

Logic in Computer Science · Computer Science 2017-06-12 Eric Finster , Samuel Mimram

We introduce a new class of higher categorical structures called weakly globular Tamsamani n-categories. These generalize the Tamsamani-Simpson model of higher categories by using the new paradigm of weak globularity to weaken higher…

Category Theory · Mathematics 2016-09-15 Simona Paoli

In this paper we put a cofibrantly generated model category structure on the category of small simplicial categories. The weak equivalences are a simplicial analogue of the notion of equivalence of categories.

Algebraic Topology · Mathematics 2007-05-23 Julia E. Bergner

This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…

Logic in Computer Science · Computer Science 2024-01-30 C. B. Aberlé

Extriangulated categories, introduced by Nakaoka and Palu, serve as a simultaneous generalization of exact and triangulated categories. In this paper, we first introduce the concept of admissible weak factorization systems and establish a…

Category Theory · Mathematics 2024-08-28 Yajun Ma , Hanyang You , Dongdong Zhang , Panyue Zhou

The homotopy category of a model structure on a weakly idempotent complete additive category is proved to be equivalent to the additive quotient of the category of cofibrant-fibrant objects with respect to the subcategory of…

Representation Theory · Mathematics 2025-01-28 Xue-Song Lu , Pu Zhang

We present a new strictification method for type-theoretic structures that are only weakly stable under substitution. Given weakly stable structures over some model of type theory, we construct equivalent strictly stable structures by…

Logic in Computer Science · Computer Science 2022-11-28 Rafaël Bocquet