P. Cu and .. The-theory-of-counit, 37 C PROP of the theory of commutative comonoids

C. Irc and P. , co-functional " circuit diagrams (opposite of C ? ? irc ), p.112

P. In and .. Of-injective-functions, 31 L ?,E Lawvere theory generated by a signature ? and a set E of equations, p.39

B. Mod-(-b-)-bicategory-of-monads-in and B. , 26 M PROP of the theory of commutative monoids

O. Mon and M. Monoids, 25 PER PROP of partial equivalence relations 54 PF PROP of partial functions, p.37

P. Frobenius and A. , 54 J PROP of isomorphisms in a given PROP T (also called the core of T) 34 P PROP of permutations 19 A T Unique PROP morphism from P to a 20 SF PROP of orthodox signal flow graphs 113 Set category of sets and functions, p.23

S. Abramsky, C. , and B. , A categorical semantics of quantum protocols, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.14-17, 2004.
DOI : 10.1109/LICS.2004.1319636

S. Abramsky, C. , and B. , Categorical Quantum Mechanics, p.4973, 2008.
DOI : 10.1016/B978-0-444-52869-8.50010-4
URL : http://arxiv.org/abs/0808.1023

J. Adámek, S. Milius, and J. Velebil, Parametric corecursion and completely iterative monads, NS-02-2 of BRICS Notes Series, pp.2-5, 2002.

F. Arbab, Reo: a channel-based coordination model for component composition, Mathematical Structures in Computer Science, vol.14, issue.3, pp.1-38, 2004.
DOI : 10.1017/S0960129504004153

M. Backens, The ZX-calculus is complete for stabilizer quantum mechanics, New Journal of Physics, vol.16, issue.9, p.93021, 2014.
DOI : 10.1088/1367-2630/16/9/093021

M. Backens, The ZX-calculus is complete for the single-qubit Clifford+T group, Proceedings 11th workshop on Quantum Physics and Logic of Electronic Proceedings in Theoretical Computer Science, pp.293-303, 2014.
DOI : 10.4204/EPTCS.172.21

J. C. Baez, Network theory, 2014.

J. C. Baez and J. Erbele, Categories in control, p.6881, 2014.

J. C. Baez and B. Fong, A compositional framework for passive linear circuits, p.5625, 2015.

J. C. Baez and M. Stay, Physics, Topology, Logic and Computation: A Rosetta Stone, Lecture Notes in Physics, vol.813, pp.95-174, 2011.
DOI : 10.1007/978-3-642-12821-9_2

M. Barnabei, C. Guerrini, and L. Montefusco, Some algebraic aspects of signal processing, Linear Algebra and its Applications, vol.284, issue.1-3, pp.1-3, 1998.
DOI : 10.1016/S0024-3795(98)10131-3

H. Basold, M. Bonsangue, H. Hansen, and J. And-rutten, (Co)Algebraic Characterizations of Signal??Flow??Graphs, Horizons of the Mind. A Tribute to, pp.124-145, 2014.
DOI : 10.1109/T-C.1973.223735

R. Beauxis and S. Mimram, A non-standard semantics for Kahn networks in continuous time, Computer Science Logic, 25th International Workshop / 20th Annual Conference of the EACSL, CSL 2011, pp.35-50, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00616968

J. Beck, Distributive laws, Lecture Notes in Mathematics, vol.80, pp.119-140, 1969.
DOI : 10.1007/BFb0083084

J. Bénabou, Introduction to bicategories, Reports of the Midwest Category Seminar, pp.1-77, 1967.
DOI : 10.1007/BF01451367

G. Bergman, Everybody knows what a Hopf algebra is, Amer. Math. Soc. Contemp. Math, vol.43, pp.25-48, 1985.
DOI : 10.1090/conm/043/810641

J. Berstel and C. Reutenauer, Rational series and their languages, EATCS Monographs on Theoretical Computer Science, vol.12, 1988.
DOI : 10.1007/978-3-642-73235-5
URL : https://hal.archives-ouvertes.fr/hal-00619791

