Related papers: Generating Higher Identity Proofs in Homotopy Type…
The classical Eckmann-Hilton argument shows that two monoid structures on a set, such that one is a homomorphism for the other, coincide and, moreover, the resulting monoid is commutative. This argument immediately gives a proof of the…
Brouwer's constructivist foundations of mathematics is based on an intuitively meaningful notion of computation shared by all mathematicians. Martin-L\"of's meaning explanations for constructive type theory define the concept of a type in…
Given a diagram of rings, one may consider the category of modules over them. We are interested in the homotopy theory of categories of this type: given a suitable diagram of model categories M(s) (as s runs through the diagram), we…
Let $M$ be a monoid and $G:\mathbf{Mon} \to \mathbf{Grp}$ be the group completion functor from monoids to groups. Given a collection $\mathcal{X}$ of submonoids of $M$ and for each $N\in \mathcal{X}$ a collection $\mathcal{Y}_N$ of…
It has been known that categorical interpretations of dependent type theory with Sigma- and Id-types induce weak factorization systems. When one has a weak factorization system (L, R) on a category C in hand, it is then natural to ask…
In functional programming languages, generalized algebraic data types (GADTs) are very useful as the unnecessary pattern matching over them can be ruled out by the failure of unification of type arguments. In dependent type systems, this is…
We introduce Displayed Type Theory (dTT), a multi-modal homotopy type theory with discrete and simplicial modes. In the intended semantics, the discrete mode is interpreted by a model for an arbitrary $\infty$-topos, while the simplicial…
Simplicial type theory (STT) was introduced by Riehl and Shulman to leverage homotopy type theory to prove results about $(\infty,1)$-categories. Initial work on simplicial type theory focused on "formal" arguments in higher category theory…
This presentation is the sequel of a paper published in GETCO'00 proceedings where a research program to construct an appropriate algebraic setting for the study of deformations of higher dimensional automata was sketched. This paper…
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 foundation of mathematics. On the one hand, Voevodsky's subtle and…
One may formulate the dependent product types of Martin-L\"of type theory either in terms of abstraction and application operators like those for the lambda-calculus; or in terms of introduction and elimination rules like those for the…
Identifying evolutionary correspondences between cell types across species is a fundamental challenge in comparative genomics and evolutionary biology. Existing approaches often rely on either reference-based matching, which imposes…
Real numbers in constructive mathematics have always seemed to require compromises of one form or another. Classical proofs of Cauchy completeness require countable choice, Bishop's setoid construction introduces persistent bookkeeping…
In a recent paper, the second author and Joana Cirici proved a theorem that says that given appropriate hypotheses, $n$-formality of a differential graded algebraic structure is equivalent to the existence of a chain-level lift of a…
In this paper we study a 2-dimensional version of Quillen's homotopy category construction. Given a category $\mathscr{A}$ and a class of morphisms $\Sigma \subset \mathscr{A}$ containing the identities, we construct a 2-category…
We show a first rectification result for homotopy chain coalgebras over a field. On the one hand, we consider the $\infty$-category obtained by localizing differential graded coalgebras over an operad with respect to quasi-isomorphisms; on…
We give a model of set theory based on multisets in homotopy type theory. The equality of the model is the identity type. The underlying type of iterative sets can be formulated in Martin-L\"of type theory, without Higher Inductive Types…
Type theories with higher-order subtyping or singleton types are examples of systems where computation rules for variables are affected by type information in the context. A complication for these systems is that bounds declared in the…
Classical definitions of weak higher-dimensional categories are given inductively; for example, a bicategory has a set of objects and hom categories, and a tricategory has a set of objects and hom bicategories. However, more recent…
We introduce some classes of genuine higher categories in homotopy type theory, defined as well-behaved subcategories of the category of types. We give several examples, and some techniques for showing other things are not examples. While…