Related papers: Type refinement and monoidal closed bifibrations
We develop semantics and syntax for bicategorical type theory. Bicategorical type theory features contexts, types, terms, and directed reductions between terms. This type theory is naturally interpreted in a class of structured…
We prove a generalisation to any characteristic of a result of Macdonald that describes strict polynomial functors in characteristic zero in terms of representations of the groupoid of finite sets and bijections. Our result will give an…
We generalise classical reconstruction results in algebra, using the language of monads, monoidal categories, module categories, as well as various notions of duality, such as closedness, Grothendieck--Verdier duality (also known as…
State monads in cartesian closed categories are those defined by the familiar adjunction between product and exponential. We investigate the structure of their algebras, and show that the exponential functor is monadic provided the base…
Operads may be represented as symmetric monoidal functors on a small symmetric monoidal category. We discuss the axioms which must be imposed on a symmetric monoidal functor in order that it give rise to a theory similar to the theory of…
Many examples of obstruction theory can be formulated as the study of when a lift exists in a commutative square. Typically, one of the maps is a cofibration of some sort and the opposite map is a fibration, and there is a functorial…
The notion of an $\mathcal{M}$-coextensive object is introduced in an arbitrary category $\mathbb{C}$, where $\mathcal{M}$ is a distinguished class of morphisms from $\mathbb{C}$. This notion allows for a categorical treatment of the strict…
We define the notion of an enriched Reedy category, and show that if A is a C-Reedy category for some symmetric monoidal model category C and M is a C-model category, the category of C-functors and C-natural transformations from A to M is…
Refinement types enable lightweight verification of functional programs. Algorithms for statically inferring refinement types typically work by reduction to solving systems of constrained Horn clauses extracted from typing derivations. An…
We give a polymorphic account of the relational algebra. We introduce a formalism of ``type formulas'' specifically tuned for relational algebra expressions, and present an algorithm that computes the ``principal'' type for a given…
Recently, a principle for state confinement has been proposed in a category theoretic framework and to accomodate this result the notion of a pre-monoidal category was developed. Here we describe an algebraic approach for the construction…
In the first part, we develop layered monoidal theories - a generalisation of monoidal theories combining descriptions of a system at several levels. Via their representation as string diagrams, monoidal theories provide a graphical syntax…
We define the notion of an additive model category, and we prove that any additive, stable, combinatorial model category has a natural enrichment over symmetric spectra based on simplicial abelian groups. As a consequence, every object in…
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…
The theory of Topological Modular Forms suggests the existence of deformation invariants for two-dimensional supersymmetric field theories that are more refined than the standard elliptic genus. In this note we give a physical definition of…
Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…
Most categorical models for dependent types have traditionally been heavily set based: contexts form a category, and for each we have a set of types in said context -- and for each type a set of terms of said type. This is the case for…
We define a weak bimonad as a monad T on a monoidal category M with the property that the Eilenberg-Moore category M^T is monoidal and the forgetful functor from M^T to M is separable Frobenius. Whenever M is also Cauchy complete, a simple…
We define a bar construction endofunctor on the category of commutative augmented monoids $A$ of a symmetric monoidal category $\mathcal{V}$ endowed with a left adjoint monoidal functor $F:s\mathbf{Set}\to \mathcal{V}$. To do this, we need…
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…