Related papers: Homotopy Type Theory in Lean

We describe a category, the objects of which may be viewed as models for homotopy theories. We show that for such models, ``functors between two homotopy theories form a homotopy theory'', or more precisely that the category of such models…

We introduce a new cubical model for homotopy types. More precisely, we'll define a category Qs with the following features: Qs is a PROP containing the classical box category as a subcategory, the category Qs-Set of presheaves of sets on…

We give a homotopy theoretic characterization of stacks on a site $\cC$ as the {\it homotopy sheaves} of groupoids on $\cC$. We use this characterization to construct a model category in which stacks are the fibrant objects. We compare…

We combine Homotopy Type Theory with axiomatic cohesion, expressing the latter internally with a version of "adjoint logic" in which the discretization and codiscretization modalities are characterized using a judgmental formalism of "crisp…

We discuss some aspects of our work on the mechanization of syntax and semantics in the UniMath library, based on the proof assistant Coq. We focus on experiences where Coq (as a type-theoretic proof assistant with decidable typechecking)…

In this paper we construct a cofibrantly generated model category structure on the category of all small symmetric multicategories enriched in simplicial sets.

We study the spaces of embeddings of manifolds in a Euclidean space. More precisely we look at the homotopy fiber of the inclusion of these spaces to the spaces of immersions. As a main result we express the rational homotopy type of…

This paper is part of a series of three articles with the objective of investigating a stratified version of the homotopy hypothesis in terms of semi-model structures that interact well with classical examples of stratified spaces, such as…

This article shows several new methods for proofs on Kan complexes while using them to give a compact introduction to the homotopy groups of these complexes. Then more advanced objects are studied starting with homology and the Hurewicz…

We introduce a modification of standard Martin-Lof type theory in which we eliminate definitional equality and replace all computation rules by propositional equalities. We show that type checking for such a system can be done in quadratic…

We describe a prototype theorem prover, UTP2, developed to match the style of hand-written proof work in the Unifying Theories of Programming semantical framework. This is based on alphabetised predicates in a 2nd-order logic, with a strong…

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…

We develop the usage of certain type theories as specification languages for algebraic theories and inductive types. We observe that the expressive power of dependent type theories proves useful in the specification of more complicated…

Using dependent type theory to formalise the syntax of dependent type theory is a very active topic of study and goes under the name of "type theory eating itself" or "type theory in type theory." Most approaches are at least loosely based…

We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and programs decouples their semantics, allowing the type system…

Clocked Cubical Type Theory is a new type theory combining the power of guarded recursion with univalence and higher inductive types (HITs). This type theory can be used as a metalanguage for synthetic guarded domain theory in which one can…

We define a general class of dependent type theories, encompassing Martin-L\"of's intuitionistic type theories and variants and extensions. The primary aim is pragmatic: to unify and organise their study, allowing results and constructions…

We develop a linear logical framework within the Hybrid system and use it to reason about the type system of a quantum lambda calculus. In particular, we consider a practical version of the calculus called Proto-Quipper, which contains the…

Dependent type theory is the foundation of many modern proof assistants. Inhabitation and unification are undecidable problems that are useful for theorem proving and program synthesis. We introduce Canonical-min, a sound and complete…

We propose an extension of pure type systems with an algebraic presentation of inductive and co-inductive type families with proper indices. This type theory supports coercions toward from smaller sorts to bigger sorts via explicit type…