Related papers: Concrete categories and higher-order recursion (Wi…
We study monoidal categories that enjoy a certain weakening of the rigidity property, namely, the existence of a dualizing object in the sense of Grothendieck and Verdier. We call them Grothendieck-Verdier categories. Notable examples…
Monads govern computational side-effects in programming semantics. They can be combined in a ''bottom-up'' way to handle several instances of such effects. Indexed monads and graded monads do this in a modular way. Here, instead, we equip…
The theory of $N$-complexes is a generalization of both ordinary chain complexes and graded objects. Hence it yields deeper insight in the structure of these and offers a broader range of applications. This work generalizes the tensor…
In this paper, we study the category $C(Rep(\mathcal{Q}, \mathcal{A}))$ of complexes of representations of quiver $\mathcal{Q}$ with values in an abelian category $\mathcal{A}$. We develop a method for constructing some model structures on…
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…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions…
We investigate an enriched-categorical approach to a field of discrete mathematics. The main result is a duality theorem between a class of enriched categories (called $\overline{\mathbb{Z}}$- or $\overline{\mathbb{R}}$-categories) and that…
Differential categories provide the categorical foundations for the algebraic approaches to differentiation. They have been successful in formalizing various important concepts related to differentiation, such as, in particular,…
The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of…
We introduce a new hierarchical deep learning framework for recursive higher-order meta-learning that enables neural networks (NNs) to construct, solve, and generalise across hierarchies of tasks. Central to this approach is a generative…
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order -- the extensional order -- and a bistable coherence, which captures…
We construct a machine which takes as input a locally small symmetric closed complete multicategory $\mathsf V$. And its output is again a locally small symmetric closed complete multicategory $\mathsf V\text-\mathcal{C}at$, the…
This is the first in a series of papers that deals with duality statements such as Mukai-duality (T-duality, from algebraic geometry) and the Baum-Connes conjecture (from operator $K$-theory). These dualities are expressed in terms of…
We define the notion of a sheaf over a complex of groups. As an application, we give a criterion for the developability of a complex of groups. When the developability is witnessed by a morphism to $\mathrm{GL}(V)$ for some $V$, our…
Applied category theory often studies symmetric monoidal categories (SMCs) whose morphisms represent open systems. These structures naturally accommodate complex wiring patterns, leveraging (co)monoidal structures for splitting and merging…
Databases have been studied category-theoretically for decades. The database schema -- whose purpose is to arrange high-level conceptual entities -- is generally modeled as a category or sketch. The data itself, often called an instance, is…
Monads in category theory are algebraic structures that can be used to model computational effects in programming languages. We show how the notion of "centre", and more generally "centrality", i.e. the property for an effect to commute…
Higher inductive types are a class of type-forming rules, introduced to provide basic (and not-so-basic) homotopy-theoretic constructions in a type-theoretic style. They have proven very fruitful for the "synthetic" development of homotopy…
Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…
A categorical framework for modeling and analyzing systems in a broad sense is proposed. These systems should be thought of as `machines' with inputs and outputs, carrying some sort of signal that occurs through some notion of time. Special…