Related papers: Notions of parametricity as monoidal models for ty…
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…
We define a computational type theory combining the contentful equality structure of cartesian cubical type theory with internal parametricity primitives. The combined theory supports both univalence and its relational equivalent, which we…
Parametricity is a key metatheoretic property of type systems, which implies strong uniformity & modularity properties of the structure of types within systems possessing it. In recent years, various systems of dependent type theory have…
Reynolds' theory of relational parametricity formalizes parametric polymorphism for System F, thus capturing the idea that polymorphically typed System F programs always map related inputs to related results. This paper shows that Reynolds'…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
Parametricity is a property of the syntax of type theory implying, e.g., that there is only one function having the type of the polymorphic identity function. Parametricity is usually proven externally, and does not hold internally.…
Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…
We propose a new model for the theory of $(\infty,n)$-categories (including the case $n=\infty$) in the category of marked cubical sets with connections, similar in flavor to complicial sets of Verity. The model structure characterizing our…
We study categorical models for the unitless fragment of multiplicative linear logic. We find that the appropriate notion of model is a special kind of promonoidal category. Since the theory of promonoidal categories has not been developed…
To characterize categorical constraints - associativity, commutativity and monoidality - in the context of quasimonoidal categories, from a cohomological point of view, we define the notion of a parity (quasi)complex. Applied to groups…
A monoidal model category is a model category with a compatible closed monoidal structure. Such things abound in nature; simplicial sets and chain complexes of abelian groups are examples. Given a monoidal model category, one can consider…
We exhibit a computational type theory which combines the higher-dimensional structure of cartesian cubical type theory with the internal parametricity primitives of parametric type theory, drawing out the similarities and distinctions…
In previous work we proved that, for categories of free finite-dimensional modules over a commutative semiring, linear compact-closed symmetric monoidal structure is a property, rather than a structure. That is, if there is such a…
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…
Semi-simplicial and semi-cubical sets are commonly defined as presheaves over respectively, the semi-simplex or semi-cube category. Homotopy Type Theory then popularized an alternative definition, where the set of n-simplices or n-cubes are…
We show that the category of simplicial sets is a co-reflective subcategory of the category of cubical sets with connections, with the inclusion given by a version of the straightening functor. We show that using the co-reflector, one can…
When designing plans in engineering, it is often necessary to consider attributes associated to objects, e.g. the location of a robot. Our aim in this paper is to incorporate attributes into existing categorical formalisms for planning,…
It is proved that the category of simplicial complete bornological spaces over $\mathbb R$ carries a combinatorial monoidal model structure satisfying the monoid axiom. For any commutative monoid in this category the category of modules is…
The role of types in categorical models of meaning is investigated. A general scheme for how typed models of meaning may be used to compare sentences, regardless of their grammatical structure is described, and a toy example is used as an…
We provide conditions on a monoidal model category $\mathcal{M}$ so that the category of commutative monoids in $\mathcal{M}$ inherits a model structure from $\mathcal{M}$ in which a map is a weak equivalence or fibration if and only if it…