Related papers: Composable Uncertainty in Symmetric Monoidal Categ…
It is well-known that small categories have equivalent descriptions as partial monoids. We provide a formulation of partial monoid and partial monoid homomorphism involving $s$ and $t$ instead of identities and then following a recent…
A categorical approach to linear control systems is introduced. Feedback actions on linear systems arises as a symmetric monoidal category. Stable feedback isomorphisms generalize enlargement of pairs of matrices. Subcategory of locally…
Imprecise probability is concerned with uncertainty about which probability distributions to use. It has applications in robust statistics and machine learning. We look at programming language models for imprecise probability. Our…
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…
We develop the idea of a supersymmetric monoidal supercategory, following ideas of Kapranov. Roughly, this is a monoidal category in which the objects and morphisms are ${\bf Z}/2$-graded, equipped with isomorphisms $X \otimes Y \to Y…
We define the affinization of an arbitrary monoidal category $\mathcal{C}$, corresponding to the category of $\mathcal{C}$-diagrams on the cylinder. We also give an alternative characterization in terms of adjoining dot generators to…
Monadic programming presents a significant challenge for many programmers. In light of category theory, we offer a new perspective on the use of monads in functional programming. This perspective is clarified through numerous examples coded…
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…
We construct a monoidal category of open transition systems that generate material history as transitions unfold, which we call situated transition systems. The material history generated by a composite system is composed of the material…
Many monoidal-type objects are known to be classified by maps from the Catalan simplicial set $\mathbb{C}$ to various nerves of categories and higher categories. There are, for example, three different nerves of the 2-category of categories…
In some bicategories, the 1-cells are `morphisms' between the 0-cells, such as functors between categories, but in others they are `objects' over the 0-cells, such as bimodules, spans, distributors, or parametrized spectra. Many…
The data for many useful bidirectional constructions in applied category theory (optics, learners, games, quantum combs) can be expressed in terms of diagrams containing "holes" or "incomplete parts", sometimes known as comb diagrams. We…
We examine a variant of hypergraphs that we call interfaced linear hypergraphs, with the aim of creating a sound and complete graphical language for symmetric traced monoidal categories (STMCs) suitable for graph rewriting. In particular,…
This work studies the proof theory of left (right) skew monoidal closed categories and skew monoidal bi-closed categories from the perspective of non-associative Lambek calculus. Skew monoidal closed categories represent a relaxed version…
Derivations provide a way of transporting ideas from the calculus of manifolds to algebraic settings where there is no sensible notion of limit. In this paper, we consider derivations in certain monoidal categories, called codifferential…
The goal of the paper is to establish and to investigate a fully faithful embedding of the category of group operads into that of crossed interval groups. For this, we introduce a monoidal structure on the slice of the category of operads…
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…
With a view on applications in computing, in particular concurrency theory and higher-dimensional rewriting, we develop notions of $n$-fold monoid and comonoid objects in $n$-fold monoidal categories and bicategories. We present a series of…
This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…
Constructions of spectra from symmetric monoidal categories are typically functorial with respect to strict structure-preserving maps, but often the maps of interest are merely lax monoidal. We describe conditions under which one can…