F. Bonchi, M. M. Bonsangue, J. J. Rutten, and A. Silva, Deriving Syntax and Axioms for Quantitative Regular Behaviours, CONCUR 2009 -Concurrency Theory , 20th International Conference, pp.146-162, 2009.
DOI : 10.1006/inco.1995.1123

F. Bonchi, S. Milius, A. Silva, and F. Zanasi, How to kill epsilons with a dagger -A coalgebraic take on systems with algebraic label structure, Coalgebraic Methods in Computer Science -12th IFIP WG 1.3 International Workshop, pp.53-74, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00989197

F. Bonchi, S. Milius, A. Silva, and F. Zanasi, Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure, Theoretical Computer Science, vol.604, 2015.
DOI : 10.1016/j.tcs.2015.03.024
URL : https://hal.archives-ouvertes.fr/hal-01284933

F. Bonchi, P. Sobocinski, and F. Zanasi, A Categorical Semantics of Signal Flow Graphs, CONCUR 2014 -Concurrency Theory -25th International Conference, CONCUR 2014, pp.435-450, 2014.
DOI : 10.1007/978-3-662-44584-6_30

F. Bonchi, P. Soboci´nskisoboci´nski, and F. Zanasi, Interacting Hopf algebras, Journal of Pure and Applied Algebra, vol.221, issue.1, p.7048, 2014.
DOI : 10.1016/j.jpaa.2016.06.002
URL : http://arxiv.org/abs/1403.7048

F. Bonchi, P. Sobocinski, and F. Zanasi, Full abstraction for signal flow graphs, Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, pp.515-526, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01178437

F. Bonchi, P. Sobociski, and F. Zanasi, Interacting Bialgebras Are Frobenius, Foundations of Software Science and Computation Structures, A. Muscholl, pp.351-365, 2014.
DOI : 10.1007/978-3-642-54830-7_23
URL : https://hal.archives-ouvertes.fr/hal-00989174

F. Bonchi and F. Zanasi, Saturated Semantics for Coalgebraic Logic Programming, Algebra and Coalgebra in Computer Science -5th International Conference, CALCO 2013 Proceedings (2013), pp.80-94, 2013.
DOI : 10.1007/978-3-642-40206-7_8
URL : https://hal.archives-ouvertes.fr/hal-00909353

F. Bonchi and F. Zanasi, Bialgebraic Semantics for Logic Programming, Logical Methods in Computer Science, vol.11, issue.1, 2015.
DOI : 10.2168/LMCS-11(1:14)2015
URL : https://hal.archives-ouvertes.fr/hal-01284910

M. M. Bonsangue, H. H. Hansen, A. Kurz, and J. Rot, Presenting distributive laws, Algebra and Coalgebra in Computer Science -5th International Conference, CALCO 2013 Proceedings (2013), pp.95-109, 2013.
DOI : 10.1007/978-3-642-40206-7_9
URL : http://arxiv.org/abs/1503.02447

M. M. Bonsangue, J. J. Rutten, and A. Silva, Coalgebraic Logic and Synthesis of Mealy Machines, Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, pp.231-245, 2008.
DOI : 10.1007/978-3-540-78499-9_17

F. Borceux, Handbook of Categorical Algebra 1 ? Basic Category Theory, 1994.

S. Brookes, On the Kahn principle and fair networks, 1998.

R. Bruni and F. Gadducci, Some algebraic laws for spans (and their connections with multi-relations), In RelMiS, 2001.

R. Bruni, I. Lanese, and U. Montanari, A basic algebra of stateless connectors, Theoretical Computer Science, vol.366, issue.1-2, pp.98-120, 2006.
DOI : 10.1016/j.tcs.2006.07.005

S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, 1981.
DOI : 10.1007/978-1-4613-8130-3

A. Burroni, Higher-dimensional word problems with applications to equational logic, Theoretical Computer Science, vol.115, issue.1, pp.43-62, 1993.
DOI : 10.1016/0304-3975(93)90054-W
URL : http://doi.org/10.1016/0304-3975(93)90054-w

A. Carboni and R. F. Walters, Cartesian bicategories I, Journal of Pure and Applied Algebra, vol.49, issue.1-2, pp.11-32, 1987.
DOI : 10.1016/0022-4049(87)90121-6
URL : http://doi.org/10.1016/0022-4049(87)90121-6

