Related papers: Higher inductive types in $(\infty,1)$-categories
Postulating an impredicative universe in dependent type theory allows System F style encodings of finitary inductive types, but these fail to satisfy the relevant {\eta}-equalities and consequently do not admit dependent eliminators. To…
A generalization of the notion of an $\infty$-category is presented, allowing for ($\infty$-)cat(egorie)s that may have non-invertible higher morphisms.
We construct classifying $\infty$-topoi by showing that the $(\infty,2)$-category of topoi has weighted limits. We show that several prestacks of interest have a classifying topos, including the prestack of spectra.
There is a well-known correspondence between coherent theories (and their interpretations) and coherent categories (resp. functors), hence the (2,1)-category $\mathbf{Coh_{\sim}}$ (of small coherent categories, coherent functors and all…
This is the second in a series of papers extending Martin-L\"{o}f's meaning explanation of dependent type theory to account for higher-dimensional types. We build on the cubical realizability framework for simple types developed in Part I,…
We present a higher-categorical generalization of the "Karoubi envelope" construction from ordinary category theory, and prove that, like the ordinary Karoubi envelope, our higher Karoubi envelope is the closure for absolute limits. Our…
This paper is mainly about an early result that the orbifold stack is globally representable via some $ \infty $-categorical techniques.
The present paper gives a generalization of cartesian closed categories, called cartesian closed categories with dependence, whose strict version induces categories with families that support 1-, Sigma- and Pi-types in the strict sense.…
The set of integer number lists with finite length, and the set of binary trees with integer labels are both countably infinite. Many inductively defined types also have countably many elements. In this paper, we formalize the syntax of…
We define a class of higher inductive types that can be constructed in the category of sets under the assumptions of Zermelo-Fraenkel set theory without the axiom of choice or the existence of uncountable regular cardinals. This class…
In this paper, we present a construction from a Reedy category $C$ of a direct category $\operatorname{Down}(C)$ and a functor $\operatorname{Down}(C) \to C$, which exhibits $C$ as an $(\infty,1)$-categorical localization of…
For a differential graded k-quiver Q we define the free A-infinity-category FQ generated by Q. The main result is that for an arbitrary A-infinity-category A the restriction A-infinity-functor A_\infty(FQ,A) -> A_1(Q,A) is an equivalence,…
While many different models for $(\infty,1)$-categories are currently being used, it is known that they are Quillen equivalent to one another. Several higher-order analogues of them are being developed as models for $(\infty,…
We describe the ind- and pro- categories of the category of definable sets, in some first order theory, in terms of points in a sufficiently saturated model.
Category theory in homotopy type theory is intricate as categorical laws can only be stated "up to homotopy", and thus require coherences. The established notion of a univalent category (Ahrens, Kapulkin, Shulman) solves this by considering…
Homotopy Type Theory is a new field of mathematics based on the surprising and elegant correspondence between Martin-Lofs constructive type theory and abstract homotopy theory. We have a powerful interplay between these disciplines - we can…
This paper introduces an expressive class of indexed quotient-inductive types, called QWI types, within the framework of constructive type theory. They are initial algebras for indexed families of equational theories with possibly…
By theorems of Carlson and Renaudin, the theory of $(\infty,1)$-categories embeds in that of prederivators. The purpose of this paper is to give a two-fold answer to the inverse problem: understanding which prederivators model…
We characterize virtual double categories of enriched categories, functors, and profunctors by introducing a new notion of double-categorical colimits. Our characterization is strict in the sense that it is up to equivalence between virtual…
To ensure decidability and consistency of its type theory, a proof assistant should only accept terminating recursive functions and productive corecursive functions. Most proof assistants enforce this through syntactic conditions, which can…