Related papers: Propification and the Scalable Comonad

The word problem for categories with free products and coproducts (sums), SP-categories, is directly related to the problem of determining the equivalence of certain processes. Indeed, the maps in these categories may be directly…

Applications of category theory often involve symmetric monoidal categories (SMCs), in which abstract processes or operations can be composed in series and parallel. However, in 2020 there remains a dearth of computational tools for working…

We introduce a notion of parity for formal morphisms between invertible objects and use it to prove a corresponding coherence theorem. Parity is conceptually similar to the sign of underlying permutations, but not defined as such. To give…

Fong developed `decorated cospans' to model various kinds of open systems: that is, systems with inputs and outputs. In this framework, open systems are seen as the morphisms of a category and can be composed as such, allowing larger open…

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,…

Effectful categories have two classes of morphisms: pure morphisms, which form a monoidal category; and effectful morphisms, which can only be combined monoidally with central morphisms (such as the pure ones), forming a premonoidal…

A quasi-schemoid is a small category whose morphisms are colored with appropriate combinatorial data. In this note, Mitchell's embedding theorem for a tame schemoid is established. The result allows us to give a cofibrantly generated model…

We prove Steinebrunner's conjecture on the biequivalence between (colored) properads and labelled cospan categories. The main part of the work is to establish a 1-categorical, strict version of the conjecture, showing that the category of…

Let $\mathcal C$ be a category with finite colimits, writing its coproduct $+$, and let $(\mathcal D, \otimes)$ be a braided monoidal category. We describe a method of producing a symmetric monoidal category from a lax braided monoidal…

We introduce nominal string diagrams as, string diagrams internal in the category of nominal sets. This requires us to take nominal sets as a monoidal category, not with the cartesian product, but with the separated product. To this end, we…

We prove that any fusion category over $\mathbb{C}$ with exactly one non-invertible simple object is spherical. Furthermore, we classify all such categories that come equipped with a braiding.

A topological monoid is isomorphic to an endomorphism monoid of a countable structure if and only if it is separable and has a compatible complete ultrametric such that composition from the left is non-expansive. We also give a topological…

Lifts of categorical diagrams $D\colon\mathsf{J}\to\mathsf{X}$ against discrete opfibrations $\pi\colon\mathsf{E}\to\mathsf{X}$ can be interpreted as presenting solutions to systems of equations. With this interpretation in mind, it is…

Milner's bigraphs are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the pi-calculus and the Ambient calculus. This paper is only concerned with…

We introduce a graphical language for closed symmetric monoidal categories based on an extension of string diagrams with special bracket wires representing internal homs. These bracket wires make the structure of the internal hom functor…

Parametricity states that polymorphic functions behave the same regardless of how they are instantiated. When developing polymorphic programs, Wadler's free theorems can serve as free specifications, which can turn otherwise partial…

There are different notions of computation, the most popular being monads, applicative functors, and arrows. In this article we show that these three notions can be seen as monoids in a monoidal category. We demonstrate that at this level…

In this paper, we extend diagrammatic reasoning in monoidal categories with algebraic operations and equations. We achieve this by considering monoidal categories that are enriched in the category of Eilenberg-Moore algebras for a monad.…

A braided monoidal category may be considered a $3$-category with one object and one $1$-morphism. In this paper, we show that, more generally, $3$-categories with one object and $1$-morphisms given by elements of a group $G$ correspond to…

Algorithmic meta-theorems explain the tractability of large classes of computational problems by linking logical expressibility with structural graph properties. While extensions of first-order logic such as FO+dp admit efficient model…