Related papers: Homotopy Type Theory in Lean
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as proofs of correctness of decision procedures for LF's…
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,…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
We show that discrete and classical homotopy theories are equivalent after localizing at n-equivalences for any non-negative integer n. By constructing an explicit homotopy inverse to the graph nerve functor associating an n-fibrant cubical…
In this paper, we present a directed homotopy type theory for reasoning synthetically about (higher) categories, directed homotopy theory, and its applications to concurrency. We specify a new `homomorphism' type former for Martin-L\"of…
We present the first definition of strictly associative and unital $\infty$-category. Our proposal takes the form of a type theory whose terms describe the operations of such structures, and whose definitional equality relation enforces…
In this paper, we set up a rational homotopy theory for operads in simplicial sets whose term of arity one is not necessarily reduced to an operadic unit, extending results obtained by the author in the book "Homotopy of operads and…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
We introduce and study a notion of cylinder coherator similar to the notion of Grothendieck coherator which define more flexible notion of weak infinity groupoids. We show that each such cylinder coherator produces a combinatorial…
We present three projects concerned with applications of proof assistants in the area of programming language theory and mathematics. The first project is about a certified compilation technique for a domain-specific programming language…
Polynomial functors are useful in the theory of data types, where they are often called containers. They are also useful in algebra, combinatorics, topology, and higher category theory, and in this broader perspective the polynomial aspect…
This is a survey. The main subject of this survey is the homotopical or homological nature of certain structures which appear in classical problems about groups, Lie rings and group rings. It is well known that the (generalized) dimension…
There is a well-established homotopy theory of simplicial objects in a Grothendieck topos, and folklore says that the weak equivalences are axiomatisable in the geometric fragment of $L_{\omega_1, \omega}$. We show that it is in fact a…
In this paper we construct new categorical models for the identity types of Martin-L\"of type theory, in the categories Top of topological spaces and SSet of simplicial sets. We do so building on earlier work of Awodey and Warren, which has…
This paper lays the foundations of an approach to applying Gromov's ideas on quantitative topology to topological data analysis. We introduce the "contiguity complex", a simplicial complex of maps between simplicial complexes defined in…
Modalities in homotopy type theory are used to create and access subuniverses of a given type universe. These have significant applications throughout mathematics and computer science, and in particular can be used to create universes in…
We found in Homotopy Type Theory (HoTT), a way of representing a first order version of intuitionistic logic (ICL), for intuitionistic calculational logic) where, instead of deduction trees, corresponding linear calculational formats are…
We construct an algebraic weak factorization system $(L, R)$ on the cartesian cubical sets, in which the canonical path object factorization $A \to A^I \to A\times A$ induced by the 1-cube $I$ is an $L$-$R$ factorization for any $R$-object…
By homotopy linear algebra we mean the study of linear functors between slices of the $\infty$-category of $\infty$-groupoids, subject to certain finiteness conditions. After some standard definitions and results, we assemble said slices…
Triangulations and higher triangulations axiomatize the calculus of derived cokernels when applied to strings of composable morphisms. While there are no cubical versions of (higher) triangulations, in this paper we use coherent diagrams to…