Fetching the paper…
Reading the bibliography…
String diagrams are a powerful and intuitive graphical syntax, originated in the study of symmetric monoidal categories.
Categorical algebra
Saunders Mac Lane · 1965
Earlier work this paper cites.
Introduction to bicategories
Jean Bénabou · 1967
Earlier work this paper cites.
Simple word problems in universal algebras
Donald E. Knuth and Peter B. Bendix · 1970
Earlier work this paper cites.
Confluent reductions: Abstract properties and applications to term rewriting systems: Abstract properties and applications to term rewriting systems
Gérard Huet · 1980
Earlier work this paper cites.
Complete sets of reductions for some equational theories
Gerald E Peterson and Mark E Stickel · 1981
Earlier work this paper cites.
Term graph rewriting
Hendrik Pieter Barendregt, Marko C. J. D. van Eekelen, John R. W. Glauert, Richard Kennaway, Marinus J. Plasmeijer, and M. Ronan Sleep · 1987
Earlier work this paper cites.
Cartesian bicategories I
Aurelio Carboni and Robert F. C. Walters · 1987
Earlier work this paper cites.
Completion for rewriting modulo a congruence
Leo Bachmair and Nachum Dershowitz · 1989
Earlier work this paper cites.
Rewrite systems
Nachum Dershowitz and Jean-Pierre Jouannaud · 1990
Earlier work this paper cites.
The geometry of tensor calculus, i
Andre Joyal and Ross Street · 1991
Earlier work this paper cites.
Higher dimensional word problems with applications to equational logic
Albert Burroni · 1993
Earlier work this paper cites.
Traced monoidal categories
Andre Joyal, Ross Street, and Dominic Verity · 1996
Earlier work this paper cites.
Algebraic approaches to graph transformation - Part I: Basic concepts and double pushout approach
Andrea Corradini, Ugo Montanari, Francesca Rossi, Hartmut Ehrig, Reiko Heckel, and Michael Löwe · 1997
Earlier work this paper cites.
An inductive view of graph transformation
Fabio Gadducci and Reiko Heckel · 1998
Earlier work this paper cites.
Categories for the Working Mathematician
Saunders Mac Lane · 1998
Earlier work this paper cites.
Term graph rewriting
Detlef Plump · 1999
Earlier work this paper cites.
Some algebraic laws for spans (and their connections with multirelations)
Roberto Bruni and Fabio Gadducci · 2001
Earlier work this paper cites.
A survey of rewriting strategies in program transformation systems
Eelco Visser · 2001
Earlier work this paper cites.
Towards an algebraic theory of Boolean circuits
Yves Lafont · 2003
Earlier work this paper cites.
A categorical semantics of quantum protocols
Samson Abramsky and Bob Coecke · 2004
Earlier work this paper cites.
Deriving bisimulation congruences in the DPO approach to graph rewriting
Hartmut Ehrig and Barbara König · 2004
Earlier work this paper cites.
Composing PROPs
Steve Lack · 2004
Cited alongside, same era.
Adhesive and quasiadhesive categories
Steve Lack and Pawel Sobociński · 2005
Cited alongside, same era.
Generic commutative separable algebras and cospans of graphs
Robert Rosebrugh, Nicoletta Sabadini, and R. F. C. Walters · 2005
Cited alongside, same era.
Reactive systems over cospans
Vladimiro Sassone and Pawel Sobociński · 2005
Cited alongside, same era.
Graph rewriting for the π \pi -calculus
Fabio Gadducci · 2007
Cited alongside, same era.
The category theoretic understanding of universal algebra: Lawvere theories and monads
Martin Hyland and John Power · 2007
Cited alongside, same era.
Interacting quantum observables
Towards 3-dimensional rewriting theory
Samuel Mimram · 2014
Later among the works it cites.
Categories in control
John Baez and Jason Erbele · 2015
Later among the works it cites.
Full abstraction for signal flow graphs
Filippo Bonchi, Pawel Sobociński, and Fabio Zanasi · 2015
Later among the works it cites.
Quantomatic: A proof assistant for diagrammatic reasoning
Aleks Kissinger and Vladimir Zamdzhiev · 2015
Later among the works it cites.
Interacting Hopf Algebras: The Theory of Linear Systems
Fabio Zanasi · 2015
Later among the works it cites.
Rewriting modulo symmetric monoidal structure
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobociński, and Fabio Zanasi · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Bob Coecke and Ross Duncan · 2008
Cited alongside, same era.
Luisa Albasini, Nicoletta Sabadini, and Robert F. C. Walters · 2009
Cited alongside, same era.
Synthesising CCS bisimulation using graph rewriting
Filippo Bonchi, Fabio Gadducci, and Barbara König · 2009
Cited alongside, same era.
Amalgamations of categories
John MacDonald and Laura Scull · 2009
Cited alongside, same era.
Open graphs and computational reasoning
Lucas Dixon, Ross Duncan, and Aleks Kissinger · 2010
Cited alongside, same era.
Checking graph-transformation systems for confluence
Detlef Plump · 2010
Cited alongside, same era.
John Baez, Brandon Coya, and Franciscus Rebro · 2017
Later among the works it cites.
Confluence of graph rewriting with interfaces
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Pawel Sobociński, and Fabio Zanasi · 2017
Later among the works it cites.
Refinement for signal flow graphs
Filippo Bonchi, Joshua Holland, Dusko Pavlovic, and Pawel Sobociński · 2017
Later among the works it cites.
The calculus of signal flow diagrams I: Linear relations on streams
Filippo Bonchi, Pawel Sobociński, and Fabio Zanasi · 2017
Later among the works it cites.
Interacting Hopf algebras
Filippo Bonchi, Pawel Sobociński, and Fabio Zanasi · 2017
Later among the works it cites.
Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning
Bob Coecke and Aleks Kissinger · 2017
Later among the works it cites.
A universal completion of the ZX-calculus
Kang Feng Ng and Quanlong Wang · 2017
Later among the works it cites.
Rewriting with Frobenius
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobociński, and Fabio Zanasi · 2018
Later among the works it cites.
A complete axiomatisation of the ZX-calculus for Clifford+T quantum mechanics
Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart · 2018
Later among the works it cites.
Diagrammatic algebra: from linear to concurrent systems
Filippo Bonchi, Joshua Holland, Robin Piedeleu, Pawel Sobocinski, and Fabio Zanasi · 2019
Later among the works it cites.
Graphical affine algebra
Filippo Bonchi, Robin Piedeleu, Pawel Sobociński, and Fabio Zanasi · 2019
Later among the works it cites.
Hypergraph categories
Brendan Fong and David I. Spivak · 2019
Later among the works it cites.
String diagram rewrite theory II: Rewriting with symmetric monoidal structure
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobociński, and Fabio Zanasi · 2020
Closest in time.
Pyzx: Large scale automated diagrammatic reasoning
Aleks Kissinger and John van de Wetering · 2020
Closest in time.
String diagram rewrite theory III: Confluence with and without Frobenius
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobociński, and Fabio Zanasi · 2021
Closest in time.