Related papers: Displayed Type Theory and Semi-Simplicial Types
We present a soundness theorem for a dependent type theory with context constants with respect to an indexed category of (finite, abstract) simplical complexes. The point of interest for computer science is that this category can be seen to…
Models of dependent type theories are contextual categories with some additional structure. We prove that if a theory $T$ has enough structure, then the category $T\text{-}\mathbf{Mod}$ of its models carries the structure of a model…
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show that two constants (falsity and implication) suffice for…
This is a sequel to a previous paper, developing an intrinsic, combinatorial homotopy theory for simplicial complexes; the latter form the cartesian closed subcategory of 'simple presheaves' in !Smp, the topos of symmetric simplicial sets,…
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 describe a non-extensional variant of Martin-L\"of type theory which we call two-dimensional type theory, and equip it with a sound and complete semantics valued in 2-categories.
We introduce a notion of discrete topological complexity in the setting of simplicial complexes, using only the combinatorial structure of the complex by means of the concept of contiguous simplicial maps. We study the links of this new…
Homotopy type theory is a logical setting based on Martin-L\"of type theory in which geometric constructions and proofs can be carried out synthetically. Here, types can be interpreted as spaces up to homotopy, and proofs as…
The calculus of Dependent Object Types (DOT) has enabled a more principled and robust implementation of Scala, but its support for type-level computation has proven insufficient. As a remedy, we propose $F^\omega_{..}$, a rigorous…
The singular simplicial set Sing(X) of a space X completely captures its weak homotopy type. We introduce a category of_controlled sets_, yielding _simplicial controlled sets_, such that one can functorially produce a singular simplicial…
We discuss the homotopy type theory library in the Lean proof assistant. The library is especially geared toward synthetic homotopy theory. Of particular interest is the use of just a few primitive notions of higher inductive types, namely…
Simplicial identities play an important and fundamental role in simplicial homotopy theory. On the other hand, the study of the paths and the regular paths on discrete sets is the foundation for the path-homology theory of digraphs. In this…
In this work we develop a discrete trace theory that spans non-conforming hybrid discretization methods and holds on polytopal meshes. A notion of a discrete trace seminorm is defined, and trace and lifting results with respect to a…
As the use and diversity of diagrams across many disciplines grows, there is an increasing interest in the diagrams research community concerning how such diversity might be documented and explained. In this article, we argue that one way…
We construct a model of type theory enjoying parametricity from an arbitrary one. A type in the new model is a semi-cubical type in the old one, illustrating the correspondence between parametricity and cubes. Our construction works not…
This survey offers an overview of an on-going project on uniform symmetries in abstract stable homotopy theories. This project has calculational, foundational, and representation-theoretic aspects, and key features of this emerging field on…
This paper proposes a way of doing type theory informally, assuming a cubical style of reasoning. It can thus be viewed as a first step toward a cubical alternative to the program of informalization of type theory carried out in the…
We study when co-evolving (or adaptive) higher-order networks defined on directed hypergraphs admit a simplicial description. Binary and triadic couplings are modelled by time-dependent weight tensors. Using representation theory of the…
We introduce the symmetricity notions of symmetric h-monoidality, symmetroidality, and symmetric flatness. As shown in our paper arXiv:1410.5675, these properties lie at the heart of the homotopy theory of colored symmetric operads and…
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…