English
Related papers

Related papers: Generating Higher Identity Proofs in Homotopy Type…

200 papers

Polymorphic variants are a useful feature of the OCaml language whose current definition and implementation rely on kinding constraints to simulate a subtyping relation via unification. This yields an awkward formalization and results in a…

Programming Languages · Computer Science 2016-07-06 Giuseppe Castagna , Tommaso Petrucciani , Kim Nguyen

Let $G$ be a finite group acting on a small category $I$. We study functors $X \colon I \to \mathscr{C}$ equipped with families of compatible natural transformations that give a kind of generalized $G$-action on $X$. Such objects are called…

Algebraic Topology · Mathematics 2016-03-09 Emanuele Dotto , Kristian Moi

Let $D$ be a large category which is cocomplete. We construct a model structure (in the sense of Quillen) on the category of small functors from $D$ to simplicial sets. As an application we construct homotopy localization functors on the…

Algebraic Topology · Mathematics 2007-05-23 Boris Chorny , William G. Dwyer

We argue that locally Cartesian closed categories form a suitable doctrine for defining dependent type theories, including non-extensional ones. Using the theory of sketches, one may define syntactic categories for type theories in a style…

Logic in Computer Science · Computer Science 2021-03-11 Daniel Gratzer , Jonathan Sterling

Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms to normal forms, as well as comparing the different reduction paths that lead to those normal forms. This higher structure can be captured by…

Logic in Computer Science · Computer Science 2023-02-15 Nicolai Kraus , Jakob von Raumer

In this paper, we justify and make precise an elementary approach that establishes the existence of (co)limits in $\mathbf{Cat}$. This approach, while conceptually evident, has not been made fully explicit or systematically described in the…

Category Theory · Mathematics 2026-04-16 Varinderjit Mann

Any modality in homotopy type theory gives rise to an orthogonal factorization system of which the left class is stable under pullbacks. We show that there is a second orthogonal factorization system associated to any modality, of which the…

Category Theory · Mathematics 2020-10-28 Felix Cherubini , Egbert Rijke

Let K be a comonad on a model category M. We provide conditions under which the associated category of K-coalgebras admits a model category structure such that the forgetful functor to M creates both cofibrations and weak equivalences. We…

Algebraic Topology · Mathematics 2014-02-26 Kathryn Hess , Brooke Shipley

Given a suitable functor T:C -> D between model categories, we define a long exact sequence relating the homotopy groups of any X in C with those of TX, and use this to describe an obstruction theory for lifting an object G in D to C.…

Algebraic Topology · Mathematics 2007-05-23 David Blanc

Centers of categories capture the natural operations on their objects. Homotopy coherent centers are introduced here as an extension of this notion to categories with an associated homotopy theory. These centers can also be interpreted as…

Algebraic Topology · Mathematics 2019-04-12 Markus Szymik

In this work we relate the known results about the homotopy type of classifying spaces for smooth foliations, with the homology and cohomology of the discrete group of diffeomorphisms of a smooth compact connected oriented manifold. The…

Algebraic Topology · Mathematics 2023-11-16 Steven Hurder

Certain results involving "higher structures" are not currently accessible to computer formalization because the prerequisite $\infty$-category theory has not been formalized. To support future work on formalizing $\infty$-category theory…

Category Theory · Mathematics 2025-07-23 Mario Carneiro , Emily Riehl

Higher-order beta-matching is the following decision problem: given two simply typed lambda-terms, can the first term be instantiated to be beta-equivalent to the second term? This problem was formulated by Huet in the 1970s and shown…

Logic in Computer Science · Computer Science 2026-02-03 Andrej Dudenhefner

We revisit Kapranov and Voevodsky's idea of spaces modelled on combinatorial pasting diagrams, now as a framework for higher-dimensional rewriting and the basis of a model of weak omega-categories. In the first part, we elaborate on…

Category Theory · Mathematics 2020-07-30 Amar Hadzihasanovic

It is well-known that in homotopy type theory (HoTT), one can prove the Eckmann-Hilton theorem: given two 2-loops p, q : 1 = 1 on the reflexivity path at an arbitrary point a : A, we have pq = qp. If we go one dimension higher, i.e., if p…

Logic in Computer Science · Computer Science 2021-08-02 Kristina Sojakova

Lumsdaine (2010) and van den Berg-Garner (2011) proved that types in Martin-L\"of type theory carry the structure of weak {\omega}-groupoids. Their proofs, while foundational, rely on abstract properties of the identity type without…

Logic in Computer Science · Computer Science 2025-12-02 Arthur F. Ramos , Tiago M. L. de Veras , Ruy J. G. B. de Queiroz , Anjolina G. de Oliveira

We construct a model structure on the category $\mathrm{DblCat}$ of double categories and double functors. Unlike previous model structures for double categories, it recovers the homotopy theory of 2-categories through the horizontal…

Algebraic Topology · Mathematics 2021-05-04 Lyne Moser , Maru Sarazola , Paula Verdugo

This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…

Algebraic Topology · Mathematics 2021-09-20 Sanjeevi Krishnan , Crichton Ogle

We prove a conjecture about the constructibility of coinductive types - in the principled form of indexed M-types - in Homotopy Type Theory. The conjecture says that in the presence of inductive types, coinductive types are derivable.…

Logic in Computer Science · Computer Science 2019-07-16 Benedikt Ahrens , Paolo Capriotti , Régis Spadotti

We show that the category of graphs has the structure of a 2-category with homotopy as the 2-cells. We then develop an explicit description of homotopies for finite graphs, in terms of what we call `spider moves'. We then create a category…

Combinatorics · Mathematics 2020-05-15 Tien Chih , Laura Scull