We provide an algebraic formalisation of connectors in BIP. These are used to structure
interactions in a component-based system. A connector relates a set of typed ports. Types …

We introduce the theory IH R of interacting Hopf algebras, parametrised over a principal
ideal domain R. The axioms of IH R are derived using Lack's approach to composing …

We introduce IH, a sound and complete graphical theory of vector subspaces over the field
of polynomial fractions, with relational composition. The theory is constructed in modular …

Graphical linear algebra is a diagrammatic language allowing to reason compositionally
about different types of linear computing devices. In this paper, we extend this formalism with …

Network theory uses the string diagrammatic language of monoidal categories to study
graphical structures formally, eschewing specialised translations into intermediate …

String diagrams turn algebraic equations into topological moves that have recurring shapes,
involving the sliding of one diagram past another. We individuate, at the root of this fact, the …

Diagrammatic techniques for reasoning about monoidal categories provide an intuitive
understanding of the symmetries and connections of interacting computational processes. In …

As first main contribution, this thesis characterises the PROP SVk of linear subspaces over a
field k-an important domain of interpretation for circuit diagrams appearing in diverse …

Over the past decades, coordination languages have emerged for the specification and
implementation of interaction protocols for communicating software components. This class …

String diagrams are a powerful and intuitive graphical syntax for terms of symmetric
monoidal categories (SMCs). They find many applications in computer science and are …