79 citations · 365 across the 37 of their papers we have counts for
5 papers · 1 filter
Data-Parallel Algorithms for String Diagrams
Paul Wilson, Fabio Zanasi
We give parallel algorithms for string diagrams represented as structured cospans of ACSets. Specifically, we give linear (sequential) and logarithmic (parallel) time algorithms fo…
String diagrams for Strictification and Coherence
Paul Wilson, Dan Ghica, Fabio Zanasi
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 mo…
The Cost of Compositionality: A High-Performance Implementation of String Diagram Composition
Paul Wilson, Fabio Zanasi
String diagrams are an increasingly popular algebraic language for the analysis of graphical models of computations across different research fields. Whereas string diagrams have b…
Interacting Hopf Algebras: the theory of linear systems
Fabio Zanasi
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 dive…
Rewriting modulo symmetric monoidal structure
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger +2
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 becoming in…