N. Carqueville and I. Runkel, Orbifold completion of defect bicategories, Quantum Topology, vol.7, issue.2, p.6363, 1210.
DOI : 10.4171/QT/76

F. Carreiro, A. Facchini, Y. Venema, and F. Zanasi, Weak MSO, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, p.27, 2014.
DOI : 10.1145/2603088.2603101
URL : https://hal.archives-ouvertes.fr/hal-00987506

E. Cheng, Iterated distributive laws, Mathematical Proceedings of the Cambridge Philosophical Society, vol.431, issue.03, pp.459-487, 2011.
DOI : 10.1017/CBO9780511525896

E. Cheng, Distributive laws for lawvere theories Algebra Universalis (to appear)

B. Coecke, D. , and R. , Interacting Quantum Observables, Automata, Languages and Programming, 35th International Colloquium Proceedings, Part II -Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations, pp.298-310, 2008.
DOI : 10.1007/978-3-540-70583-3_25

B. Coecke, D. , and R. , Interacting quantum observables: categorical algebra and diagrammatics, New Journal of Physics, vol.13, issue.4, p.43016, 2011.
DOI : 10.1088/1367-2630/13/4/043016
URL : http://doi.org/10.1088/1367-2630/13/4/043016

H. Cohen, A Course in Computational Algebraic Number Theory, 1993.
DOI : 10.1007/978-3-662-02945-9

P. Conti, Hermite canonical form and Smith canonical form of a matrix over a principal ideal domain, ACM SIGSAM Bulletin, vol.24, issue.3, pp.8-16
DOI : 10.1145/101104.101105

A. Corradini and F. Gadducci, An algebraic presentation of term graphs, via gsmonoidal categories, Applied Categorical Structures, vol.7, issue.4, pp.299-331, 1999.
DOI : 10.1023/A:1008647417502

V. Danos and L. Regnier, The structure of multiplicatives, Archive for Mathematical Logic, vol.28, issue.3, pp.181-203, 1989.
DOI : 10.1007/BF01622878

C. S. De-witt and V. Zamdzhiev, The ZX calculus is incomplete for quantum mechanics, Proceedings of the 11th workshop on Quantum Physics and Logic, QPL 2014, pp.4-6, 2014.

S. Eilenberg, K. , and G. M. , Closed Categories, Proceedings of the Conference on Categorical Algebra, pp.421-562, 1966.
DOI : 10.1007/978-3-642-99902-4_22

A. Facchini, Y. Venema, and F. Zanasi, A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.478-487, 2013.
DOI : 10.1109/LICS.2013.54

M. P. Fiore and M. D. Campos, The Algebra of Directed Acyclic Graphs, In Abramsky Festschrift LNCS, vol.43, issue.3, 2013.
DOI : 10.1017/S0960129505004809

T. Fritz, A presentation of the category of stochastic matrices CoRR abs/0902, p.2554, 2009.

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

M. Hasegawa, Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculi, pp.196-213
DOI : 10.1007/3-540-62688-3_37

I. Hasuo and N. Hoshino, Semantics of higher-order quantum computation via geometry of interaction, Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, pp.237-246, 2011.

T. Heindel and P. Sobocinski, Being Van Kampen is a universal property, Logical Methods in Computer Science, vol.7, issue.1, 2011.

T. T. Hildebrandt, P. Panangaden, and G. Winskel, A relational model of non-deterministic dataflow, Mathematical Structures in Computer Science, vol.14, issue.5, pp.613-649, 2004.
DOI : 10.1017/S0960129504004293

C. A. Hoare, Communicating sequential processes, Communications of the ACM, vol.21, issue.8, pp.666-677, 1978.
DOI : 10.1145/359576.359585

L. Hogben, Handbook of Linear Algebra
DOI : 10.1201/9781420010572

M. Hyland and J. Power, The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads, Electronic Notes in Theoretical Computer Science, vol.172, pp.437-458, 2007.
DOI : 10.1016/j.entcs.2007.02.019

B. Jacobs, Categorical Logic and Type Theory. No. 141 in Studies in Logic and the Foundations of Mathematics, 1999.

