Related papers: The Produoidal Algebra of Process Decomposition
The representation theory for categorical groups is constructed. Each categorical group determines a monoidal bicategory of representations. Typically, these categories contain representations which are indecomposable but not irreducible. A…
We develop a (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators. Our framework features a uniform semantics of process terms and a complete axiomatisation of semantic…
We introduce monoidal width as a measure of the difficulty of decomposing morphisms in monoidal categories. For graphs, we show that monoidal width and two variations capture existing notions, namely branch width, tree width and path width.…
The study of categories that abstract the structural properties of relations has been extensively developed over the years, resulting in a rich and diverse body of work. This paper strives to provide a modern presentation of these…
Lenses are a well-established structure for modelling bidirectional transformations, such as the interactions between a database and a view of it. Lenses may be symmetric or asymmetric, and may be composed, forming the morphisms of a…
In the first part, we develop layered monoidal theories - a generalisation of monoidal theories combining descriptions of a system at several levels. Via their representation as string diagrams, monoidal theories provide a graphical syntax…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
This paper is the first of two articles which develop the notion of protoperads. In this one, we construct a new monoidal product on the category of reduced S-modules. We study the associated monoids, called protoperads, which are a…
This paper introduces and studies a categorical analogue of the familiar monoid semiring construction. By introducing an axiomatisation of summation that unifies notions of summation from algebraic program semantics with various notions of…
This is a report on aspects of the theory and use of monoidal categories. The first section introduces the main concepts through the example of the category of vector spaces. String notation is explained and shown to lead naturally to a…
In this paper we develope a categorical theory of relations and use this formulation to define the notion of quantization for relations. Categories of relations are defined in the context of symmetric monoidal categories. They are shown to…
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…
Lenses may be characterised as objects in the category of algebras over a monad, however they are often understood instead as morphisms, which propagate updates between systems. Working internally to a category with pullbacks, we define…
Constructor theory is a meta-theoretic approach that seeks to characterise concrete theories of physics in terms of the (im)possibility to implement certain abstract "tasks" by means of physical processes. Process theory, on the other hand,…
We consider the category of C*-algebras equipped with actions of a locally compact quantum group. We show that this category admits a monoidal structure satisfying certain natural conditions if and only if the group is quasitriangular. The…
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 give a natural-deduction-style type theory for symmetric monoidal categories whose judgmental structure directly represents morphisms with tensor products in their codomain as well as their domain. The syntax is inspired by Sweedler…
Usually a name of the category is inherited from the name of objects. However more relevant for a category of objects and morphisms is an algebra of morphisms. Therefore we prefer to say a category of graphs if every morphism is a graph. In…
Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a…
We introduce a theory for encoding and manipulating algebraic data on categories via $\textit{concentration structures}$, which are equivalence relations on morphisms that satisfy certain axioms. For any category with a concentration…