{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:08:42Z","timestamp":1770275322430,"version":"3.49.0"},"publisher-location":"Cham","reference-count":73,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030993351","type":"print"},{"value":"9783030993368","type":"electronic"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:00:00Z","timestamp":1648512000000},"content-version":"vor","delay-in-days":87,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Algebraic effects offer a versatile framework that covers a wide variety of effects. However, the family of operations that delimit scopes are not algebraic and are usually modelled as handlers, thus preventing them from being used freely in conjunction with algebraic operations. Although proposals for scoped operations exist, they are either ad-hoc and unprincipled, or too inconvenient for practical programming. This paper provides the best of both worlds: a theoretically-founded model of scoped effects that is convenient for implementation and reasoning. Our new model is based on an adjunction between a locally finitely presentable category and a category of <jats:italic>functorial algebras<\/jats:italic>. Using comparison functors between adjunctions, we show that our new model, an existing indexed model, and a third approach that simulates scoped operations in terms of algebraic ones have equal expressivity for handling scoped operations. We consider our new model to be the sweet spot between ease of implementation and structuredness. Additionally, our approach automatically induces fusion laws of handlers of scoped effects, which are useful for reasoning and optimisation.<\/jats:p>","DOI":"10.1007\/978-3-030-99336-8_17","type":"book-chapter","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T20:02:48Z","timestamp":1648497768000},"page":"462-491","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Structured Handling of Scoped Effects"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5573-3357","authenticated-orcid":false,"given":"Zhixuan","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1513-0807","authenticated-orcid":false,"given":"Marco","family":"Paviotti","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4161-985X","authenticated-orcid":false,"given":"Nicolas","family":"Wu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0088-9546","authenticated-orcid":false,"given":"Birthe","family":"van den Berg","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8771-5559","authenticated-orcid":false,"given":"Tom","family":"Schrijvers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,29]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Ad\u00e1mek, J., Rosicky, J.: Locally Presentable and Accessible Categories. London Mathematical Society Lecture Note Series, Cambridge University Press (1994). https:\/\/doi.org\/10.1017\/CBO9780511600579","DOI":"10.1017\/CBO9780511600579"},{"key":"17_CR2","unstructured":"Ad\u00e1mek, J.: Free algebras and automata realizations in the language of categories. Commentationes Mathematicae Universitatis Carolinae 015(4), 589\u2013602 (1974), http:\/\/eudml.org\/doc\/16649"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Ahman, D., Pretnar, M.: Asynchronous effects. Proc. ACM Program. Lang. 5(POPL) (Jan 2021). https:\/\/doi.org\/10.1145\/3434305","DOI":"10.1145\/3434305"},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"Backhouse, R., Bijsterveld, M., van Geldrop, R., van\u00a0der Woude, J.: Categorical fixed point calculus. In: Pitt, D., Rydeheard, D.E., Johnstone, P. (eds.) Category Theory and Computer Science. pp. 159\u2013179. Springer Berlin Heidelberg, Berlin, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60164-3_25","DOI":"10.1007\/3-540-60164-3_25"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Barr, M.: Coequalizers and free triples. Mathematische Zeitschrift (1970)","DOI":"10.1007\/BF01111838"},{"key":"17_CR6","unstructured":"Barr, M., Wells, C.: Category theory for computing science, vol.\u00a01. Prentice Hall New York (1990)"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Bauer, A., Pretnar, M.: An effect system for algebraic effects and handlers. Logical Methods in Computer Science 10(4) (Dec 2014). https:\/\/doi.org\/10.2168\/lmcs-10(4:9)2014","DOI":"10.2168\/lmcs-10(4:9)2014"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Bauer, A., Pretnar, M.: Programming with algebraic effects and handlers. J. Log. Algebraic Methods Program. 84(1), 108\u2013123 (2015). https:\/\/doi.org\/10.1016\/j.jlamp.2014.02.001","DOI":"10.1016\/j.jlamp.2014.02.001"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"van\u00a0den Berg, B., Schrijvers, T., Bach-Poulsen, C., Wu, N.: Latent effects for reusable language components: Extended version (2021), https:\/\/arxiv.org\/abs\/2108.11155","DOI":"10.1007\/978-3-030-89051-3_11"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Bird, R.S., Paterson, R.: Generalised folds for nested datatypes. Formal Aspects Comput. (1999). https:\/\/doi.org\/10.1007\/s001650050047","DOI":"10.1007\/s001650050047"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Claessen, K.: A poor man\u2019s concurrency monad. Journal of Functional Programming 9(3), 313\u2013323 (1999). https:\/\/doi.org\/10.1017\/S0956796899003342","DOI":"10.1017\/S0956796899003342"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Coutts, D., Leshchinskiy, R., Stewart, D.: Stream fusion: From lists to streams to nothing at all. SIGPLAN Not. 42(9), 315\u2013326 (Oct 2007). https:\/\/doi.org\/10.1145\/1291220.1291199","DOI":"10.1145\/1291220.1291199"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Dijkstra, E.W.: Letters to the editor: Go to statement considered harmful. Commun. ACM 11(3), 147\u2013148 (Mar 1968). https:\/\/doi.org\/10.1145\/362929.362947","DOI":"10.1145\/362929.362947"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Fiore, M., Hur, C.K.: On the construction of free algebras for equational systems. Theoretical Computer Science 410(18), 1704\u20131729 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2008.12.052, automata, Languages and Programming (ICALP 2007)","DOI":"10.1016\/j.tcs.2008.12.052"},{"key":"17_CR15","doi-asserted-by":"publisher","unstructured":"Fiore, M., Mahmoud, O.: Second-order algebraic theories. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) Mathematical Foundations of Computer Science 2010. pp. 368\u2013380. Springer Berlin Heidelberg, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15155-2_33","DOI":"10.1007\/978-3-642-15155-2_33"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Fiore, M.P., Plotkin, G.D., Turi, D.: Abstract syntax and variable binding. In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999 (1999). https:\/\/doi.org\/10.1109\/LICS.1999.782615","DOI":"10.1109\/LICS.1999.782615"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Fiore, M.P., Turi, D.: Semantics of name and value passing. In: 16th Annual IEEE Symposium on Logic in Computer Science, Boston, Massachusetts, USA, June 16-19, 2001, Proceedings (2001). https:\/\/doi.org\/10.1109\/LICS.2001.932486","DOI":"10.1109\/LICS.2001.932486"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Ghani, N., Uustalu, T.: Explicit substitutions and higher-order syntax. In: Proceedings of the 2003 ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding. p. 1\u20137. MERLIN \u201903, Association for Computing Machinery, New York, NY, USA (2003). https:\/\/doi.org\/10.1145\/976571.976580","DOI":"10.1145\/976571.976580"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Hillerstr\u00f6m, D., Lindley, S.: Shallow Effect Handlers. Lecture Notes in Computer Science 11275 LNCS, 415\u2013435 (2018). https:\/\/doi.org\/10.1007\/978-3-030-02768-1_22","DOI":"10.1007\/978-3-030-02768-1_22"},{"key":"17_CR20","unstructured":"Hinze, R.: Prological features in a functional setting \u2014 axioms and implementations. In: Sato, M., Toyama, Y. (eds.) Proceedings of the Third Fuji International Symposium on Functional and Logic Programming (FLOPS \u201998). pp. 98\u2013122. World Scientific, Singapore, New Jersey, London, Hong Kong (apr 1998)"},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"Hinze, R., Harper, T., James, D.W.H.: Theory and practice of fusion. In: Hage, J., Moraz\u00e1n, M.T. (eds.) Implementation and Application of Functional Languages. pp. 19\u201337. Springer Berlin Heidelberg, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24276-2_2","DOI":"10.1007\/978-3-642-24276-2_2"},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Hyland, M., Plotkin, G., Power, J.: Combining effects: Sum and tensor. Theor. Comput. Sci. 357(1), 70\u201399 (Jul 2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.03.013","DOI":"10.1016\/j.tcs.2006.03.013"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Hyland, M., Power, J.: The category theoretic understanding of universal algebra: Lawvere theories and monads. Electronic Notes in Theoretical Computer Science 172, 437\u2013458 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.02.019, computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin","DOI":"10.1016\/j.entcs.2007.02.019"},{"key":"17_CR24","doi-asserted-by":"publisher","unstructured":"Johann, P., Ghani, N.: Initial algebra semantics is enough! In: Typed Lambda Calculi and Applications, TLCA. Lecture Notes in Computer Science, Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-73228-0_16","DOI":"10.1007\/978-3-540-73228-0_16"},{"key":"17_CR25","doi-asserted-by":"publisher","unstructured":"Johann, P., Ghani, N.: Foundations for structured programming with gadts. In: Necula, G.C., Wadler, P. (eds.) Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008. pp. 297\u2013308. ACM (2008). https:\/\/doi.org\/10.1145\/1328438.1328475","DOI":"10.1145\/1328438.1328475"},{"key":"17_CR26","unstructured":"Jones, M.P., Duponcheel, L.: Composing monads. Research Report YALEU\/DCS\/RR-1004, Yale University, New Haven, Connecticut, USA (December 1993), http:\/\/web.cecs.pdx.edu\/~mpj\/pubs\/RR-1004.pdf"},{"key":"17_CR27","doi-asserted-by":"publisher","unstructured":"Kammar, O., Lindley, S., Oury, N.: Handlers in action. SIGPLAN Not. 48(9), 145\u2013158 (Sep 2013). https:\/\/doi.org\/10.1145\/2544174.2500590","DOI":"10.1145\/2544174.2500590"},{"key":"17_CR28","doi-asserted-by":"publisher","unstructured":"Kammar, O., Plotkin, G.D.: Algebraic foundations for effect-dependent optimisations. In: Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. p. 349\u2013360. POPL \u201912, Association for Computing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2103656.2103698","DOI":"10.1145\/2103656.2103698"},{"key":"17_CR29","unstructured":"Kelly, G.M.: Structures defined by finite limits in the enriched context, i. Cahiers de Topologie et G\u00e9om\u00e9trie Diff\u00e9rentielle Cat\u00e9goriques 23(1), 3\u201342 (1982), http:\/\/www.numdam.org\/item\/CTGDC_1982__23_1_3_0\/"},{"key":"17_CR30","doi-asserted-by":"publisher","unstructured":"Kelly, G., Power, A.: Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads. Journal of Pure and Applied Algebra 89(1), 163\u2013179 (1993). https:\/\/doi.org\/10.1016\/0022-4049(93)90092-8","DOI":"10.1016\/0022-4049(93)90092-8"},{"key":"17_CR31","doi-asserted-by":"publisher","unstructured":"Kidney, D.O., Wu, N.: Algebras for weighted search. Proc. ACM Program. Lang. 5(ICFP) (Aug 2021). https:\/\/doi.org\/10.1145\/3473577","DOI":"10.1145\/3473577"},{"key":"17_CR32","unstructured":"King, A.: eff \u2013 screaming fast extensible effects for less (2019), https:\/\/github.com\/hasura\/eff"},{"key":"17_CR33","doi-asserted-by":"publisher","unstructured":"Kiselyov, O., Ishii, H.: Freer monads, more extensible effects. In: Proceedings of the 2015 ACM SIGPLAN Symposium on Haskell. p. 94\u2013105. Haskell \u201915, Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2804302.2804319","DOI":"10.1145\/2804302.2804319"},{"key":"17_CR34","doi-asserted-by":"publisher","unstructured":"Kiselyov, O., Mu, S.C., Sabry, A.: Not by equations alone: Reasoning with extensible effects. Journal of Functional Programming 31, \u00a0e2 (2021). https:\/\/doi.org\/10.1017\/S0956796820000271","DOI":"10.1017\/S0956796820000271"},{"key":"17_CR35","unstructured":"Lambek, J., Scott, P.J.: Introduction to Higher Order Categorical Logic. Cambridge University Press, USA (1986)"},{"key":"17_CR36","doi-asserted-by":"publisher","unstructured":"Leijen, D.: Type directed compilation of row-typed algebraic effects. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages. p. 486\u2013499. POPL 2017, Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3009837.3009872","DOI":"10.1145\/3009837.3009872"},{"key":"17_CR37","doi-asserted-by":"publisher","unstructured":"Levy, P.B.: Adjunction models for call-by-push-value with stacks. Electronic Notes in Theoretical Computer Science 69, 248\u2013271 (2003). https:\/\/doi.org\/10.1016\/S1571-0661(04)80568-1, cTCS\u201902, Category Theory and Computer Science","DOI":"10.1016\/S1571-0661(04)80568-1"},{"key":"17_CR38","doi-asserted-by":"publisher","unstructured":"Levy, P.B.: Call-by-push-value: A Functional\/Imperative Synthesis, vol.\u00a02. Springer Netherlands (2003). https:\/\/doi.org\/10.1007\/978-94-007-0954-6","DOI":"10.1007\/978-94-007-0954-6"},{"key":"17_CR39","doi-asserted-by":"publisher","unstructured":"Liang, S., Hudak, P., Jones, M.: Monad transformers and modular interpreters. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. pp. 333\u2013343. POPL \u201995, ACM (1995). https:\/\/doi.org\/10.1145\/199448.199528","DOI":"10.1145\/199448.199528"},{"key":"17_CR40","doi-asserted-by":"publisher","unstructured":"Lindley, S., McBride, C., McLaughlin, C.: Do be do be do. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages. p. 500\u2013514. POPL 2017, Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3009837.3009897","DOI":"10.1145\/3009837.3009897"},{"key":"17_CR41","unstructured":"Mac Lane, S.: Categories for the Working Mathematician, 2nd edn. Graduate Texts in Mathematics, Springer, Berlin (1998)"},{"key":"17_CR42","unstructured":"Maguire, S.: polysemy: Higher-order, low-boilerplate free monads (2019), https:\/\/hackage.haskell.org\/package\/polysemy"},{"key":"17_CR43","doi-asserted-by":"publisher","unstructured":"Matthes, R., Uustalu, T.: Substitution in non-wellfounded syntax with variable binding. Theoretical Computer Science 327(1), 155\u2013174 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2004.07.025, selected Papers of CMCS \u201903","DOI":"10.1016\/j.tcs.2004.07.025"},{"key":"17_CR44","unstructured":"Moggi, E.: An abstract view of programming languages. Tech. Rep. ECS-LFCS-90-113, Edinburgh University, Department of Computer Science (June 1989)"},{"key":"17_CR45","doi-asserted-by":"publisher","unstructured":"Moggi, E.: Notions of computation and monads. Information and Computation 93(1), 55 \u2013 92 (1991). https:\/\/doi.org\/10.1016\/0890-5401(91)90052-4, selections from 1989 IEEE Symposium on Logic in Computer Science","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"17_CR46","doi-asserted-by":"publisher","unstructured":"Pir\u00f3g, M., Schrijvers, T., Wu, N., Jaskelioff, M.: Syntax and semantics for operations with scopes. In: Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science. p. 809\u2013818. LICS \u201918, Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3209108.3209166","DOI":"10.1145\/3209108.3209166"},{"key":"17_CR47","doi-asserted-by":"publisher","unstructured":"Pir\u00f3g, M., Gibbons, J.: Tracing monadic computations and representing effects. Electronic Proceedings in Theoretical Computer Science 76, 90\u2013111 (Feb 2012). https:\/\/doi.org\/10.4204\/eptcs.76.8","DOI":"10.4204\/eptcs.76.8"},{"key":"17_CR48","doi-asserted-by":"publisher","unstructured":"Plotkin, G., Power, J.: Notions of computation determine monads. In: Nielsen, M., Engberg, U. (eds.) Foundations of Software Science and Computation Structures, 5th International Conference. pp. 342\u2013356. FOSSACS 2002, Springer (2002). https:\/\/doi.org\/10.1007\/3-540-45931-6_24","DOI":"10.1007\/3-540-45931-6_24"},{"key":"17_CR49","doi-asserted-by":"publisher","unstructured":"Plotkin, G., Power, J.: Algebraic operations and generic effects. Applied Categorical Structures 11(1), 69\u201394 (2003). https:\/\/doi.org\/10.1023\/A:1023064908962","DOI":"10.1023\/A:1023064908962"},{"key":"17_CR50","doi-asserted-by":"publisher","unstructured":"Plotkin, G., Pretnar, M.: A logic for algebraic effects. In: 2008 23rd Annual IEEE Symposium on Logic in Computer Science. pp. 118\u2013129 (2008). https:\/\/doi.org\/10.1109\/LICS.2008.45","DOI":"10.1109\/LICS.2008.45"},{"key":"17_CR51","doi-asserted-by":"publisher","unstructured":"Plotkin, G., Pretnar, M.: Handlers of algebraic effects. In: Castagna, G. (ed.) Programming Languages and Systems. pp. 80\u201394. Springer Berlin Heidelberg, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00590-9_7","DOI":"10.1007\/978-3-642-00590-9_7"},{"key":"17_CR52","doi-asserted-by":"publisher","unstructured":"Plotkin, G., Pretnar, M.: Handling algebraic effects. Logical Methods in Computer Science 9(4) (Dec 2013). https:\/\/doi.org\/10.2168\/lmcs-9(4:23)2013","DOI":"10.2168\/lmcs-9(4:23)2013"},{"key":"17_CR53","unstructured":"Poulsen, C.B., van\u00a0der Rest, C., Schrijvers, T.: Staged effects and handlers for modular languages with abstraction. In: Workshop on Partial Evaluation and Program Manipulation (PEPM) (2021), https:\/\/casvdrest.github.io\/staged-effects.agda\/pepm21.pdf"},{"key":"17_CR54","unstructured":"Power, A.J.: Enriched Lawvere theories. Theory and Applications of Categories 6(7), 83\u201393 (1999)"},{"key":"17_CR55","unstructured":"Riehl, E.: Category Theory in Context. Aurora: Dover Modern Math Originals, Dover Publications (2017)"},{"key":"17_CR56","unstructured":"Rix, R., Thomson, P., Wu, N., Schrijvers, T.: fused-effects: A fast, flexible, fused effect system (2018), https:\/\/hackage.haskell.org\/package\/fused-effects"},{"key":"17_CR57","doi-asserted-by":"publisher","unstructured":"Robinson, E.: Variations on algebra: Monadicity and generalisations of equational theories. Form. Asp. Comput. 13(3\u20135), 308\u2013326 (Jul 2002). https:\/\/doi.org\/10.1007\/s001650200014","DOI":"10.1007\/s001650200014"},{"key":"17_CR58","doi-asserted-by":"publisher","unstructured":"Schrijvers, T., Pir\u00f3g, M., Wu, N., Jaskelioff, M.: Monad transformers and modular algebraic effects: what binds them together. In: Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell, Haskell@ICFP 2019, Berlin, Germany, August 18-23, 2019. pp. 98\u2013113 (2019). https:\/\/doi.org\/10.1145\/3331545.3342595","DOI":"10.1145\/3331545.3342595"},{"key":"17_CR59","doi-asserted-by":"publisher","unstructured":"Spivey, J.M.: Algebras for combinatorial search. Journal of Functional Programming 19(3-4), 469\u2013487 (2009). https:\/\/doi.org\/10.1017\/S0956796809007321","DOI":"10.1017\/S0956796809007321"},{"key":"17_CR60","doi-asserted-by":"publisher","unstructured":"Spivey, M.: A functional theory of exceptions. Science of Computer Programming 14(1), 25\u201342 (1990). https:\/\/doi.org\/10.1016\/0167-6423(90)90056-J","DOI":"10.1016\/0167-6423(90)90056-J"},{"key":"17_CR61","doi-asserted-by":"publisher","unstructured":"Stark, I.: Free-algebra models for the $$\\pi $$-calculus. Theoretical Computer Science 390(2), 248\u2013270 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2007.09.024","DOI":"10.1016\/j.tcs.2007.09.024"},{"key":"17_CR62","doi-asserted-by":"publisher","unstructured":"Staton, S.: Instances of computational effects: An algebraic perspective. In: 2013 28th Annual ACM\/IEEE Symposium on Logic in Computer Science. pp. 519\u2013519 (2013). https:\/\/doi.org\/10.1109\/LICS.2013.58","DOI":"10.1109\/LICS.2013.58"},{"key":"17_CR63","doi-asserted-by":"publisher","unstructured":"Steele, Jr., G.L.: Building interpreters by composing monads. In: Boehm, H., Lang, B., Yellin, D.M. (eds.) Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages. pp. 472\u2013492. POPL \u201994, ACM (1994). https:\/\/doi.org\/10.1145\/174675.178068","DOI":"10.1145\/174675.178068"},{"key":"17_CR64","doi-asserted-by":"publisher","unstructured":"Swierstra, W.: Data types \u00e0 la carte. J. Funct. Program. 18(4), 423\u2013436 (2008). https:\/\/doi.org\/10.1017\/S0956796808006758","DOI":"10.1017\/S0956796808006758"},{"key":"17_CR65","doi-asserted-by":"publisher","unstructured":"Takano, A., Meijer, E.: Shortcut deforestation in calculational form. In: Proceedings of the Seventh International Conference on Functional Programming Languages and Computer Architecture. Association for Computing Machinery, New York, NY, USA (1995). https:\/\/doi.org\/10.1145\/224164.224221","DOI":"10.1145\/224164.224221"},{"key":"17_CR66","doi-asserted-by":"publisher","unstructured":"Wadler, P.: Deforestation: Transforming programs to eliminate trees. Theor. Comput. Sci. 73(2), 231\u2013248 (Jan 1988). https:\/\/doi.org\/10.1016\/0304-3975(90)90147-A","DOI":"10.1016\/0304-3975(90)90147-A"},{"key":"17_CR67","doi-asserted-by":"publisher","unstructured":"Wadler, P.: Comprehending monads. In: Proceedings of the 1990 ACM Conference on LISP and Functional Programming. pp. 61\u201378. LFP \u201990, ACM (1990). https:\/\/doi.org\/10.1145\/91556.91592","DOI":"10.1145\/91556.91592"},{"key":"17_CR68","doi-asserted-by":"publisher","unstructured":"Wadler, P.: Monads for functional programming. In: Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text. p. 24\u201352. Springer-Verlag, Berlin, Heidelberg (1995). https:\/\/doi.org\/10.5555\/647698.734146","DOI":"10.5555\/647698.734146"},{"key":"17_CR69","doi-asserted-by":"crossref","unstructured":"Wu, N., Schrijvers, T.: Fusion for free. In: Hinze, R., Voigtl\u00e4nder, J. (eds.) Mathematics of Program Construction. pp. 302\u2013322. Springer International Publishing, Cham (2015). https:\/\/doi.org\/978-3-319-19797-5_15","DOI":"10.1007\/978-3-319-19797-5_15"},{"key":"17_CR70","doi-asserted-by":"publisher","unstructured":"Wu, N., Schrijvers, T., Hinze, R.: Effect handlers in scope. In: Proceedings of the 2014 ACM SIGPLAN Symposium on Haskell. p. 1\u201312. Haskell \u201914, Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2633357.2633358","DOI":"10.1145\/2633357.2633358"},{"key":"17_CR71","doi-asserted-by":"publisher","unstructured":"Yang, Z., Paviotti, M., Wu, N., van\u00a0den Berg, B., Schrijvers, T.: Structured handling of scoped effects: Artefacts (Jan 2022). https:\/\/doi.org\/10.5281\/zenodo.5914133","DOI":"10.5281\/zenodo.5914133"},{"key":"17_CR72","doi-asserted-by":"crossref","unstructured":"Yang, Z., Paviotti, M., Wu, N., van\u00a0den Berg, B., Schrijvers, T.: Structured handling of scoped effects: Extended version (2022), https:\/\/arxiv.org\/abs\/2201.10287","DOI":"10.1007\/978-3-030-99336-8_17"},{"key":"17_CR73","doi-asserted-by":"publisher","unstructured":"Yang, Z., Wu, N.: Reasoning about effect interaction by fusion. Proc. ACM Program. Lang. 5(ICFP) (Aug 2021). https:\/\/doi.org\/10.1145\/3473578","DOI":"10.1145\/3473578"}],"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-99336-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T05:09:49Z","timestamp":1731647389000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-99336-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030993351","9783030993368"],"references-count":73,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-99336-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"5 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2022\/esop","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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","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":"21","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":"0","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":"33% - 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.5","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":"7","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)"}}]}}