Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobociński & Fabio Zanasi (2017):
Confluence of graph rewriting with interfaces.
In: ESOP 2016,
pp. 141–169,
doi:10.1007/978-3-662-54434-1.
Filippo Bonchi, Pawel Sobocinski & Fabio Zanasi (2014):
A Categorical Semantics of Signal Flow Graphs.
In: CONCUR 2014,
LNCS 8704.
Springer,
pp. 435–450,
doi:10.1007/978-3-662-44584-6.
Filippo Bonchi, Pawel Sobocinski & Fabio Zanasi (2017):
The Calculus of Signal Flow Diagrams I: Linear relations on streams.
Inf. Comput. 252,
pp. 2–29,
doi:10.1016/j.ic.2016.03.002.
Roberto Bruni & Fabio Gadducci (2001):
Some algebraic laws for spans.
ENTCS 44,
pp. 175–193,
doi:10.1016/S1571-0661(04)80937-X.
Roberto Bruni, Ivan Lanese & Ugo Montanari (2006):
A basic algebra of stateless connectors.
Theoretical Computer Science 366(1–2),
pp. 98–120,
doi:10.1016/j.tcs.2006.07.005.
Albert Burroni (1993):
Higher dimensional word problems with applications to equational logic.
Theoretical Computer Science 115(1),
pp. 43–62,
doi:10.1016/0304-3975(93)90054.
Aurelio Carboni & R. F. C. Walters (1987):
Cartesian Bicategories I.
Journal of Pure and Applied Algebra 49(1-2),
pp. 11–32,
doi:10.1016/0022-4049(87)90121.
Bob Coecke & Ross Duncan (2008):
Interacting Quantum Observables.
In: ICALP 2008,
LNCS 5216.
Springer,
pp. 298–310,
doi:10.1007/978-3-540-70583-3.
A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel & M. Loewe (1997):
Algebraic Approaches to Graph Transformation, Part I: Basic Concepts and Double Pushout Approach.
In: Handbook of Graph Grammars.
University of Pisa,
pp. 163–246.
Andrea Corradini (2016):
On the definition of parallel independence in the algebraic approaches to graph transformation.
In: STAF 2016,
LNCS 9946.
Springer,
doi:10.1007/978-3-319-50230-4.
Hartmut Ehrig, Annegret Habel, Julia Padberg & Ulrike Prange (2004):
Adhesive High-Level Replacement Categories and Systems.
In: ICGT 2004,
LNCS 2987.
Springer,
pp. 144–160,
doi:10.1007/978-3-540-30203-2.
Hartmut Ehrig & Barbara König (2004):
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting.
In: FoSSaCS 2004,
LNCS 2987.
Springer,
pp. 151–166,
doi:10.1007/978-3-540-24727-2.
Brendan Fong (2016):
The Algebra of Open and Interconnected Systems.
University of Oxford.
Brendan Fong & Fabio Zanasi (2017):
A Universal construction for (co)relations.
In: Proceedings of CALCO'17.
Fabio Gadducci & Reiko Heckel (1997):
An inductive view of graph transformation.
In: WADT 1997,
LNCS 1376.
Springer,
pp. 223–237,
doi:10.1007/3-540-64299-4.
Philip Hackney & Marcy Robertson (2015):
On the Category of Props.
Applied Categorical Structures 23(4),
pp. 543–573,
doi:10.1007/s10485-014-9369-4.
Dimitri Kartsaklis, Mehrnoosh Sadrzadeh, Stephen Pulman & Bob Coecke (2014):
Reasoning about Meaning in Natural Language with Compact Closed Categories and Frobenius Algebras.
CoRR abs/1401.5980.
Available at http://arxiv.org/abs/1401.5980.
Piergiulio Katis, Nicoletta Sabadini & Robert Frank Carslaw Walters (1997):
Span(Graph): a categorical algebra of transition systems.
In: Proceedings of AMAST '97,
LNCS 1349.
Springer,
pp. 322–336,
doi:10.1007/BFb0000479.
G. M. Kelly & Ross Street (1974):
Review of the elements of 2-categories.
In: Category Seminar (Proc. Sem., Sydney, 1972/1973).
Springer,
pp. 75–103. Lecture Notes in Math., Vol. 420,
doi:10.1016/0022-4049(72)90019-9.
Aleks Kissinger (2014):
Finite matrices are complete for (dagger-)hypergraph categories.
CoRR abs/1406.5942.
Available at http://arxiv.org/abs/1406.5942.
Stephen Lack (2004):
Composing PROPs.
Theory and Application of Categories 13(9),
pp. 147–163.
Stephen Lack & PawełSobociński (2005):
Adhesive and quasiadhesive categories.
Theoretical Informatics and Applications 39(3),
pp. 511–546,
doi:10.1051/ita:2005028.
John MacDonald & Laura Scull (2009):
Amalgamations of categories.
Can Math B 52,
pp. 273–284,
doi:10.4153/CMB-2009-030-5.
Dan Marsden & Fabrizio Genovese (2017):
Custom hypergraph categories via generalized relations.
arXiv abs/1703.01204.
Available at http://arxiv.org/abs/1703.01204.
Samuel Mimram (2010):
Computing Critical Pairs in 2-Dimensional Rewriting Systems.
In: RTA 2010,
LIPIcs 6.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
pp. 227–242,
doi:10.4230/LIPIcs.RTA.2010.227.
Dusko Pavlovic (2013):
Monoidal computer I: Basic computability by string diagrams.
Information and Computation 226,
pp. 94–116,
doi:10.1016/j.ic.2013.03.007.
Detlef Plump (1993):
Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence.
In: Term Graph Rewriting: Theory and Practice.
Wiley,
pp. 201–213.
Detlef Plump (2010):
Checking Graph-Transformation Systems for Confluence.
In: Manipulation of Graphs, Algebras and Pictures,
ECEASST 26.
EASST.
Robert Rosebrugh, Nicoletta Sabadini & R. F. C. Walters (2005):
Generic Commutative Separable Algebras and Cospans of Graphs.
Theory and Application of Categories 17(6),
pp. 164–177.
Peter Selinger (2011):
A survey of graphical languages for monoidal categories.
Springer Lecture Notes in Physics 13(813),
pp. 289–355.
Veeramani, Balaji & Joel S Bader (2010):
Predicting Functional Associations from Metabolism Using Bi-Partite Network Algorithms.
BMC Systems Biology 4,
doi:10.1186/1752-0509-4-95.
Fabio Zanasi (2015):
Interacting Hopf Algebras: the theory of linear systems.
Ecole Normale Supérieure de Lyon.
Fabio Zanasi (2016):
The Algebra of Partial Equivalence Relations.
In: Mathematical Foundations of Program Semantics (MFPS) 325,
pp. 313–333,
doi:10.1016/j.entcs.2016.09.046.
eptcs@eptcs.org