{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:17:32Z","timestamp":1762460252974,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031177149"},{"type":"electronic","value":"9783031177156"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17715-6_26","type":"book-chapter","created":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T09:02:27Z","timestamp":1664701347000},"page":"407-424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Runners for\u00a0Interleaving Algebraic Effects"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6650-3493","authenticated-orcid":false,"given":"Niels F. W.","family":"Voorneveld","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,3]]},"reference":[{"key":"26_CR1","unstructured":"Abramsky, S.: The Lazy Lambda Calculus, pp. 65\u2013116. Addison-Wesley Longman Publishing Co., Inc. (1990)"},{"key":"26_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":"26_CR3","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BFb0083084","volume-title":"Seminar on Triples and Categorical Homology Theory","author":"J Beck","year":"1969","unstructured":"Beck, J.: Distributive laws. In: Eckmann, B. (ed.) Seminar on Triples and Categorical Homology Theory. LNM, vol. 80, pp. 119\u2013140. Springer, Heidelberg (1969). https:\/\/doi.org\/10.1007\/BFb0083084"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"JA Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theor. Comput. Sci. 37, 77\u2013121 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90088-X","journal-title":"Theor. Comput. Sci."},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-15670-4_4","volume-title":"Seminar on Concurrency","author":"JA Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W., Tucker, J.V.: Process algebra with asynchronous communication mechanisms. In: Brookes, S.D., Roscoe, A.W., Winskel, G. (eds.) CONCURRENCY 1984. LNCS, vol. 197, pp. 76\u201395. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-15670-4_4"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-540-27755-2_8","volume-title":"Lectures on Concurrency and Petri Nets","author":"N Busi","year":"2004","unstructured":"Busi, N., Gorrieri, R.: A survey on non-interference with Petri nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 328\u2013344. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27755-2_8"},{"key":"26_CR7","unstructured":"Clinger, W.D.: Foundations of actor semantics. Technical report, Massachusetts Institute of Technology, USA (1981). http:\/\/hdl.handle.net\/1721.1\/6935"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1112\/jlms\/jdm096","volume":"77","author":"M Fiore","year":"2008","unstructured":"Fiore, M., Gambino, N., Hyland, M., Winskel, G.: The cartesian closed bicategory of generalised species of structures. J. Lond. Math. Soc. 77, 203\u2013220 (2008). https:\/\/doi.org\/10.1112\/jlms\/jdm096","journal-title":"J. Lond. Math. Soc."},{"issue":"3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"2791","DOI":"10.1007\/s00029-017-0361-3","volume":"24","author":"M Fiore","year":"2017","unstructured":"Fiore, M., Gambino, N., Hyland, M., Winskel, G.: Relative pseudomonads, Kleisli bicategories, and substitution monoidal structures. Sel. Math. New Ser. 24(3), 2791\u20132830 (2017). https:\/\/doi.org\/10.1007\/s00029-017-0361-3","journal-title":"Sel. Math. New Ser."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-1-84882-912-1_15","volume-title":"Reflections on the Work of C.A.R. Hoare","author":"R van Glabbeek","year":"2010","unstructured":"van Glabbeek, R., Plotkin, G.: On CSP and the algebraic theory of effects. In: Roscoe, A.W., Jones, C.B., Wood, K.R. (eds.) Reflections on the Work of C.A.R. Hoare, pp. 333\u2013369. Springer, London (2010). https:\/\/doi.org\/10.1007\/978-1-84882-912-1_15"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-030-51831-8_7","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"R Gorrieri","year":"2020","unstructured":"Gorrieri, R.: Interleaving vs true concurrency: some instructive security examples. In: Janicki, R., Sidorova, N., Chatain, T. (eds.) PETRI NETS 2020. LNCS, vol. 12152, pp. 131\u2013152. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51831-8_7"},{"key":"26_CR12","doi-asserted-by":"publisher","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Logical Methods Comput. Sci. 3 (2007). https:\/\/doi.org\/10.2168\/LMCS-3(4:11)2007","DOI":"10.2168\/LMCS-3(4:11)2007"},{"key":"26_CR13","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Rivas, E., Uustalu, T.: Interaction laws of monads and comonads. In: Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2020, pp. 604\u2013618. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3373718.3394808","DOI":"10.1145\/3373718.3394808"},{"issue":"7","key":"26_CR14","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"RM Keller","year":"1976","unstructured":"Keller, R.M.: Formal verification of parallel programs. Commun. ACM 19(7), 371\u2013384 (1976). https:\/\/doi.org\/10.1145\/360248.360251","journal-title":"Commun. ACM"},{"key":"26_CR15","doi-asserted-by":"publisher","unstructured":"Lago, U.D., Gavazzo, F., Levy, P.B.: Effectful applicative bisimilarity: monads, relators, and Howe\u2019s method. In: Proceedings of 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2017, pp. 1\u201312. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005117","DOI":"10.1109\/LICS.2017.8005117"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-19805-2_3","volume-title":"Foundations of Software Science and Computational Structures","author":"PB Levy","year":"2011","unstructured":"Levy, P.B.: Similarity quotients as final coalgebras. In: Hofmann, M. (ed.) FoSSaCS 2011. LNCS, vol. 6604, pp. 27\u201341. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19805-2_3"},{"key":"26_CR17","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Categories for the Working Mathematician","author":"S MacLane","year":"1971","unstructured":"MacLane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, vol. 5. Springer, New York (1971). https:\/\/doi.org\/10.1007\/978-1-4612-9839-7"},{"key":"26_CR18","unstructured":"Matache, C.: Program equivalence for algebraic effects via modalities. Master\u2019s thesis, University of Oxford (2019)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-030-17127-8_22","volume-title":"Foundations of Software Science and Computation Structures","author":"C Matache","year":"2019","unstructured":"Matache, C., Staton, S.: A sound and complete logic for algebraic effects. In: Boja\u0144czyk, M., Simpson, A. (eds.) FoSSaCS 2019. LNCS, vol. 11425, pp. 382\u2013399. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17127-8_22"},{"key":"26_CR20","doi-asserted-by":"publisher","unstructured":"Melli\u00e8s, P.A.: Template games and differential linear logic. In: 2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201313 (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785830","DOI":"10.1109\/LICS.2019.8785830"},{"key":"26_CR21","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall Inc., Hoboken (1989)"},{"issue":"1","key":"26_CR22","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","journal-title":"Inf. Comput."},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45315-6_1","volume-title":"Foundations of Software Science and Computation Structures","author":"G Plotkin","year":"2001","unstructured":"Plotkin, G., Power, J.: Adequacy for algebraic effects. In: Honsell, F., Miculan, M. (eds.) FoSSaCS 2001. LNCS, vol. 2030, pp. 1\u201324. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45315-6_1"},{"key":"26_CR24","doi-asserted-by":"publisher","unstructured":"Plotkin, G.D., Pretnar, M.: Handling algebraic effects. Log. Methods Comput. Sci. 9(4, Article 23), 1\u201336 (2013). https:\/\/doi.org\/10.2168\/lmcs-9(4:23)2013","DOI":"10.2168\/lmcs-9(4:23)2013"},{"key":"26_CR25","unstructured":"Rivas, E., Jaskelioff, M.: Monads with merging (2019). https:\/\/hal.inria.fr\/hal-02150199. Working paper or preprint"},{"key":"26_CR26","doi-asserted-by":"publisher","unstructured":"Simpson, A., Voorneveld, N.: Behavioural equivalence via modalities for algebraic effects. ACM Trans. Program. Lang. Syst. 42(1), 4:1\u20134:45 (2020). https:\/\/doi.org\/10.1145\/3363518","DOI":"10.1145\/3363518"},{"key":"26_CR27","unstructured":"Thijs, A.M.: Simulation and fixpoint semantics. Ph.D. thesis, University of Groningen (1996). https:\/\/research.rug.nl\/en\/publications\/simulation-and-fixpoint-semantics"},{"key":"26_CR28","doi-asserted-by":"publisher","unstructured":"Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp. 280\u2013291 (1997). https:\/\/doi.org\/10.1109\/LICS.1997.614955","DOI":"10.1109\/LICS.1997.614955"},{"key":"26_CR29","doi-asserted-by":"publisher","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. The 31st Conference on the Mathematical Foundations of Programming Semantics","DOI":"10.1016\/j.entcs.2015.12.024"},{"key":"26_CR30","doi-asserted-by":"publisher","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. Proceedings of the Ninth Workshop on Coalgebraic Methods in Computer Science (CMCS 2008)","DOI":"10.1016\/j.entcs.2008.05.029"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17715-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T23:04:51Z","timestamp":1664751891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17715-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031177149","9783031177156"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17715-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/viam.science.tsu.ge\/clas2022\/ictac\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}