Related papers: Classifying Types
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…
The goal of this dissertation is to present results from synthetic homotopy theory based on homotopy type theory (HoTT). After an introduction to Martin-L\"of's dependent type theory and homotopy type theory, key results include a synthetic…
Homotopy methods have proven to be a powerful tool for understanding the multitude of solutions provided by the coupled-cluster polynomial equations. This endeavor has been pioneered by quantum chemists that have undertaken both elaborate…
$\infty$-category theory was originally developed in the context of classical homotopy theory using standard set theoretical assumptions, but has since been extended to a variety of mathematical foundations. One such successful effort,…
We endow categories of non-symmetric operads with natural model structures. We work with no restriction on our operads and only assume the usual hypotheses for model categories with a symmetric monoidal structure. We also study categories…
A stratified space is a topological space together with a decomposition into strata corresponding to different types of singularities. Examples of such spaces appear everywhere in topology and geometry. The study of stratified spaces…
We implement in the formal language of homotopy type theory a new set of axioms called cohesion. Then we indicate how the resulting cohesive homotopy type theory naturally serves as a formal foundation for central concepts in quantum gauge…
The notion of the \emph{homotopy type} of a topological stack has been around in the literature for some time. The basic idea is that an atlas $X \to \mathfrak{X}$ of a stack determines a topological groupoid $\mathbb{X}$ with object space…
In this paper, we define indexed type theories which are related to indexed ($\infty$-)categories in the same way as (homotopy) type theories are related to ($\infty$-)categories. We define several standard constructions for such theories…
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…
In recent years, Homotopy Type Theory (HoTT) has had great success both as a foundation of mathematics and as internal language to reason about $\infty$-groupoids (a.k.a. spaces). However, in many areas of mathematics and computer science,…
The aim of homotopy theory in topology is to simplify, after continuous deformation, continuous maps between topological spaces. What prevents this from happening are homotopy invariants. This raises quantitative questions: $\bullet$ Is the…
We develop a general theory of extensions of flat functors along geometric morphisms of toposes, and apply it to the study of the class of theories whose classifying topos is equivalent to a presheaf topos. As a result, we obtain a…
The ALEA Coq library formalizes measure theory based on a variant of the Giry monad on the category of sets. This enables the interpretation of a probabilistic programming language with primitives for sampling from discrete distributions.…
Simplicial type theory extends homotopy type theory with a directed path type which internalizes the notion of a homomorphism within a type. This concept has significant applications both within mathematics -- where it allows for synthetic…
We report on the development of the HoTT library, a formalization of homotopy type theory in the Coq proof assistant. It formalizes most of basic homotopy type theory, including univalence, higher inductive types, and significant amounts of…
A model category is called combinatorial if it is cofibrantly generated and its underlying category is locally presentable. As shown in recent years, homotopy categories of combinatorial model categories share useful properties, such as…
The homotopy type of the complement of a complex coordinate subspace arrangement is studied by fathoming out the connection between its topological and combinatorial structures. A family of arrangements for which the complement is homotopy…
In the theory of programming languages, type inference is the process of inferring the type of an expression automatically, often making use of information from the context in which the expression appears. Such mechanisms turn out to be…
We study the homotopy type of the simplicial set of continuous semi-algebraic simplexes of an algebraic variety defined over a real closed field, which we will call the real homotopy type. We prove an analogue of the theorem of Artin-Mazur…