Related papers: Naturality for higher-dimensional path types
We give a definition of weak n-categories based on the theory of operads. We work with operads having an arbitrary set S of types, or `S-operads', and given such an operad O, we denote its set of operations by elt(O). Then for any S-operad…
We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…
Higher inductive types are inductive types that include nontrivial higher-dimensional structure, represented as identifications that are not reflexivity. While work proceeds on type theories with a computational interpretation of univalence…
Suppose we are given a graph and want to show a property for all its cycles (closed chains). Induction on the length of cycles does not work since sub-chains of a cycle are not necessarily closed. This paper derives a principle reminiscent…
We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combinatorics of the negative corner (or branching) homology of a globular…
The usual coherence theorem of MacLane for categories with multiplication assumes that a certain pentagonal diagram commutes in order to conclude that associativity isomorphisms are well defined in a certain practical sense. The practical…
We show that Martin Hyland's effective topos can be exhibited as the homotopy category of a path category $\mathbb{EFF}$. Path categories are categories of fibrant objects in the sense of Brown satisfying two additional properties and as…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions…
The purpose of this dissertation is to set up a theory of generalized operads and multicategories, and to use it as a language in which to propose a definition of weak n-category. Included is a full explanation of why the proposed…
We give a specific cylinder functor for semifree dg categories. This allows us to construct a homotopy colimit functor explicitly. These two functors are "computable", specifically, the constructed cylinder functor sends a dg category of…
We extend McCarthy's stabilization construction to exact $\infty$-categories. This is achieved by constructing, for any functor from exact $\infty$-categories to a fixed stable $\infty$-category $\mathcal{A}$, a coherent chain complex in…
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…
We provide the expected constructions of weakly $\omega$-categorified models (in the sense of Bressie) of the theory of groups and quandles which arise by replacing the homotopies used to give equivalence relations in the theory of…
Reconfiguration paths express sequences of successive reconfiguration operations within a component-based approach allowing dynamic reconfigurations. We use constructs from regular expressions-pin particular, alternatives-to introduce…
The category of strict omega-categories has an important full subcategory whose objects are the simple omega-categories freely generated by planar trees or by globular cardinals. We give a simple description of this subcategory in terms of…
Let M be a smooth compact manifold with boundary. Under some geometric conditions on M, a homotopical model for the pair (M,boundary of M) can be recovered from the configuration category of the interior of M. The grouplike monoid of…
We present the type theory CaTT, originally introduced by Finster and Mimram to describe globular weak $\omega$-categories, and we formalise this theory in the language of homotopy type theory. Most of the studies about this type theory…
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…
A key property for systems subject to uncertainty in their operating environment is robustness, ensuring that unmodelled, but bounded, disturbances have only a proportionally bounded effect upon the behaviours of the system. Inspired by…
This paper describes a new technique, called "knowledge patterns", for helping construct axiom-rich, formal ontologies, based on identifying and explicitly representing recurring patterns of knowledge (theory schemata) in the ontology, and…