{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:08:28Z","timestamp":1750219708888,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T00:00:00Z","timestamp":1697932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002301","name":"Eesti Teadusagentuur","doi-asserted-by":"publisher","award":["PRG1210"],"award-info":[{"award-number":["PRG1210"]}],"id":[{"id":"10.13039\/501100002301","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011103","name":"Rann\u00eds","doi-asserted-by":"publisher","award":["228684"],"award-info":[{"award-number":["228684"]}],"id":[{"id":"10.13039\/501100011103","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,22]]},"DOI":"10.1145\/3610612.3610625","type":"proceedings-article","created":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T23:13:48Z","timestamp":1697498028000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Additive Cellular Automata Graded-Monadically"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2936-0419","authenticated-orcid":false,"given":"Silvio","family":"Capobianco","sequence":"first","affiliation":[{"name":"Department of Software Science, Tallinn University of Technology, Estonia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1297-0579","authenticated-orcid":false,"given":"Tarmo","family":"Uustalu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Reykjavik University, Iceland and Department of Software Science, Tallinn University of Technology, Estonia"}]}],"member":"320","published-online":{"date-parts":[[2023,10,22]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"235","article-title":"Internal Object Actions","volume":"46","author":"Borceux Francis","year":"2005","unstructured":"Francis Borceux , George Janelidze , and G.\u00a0 Max Kelly . 2005 . Internal Object Actions . Comment. Math. Univ. Carolin. 46 , 2 (2005), 235 \u2013 255 . http:\/\/eudml.org\/doc\/249553 Francis Borceux, George Janelidze, and G.\u00a0Max Kelly. 2005. Internal Object Actions. Comment. Math. Univ. Carolin. 46, 2 (2005), 235\u2013255. http:\/\/eudml.org\/doc\/249553","journal-title":"Comment. Math. Univ. Carolin."},{"volume-title":"Applications of Categories in Computer Science, Michael\u00a0P","author":"Brookes Stephen","key":"e_1_3_2_1_2_1","unstructured":"Stephen Brookes and Shai Geva . 1992. Computational Comonads and Intensional Semantics . In Applications of Categories in Computer Science, Michael\u00a0P . Fourman, Peter\u00a0T. Johnstone, and Andrew\u00a0M. Pitts (Eds.). London Math. Soc. Lect. Notes Series, Vol.\u00a0177. Cambridge Univ. Press , Cambridge, 1\u201344. Stephen Brookes and Shai Geva. 1992. Computational Comonads and Intensional Semantics. In Applications of Categories in Computer Science, Michael\u00a0P. Fourman, Peter\u00a0T. Johnstone, and Andrew\u00a0M. Pitts (Eds.). London Math. Soc. Lect. Notes Series, Vol.\u00a0177. Cambridge Univ. Press, Cambridge, 1\u201344."},{"key":"e_1_3_2_1_4_1","volume-title":"Programming Languages and Systems: 23rd Europ. Symp. on Programming, ESOP 2014, Proc.(Lect. Notes in Comput. Sci., Vol.\u00a08410)","author":"Brunel Alo\u00efs","year":"2014","unstructured":"Alo\u00efs Brunel , Marco Gaboardi , Damiano Mazza , and Steve Zdancewic . 2014 . A Core Quantitative Coeffect Calculus . In Programming Languages and Systems: 23rd Europ. Symp. on Programming, ESOP 2014, Proc.(Lect. Notes in Comput. Sci., Vol.\u00a08410) , Zhong Shao (Ed.). Springer, Berlin, Heidelberg, 351\u2013370. https:\/\/doi.org\/10.1007\/978-3-642-54833-8_19 10.1007\/978-3-642-54833-8_19 Alo\u00efs Brunel, Marco Gaboardi, Damiano Mazza, and Steve Zdancewic. 2014. A Core Quantitative Coeffect Calculus. In Programming Languages and Systems: 23rd Europ. Symp. on Programming, ESOP 2014, Proc.(Lect. Notes in Comput. Sci., Vol.\u00a08410), Zhong Shao (Ed.). Springer, Berlin, Heidelberg, 351\u2013370. https:\/\/doi.org\/10.1007\/978-3-642-54833-8_19"},{"key":"e_1_3_2_1_5_1","volume-title":"Journ\u00e9es Automates Cellulaires","author":"Capobianco Silvio","year":"2010","unstructured":"Silvio Capobianco and Tarmo Uustalu . 2010. A Categorical Outlook on Cellular Automata . In Journ\u00e9es Automates Cellulaires 2010 , Jarkko Kari (Ed.). TUCS Lecture Note Series, Vol.\u00a013. University of Turku , Turku, 88\u201399. https:\/\/hal.science\/hal-00542015\/ Silvio Capobianco and Tarmo Uustalu. 2010. A Categorical Outlook on Cellular Automata. In Journ\u00e9es Automates Cellulaires 2010, Jarkko Kari (Ed.). TUCS Lecture Note Series, Vol.\u00a013. University of Turku, Turku, 88\u201399. https:\/\/hal.science\/hal-00542015\/"},{"volume-title":"Cellular Automata and Groups","author":"Ceccherini-Silberstein Tullio","key":"e_1_3_2_1_6_1","unstructured":"Tullio Ceccherini-Silberstein and Michal Coornaert . 2010. Cellular Automata and Groups . Springer , Berlin, Heidelberg . https:\/\/doi.org\/10.1007\/978-3-642-14034-1 10.1007\/978-3-642-14034-1 Tullio Ceccherini-Silberstein and Michal Coornaert. 2010. Cellular Automata and Groups. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-14034-1"},{"key":"e_1_3_2_1_7_1","volume-title":"47th Int. Coll. on Automata, Languages, and Programming (ICALP","author":"Dennunzio Alberto","year":"2020","unstructured":"Alberto Dennunzio , Enrico Formenti , Darij Grinberg , and Luciano Margara . 2020. From Linear to Additive Cellular Automata . In 47th Int. Coll. on Automata, Languages, and Programming (ICALP 2020 ), Artur Czumaj, Anuj Dawar , and Emanuela Merelli (Eds.). Dagstuhl Publishing , Saarbr\u00fccken\/Wadern, 125:1\u2013125:13. https:\/\/doi.org\/10.4230\/lipics.icalp.2020.125 10.4230\/lipics.icalp.2020.125 Alberto Dennunzio, Enrico Formenti, Darij Grinberg, and Luciano Margara. 2020. From Linear to Additive Cellular Automata. In 47th Int. Coll. on Automata, Languages, and Programming (ICALP 2020), Artur Czumaj, Anuj Dawar, and Emanuela Merelli (Eds.). Dagstuhl Publishing, Saarbr\u00fccken\/Wadern, 125:1\u2013125:13. https:\/\/doi.org\/10.4230\/lipics.icalp.2020.125"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1215\/ijm\/1256068141"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Alexandre Fernandez Luidnel Maignan and Antoine Spicher. to appear. Cellular Automata and Kan Extensions. Nat. Comput. (to appear) 15\u00a0pages. https:\/\/doi.org\/10.1007\/s11047-022-09931-0    10.1007\/s11047-022-09931-0\nAlexandre Fernandez Luidnel Maignan and Antoine Spicher. to appear. Cellular Automata and Kan Extensions. Nat. Comput. (to appear) 15\u00a0pages. https:\/\/doi.org\/10.1007\/s11047-022-09931-0","DOI":"10.1007\/s11047-022-09931-0"},{"key":"e_1_3_2_1_10_1","volume-title":"19th Int. Conf., FoSSaCS 2016, Proc., Bart Jacobs and Christoph L\u00f6ding (Eds.). Lect. Notes in Comput. Sci., Vol.\u00a09634","author":"Fujii Soichiro","year":"2016","unstructured":"Soichiro Fujii , Shin-ya Katsumata, and Paul-Andr\u00e9 Melli\u00e8s . 2016 . Towards a Formal Theory of Graded Monads. In Foundations of Software Science and Computation Structures , 19th Int. Conf., FoSSaCS 2016, Proc., Bart Jacobs and Christoph L\u00f6ding (Eds.). Lect. Notes in Comput. Sci., Vol.\u00a09634 . Springer, Cham, 513\u2013530. https:\/\/doi.org\/10.1007\/978-3-662-49630-5_30 10.1007\/978-3-662-49630-5_30 Soichiro Fujii, Shin-ya Katsumata, and Paul-Andr\u00e9 Melli\u00e8s. 2016. Towards a Formal Theory of Graded Monads. In Foundations of Software Science and Computation Structures, 19th Int. Conf., FoSSaCS 2016, Proc., Bart Jacobs and Christoph L\u00f6ding (Eds.). Lect. Notes in Comput. Sci., Vol.\u00a09634. Springer, Cham, 513\u2013530. https:\/\/doi.org\/10.1007\/978-3-662-49630-5_30"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01691062"},{"key":"e_1_3_2_1_12_1","unstructured":"Ralf Hinze. 2011. Monads from Comonads Comonads from Monads. Notes for an IFIP WG 2.8 Meeting. http:\/\/www.cs.ox.ac.uk\/ralf.hinze\/WG2.8\/28\/slides\/Comonad.pdf  Ralf Hinze. 2011. Monads from Comonads Comonads from Monads. Notes for an IFIP WG 2.8 Meeting. http:\/\/www.cs.ox.ac.uk\/ralf.hinze\/WG2.8\/28\/slides\/Comonad.pdf"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.11.021"},{"volume-title":"Proc. of 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL\u00a0\u201914","year":"2014","key":"e_1_3_2_1_14_1","unstructured":"Shin-ya Katsumata. 2014 . Parametric Effect Monads and Semantics of Effect Systems . In Proc. of 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL\u00a0\u201914 . ACM Press, New York, 633\u2013645. https:\/\/doi.org\/10.1145\/2535838.2535846 10.1145\/2535838.2535846 Shin-ya Katsumata. 2014. Parametric Effect Monads and Semantics of Effect Systems. In Proc. of 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL\u00a0\u201914. ACM Press, New York, 633\u2013645. https:\/\/doi.org\/10.1145\/2535838.2535846"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0021-8693(90)90069-Z","article-title":"Adjoint Monads and an Isomorphism of the Kleisli Category","volume":"133","author":"Kleiner Mark","year":"1990","unstructured":"Mark Kleiner . 1990 . Adjoint Monads and an Isomorphism of the Kleisli Category . J. Algebra 133 , 1 (1990), 79 \u2013 82 . https:\/\/doi.org\/10.1016\/0021-8693(90)90069-Z 10.1016\/0021-8693(90)90069-Z Mark Kleiner. 1990. Adjoint Monads and an Isomorphism of the Kleisli Category. J. Algebra 133, 1 (1990), 79\u201382. https:\/\/doi.org\/10.1016\/0021-8693(90)90069-Z","journal-title":"J. Algebra"},{"key":"e_1_3_2_1_16_1","unstructured":"Paul\u00a0B. Levy. 2019. Locally Graded Categories. Slides for talk at Univ. of Cambridge. https:\/\/www.cs.bham.ac.uk\/\u00a0pbl\/papers\/locgrade.pdf  Paul\u00a0B. Levy. 2019. Locally Graded Categories. Slides for talk at Univ. of Cambridge. https:\/\/www.cs.bham.ac.uk\/\u00a0pbl\/papers\/locgrade.pdf"},{"key":"e_1_3_2_1_17_1","volume-title":"14th Int. Conf., MPC 2022, Proc., Ekaterina Komendantskaya (Ed.). Lect. Notes in Comput. Sci., Vol.\u00a013544","author":"McDermott Dylan","year":"2022","unstructured":"Dylan McDermott and Tarmo Uustalu . 2022 . Flexibly Graded Monads and Graded Algebras. In Mathematics of Program Construction , 14th Int. Conf., MPC 2022, Proc., Ekaterina Komendantskaya (Ed.). Lect. Notes in Comput. Sci., Vol.\u00a013544 . Springer, Cham, 102\u2013128. https:\/\/doi.org\/10.1007\/978-3-031-16912-0_4 10.1007\/978-3-031-16912-0_4 Dylan McDermott and Tarmo Uustalu. 2022. Flexibly Graded Monads and Graded Algebras. In Mathematics of Program Construction, 14th Int. Conf., MPC 2022, Proc., Ekaterina Komendantskaya (Ed.). Lect. Notes in Comput. Sci., Vol.\u00a013544. Springer, Cham, 102\u2013128. https:\/\/doi.org\/10.1007\/978-3-031-16912-0_4"},{"key":"e_1_3_2_1_18_1","unstructured":"Paul-Andr\u00e9 Melli\u00e8s. 2012. Parametric Monads and Enriched Adjunctions. Manuscript. https:\/\/www.irif.fr\/ mellies\/tensorial-logic\/8-parametric-monads-and-enriched-adjunctions.pdf  Paul-Andr\u00e9 Melli\u00e8s. 2012. Parametric Monads and Enriched Adjunctions. Manuscript. https:\/\/www.irif.fr\/ mellies\/tensorial-logic\/8-parametric-monads-and-enriched-adjunctions.pdf"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. of 4th Ann. IEEE Symp. on Logic in Computer Science, LICS\u00a0\u201989","author":"Moggi Eugenio","year":"1989","unstructured":"Eugenio Moggi . 1989 . Computational Lambda-Calculus and Monads . In Proc. of 4th Ann. IEEE Symp. on Logic in Computer Science, LICS\u00a0\u201989 . IEEE Comput. Soc., Los Alamitos, CA, 14\u201323. https:\/\/doi.org\/10.1109\/lics. 1989.39155 10.1109\/lics.1989.39155 Eugenio Moggi. 1989. Computational Lambda-Calculus and Monads. In Proc. of 4th Ann. IEEE Symp. on Logic in Computer Science, LICS\u00a0\u201989. IEEE Comput. Soc., Los Alamitos, CA, 14\u201323. https:\/\/doi.org\/10.1109\/lics.1989.39155"},{"key":"e_1_3_2_1_20_1","unstructured":"Dominic Orchard. 2011. Should I Use a Monad or a Comonad?Draft. https:\/\/www.cs.kent.ac.uk\/people\/staff\/dao7\/drafts\/monad-or-comonad-orchard11-draft.pdf  Dominic Orchard. 2011. Should I Use a Monad or a Comonad?Draft. https:\/\/www.cs.kent.ac.uk\/people\/staff\/dao7\/drafts\/monad-or-comonad-orchard11-draft.pdf"},{"key":"e_1_3_2_1_21_1","volume-title":"ICALP 2013, Proc., Part II(Lect. Notes in Comput. Sci., Vol.\u00a07966)","author":"Petricek Tomas","year":"2013","unstructured":"Tomas Petricek , Dominic Orchard , and Alan Mycroft . 2013 . Coeffects: Unified Static Analysis of Context-Dependence. In Automata, Languages, and Programming: 40th Int. Coll ., ICALP 2013, Proc., Part II(Lect. Notes in Comput. Sci., Vol.\u00a07966) , Fedor\u00a0V. Fomin, R\u016bsin\u0161 Freivalds, Marta Kwiatkowska, and David Peleg (Eds.). Springer, Berlin, Heidelberg, 385\u2013397. https:\/\/doi.org\/10.1007\/978-3-642-39212-2_35 10.1007\/978-3-642-39212-2_35 Tomas Petricek, Dominic Orchard, and Alan Mycroft. 2013. Coeffects: Unified Static Analysis of Context-Dependence. In Automata, Languages, and Programming: 40th Int. Coll., ICALP 2013, Proc., Part II(Lect. Notes in Comput. Sci., Vol.\u00a07966), Fedor\u00a0V. Fomin, R\u016bsin\u0161 Freivalds, Marta Kwiatkowska, and David Peleg (Eds.). Springer, Berlin, Heidelberg, 385\u2013397. https:\/\/doi.org\/10.1007\/978-3-642-39212-2_35"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.10.023"},{"key":"e_1_3_2_1_23_1","unstructured":"Dan (sigfpe) Piponi. 2006. Evaluating Cellular Automata is Comonadic. Blog post. http:\/\/blog.sigfpe.com\/2006\/12\/evaluating-cellular-automata-is.html  Dan (sigfpe) Piponi. 2006. Evaluating Cellular Automata is Comonadic. Blog post. http:\/\/blog.sigfpe.com\/2006\/12\/evaluating-cellular-automata-is.html"},{"key":"e_1_3_2_1_24_1","unstructured":"Zoran \u0160koda. 2011. Adjoint Monads. ncatlab entry. https:\/\/ncatlab.org\/nlab\/show\/adjoint+monad  Zoran \u0160koda. 2011. Adjoint Monads. ncatlab entry. https:\/\/ncatlab.org\/nlab\/show\/adjoint+monad"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10958-008-9013-7"},{"key":"e_1_3_2_1_26_1","volume-title":"CEFP 2005","author":"Uustalu Tarmo","year":"2006","unstructured":"Tarmo Uustalu and Varmo Vene . 2006 . The Essence of Dataflow Programming. In Central European Functional Programming School, 1st Summer School , CEFP 2005 , Revised Selected Lectures, Zolt\u00e1n Horv\u00e1th (Ed.). Lect. Notes in Comput. Sci., Vol.\u00a04164. Springer, Berlin, Heidelberg, 135\u2013167. https:\/\/doi.org\/10.1007\/1 1894100_5 10.1007\/11894100_5 Tarmo Uustalu and Varmo Vene. 2006. The Essence of Dataflow Programming. In Central European Functional Programming School, 1st Summer School, CEFP 2005, Revised Selected Lectures, Zolt\u00e1n Horv\u00e1th (Ed.). Lect. Notes in Comput. Sci., Vol.\u00a04164. Springer, Berlin, Heidelberg, 135\u2013167. https:\/\/doi.org\/10.1007\/11894100_5"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.05.029"},{"volume-title":"Indicial Methods for Relative Categories. Ph.\u00a0D. Dissertation","author":"Wood J.","key":"e_1_3_2_1_28_1","unstructured":"Richard\u00a0 J. Wood . 1976. Indicial Methods for Relative Categories. Ph.\u00a0D. Dissertation . Dalhousie University . http:\/\/hdl.handle.net\/10222\/55465 Richard\u00a0J. Wood. 1976. Indicial Methods for Relative Categories. Ph.\u00a0D. Dissertation. Dalhousie University. http:\/\/hdl.handle.net\/10222\/55465"},{"key":"e_1_3_2_1_29_1","volume-title":"Distributive-Law Semantics for Cellular Automata and Agent-Based Models. In Algebra and Coalgebra in Computer Science: 4th Int. Conf., CALCO 2011, Proc.(Lect. Notes in Comput. Sci., Vol.\u00a06851)","author":"Widemann Baltasar\u00a0Tranc\u00f3n","year":"2011","unstructured":"Baltasar\u00a0Tranc\u00f3n y Widemann and Michael Hauhs . 2011 . Distributive-Law Semantics for Cellular Automata and Agent-Based Models. In Algebra and Coalgebra in Computer Science: 4th Int. Conf., CALCO 2011, Proc.(Lect. Notes in Comput. Sci., Vol.\u00a06851) , Andrea Corradini, Bartek Klin, and Corina C\u00eerstea (Eds.). Springer, Berlin, Heidelberg, 344\u2013358. https:\/\/doi.org\/10.1007\/978-3-642-22944-2_24 10.1007\/978-3-642-22944-2_24 Baltasar\u00a0Tranc\u00f3n y Widemann and Michael Hauhs. 2011. Distributive-Law Semantics for Cellular Automata and Agent-Based Models. In Algebra and Coalgebra in Computer Science: 4th Int. Conf., CALCO 2011, Proc.(Lect. Notes in Comput. Sci., Vol.\u00a06851), Andrea Corradini, Bartek Klin, and Corina C\u00eerstea (Eds.). Springer, Berlin, Heidelberg, 344\u2013358. https:\/\/doi.org\/10.1007\/978-3-642-22944-2_24"}],"event":{"name":"PPDP 2023: International Symposium on Principles and Practice of Declarative Programming","acronym":"PPDP 2023","location":"Lisboa Portugal"},"container-title":["International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3610612.3610625","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:00Z","timestamp":1750178160000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3610612.3610625"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,22]]},"references-count":28,"alternative-id":["10.1145\/3610612.3610625","10.1145\/3610612"],"URL":"https:\/\/doi.org\/10.1145\/3610612.3610625","relation":{},"subject":[],"published":{"date-parts":[[2023,10,22]]},"assertion":[{"value":"2023-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}