Related papers: A Diagrammatic Algebra for Program Logics
The Kuperberg Program asks to find presentations of planar algebras and use these presentations to prove results about their corresponding categories purely diagrammatically. This program has been completed for index less than 4 and is…
String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs…
Relational structures are emerging as ubiquitous mathematical machinery in the semantics of open systems of various kinds. Cartesian bicategories are a well-known categorical algebra of relations that has proved especially useful in recent…
Diagrammatically speaking, grammatical calculi such as pregroups provide wires between words in order to elucidate their interactions, and this enables one to verify grammatical correctness of phrases and sentences. In this paper we also…
Whereas string diagrams for strict monoidal categories are well understood, and have found application in several fields of Computer Science, graphical formalisms for non-strict monoidal categories are far less studied. In this paper, we…
Categories are coreflectively embedded in multicategories via the "discrete cocone" construction, the right adjoint being given by the monoid construction. Furthermore, the adjunction lifts to the "cartesian level": preadditive categories…
We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally…
It is known that every monoidal bicategory has an associated braided monoidal category of scalars. In this thesis we show that every monoidal bicategory, which is closed both monoidally and compositionally, can be enriched over the monoidal…
In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…
We propose a graphical language that accommodates two monoidal structures: a multiplicative one for pairing and an additional one for branching. In this colored PROP, whether wires in parallel are linked through the multiplicative structure…
We present a process semantics for the purely additive fragment of linear logic in which formulas denote protocols and (equivalence classes of) proofs denote multi-channel concurrent processes. The polycategorical model induced by this…
Using the language of string diagrams, we define categorical generalizations of modules for map algebras $\mathfrak{g} \otimes A$ and equivariant map algebras $(\mathfrak{g} \otimes A)^\Gamma$, where $\mathfrak{g}$ is a Lie algebra, $A$ is…
We study categorical models for the unitless fragment of multiplicative linear logic. We find that the appropriate notion of model is a special kind of promonoidal category. Since the theory of promonoidal categories has not been developed…
Bicategories of spans are characterized as cartesian bicategories in which every comonad has an Eilenberg-Moore ob ject and every left adjoint arrow is comonadic.
Monoidal algebraic structures consist of operations that can have multiple outputs as well as multiple inputs, which have applications in many areas including categorical algebra, programming language semantics, representation theory,…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
We introduce two applications of polygraphs to categorification problems. We compute first, from a coherent presentation of an $n$-category, a coherent presentation of its Karoubi envelope. For this, we extend the construction of Karoubi…
We enhance the calculus of string diagrams for monoidal categories with hierarchical features in order to capture closed monoidal (and cartesian closed) structure. Using this new syntax we formulate an automatic differentiation algorithm…
This paper introduces an inherently strict presentation of categories with products, coproducts, or symmetric monoidal products that is inspired by file systems and directories. Rather than using nested binary tuples to combine objects or…
Kleene algebra with tests, KAT, provides a simple two-sorted algebraic framework for verifying properties of propositional while programs. Kleene algebra with domain, KAD, is a one-sorted alternative to KAT. The equational theory of KAT…