{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:33:21Z","timestamp":1730280801461,"version":"3.28.0"},"reference-count":118,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,26]]},"DOI":"10.1109\/lics56636.2023.10175807","type":"proceedings-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T13:18:23Z","timestamp":1689340703000},"page":"1-15","source":"Crossref","is-referenced-by-count":0,"title":["Allegories of Symbolic Manipulations"],"prefix":"10.1109","author":[{"given":"Francesco","family":"Gavazzo","sequence":"first","affiliation":[{"name":"University of Pisa"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2014.11.001"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/FUZZY.2009.5277248"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1992.185521"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/3571256"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16780-3_76"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2005.04.001"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.04.007"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/LICS52264.2021.9470633"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00154-5"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36280-0_19"},{"key":"ref46","first-page":"65","article-title":"The lazy lambda calculus","author":"abramsky","year":"1990","journal-title":"Research Topics in Functional Programming"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511792588.006"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2012.06.003"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59200-8_59"},{"key":"ref42","article-title":"Relational reasoning about functions and nondeterminism","author":"lassen","year":"1998","journal-title":"Ph D Dissertation"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6510-2_2"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0008"},{"key":"ref43","first-page":"91","article-title":"Relational reasoning about contexts","author":"lassen","year":"1998","journal-title":"Higher Order Operational Techniques in Semantics"},{"key":"ref49","first-page":"5464","article-title":"On the use of relation algebra in the theory of reduction systems","volume":"92","author":"b\u00e4umer","year":"1992","journal-title":"CSN"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3373718.3394771"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1999.782615"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30477-7_23"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/507635.507637"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1999.782617"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147961"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_3"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1993.287580"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535872"},{"key":"ref40","volume":"132","author":"schmidt","year":"2011","journal-title":"Relational Mathematics"},{"journal-title":"Algebra of Programming","year":"1997","author":"bird","key":"ref35"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90670-5"},{"journal-title":"A general Church-Rosser theorem","year":"1978","author":"aczel","key":"ref37"},{"key":"ref36","article-title":"Dual intuitionistic linear logic","author":"barber","year":"1996","journal-title":"Tech Rep ECS-LFCS-96-347"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-57.3.433"},{"key":"ref30","volume":"2","author":"johnstone","year":"2002","journal-title":"Sketches of an elephant A Topos Theory Compendium"},{"key":"ref33","first-page":"47","article-title":"A 2-categorical approach to change of base and geometric morphisms i","volume":"32","author":"carboni","year":"1991","journal-title":"Cahiers de Topologie et Géométrie Différetielle Catégoriques"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0060439"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.2307\/2268577"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1057"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18508-9_23"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54496-8_14"},{"key":"ref26","first-page":"65","article-title":"Modelling computations: A 2-categorical framework","author":"seely","year":"1987","journal-title":"Proceedings of the Second Annual Symposium on Logic in Computer Science"},{"key":"ref25","article-title":"Modelling term rewriting systems by sesqui-categories","author":"stell","year":"1994","journal-title":"Tech Rep TR-02"},{"key":"ref20","first-page":"290","article-title":"Rewriting via coinserters","volume":"10","author":"ghani","year":"2003","journal-title":"Nord J Comput"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0018358"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90054-W"},{"key":"ref28","article-title":"Categorical term rewriting: Monads and modularity","author":"l\u00fcth","year":"1998","journal-title":"Ph D Dissertation"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0026982"},{"key":"ref29","volume":"39","author":"freyd","year":"1990","journal-title":"Categories Allegories"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44957-4_16"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/53990.54010"},{"journal-title":"Term Rewriting Systems","year":"2003","author":"bezem","key":"ref15"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2307\/1968867"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.06.006"},{"key":"ref96","first-page":"78","article-title":"A tutorial on co-induction and functional programming","author":"gordon","year":"1994","journal-title":"Workshops in Computing"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45127-7_25"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1999.782616"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1936-1501858-0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19805-2_26"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322230"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.12.002"},{"key":"ref18","article-title":"Combinatory reduction systems","author":"klop","year":"1980","journal-title":"Ph D Dissertation"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500000360"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107517288"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8747-5"},{"journal-title":"Introduction to Lattices and Order","year":"1990","author":"davey","key":"ref94"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2725"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316823187"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025750816098"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.07.003"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73445-1_16"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99253-8_20"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.46298\/lmcs-18(3:3)2022"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004112000394"},{"key":"ref81","article-title":"A tutorial on (co)algebras and (co)induction","author":"jacobs","year":"1997","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.38"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80639-X"},{"key":"ref80","first-page":"589","article-title":"Free algebras and automata realizations in the language of categories","volume":"15","author":"ad\u00e1mek","year":"1974","journal-title":"Commentations Mathematicae Universitatis Carolinae"},{"journal-title":"Categories for the Working Mathematician","year":"1971","author":"maclane","key":"ref79"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.12.025"},{"journal-title":"Relation algebra and kat in coq","year":"0","author":"pous","key":"ref78"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1145\/3498692"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54833-8_12"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2014.10.004"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/3502719"},{"key":"ref104","article-title":"Coinductive equivalences and metrics for higher-order languages with algebraic effects","author":"gavazzo","year":"2019","journal-title":"Ph D Dissertation"},{"key":"ref74","first-page":"37:1","article-title":"Bialgebraic semantics for string diagrams","volume":"140","author":"bonchi","year":"2019","journal-title":"30th International Conference on Concurrency Theory CONCUR 2019"},{"key":"ref105","first-page":"87","article-title":"Effectful applicative similarity for call-by-name lambda calculi","author":"dal lago","year":"2017","journal-title":"Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N)"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129522000123"},{"key":"ref102","first-page":"1","article-title":"Effectful applicative bisimilarity: Monads, relators, and howe’s method","author":"dal lago","year":"2017","journal-title":"Proc of LICS 2017"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129522000317"},{"journal-title":"On bisimilarity in lambda calculi with continuous probabilistic choice","year":"2019","author":"da lago","key":"ref103"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139084673"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321997"},{"key":"ref71","first-page":"303","article-title":"Polynomial relators (extended abstract)","author":"backhouse","year":"1991","journal-title":"Proc of (AMAST ’91"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.46298\/lmcs-18(3:37)2022"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.2206\/kyushumfs.27.275"},{"key":"ref112","article-title":"Weak similarity in higher-order mathematical operational semantics","volume":"abs 2302 8200","author":"urbat","year":"2023","journal-title":"CoRR"},{"key":"ref73","first-page":"289","author":"selinger","year":"2011","journal-title":"A Survey of Graphical Languages for Monoidal Categories"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/BF01110627"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1145\/3373718.3394738"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57499-9_15"},{"key":"ref67","first-page":"113","article-title":"A cottage industry of lax extensions","volume":"3","author":"hoffman","year":"2015","journal-title":"Categories and General Algebraic Structures with Applications"},{"key":"ref117","first-page":"6:1","article-title":"Factorize factorization","volume":"183","author":"accattoli","year":"2021","journal-title":"Proc of CSL 2021"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2015.08.002"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45315-6_1"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/11601548_23"},{"key":"ref115","first-page":"1","article-title":"for data: Differentiating data structures","volume":"65","author":"abbott","year":"2005","journal-title":"Fund Informaticae"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45610-4_4"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00349-2"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47797-7_4"},{"journal-title":"The Derivative of a Regular Type is its Type of One-hole Contexts","year":"2009","author":"mcbride","key":"ref113"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80013-6"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44904-3_2"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0026981"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/10.3.461"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1998.705665"}],"event":{"name":"2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2023,6,26]]},"location":"Boston, MA, USA","end":{"date-parts":[[2023,6,29]]}},"container-title":["2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10175635\/10175671\/10175807.pdf?arnumber=10175807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T13:58:49Z","timestamp":1690898329000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10175807\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,26]]},"references-count":118,"URL":"https:\/\/doi.org\/10.1109\/lics56636.2023.10175807","relation":{},"subject":[],"published":{"date-parts":[[2023,6,26]]}}}