B. Jacobs and J. Mandemaker, Coreflections in Algebraic Quantum Logic, Foundations of Physics, vol.14, issue.4, pp.932-958, 2012.
DOI : 10.1007/s10701-012-9654-8

A. Joyal and R. Street, The geometry of tensor calculus, I, Advances in Mathematics, vol.88, issue.1, pp.55-112, 1991.
DOI : 10.1016/0001-8708(91)90003-P

A. Joyal, R. Street, and D. Verity, Traced monoidal categories, Mathematical Proceedings of the Cambridge Philosophical Society, vol.1488, issue.03, pp.447-468, 1996.
DOI : 10.1007/BF02096491

P. Katis, N. Sabadini, and R. F. Walters, Span(Graph): an algebra of transition systems, Algebraic Methodology and Software Technology (AMAST '97, pp.322-336, 1997.

G. M. Kelly and M. L. Laplaza, Coherence for compact closed categories, Journal of Pure and Applied Algebra, vol.19, pp.193-213, 1980.
DOI : 10.1016/0022-4049(80)90101-2

A. Kissinger and V. Zamdzhiev, Quantomatic: A Proof Assistant for Diagrammatic Reasoning, p.1034, 2015.
DOI : 10.1007/978-3-319-21401-6_22

S. C. Kleene, Representation of Events in Nerve Nets and Finite Automata, pp.3-41, 1956.
DOI : 10.1515/9781400882618-002

E. Komendantskaya and J. Power, Coalgebraic derivations in logic programming, of LIPIcs, Schloss Dagstuhl, pp.352-366, 2011.

D. Kozen, A completeness theorem for Kleene algebras and the algebra of regular events, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.366-390, 1994.
DOI : 10.1109/LICS.1991.151646

S. Lack, Composing PROPs, Theor App Categories, vol.13, issue.9, pp.147-163, 2004.

Y. Lafont, Interaction nets, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.95-108, 1990.
DOI : 10.1145/96709.96718

Y. Lafont, Equational reasoning with 2-dimensional diagrams, Lecture Notes in Computer Science, vol.909, pp.170-195, 1995.
DOI : 10.1007/3-540-59340-3_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.3029

Y. Lafont, Interaction Combinators, Information and Computation, vol.137, issue.1, pp.69-101, 1997.
DOI : 10.1006/inco.1997.2643
URL : http://doi.org/10.1006/inco.1997.2643

Y. Lafont, Towards an algebraic theory of Boolean circuits, Journal of Pure and Applied Algebra, vol.184, issue.2-3, pp.257-310, 2003.
DOI : 10.1016/S0022-4049(03)00069-0

B. Lahti, Signal Processing and Linear Systems, 1998.

W. Lawvere, FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES, Proceedings of the National Academy of Sciences, vol.50, issue.5, 2004.
DOI : 10.1073/pnas.50.5.869

T. Leinster, Higher operads, higher categories. No. 298, 2004.
DOI : 10.1017/cbo9780511525896
URL : http://arxiv.org/abs/math/0305049

M. Lane and S. , Categorical algebra, Am Math Soc, vol.71, pp.40-106, 1965.

M. Lane and S. , Categories for the Working Mathematician, 1998.
DOI : 10.1007/978-1-4612-9839-7

S. J. Mason, Feedback Theory-Some Properties of Signal Flow Graphs, Proceedings of the IRE, vol.41, issue.9, 1953.
DOI : 10.1109/JRPROC.1953.274449

S. Milius, A Sound and Complete Calculus for Finite Stream Circuits, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.11-14, 2010.
DOI : 10.1109/LICS.2010.11

R. Milner, A Calculus of Communicating Systems, 1982.
DOI : 10.1007/3-540-10235-3

S. Mimram, Semantique des jeux asynchrones et réécriture 2-dimensionnelle, 2008.

S. Mimram, Towards 3-Dimensional Rewriting Theory, Logical Methods in Computer Science, vol.10, issue.2, 2014.
DOI : 10.2168/LMCS-10(2:1)2014
URL : http://arxiv.org/abs/1403.4094

S. Mimram, Presenting Finite Posets, Proceedings 8th International Workshop on Computing with Terms and Graphs of Electronic Proceedings in Theoretical Computer Science, pp.1-17, 2014.
DOI : 10.4204/EPTCS.183.1

P. Panangaden, Probabilistic relations. School of Computer Science research reports, University of Birmingham CSR, pp.59-74, 1998.

D. Pavlovic, Monoidal computer I: Basic computability by string diagrams, Information and Computation, vol.226, pp.94-116, 2013.
DOI : 10.1016/j.ic.2013.03.007
URL : http://arxiv.org/abs/1208.5205

D. Pavlovic and M. H. Escardó, Calculus in coinductive form, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226), p.408, 1998.
DOI : 10.1109/LICS.1998.705675

