Related papers: CaTT contexts are finite computads
Batanin and Leinster's work on globular operads has provided one of many potential defnitions of a weak $\omega$-category. Through the language of globular operads they construct a monad whose algebras encode weak $\omega$-categories. The…
Monads are extensively used nowadays to abstractly model a wide range of computational effects such as nondeterminism, statefulness, and exceptions. It turns out that equipping a monad with a (uniform) iteration operator satisfying a set of…
Weak $\infty$-categories are known to be more expressive than their strict counterparts, but are more difficult to work with, as constructions in such a category involve the manipulation of explicit coherence data. This motivates the search…
We study a family of distributors-induced bicategorical models of lambda-calculus, proving that they can be syntactically presented via intersection type systems. We first introduce a class of 2-monads whose algebras are monoidal categories…
Higher categorical structures are often defined by induction on dimension, which a priori produces only finite-dimensional structures. In this paper we show how to extend such definitions to infinite dimensions using the theory of terminal…
Containers represent a wide class of type constructions relevant for functional programming and (co)inductive reasoning. Indexed containers generalize this notion to better fit the scope of dependently typed programming. When interpreting…
Higher category theory is an exceedingly active area of research, whose rapid growth has been driven by its penetration into a diverse range of scientific fields. Its influence extends through key mathematical disciplines, notably homotopy…
In this paper we study compact closed categories within the context of homotopical algebra. We construct two new model category structures by localizing two (Quillen equivalent) model categories of symmetric monoidal categories with the…
We investigate the notion of involutive weak cubical $\omega$-categories via Penon's approach: as algebras for the monad induced by the free involutive strict $\omega$-category functor on cubical $\omega$-sets. A few examples of involutive…
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…
Strong bisimulation for labelled transition systems is one of the most fundamental equivalences in process algebra, and has been generalised to numerous classes of systems that exhibit richer transition behaviour. Nearly all of the ensuing…
It is well known that strict $\omega$-categories, strict $\omega$-functors, strict natural $\omega$-transformations, and so on, form a strict $\omega$-category. A similar property for weak $\omega$-categories is one of the main hypotheses…
In these lecture notes, we give a brief introduction to some elements of category theory. The choice of topics is guided by applications to functional programming. Firstly, we study initial algebras, which provide a mathematical…
Tangent categories provide a categorical axiomatization of the tangent bundle. There are many interesting examples and applications of tangent categories in a variety of areas such as differential geometry, algebraic geometry, algebra, and…
Whereas formal category theory is classically considered within a $2$-category, in this paper a double-dimensional approach is taken. More precisely we develop such theory within the setting of augmented virtual double categories, a notion…
We propose a definition of double categories whose composition of 1-cells is weak in both directions. Namely, a doubly weak double category is a double computad -- a structure with 2-cells of all possible double-categorical shapes --…
We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin-L\"of type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We…
We give an account of the basic combinatorial structure underlying the notion of type dependency. We do so by considering the category of all dependent sequent calculi, and exhibiting it as the category of algebras for a monad on a presheaf…
The paper introduces the notion of a weak bisimulation for coalgebras whose type is a monad satisfying some extra properties. In the first part of the paper we argue that systems with silent moves should be modelled coalgebraically as…
In this paper, a monad-based denotational model is introduced and shown adequate for the Proto-Quipper family of calculi, themselves being idealized versions of the Quipper programming language. The use of a monadic approach allows us to…