Related papers: CaTT contexts are finite computads
Awodey, later with Newstead, showed how polynomial functors with extra structure (termed ``natural models'') hold within them the categorical semantics for dependent type theory. Their work presented these ideas clearly but ultimately led…
This note informally describes a way to build certain cubical n-categories by iterating a process of taking models of certain finite limits theories. We base this discussion on a construction of "double bicategories" as bicategories…
Batanin and Markl's operadic categories are categories in which each map is endowed with a finite collection of "abstract fibres" -- also objects of the same category -- subject to suitable axioms. We give a reconstruction of the data and…
We introduce type-theoretic algebraic weak factorisation systems and show how they give rise to homotopy-theoretic models of Martin-L\"of type theory. This is done by showing that the comprehension category associated to a type-theoretic…
We describe the categorical semantics for a simply typed variant and a simplified dependently typed variant of Cocon, a contextual modal type theory where the box modality mediates between the weak function space that is used to represent…
Eight categorical soundness and completeness theorems are established within the framework of algebraic theories. Exactly six of the eight deduction systems exhibit complete semantics within the cartesian monoidal category of sets. The…
We present two Dialectica-like constructions for models of intensional Martin-L\"of type theory based on G\"odel's original Dialectica interpretation and the Diller-Nahm variant, bringing dependent types to categorical proof theory. We set…
Capretta's delay monad can be used to model partial computations, but it has the "wrong" notion of built-in equality, strong bisimilarity. An alternative is to quotient the delay monad by the "right" notion of equality, weak bisimilarity.…
Varieties of quantitative algebras are fully described by their free-algebra monads on the category Met of metric spaces. For a longer time it has been an open problem whether the resulting enriched monads are precisely the strongly…
We define the concept of weak pseudotwistor for an algebra $(A, \mu)$ in a monoidal category $\mathcal{C}$, as a morphism $T:A\otimes A\rightarrow A\otimes A$ in $\mathcal{C}$, satisfying some axioms ensuring that $(A, \mu \circ T)$ is also…
Inspired by the study of vertex operator algebra extensions, we answer the question of when the category of local modules over a commutative exact algebra in a braided finite tensor category is a (non-semisimple) modular tensor category.…
We assemble polynomials in a locally cartesian closed category into a tricategory, allowing us to define the notion of a polynomial pseudomonad and polynomial pseudoalgebra. Working in the context of natural models of type theory, we prove…
In this paper we obtain several model structures on {\bf DblCat}, the category of small double categories. Our model structures have three sources. We first transfer across a categorification-nerve adjunction. Secondly, we view double…
In functional programming, datatypes a la carte provide a convenient modular representation of recursive datatypes, based on their initial algebra semantics. Unfortunately it is highly challenging to implement this technique in proof…
We develop a dependent type theory that is based purely on inductive and coinductive types, and the corresponding recursion and corecursion principles. This results in a type theory with a small set of rules, while still being fairly…
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…
Classical definitions of weak higher-dimensional categories are given inductively; for example, a bicategory has a set of objects and hom categories, and a tricategory has a set of objects and hom bicategories. However, more recent…
It is well known that classical varieties of $\Sigma$-algebras correspond bijectively to finitary monads on $\mathsf{Set}$. We present an analogous result for varieties of ordered $\Sigma$-algebras, i.e., classes presented by inequations…
Abstract clones serve as an algebraic presentation of the syntax of a simple type theory. From the perspective of universal algebra, they define algebraic theories like those of groups, monoids and rings. This link allows one to study the…
We extend the 2-representation theory of finitary 2-categories to certain 2-categories with infinitely many objects, denoted locally finitary 2-categories, and extend the classical classification results of simple transitive…