{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:49:50Z","timestamp":1764557390406,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC grant n o 320571","award":["FP7\/2007-2013"],"award-info":[{"award-number":["FP7\/2007-2013"]}]},{"name":"ANR 12IS02001 PACE"},{"name":"Labex MILYON\/ANR- 10-LABX-0070"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,5]]},"DOI":"10.1145\/2933575.2935316","type":"proceedings-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T13:34:47Z","timestamp":1476452087000},"page":"710-719","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Rewriting modulo symmetric monoidal structure"],"prefix":"10.1145","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[{"name":"CNRS, ENS Lyon"}]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[{"name":"U. Pisa"}]},{"given":"Aleks","family":"Kissinger","sequence":"additional","affiliation":[{"name":"Radboud U. Nijmegen"}]},{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"additional","affiliation":[{"name":"U. Southampton"}]},{"given":"Fabio","family":"Zanasi","sequence":"additional","affiliation":[{"name":"Radboud U. Nijmegen"}]}],"member":"320","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Globular. http:\/\/globular.science\/. Accessed: 2016-01-18.  Globular. http:\/\/globular.science\/. Accessed: 2016-01-18."},{"key":"e_1_3_2_1_2_1","volume-title":"Categories in control. CoRR\/1405.6881","author":"Baez J.","year":"2014","unstructured":"J. Baez and J. Erbele . Categories in control. CoRR\/1405.6881 , 2014 . J. Baez and J. Erbele. Categories in control. CoRR\/1405.6881, 2014."},{"key":"e_1_3_2_1_3_1","volume-title":"A compositional framework for passive linear circuits. CoRR, abs\/1504.05625","author":"Baez J. C.","year":"2015","unstructured":"J. C. Baez and B. Fong . A compositional framework for passive linear circuits. CoRR, abs\/1504.05625 , 2015 . J. C. Baez and B. Fong. A compositional framework for passive linear circuits. CoRR, abs\/1504.05625, 2015."},{"key":"e_1_3_2_1_4_1","volume-title":"Rewriting modulo symmetric monoidal structure. CoRR, abs\/1602.06771","author":"Bonchi F.","year":"2016","unstructured":"F. Bonchi , F. Gadducci , A. Kissinger , P. Sobocinski , and F. Zanasi . Rewriting modulo symmetric monoidal structure. CoRR, abs\/1602.06771 , 2016 . F. Bonchi, F. Gadducci, A. Kissinger, P. Sobocinski, and F. Zanasi. Rewriting modulo symmetric monoidal structure. CoRR, abs\/1602.06771, 2016."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44584-6_30"},{"key":"e_1_3_2_1_6_1","volume-title":"Interacting Hopf algebras. CoRR, abs\/1403.7048","author":"Bonchi F.","year":"2014","unstructured":"F. Bonchi , P. Soboci\u0144ski , and F. Zanasi . Interacting Hopf algebras. CoRR, abs\/1403.7048 , 2014 . F. Bonchi, P. Soboci\u0144ski, and F. Zanasi. Interacting Hopf algebras. CoRR, abs\/1403.7048, 2014."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676993"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.07.005"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2040235.2040263"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90054-W"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(91)90057-F"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_25"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.35"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008647417502"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129512000138"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24727-2_12"},{"key":"e_1_3_2_1_17_1","first-page":"284","volume-title":"MFCS 1976","author":"Ehrig H.","year":"1976","unstructured":"H. Ehrig and H.-J. Kreowski . Parallelism of manipulations in information structures . In MFCS 1976 , pages 284 -- 293 , 1976 . H. Ehrig and H.-J. Kreowski. Parallelism of manipulations in information structures. In MFCS 1976, pages 284--293, 1976."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934556"},{"key":"e_1_3_2_1_19_1","first-page":"223","volume-title":"WADT 1997","author":"Gadducci F.","year":"1997","unstructured":"F. Gadducci and R. Heckel . An inductive view of graph transformation . In WADT 1997 , pages 223 -- 237 , 1997 . F. Gadducci and R. Heckel. An inductive view of graph transformation. In WADT 1997, pages 223--237, 1997."},{"key":"e_1_3_2_1_20_1","volume-title":"abs\/math\/0612083","author":"Guiraud Y.","year":"2006","unstructured":"Y. Guiraud . Termination orders for 3-dimensional rewriting. CoRR , abs\/math\/0612083 , 2006 . Y. Guiraud. Termination orders for 3-dimensional rewriting. CoRR, abs\/math\/0612083, 2006."},{"key":"e_1_3_2_1_21_1","first-page":"437","volume-title":"Computation, Meaning, and Logic","author":"Hyland M.","year":"2007","unstructured":"M. Hyland and J. Power . Lawvere theories and monads . In Computation, Meaning, and Logic , pages 437 -- 458 , 2007 . M. Hyland and J. Power. Lawvere theories and monads. In Computation, Meaning, and Logic, pages 437--458, 2007."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100074338"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(91)90003-P"},{"key":"e_1_3_2_1_24_1","unstructured":"C. Kassel. Quantum Groups. Springer 2012.   C. Kassel. Quantum Groups. Springer 2012."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(80)90101-2"},{"key":"e_1_3_2_1_26_1","volume-title":"Quantomatic: A proof assistant for diagrammatic reasoning. CoRR, abs\/1503.01034","author":"Kissinger A.","year":"2015","unstructured":"A. Kissinger and V. Zamdzhiev . Quantomatic: A proof assistant for diagrammatic reasoning. CoRR, abs\/1503.01034 , 2015 . A. Kissinger and V. Zamdzhiev. Quantomatic: A proof assistant for diagrammatic reasoning. CoRR, abs\/1503.01034, 2015."},{"issue":"9","key":"e_1_3_2_1_27_1","first-page":"147","volume":"13","author":"Lack S.","year":"2004","unstructured":"S. Lack . Composing PRO Ps . Theory and Application of Categories , 13 ( 9 ): 147 -- 163 , 2004 . S. Lack. Composing PROPs. Theory and Application of Categories, 13(9):147--163, 2004.","journal-title":"Theory and Application of Categories"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2005028"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(03)00069-0"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1965-11234-4"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90013-8"},{"key":"e_1_3_2_1_32_1","volume-title":"Towards 3-dimensional rewriting theory. Logical Methods in Computer Science, 10(2)","author":"Mimram S.","year":"2014","unstructured":"S. Mimram . Towards 3-dimensional rewriting theory. Logical Methods in Computer Science, 10(2) , 2014 . S. Mimram. Towards 3-dimensional rewriting theory. Logical Methods in Computer Science, 10(2), 2014."},{"key":"e_1_3_2_1_33_1","first-page":"201","volume-title":"Sleep et al. {39}","author":"Plump D.","unstructured":"D. Plump . Hypergraph rewriting: Critical pairs and undecidability of confluence . In Sleep et al. {39} , pages 201 -- 213 . D. Plump. Hypergraph rewriting: Critical pairs and undecidability of confluence. In Sleep et al. {39}, pages 201--213."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11439-2_18"},{"issue":"6","key":"e_1_3_2_1_35_1","first-page":"164","article-title":"Generic commutative separable algebras and cospans of graphs","volume":"17","author":"Rosebrugh R.","year":"2005","unstructured":"R. Rosebrugh , N. Sabadini , and R. F. C. Walters . Generic commutative separable algebras and cospans of graphs . Theory and Application of Categories , 17 ( 6 ): 164 -- 177 , 2005 . R. Rosebrugh, N. Sabadini, and R. F. C. Walters. Generic commutative separable algebras and cospans of graphs. Theory and Application of Categories, 17(6):164--177, 2005.","journal-title":"Theory and Application of Categories"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.40"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.12.018"},{"issue":"813","key":"e_1_3_2_1_38_1","first-page":"289","article-title":"A survey of graphical languages for monoidal categories","volume":"13","author":"Selinger P.","year":"2011","unstructured":"P. Selinger . A survey of graphical languages for monoidal categories . Springer Lecture Notes in Physics , 13 ( 813 ): 289 -- 355 , 2011 . P. Selinger. A survey of graphical languages for monoidal categories. Springer Lecture Notes in Physics, 13(813):289--355, 2011.","journal-title":"Springer Lecture Notes in Physics"},{"key":"e_1_3_2_1_39_1","volume-title":"Term Graph Rewriting: Theory and Practice","author":"Sleep M. R.","year":"1993","unstructured":"M. R. Sleep , M. J. Plasmeijer , and M. C. J. D. van Eekelen , editors. Term Graph Rewriting: Theory and Practice . Wiley , 1993 . M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. van Eekelen, editors. Term Graph Rewriting: Theory and Practice. Wiley, 1993."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07734-5_9"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(76)90013-X"}],"event":{"name":"LICS '16: 31st Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"New York NY USA","acronym":"LICS '16"},"container-title":["Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2935316","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933575.2935316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:53Z","timestamp":1750222493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2935316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":41,"alternative-id":["10.1145\/2933575.2935316","10.1145\/2933575"],"URL":"https:\/\/doi.org\/10.1145\/2933575.2935316","relation":{},"subject":[],"published":{"date-parts":[[2016,7,5]]},"assertion":[{"value":"2016-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}