Related papers: Naturality for higher-dimensional path types
We introduce a notion of productivity (summability) of sequences in a topological group G, parametrized by a given function f : N --> omega+1. The extreme case when f is the function taking constant value omega is closely related to the TAP…
In the theory of operads we consider functors of generalized symmetric powers defined by sums of coinvariant modules under actions of symmetric groups. One observes classically that the construction of symmetric functors provides an…
In this article we note that in a number of situations the operator product and the classical action satisfy a natural compatibility condition. We consider the interest of this condition to be twofold: First, the naturality (functoriality)…
Cubical type theory provides a constructive justification of homotopy type theory. A crucial ingredient of cubical type theory is a path lifting operation which is explained computationally by induction on the type involving several…
The representation of workflows and processes is essential in materials science engineering, where experimental and computational reproducibility depend on structured and semantically coherent process models. Although numerous ontologies…
Let $D$ be a large category which is cocomplete. We construct a model structure (in the sense of Quillen) on the category of small functors from $D$ to simplicial sets. As an application we construct homotopy localization functors on the…
Applied category theory has recently developed libraries for computing with morphisms in interesting categories, while machine learning has developed ways of learning programs in interesting languages. Taking the analogy between categories…
We present a general and user-extensible equality checking algorithm that is applicable to a large class of type theories. The algorithm has a type-directed phase for applying extensionality rules and a normalization phase based on…
Homotopy Type Theory is a new field of mathematics based on the surprising and elegant correspondence between Martin-Lofs constructive type theory and abstract homotopy theory. We have a powerful interplay between these disciplines - we can…
Soft robotics is an emerging field of research where the robot body is composed of compliant and soft materials. It allows the body to bend, twist, and deform to move or to adapt its shape to the environment for grasping, all of which are…
We show that C if is a proper model category, then the pro-category pro-C has a strict model structure in which the weak equivalences are the levelwise weak equivalences. The strict model structure is the starting point for many homotopy…
We show that certain diagrams of $\infty$-logoses are reconstructed in homotopy type theory extended with some lex, accessible modalities, which enables us to use plain homotopy type theory to reason about not only a single $\infty$-logos…
We develop formal theories of conversion for Church-style lambda-terms with Pi-types in first-order syntax using one-sorted variables names and Stoughton's multiple substitutions. We then formalize the Pure Type Systems along some…
Time evolution equations for dynamical systems can often be derived from generating functionals. Examples are Newton's equations of motion in classical dynamics which can be generated within the Lagrange or the Hamiltonian formalism. We…
We develop an alternative to the May-Thomason construction used to compare operad based infinite loop machines to that of Segal, which relies on weak products. Our construction has the advantage that it can be carried out in $Cat$, whereas…
We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a type system that uses intersection and product types. The presence of the latter and a restricted use of the type omega enable us to…
We provide a systematic description of the solid angle function as a means of constructing a knotted field for any curve or link in $\mathbb{R}^3$. This is a purely geometric construction in which all of the properties of the entire knotted…
A good feature representation is a determinant factor to achieve high performance for many machine learning algorithms in terms of classification. This is especially true for techniques that do not build complex internal representations of…
In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…
This paper is part of a series of papers about homotopy theory of strict $n$-categories. In the first paper of this series, we gave conditions that guarantee the existence of a Thomason model category structure on the category of strict…