R. Penrose, Applications of negative dimension tensors, Combinatorial Mathematics and its Applications, pp.221-244, 1971.

J. L. Peterson, Petri Nets, ACM Computing Surveys, vol.9, issue.3, pp.223-252, 1977.
DOI : 10.1145/356698.356702

T. Pirashvili, On the prop corresponding to bialgebras, Cah. Top. Gom. Diff. Cat XLIII, 2002.

P. Rannou, Réécriture de diagrammes et de ?-diagrammes, 2013.

R. Rosebrugh and R. Wood, Distributive laws and factorization, Journal of Pure and Applied Algebra, vol.175, issue.1-3, pp.327-353, 2002.
DOI : 10.1016/S0022-4049(02)00140-8
URL : http://doi.org/10.1016/s0022-4049(02)00140-8

J. J. Rutten, A tutorial on coinductive stream calculus and signal flow graphs, Theoretical Computer Science, vol.343, issue.3, pp.443-481, 2005.
DOI : 10.1016/j.tcs.2005.06.019

J. J. Rutten, Rational streams coalgebraically, Logical Methods in Computer Science, vol.4, issue.3, 2008.
DOI : 10.2168/LMCS-4(3:9)2008
URL : http://arxiv.org/abs/0807.4073

D. Sangiorgi and D. Walker, PI-Calculus: A Theory of Mobile Processes, 2001.

P. Selinger, Dagger Compact Closed Categories and Completely Positive Maps, Electronic Notes in Theoretical Computer Science, vol.170, pp.139-163, 2007.
DOI : 10.1016/j.entcs.2006.12.018
URL : http://doi.org/10.1016/j.entcs.2006.12.018

P. Selinger, A Survey of Graphical Languages for Monoidal Categories, Lecture Notes in Physics, vol.13, issue.813, pp.289-355, 2011.
DOI : 10.1007/978-3-642-12821-9_4

C. E. Shannon, The theory and design of linear differential equation machines, Tech. rep., National Defence Research Council, 1942.

M. R. Sleep, M. J. Plasmeijer, and M. C. Van-eekelen, Term Graph Rewriting: Theory and Practice, 1993.

P. Soboci´nskisoboci´nski, Representations of petri net interactions, CONCUR 2010 -Concurrency Theory, 21th International Conference, pp.554-568, 2010.

P. Soboci´nskisoboci´nski, Nets, relations and linking diagrams, Algebra and Coalgebra in Computer Science -5th International Conference Proceedings (2013), pp.282-298, 2013.

G. Stefanescu, Network Algebra. Discrete Mathematics and Theoretical Computer Science, 2000.

R. Street, The formal theory of monads, Journal of Pure and Applied Algebra, vol.2, issue.2, pp.243-265, 2002.
DOI : 10.1016/0022-4049(72)90019-9

T. Streicher, Semantics of type theory : correctness, completeness, and independence results. Progress in theoretical computer science, 1991.
DOI : 10.1007/978-1-4612-0433-6

S. Wadsley and N. Woods, Props for linear systems, p.48, 2015.

J. Willems, Linear Systems in Discrete Time, Festschrift on the occasion of the retirement of Okko Bosgra, pp.3-12, 2009.
DOI : 10.1007/978-1-4419-0895-7_1

J. C. Willems, The Behavioral Approach to Open and Interconnected Systems, IEEE Control Systems Magazine, vol.27, issue.6, pp.46-99, 2007.
DOI : 10.1109/MCS.2007.906923