{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:18:38Z","timestamp":1743041918413,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030644369"},{"type":"electronic","value":"9783030644376"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64437-6_10","type":"book-chapter","created":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T13:02:45Z","timestamp":1606395765000},"page":"186-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algebraic and Coalgebraic Perspectives on Interaction Laws"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1297-0579","authenticated-orcid":false,"given":"Tarmo","family":"Uustalu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6650-3493","authenticated-orcid":false,"given":"Niels","family":"Voorneveld","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,24]]},"reference":[{"issue":"1\u20133","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00728-4","volume":"300","author":"P Aczel","year":"2003","unstructured":"Aczel, P., Ad\u00e1mek, J., Milius, S., Velebil, J.: Infinite trees and completely iterative theories: a coalgebraic view. Theor. Comput. Sci. 300(1\u20133), 1\u201345 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-030-44914-8_2","volume-title":"Programming Languages and Systems","author":"D Ahman","year":"2020","unstructured":"Ahman, D., Bauer, A.: Runners in action. In: M\u00fcller, P. (ed.) ESOP 2020. LNCS, vol. 12075, pp. 29\u201355. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44914-8_2"},{"key":"10_CR3","unstructured":"Bauer, A.: What is algebraic about algebraic effects and handlers? arXiv eprint 1807.05923 [cs.LO] (2018). https:\/\/arxiv.org\/abs\/1807.05923"},{"key":"10_CR4","unstructured":"Capobianco, S., Uustalu, T.: A categorical outlook on cellular automata. In: Kari, J. (ed.) Proceedings of 2nd Symposium on Cellular Automata, JAC 2010. TUCS Lecture Notes, vol. 13, pp. 88\u201389. University of Turku, Turku (2010)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2015.03.047","volume":"604","author":"I Hasuo","year":"2015","unstructured":"Hasuo, I.: Generic weakest precondition semantics from monads enriched with order. Theor. Comput. Sci. 604, 2\u201329 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.03.047","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/357980.358001","volume":"26","author":"CAR Hoare","year":"1983","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 26(1), 53\u201356 (1983). https:\/\/doi.org\/10.1145\/357980.358001","journal-title":"Commun. ACM"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Rivas, E., Uustalu, T.: Interaction laws of monads and comonads. In: Proceedings of 35th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2020, pp. 604\u2013618. ACM, New York (2020). https:\/\/doi.org\/10.1145\/3373718.3394808","DOI":"10.1145\/3373718.3394808"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.7146\/math.scand.a-10995","volume":"27","author":"J Kock","year":"1970","unstructured":"Kock, J.: On the double dualization monads. Math. Scand. 27, 151\u2013165 (1970). https:\/\/doi.org\/10.7146\/math.scand.a-10995","journal-title":"Math. Scand."},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/lmcs-10(1:17)2014","volume":"10","author":"RE M\u00f8gelberg","year":"2014","unstructured":"M\u00f8gelberg, R.E., Staton, S.: Linear usage of state. Log. Meth. Comput. Sci. 10(1), 1\u201352 (2014). https:\/\/doi.org\/10.2168\/lmcs-10(1:17)2014","journal-title":"Log. Meth. Comput. Sci."},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comput. 93(1), 55\u201392 (1991). https:\/\/doi.org\/10.1016\/0890-5401(91)90052-4. Article 17","journal-title":"Inf. Comput."},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/229542.229547","volume":"18","author":"C Morgan","year":"1996","unstructured":"Morgan, C., McIver, A., Seidel, K.: Probabilistic predicate transformers. ACM Trans. Program. Lang. Syst. 18(3), 325\u2013353 (1996). https:\/\/doi.org\/10.1145\/229542.229547","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"9","key":"10_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/2692915.2628160","volume":"49","author":"T Petricek","year":"2014","unstructured":"Petricek, T., Orchard, D., Mycroft, A.: Coeffects: a calculus of context-dependent computation. SIGPLAN Not. 49(9), 123\u2013135 (2014). https:\/\/doi.org\/10.1145\/2692915.2628160","journal-title":"SIGPLAN Not."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.entcs.2008.10.018","volume":"218","author":"G Plotkin","year":"2008","unstructured":"Plotkin, G., Power, J.: Tensors of comodels and models for operational semantics. Electron. Notes Theor. Comput. Sci. 218, 295\u2013311 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2008.10.018","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-45931-6_24","volume-title":"Foundations of Software Science and Computation Structures","author":"G Plotkin","year":"2002","unstructured":"Plotkin, G., Power, J.: Notions of computation determine monads. In: Nielsen, M., Engberg, U. (eds.) FoSSaCS 2002. LNCS, vol. 2303, pp. 342\u2013356. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45931-6_24"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/a:1023064908962","volume":"11","author":"GD Plotkin","year":"2003","unstructured":"Plotkin, G.D., Power, J.: Algebraic operations and generic effects. Appl. Categ. Struct. 11, 69\u201394 (2003). https:\/\/doi.org\/10.1023\/a:1023064908962","journal-title":"Appl. Categ. Struct."},{"issue":"4","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/lmcs-9(4:23)2013","volume":"9","author":"GD Plotkin","year":"2013","unstructured":"Plotkin, G.D., Pretnar, M.: Handling algebraic effects. Log. Meth. Comput. Sci. 9(4), 1\u201336 (2013). https:\/\/doi.org\/10.2168\/lmcs-9(4:23)2013. Article 23","journal-title":"Log. Meth. Comput. Sci."},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Poinsot, L., Porst, H.E.: Internal coalgebras in cocomplete categories: generalizing the Eilenberg-Watts theorem. J. Algebra Appl. (to appear). https:\/\/doi.org\/10.1142\/s0219498821501656","DOI":"10.1142\/s0219498821501656"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.entcs.2004.02.041","volume":"106","author":"J Power","year":"2004","unstructured":"Power, J., Shkaravska, O.: From comodels to coalgebras: state and arrays. Electron. Notes Theor. Comput. Sci. 106, 297\u2013314 (2004). https:\/\/doi.org\/10.1016\/j.entcs.2004.02.041","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3363518","volume":"42","author":"A Simpson","year":"2020","unstructured":"Simpson, A., Voorneveld, N.: Behavioural equivalence via modalities for algebraic effects. ACM Trans. Program. Lang. Syst. 42(1), 1\u201345 (2020). https:\/\/doi.org\/10.1145\/3363518. Article 4","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.entcs.2015.12.024","volume":"319","author":"T Uustalu","year":"2015","unstructured":"Uustalu, T.: Stateful runners of effectful computations. Electron. Notes Theor. Comput. Sci. 319, 403\u2013421 (2015). https:\/\/doi.org\/10.1016\/j.entcs.2015.12.024","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11894100_5","volume-title":"Central European Functional Programming School","author":"T Uustalu","year":"2006","unstructured":"Uustalu, T., Vene, V.: The essence of dataflow programming. In: Horv\u00e1th, Z. (ed.) CEFP 2005. LNCS, vol. 4164. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11894100_5"},{"issue":"5","key":"10_CR22","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.entcs.2008.05.029","volume":"203","author":"T Uustalu","year":"2008","unstructured":"Uustalu, T., Vene, V.: Comonadic notions of computation. Electron. Notes Theor. Comput. Sci. 203(5), 263\u2013284 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2008.05.029","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.entcs.2019.09.015","volume":"347","author":"N Voorneveld","year":"2019","unstructured":"Voorneveld, N.: Quantitative logics for equivalence of effectful programs. Electron. Notes Theor. Comput. Sci. 347, 281\u2013301 (2019). https:\/\/doi.org\/10.1016\/j.entcs.2019.09.015","journal-title":"Electron. Notes Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64437-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T12:49:52Z","timestamp":1619268592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64437-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030644369","9783030644376"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64437-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fukuoka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Hotcrp.com","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}