{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:31:58Z","timestamp":1775097118472,"version":"3.50.1"},"reference-count":70,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T00:00:00Z","timestamp":1664409600000},"content-version":"unspecified","delay-in-days":181,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Symmetric monoidal theories (SMTs) generalise algebraic theories in a way that make them suitable to express resource-sensitive systems, in which variables cannot be copied or discarded at will. In SMTs, traditional tree-like terms are replaced by <jats:italic>string diagrams<\/jats:italic>, topological entities that can be intuitively thought of as diagrams of wires and boxes. Recently, string diagrams have become increasingly popular as a graphical syntax to reason about computational models across diverse fields, including programming language semantics, circuit theory, quantum mechanics, linguistics, and control theory. In applications, it is often convenient to implement the equations appearing in SMTs as <jats:italic>rewriting rules<\/jats:italic>. This poses the challenge of extending the traditional theory of term rewriting, which has been developed for algebraic theories, to string diagrams. In this paper, we develop a mathematical theory of string diagram rewriting for SMTs. Our approach exploits the correspondence between string diagram rewriting and double pushout (DPO) rewriting of certain graphs, introduced in the first paper of this series. Such a correspondence is only sound when the SMT includes a <jats:italic>Frobenius algebra<\/jats:italic> structure. In the present work, we show how an analogous correspondence may be established for arbitrary SMTs, once an appropriate notion of DPO rewriting (which we call <jats:italic>convex<\/jats:italic>) is identified. As proof of concept, we use our approach to show termination of two SMTs of interest: Frobenius semi-algebras and bialgebras.<\/jats:p>","DOI":"10.1017\/s0960129522000317","type":"journal-article","created":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T07:25:17Z","timestamp":1664436317000},"page":"511-541","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":13,"title":["String diagram rewrite theory II: Rewriting with symmetric monoidal structure"],"prefix":"10.1017","volume":"32","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0690-3051","authenticated-orcid":false,"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[]},{"given":"Aleks","family":"Kissinger","sequence":"additional","affiliation":[]},{"given":"Pawel","family":"Sobocinski","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Zanasi","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2022,9,29]]},"reference":[{"key":"S0960129522000317_ref61","doi-asserted-by":"crossref","unstructured":"Power, J. (2006a). Countable Lawvere theories and computational effects. In: Seda, A. K., Hurley, T., Schellekens, M. P., Airchinnigh, M. M. and Strong, G. (eds.) MFCSIT 2004, ENTCS, vol. 161, Elsevier, 59\u201371.","DOI":"10.1016\/j.entcs.2006.04.025"},{"key":"S0960129522000317_ref25","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1080\/00927877608822127","article-title":"Coalgebras and cartesian categories","volume":"4","author":"Fox","year":"1976","journal-title":"Communications in Algebra"},{"key":"S0960129522000317_ref64","doi-asserted-by":"crossref","unstructured":"Sassone, V. and Soboci\u0143ski, P. (2005). Reactive systems over cospans. In: LICS 2005, IEEE Computer Society, 311\u2013320.","DOI":"10.1109\/LICS.2005.40"},{"key":"S0960129522000317_ref7","unstructured":"Bonchi, F. , Holland, J. , Pavlovic, D. and Soboci\u0143ski, P. (2017b). Refinement for signal flow graphs. In: Meyer, R. and Nestmann, U. (eds.) CONCUR 2017, LIPIcs, vol. 85, Schloss Dagstuhl - Leibniz-Zentrum f\u00dcr Informatik, 24:1\u201324:16."},{"key":"S0960129522000317_ref9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.ic.2016.03.002","article-title":"The calculus of signal flow diagrams I: linear relations on streams","volume":"252","author":"Bonchi","year":"2017","journal-title":"Information and Computation"},{"key":"S0960129522000317_ref40","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1017\/S0956796809007254","article-title":"Gabriel-Ulmer duality and Lawvere theories enriched over a general base","volume":"19","author":"Lack","year":"2009","journal-title":"Functional Programming"},{"key":"S0960129522000317_ref21","doi-asserted-by":"crossref","unstructured":"Corradini, A. , Montanari, U. , Rossi, F. , Ehrig, H. , Heckel, R. and L\u00d6we, M. (1997). Algebraic approaches to graph transformation - Part I: basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations, World Scientific, 163\u2013246.","DOI":"10.1142\/9789812384720_0003"},{"key":"S0960129522000317_ref48","doi-asserted-by":"crossref","DOI":"10.2168\/LMCS-10(2:1)2014","article-title":"Towards 3-dimensional rewriting theory","volume":"10","author":"Mimram","year":"2014","journal-title":"Logical Methods in Computer Science"},{"key":"S0960129522000317_ref50","unstructured":"Obradovic, J. (2017). Cyclic Operads: Syntactic, Algebraic and Categorified Aspects. Phd thesis, Universit\u00c9 Paris 7."},{"key":"S0960129522000317_ref36","doi-asserted-by":"crossref","unstructured":"Jacobs, B. , Kissinger, A. and Zanasi, F. (2019). Causal inference by string diagram surgery. In: Bojanczyk, M. and Simpson, A. (eds.) FOSSACS 2019, LNCS, vol. 11425, Springer, 313\u2013329.","DOI":"10.1007\/978-3-030-17127-8_18"},{"key":"S0960129522000317_ref13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.ic.2008.10.005","article-title":"Synthesising CCS bisimulation using graph rewriting","volume":"207","author":"Bonchi","year":"2009","journal-title":"Information and Computation"},{"key":"S0960129522000317_ref57","doi-asserted-by":"crossref","unstructured":"Power, J. (1991). An n-categorical pasting theorem. In: Carboni, A., Pedicchio, M. C. and Rosolini, G. (eds.) Category theory, Lecture Notes in Mathematics, Springer, 326\u2013358.","DOI":"10.1007\/BFb0084230"},{"key":"S0960129522000317_ref41","first-page":"147","article-title":"Composing PROPs","volume":"13","author":"Lack","year":"2004","journal-title":"Theory and Application of Categories"},{"key":"S0960129522000317_ref39","doi-asserted-by":"crossref","unstructured":"Kissinger, A. and Zamdzhiev, V. (2015). Quantomatic: a proof assistant for diagrammatic reasoning. Preprint available at arXiv:1503.01034.","DOI":"10.1007\/978-3-319-21401-6_22"},{"key":"S0960129522000317_ref22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10485-019-09569-7","article-title":"Categorified cyclic operads","volume":"28","author":"Curien","year":"2020","journal-title":"Applied Categorical Structures"},{"key":"S0960129522000317_ref29","unstructured":"Ghica, D. R. , Jung, A. and Lopez, A. (2017). Diagrammatic semantics for digital circuits. In: Goranko, V. and Dam, M. (eds.) CSL 2017, LIPIcs, vol. 82, Schloss Dagstuhl - Leibniz-Zentrum f\u00dcr Informatik, 24:1\u201324:16."},{"key":"S0960129522000317_ref44","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0022-4049(03)00069-0","article-title":"Towards an algebraic theory of Boolean circuits","volume":"184","author":"Lafont","year":"2003","journal-title":"Pure and Applied Algebra"},{"key":"S0960129522000317_ref49","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","article-title":"Notions of computation and monads","volume":"93","author":"Moggi","year":"1991","journal-title":"Information and Computation"},{"key":"S0960129522000317_ref23","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1017\/S0960129512000138","article-title":"Open-graphs and monoidal theories","volume":"23","author":"Dixon","year":"2013","journal-title":"Mathematical Structures in Computer Science"},{"key":"S0960129522000317_ref59","doi-asserted-by":"crossref","unstructured":"Power, J. (2004). Canonical models for computational effects. In: Walukiewicz, I. (ed.) FOSSACS 2004, LNCS, vol. 2987, Springer, 438\u2013452.","DOI":"10.1007\/978-3-540-24727-2_31"},{"key":"S0960129522000317_ref63","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1093\/logcom\/ext044","article-title":"The Frobenius anatomy of word meanings I: subject and object relative pronouns","volume":"23","author":"Sadrzadeh","year":"2013","journal-title":"Logic and Computation"},{"key":"S0960129522000317_ref65","first-page":"289","article-title":"A survey of graphical languages for monoidal categories","volume":"13","author":"Selinger","year":"2011","journal-title":"Springer Lecture Notes in Physics"},{"key":"S0960129522000317_ref31","unstructured":"Hadzihasanovic, A. (2020a). Via Twitter: twitter.com\/amar_hh\/status\/1336274654923788288?s=20."},{"key":"S0960129522000317_ref11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3502719","article-title":"String diagram rewrite theory I: rewriting with Frobenius structure","volume":"69","author":"Bonchi","year":"2022","journal-title":"Journal of the ACM"},{"key":"S0960129522000317_ref17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0304-3975(93)90054-W","article-title":"Higher dimensional word problems with applications to equational logic","volume":"115","author":"Burroni","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"S0960129522000317_ref38","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1017\/S0305004100074338","article-title":"Traced monoidal categories","volume":"119","author":"Joyal","year":"1996","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"S0960129522000317_ref45","unstructured":"Liberti, I. D. , Loregian, F. , Nester, C. and Soboci\u0143ski, P. (2021). Functorial semantics for partial theories. In: POPL 2021."},{"key":"S0960129522000317_ref60","doi-asserted-by":"crossref","unstructured":"Power, J. (2005). Discrete Lawvere theories. In: Fiadeiro, J. L., Harman, N., Roggenbach, M. and Rutten, J. J. M. M. (eds.) CALCO 2005, LNCS, vol. 3629, Springer, 348\u2013363.","DOI":"10.1007\/11548133_22"},{"key":"S0960129522000317_ref70","doi-asserted-by":"crossref","unstructured":"Zanasi, F. (2016). The algebra of partial equivalence relations. In: Birkedal, L. (ed.) MFPS 2016, ENTCS, vol. 325, Elsevier, 313\u2013333.","DOI":"10.1016\/j.entcs.2016.09.046"},{"key":"S0960129522000317_ref30","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.jpaa.2005.10.011","article-title":"Termination orders for three-dimensional rewriting","volume":"207","author":"Guiraud","year":"2006","journal-title":"Pure and Applied Algebra"},{"key":"S0960129522000317_ref42","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1051\/ita:2005028","article-title":"Adhesive and quasiadhesive categories","volume":"39","author":"Lack","year":"2005","journal-title":"Theoretical Informatics and Applications"},{"key":"S0960129522000317_ref58","first-page":"83","article-title":"Enriched Lawvere theories","volume":"6","author":"Power","year":"1999","journal-title":"Theory and Applications of Categories"},{"key":"S0960129522000317_ref3","article-title":"Globular: an online proof assistant for higher-dimensional rewriting","volume":"14","author":"Bar","year":"2018","journal-title":"Logical Methods in Computer Science"},{"key":"S0960129522000317_ref14","doi-asserted-by":"crossref","unstructured":"Bonchi, F. , Piedeleu, R. , Soboci\u0143ski, P. and Zanasi, F. (2019). Graphical affine algebra. In: LICS 2019, IEEE, 1\u201312.","DOI":"10.1109\/LICS.2019.8785877"},{"key":"S0960129522000317_ref18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1088\/1367-2630\/13\/4\/043016","article-title":"Interacting quantum observables: categorical algebra and diagrammatics","volume":"13","author":"Coecke","year":"2011","journal-title":"New Journal of Physics"},{"key":"S0960129522000317_ref66","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0479-7","volume-title":"Network Algebra","author":"Stefanescu","year":"2000"},{"key":"S0960129522000317_ref1","doi-asserted-by":"crossref","unstructured":"Abramsky, S. and Heunen, C. (2012). H*-algebras and nonunital Frobenius algebras: first steps in infinite-dimensional categorical quantum mechanics. In: Abramsky, S. and Mislove, M. (eds.) Mathematical Foundations of Information Flow, Proceedings of Symposia in Applied Mathematics, vol. 71, American Mathematical Society, 1\u201314.","DOI":"10.1090\/psapm\/071\/599"},{"key":"S0960129522000317_ref15","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.jlamp.2017.12.002","article-title":"Deconstructing Lawvere with distributive laws","volume":"95","author":"Bonchi","year":"2018","journal-title":"Logic and Algebraic Methods in Programming"},{"key":"S0960129522000317_ref35","doi-asserted-by":"crossref","unstructured":"Hyland, M. and Power, J. (2007). The category theoretic understanding of universal algebra: Lawvere theories and monads. In: Cardelli, L., Fiore, M. P. and Winskel, G. (eds.) Computation, Meaning, and Logic, ENTCS, vol. 172, Elsevier, 437\u2013458.","DOI":"10.1016\/j.entcs.2007.02.019"},{"key":"S0960129522000317_ref51","doi-asserted-by":"crossref","unstructured":"Plotkin, G. D. and Power, J. (2001a). Adequacy for algebraic effects. In: Honsell, F. and Miculan, M. (eds.) FOSSACS 2001, LNCS, vol. 2030, Springer, 1\u201324.","DOI":"10.1007\/3-540-45315-6_1"},{"key":"S0960129522000317_ref54","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1023\/A:1023064908962","article-title":"Algebraic operations and generic effects","volume":"11","author":"Plotkin","year":"2003","journal-title":"Applied Categorical Structures"},{"key":"S0960129522000317_ref6","doi-asserted-by":"crossref","unstructured":"Bonchi, F. , Gadducci, F. , Kissinger, A. , Soboci\u0143ski, P. and Zanasi, F. (2017a). Confluence of graph rewriting with interfaces. In: Yang, H. (ed.) ESOP 2017, LNCS, vol. 10201, Springer, 141\u2013169.","DOI":"10.1007\/978-3-662-54434-1_6"},{"key":"S0960129522000317_ref53","doi-asserted-by":"crossref","unstructured":"Plotkin, G. D. and Power, J. (2002). Notions of computation determine monads. In: Nielsen, M. and Engberg, U. (eds.) FOSSACS 2002, LNCS, vol. 2303, Springer, 342\u2013356.","DOI":"10.1007\/3-540-45931-6_24"},{"key":"S0960129522000317_ref27","doi-asserted-by":"crossref","unstructured":"Gadducci, F. and Heckel, R. (1998). An inductive view of graph transformation. In: Parisi-Presicce, F. (ed.) WADT 1997, vol. 1376, Springer, 223\u2013237.","DOI":"10.1007\/3-540-64299-4_36"},{"key":"S0960129522000317_ref8","unstructured":"Bonchi, F. , Pavlovic, D. and Soboci\u0143ski, P. (2017c). Functorial semantics for relational theories. Preprint available at arXiv:1711.08699."},{"key":"S0960129522000317_ref46","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1090\/S0002-9904-1965-11234-4","article-title":"Categorical algebra","volume":"71","author":"Mac Lane","year":"1965","journal-title":"Bulletin of the American Mathematical Society"},{"key":"S0960129522000317_ref37","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0001-8708(91)90003-P","article-title":"The geometry of tensor calculus, i","volume":"88","author":"Joyal","year":"1991","journal-title":"Advances in Mathematics"},{"key":"S0960129522000317_ref52","doi-asserted-by":"crossref","unstructured":"Plotkin, G. D. and Power, J. (2001b). Semantics for algebraic operations. In: Brookes, S. D. and Mislove, M. W. (eds.) MFPS 2001, ENTCS, vol. 45, Elsevier, 332\u2013345.","DOI":"10.1016\/S1571-0661(04)80970-8"},{"key":"S0960129522000317_ref19","doi-asserted-by":"crossref","DOI":"10.1017\/9781316219317","volume-title":"Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning","author":"Coecke","year":"2017"},{"key":"S0960129522000317_ref16","doi-asserted-by":"crossref","unstructured":"Bruni, R. and Gadducci, F. (2001). Some algebraic laws for spans (and their connections with multirelations). In: Kahl, W., Parnas, D. L. and Schmidt, G. (eds.) RELMIS 2001, ENTCS, vol. 44(3), Elsevier, 175\u2013193.","DOI":"10.1016\/S1571-0661(04)80937-X"},{"key":"S0960129522000317_ref62","doi-asserted-by":"crossref","unstructured":"Power, J. (2006b). The universal algebra of computational effects: Lawvere theories and monads. In: McBride, C. and Uustalu, T. (eds.) MSFP@MPC 2006, Workshops in Computing. BCS.","DOI":"10.14236\/ewic\/MSFP2006.2"},{"key":"S0960129522000317_ref56","unstructured":"Plump, D. (1993). Hypergraph rewriting: critical pairs and undecidability of confluence. In: Ronan Sleep, M., Plasmeijer, M. J. and van Eekele, M. C. J. D. (eds.) Term Graph Rewriting: Theory and Practice, Wiley, 201\u2013213."},{"key":"S0960129522000317_ref68","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","article-title":"An algorithm for subgraph isomorphism","volume":"23","author":"Ullmann","year":"1976","journal-title":"Journal of the ACM"},{"key":"S0960129522000317_ref12","doi-asserted-by":"crossref","unstructured":"Bonchi, F. , Gadducci, F. , Kissinger, A. , Soboci\u0143ski, P. and Zanasi, F. (2022). String diagram rewrite theory III: confluence with and without Frobenius. Mathematical Structures in Computer Science.","DOI":"10.1017\/S0960129522000123"},{"key":"S0960129522000317_ref67","volume-title":"Term Rewriting Systems","year":"2003"},{"key":"S0960129522000317_ref20","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0304-3975(01)00319-X","article-title":"Functorial semantics for multi-algebras and partial algebras, with applications to syntax","volume":"286","author":"Corradini","year":"2002","journal-title":"Theoretical Computer Science"},{"key":"S0960129522000317_ref26","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1017\/S096012950700610X","article-title":"Graph rewriting for the","volume":"17","author":"Gadducci","year":"2007","journal-title":"Mathematical Structures in Computer Science"},{"key":"S0960129522000317_ref55","doi-asserted-by":"crossref","unstructured":"Plotkin, G. D. and Power, J. (2004). Computational effects and operations: an overview. In: Escard\u00d3, M. H. and Jung, A. (eds.) Workshop on Domains VI, ENTCS, vol. 73, Elsevier, 149\u2013163.","DOI":"10.1016\/j.entcs.2004.08.008"},{"key":"S0960129522000317_ref33","doi-asserted-by":"crossref","unstructured":"Hadzihasanovic, A. (2021). The smash product of monoidal theories. In: LICS 2021, IEEE, 1\u201313.","DOI":"10.1109\/LICS52264.2021.9470575"},{"key":"S0960129522000317_ref28","article-title":"An enriched view on the extended finitary monad-Lawvere theory correspondence","volume":"14","author":"Garner","year":"2018","journal-title":"Logical Methods in Computer Science"},{"key":"S0960129522000317_ref69","unstructured":"Zanasi, F. (2015). Interacting Hopf Algebras: The Theory of Linear Systems. Phd thesis, \u00c9cole Normale Sup\u00c9rieure de Lyon."},{"key":"S0960129522000317_ref2","first-page":"836","article-title":"Categories in control","volume":"30","author":"Baez","year":"2015","journal-title":"Theory and Application of Categories"},{"key":"S0960129522000317_ref34","doi-asserted-by":"crossref","unstructured":"Hyland, M. , Plotkin, G. D. and Power, J. (2002). Combining computational effects: commutativity & sum. In: Baeza-Yates, R. A., Montanari, U. and Santoro, N. (eds.) TCS 2002, IFIP Conference Proceedings, vol. 223, Kluwer, 474\u2013484.","DOI":"10.1007\/978-0-387-35608-2_39"},{"key":"S0960129522000317_ref24","doi-asserted-by":"crossref","unstructured":"Ehrig, H. and K\u00d6nig, B. (2004). Deriving bisimulation congruences in the DPO approach to graph rewriting. In: Walukiewicz, I. (ed.) FOSSACS 2004, LNCS, vol. 2987, Springer, 151\u2013166.","DOI":"10.1007\/978-3-540-24727-2_12"},{"key":"S0960129522000317_ref5","doi-asserted-by":"crossref","unstructured":"Bonchi, F. , Gadducci, F. , Kissinger, A. , Soboci\u0143ski, P. and Zanasi, F. (2016). Rewriting modulo symmetric monoidal structure. In: Grohe, M., Koskinen, E. and Shankar, N. (eds.) LICS 2016, ACM, 710\u2013719.","DOI":"10.1145\/2933575.2935316"},{"key":"S0960129522000317_ref32","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s10485-019-09586-6","article-title":"A combinatorial-topological shape category for polygraphs","volume":"28","author":"Hadzihasanovic","year":"2020","journal-title":"Applied Categorical Structures"},{"key":"S0960129522000317_ref47","unstructured":"Mazza, D. (2006). Interaction Nets: Semantics and Concurrent Extensions. Phd thesis, Universit\u00c9 Aix-Marseille II\/Universit\u00c0 degli Studi Roma Tre."},{"key":"S0960129522000317_ref43","doi-asserted-by":"crossref","unstructured":"Lafont, Y. (1990). Interaction nets. In: Allen, F. E. (ed.) POPL 1990, 95\u2013108.","DOI":"10.1145\/96709.96718"},{"key":"S0960129522000317_ref10","doi-asserted-by":"crossref","unstructured":"Bonchi, F. , Gadducci, F. , Kissinger, A. , Soboci\u0143ski, P. and Zanasi, F. (2018a). Rewriting with Frobenius. In: Dawar, A. and Gr\u00c4del, E. (eds.) LICS 2018, ACM, 165\u2013174.","DOI":"10.1145\/3209108.3209137"},{"key":"S0960129522000317_ref4","doi-asserted-by":"crossref","unstructured":"Behrisch, M. , Kerkhoff, S. and Power, J. (2012). Category theoretic understandings of universal algebra and its dual: monads and Lawvere theories, comonads and what? In: Berger, U. and Mislove, M. W. (eds.) MFPS 2012, ENTCS, vol. 286, Elsevier, 5\u201316.","DOI":"10.1016\/j.entcs.2012.08.002"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129522000317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T12:26:56Z","timestamp":1671193616000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129522000317\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":70,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["S0960129522000317"],"URL":"https:\/\/doi.org\/10.1017\/s0960129522000317","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]},"assertion":[{"value":"\u00a9 The Author(s), 2022. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution-NonCommercial-ShareAlike licence (http:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the same Creative Commons licence is used to distribute the re-used or adapted article and the original article is properly cited. The written permission of Cambridge University Press must be obtained prior to any commercial use.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}