{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:45:39Z","timestamp":1780994739626,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1145\/3009837.3009897","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T16:20:29Z","timestamp":1482423629000},"page":"500-514","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":67,"title":["Do be do be do"],"prefix":"10.1145","author":[{"given":"Sam","family":"Lindley","sequence":"first","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Conor","family":"McBride","sequence":"additional","affiliation":[{"name":"University of Strathclyde, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Craig","family":"McLaughlin","sequence":"additional","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,1]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500591"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633357.2633369"},{"key":"e_1_3_2_1_3_1","volume-title":"An algebraic approach to typechecking and elaboration","author":"Atkey R.","year":"2015","unstructured":"R. Atkey . An algebraic approach to typechecking and elaboration , 2015 . R. Atkey. An algebraic approach to typechecking and elaboration, 2015."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500597"},{"key":"e_1_3_2_1_5_1","volume-title":"An effect system for algebraic effects and handlers. Logical Methods in Computer Science, 10(4)","author":"Bauer A.","year":"2014","unstructured":"A. Bauer and M. Pretnar . An effect system for algebraic effects and handlers. Logical Methods in Computer Science, 10(4) , 2014 . A. Bauer and M. Pretnar. An effect system for algebraic effects and handlers. Logical Methods in Computer Science, 10(4), 2014."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2014.02.001"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500581"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S095679681300018X"},{"key":"e_1_3_2_1_9_1","volume-title":"ICFP","author":"Chakravarty M. M. T.","year":"2011","unstructured":"M. M. T. Chakravarty , Z. Hu , and O. Danvy , editors . ICFP , 2011 . ACM. M. M. T. Chakravarty, Z. Hu, and O. Danvy, editors. ICFP, 2011. ACM."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"E.\n      Cooper S.\n      Lindley P.\n      Wadler and \n      J.\n      Yallop\n  . \n  Links: Web programming without tiers\n  . In F. S. de Boer M. M. Bonsangue S. Graf and W. P. de Roever editors FMCO volume \n  4709\n   of \n  Lecture Notes in Computer Science pages 266\u2013\n  296\n  . Springer 2006.   E. Cooper S. Lindley P. Wadler and J. Yallop. Links: Web programming without tiers. In F. S. de Boer M. M. Bonsangue S. Graf and W. P. de Roever editors FMCO volume 4709 of Lecture Notes in Computer Science pages 266\u2013296. Springer 2006.","DOI":"10.1007\/978-3-540-74792-5_12"},{"key":"e_1_3_2_1_11_1","volume-title":"OCaml Workshop","author":"Dolan S.","year":"2015","unstructured":"S. Dolan , L. White , K. Sivaramakrishnan , J. Yallop , and A. Madhavapeddy . Effective concurrency through algebraic effects . In OCaml Workshop , 2015 . S. Dolan, L. White, K. Sivaramakrishnan, J. Yallop, and A. Madhavapeddy. Effective concurrency through algebraic effects. In OCaml Workshop, 2015."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292557"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706354"},{"key":"e_1_3_2_1_14_1","volume-title":"On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control. CoRR, abs\/1610.09161","author":"Forster Y.","year":"2012","unstructured":"Y. Forster , O. Kammar , S. Lindley , and M. Pretnar . On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control. CoRR, abs\/1610.09161 , 2012 . Y. Forster, O. Kammar, S. Lindley, and M. Pretnar. On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control. CoRR, abs\/1610.09161, 2012."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237805"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863597.1863608"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2005.05.022"},{"key":"e_1_3_2_1_19_1","volume-title":"School of Informatics","author":"Hillerstr\u00f6m D.","year":"2015","unstructured":"D. Hillerstr\u00f6m . Handlers for algebraic effects in Links . Master\u2019s thesis , School of Informatics , The University of Edinburgh , 2015 . D. Hillerstr\u00f6m. Handlers for algebraic effects in Links. Master\u2019s thesis, School of Informatics, The University of Edinburgh, 2015."},{"key":"e_1_3_2_1_20_1","volume-title":"School of Informatics","author":"Hillerstr\u00f6m D.","year":"2016","unstructured":"D. Hillerstr\u00f6m . Compilation of effect handlers and their applications in concurrency. Master\u2019s thesis , School of Informatics , The University of Edinburgh , 2016 . D. Hillerstr\u00f6m. Compilation of effect handlers and their applications in concurrency. Master\u2019s thesis, School of Informatics, The University of Edinburgh, 2016."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976022.2976033"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19797-5"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11546382_2"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500590"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2804302.2804319"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503778.2503791"},{"key":"e_1_3_2_1_27_1","unstructured":"E. A. Kmett. Trifecta (1.5.2) 2015. http:\/\/hackage.haskell.org\/package\/trifecta-1.5.2.  E. A. Kmett. Trifecta (1.5.2) 2015. http:\/\/hackage.haskell.org\/package\/trifecta-1.5.2."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"D.\n      Leijen\n    . Koka\n  : \n  Programming with row polymorphic effect types\n  . In P. Levy and N. Krishnaswami editors MSFP volume \n  153\n   of \n  EPTCS pages 100\u2013\n  126 2014\n  .  D. Leijen. Koka: Programming with row polymorphic effect types. In P. Levy and N. Krishnaswami editors MSFP volume 153 of EPTCS pages 100\u2013126 2014.","DOI":"10.4204\/EPTCS.153.8"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009872"},{"key":"e_1_3_2_1_30_1","volume-title":"Parsec (3.1.9)","author":"Leijen D.","year":"2015","unstructured":"D. Leijen and P. Martini . Parsec (3.1.9) , 2015 . http:\/\/hackage.haskell.org\/package\/parsec-3.1.9. D. Leijen and P. Martini. Parsec (3.1.9), 2015. http:\/\/hackage.haskell.org\/package\/parsec-3.1.9."},{"key":"e_1_3_2_1_31_1","series-title":"Semantics Structures in Computation","volume-title":"A Functional\/Imperative Synthesis","author":"Levy P. B.","year":"2004","unstructured":"P. B. Levy . Call-By-Push-Value : A Functional\/Imperative Synthesis , volume 2 of Semantics Structures in Computation . Springer , 2004 . P. B. Levy. Call-By-Push-Value: A Functional\/Imperative Synthesis, volume 2 of Semantics Structures in Computation. Springer, 2004."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633628.2633636"},{"key":"e_1_3_2_1_33_1","volume-title":"Frank junior","author":"Lindley S.","year":"2016","unstructured":"S. Lindley , C. McBride , and C. McLaughlin . Frank junior , 2016 . https:\/\/www.github.com\/cmcl\/frankjnr. S. Lindley, C. McBride, and C. McLaughlin. Frank junior, 2016. https:\/\/www.github.com\/cmcl\/frankjnr."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73564"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/800055.802036"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411304.1411311"},{"key":"e_1_3_2_1_37_1","volume-title":"Workshop on Effects and Type Theory","author":"McBride C.","year":"2007","unstructured":"C. McBride . How might effectful programs look ? In Workshop on Effects and Type Theory , 2007 . http:\/\/cs.ioc.ee\/efftt\/mcbride-slides.pdf. C. McBride. How might effectful programs look? In Workshop on Effects and Type Theory, 2007. http:\/\/cs.ioc.ee\/efftt\/mcbride-slides.pdf."},{"key":"e_1_3_2_1_38_1","volume-title":"Kleisli arrows of outrageous fortune","author":"McBride C.","year":"2011","unstructured":"C. McBride . Kleisli arrows of outrageous fortune , 2011 . Draft. https:\/\/personal.cis.strath.ac.uk\/conor.mcbride\/ Kleisli .pdf. C. McBride. Kleisli arrows of outrageous fortune, 2011. Draft. https:\/\/personal.cis.strath.ac.uk\/conor.mcbride\/ Kleisli.pdf."},{"key":"e_1_3_2_1_39_1","unstructured":"C. McBride. Frank (0.3) 2012. http:\/\/hackage.haskell.org\/package\/Frank.  C. McBride. Frank (0.3) 2012. http:\/\/hackage.haskell.org\/package\/Frank."},{"key":"e_1_3_2_1_40_1","first-page":"275","volume-title":"Hinze and Voigtl\u00e4nder {22}","author":"McBride C.","unstructured":"C. McBride . Turing-completeness totally free. In Hinze and Voigtl\u00e4nder {22} , pages 257\u2013 275 . C. McBride. Turing-completeness totally free. In Hinze and Voigtl\u00e4nder {22}, pages 257\u2013275."},{"key":"e_1_3_2_1_41_1","unstructured":"C. McBride. Shonky 2016. https:\/\/github.com\/pigworker\/shonky.  C. McBride. Shonky 2016. https:\/\/github.com\/pigworker\/shonky."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796807006326"},{"key":"e_1_3_2_1_43_1","volume-title":"ICFP","author":"Morrisett G.","year":"2013","unstructured":"G. Morrisett and T. Uustalu , editors . ICFP , 2013 . ACM. G. Morrisett and T. Uustalu, editors. ICFP, 2013. ACM."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/345099.345100"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80970-8"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"G. D.\n      Plotkin\n     and \n      J.\n      Power\n  . \n  Adequacy for algebraic effects\n  . In F. Honsell and M. Miculan editors FOSSACS volume \n  2030\n   of \n  Lecture Notes in Computer Science pages 1\u2013\n  24\n  . Springer 2001.   G. D. Plotkin and J. Power. Adequacy for algebraic effects. In F. Honsell and M. Miculan editors FOSSACS volume 2030 of Lecture Notes in Computer Science pages 1\u201324. Springer 2001.","DOI":"10.1007\/3-540-45315-6_1"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"G. D.\n      Plotkin\n     and \n      J.\n      Power\n  . \n  Notions of computation determine monads\n  . In M. Nielsen and U. Engberg editors FOSSACS volume \n  2303\n   of \n  Lecture Notes in Computer Science pages 342\u2013\n  356\n  . Springer 2002.   G. D. Plotkin and J. Power. Notions of computation determine monads. In M. Nielsen and U. Engberg editors FOSSACS volume 2303 of Lecture Notes in Computer Science pages 342\u2013356. Springer 2002.","DOI":"10.1007\/3-540-45931-6_24"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023064908962"},{"key":"e_1_3_2_1_49_1","volume-title":"Handling algebraic effects. Logical Methods in Computer Science, 9(4)","author":"Plotkin G. D.","year":"2013","unstructured":"G. D. Plotkin and M. Pretnar . Handling algebraic effects. Logical Methods in Computer Science, 9(4) , 2013 . G. D. Plotkin and M. Pretnar. Handling algebraic effects. Logical Methods in Computer Science, 9(4), 2013."},{"key":"e_1_3_2_1_50_1","volume-title":"Inferring algebraic effects. Logical Methods in Computer Science, 10(3)","author":"Pretnar M.","year":"2014","unstructured":"M. Pretnar . Inferring algebraic effects. Logical Methods in Computer Science, 10(3) , 2014 . M. Pretnar. Inferring algebraic effects. Logical Methods in Computer Science, 10(3), 2014."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2643135.2643145"},{"key":"e_1_3_2_1_52_1","volume-title":"og, N. Wu, and M. Jaskelioff. Monad transformers and modular algebraic effects. Technical report","author":"Schrijvers T.","year":"2016","unstructured":"T. Schrijvers , M. Pir ` og, N. Wu, and M. Jaskelioff. Monad transformers and modular algebraic effects. Technical report , University of Leuven , 2016 . T. Schrijvers, M. Pir`og, N. Wu, and M. Jaskelioff. Monad transformers and modular algebraic effects. Technical report, University of Leuven, 2016."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034783"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034778"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796808006758"},{"key":"e_1_3_2_1_56_1","volume-title":"Haskell","author":"Swierstra W.","year":"2014","unstructured":"W. Swierstra , editor. Haskell , 2014 . ACM. W. Swierstra, editor. Haskell, 2014. ACM."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1046"},{"key":"e_1_3_2_1_58_1","unstructured":"A. van der Ploeg and O. Kiselyov. Reflection without remorse: revealing a hidden sequence to speed up monadic reflection. In Swierstra  A. van der Ploeg and O. Kiselyov. Reflection without remorse: revealing a hidden sequence to speed up monadic reflection. In Swierstra"},{"key":"e_1_3_2_1_59_1","unstructured":"pages 133\u2013144. pages 133\u2013144."},{"key":"e_1_3_2_1_60_1","unstructured":"K. Vonnegut. Deadeye Dick. Delacorte Press 1982.  K. Vonnegut. Deadeye Dick. Delacorte Press 1982."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/143165.143169"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75283"},{"key":"e_1_3_2_1_63_1","first-page":"322","volume-title":"Hinze and Voigtl\u00e4nder {22}","author":"Wu N.","unstructured":"N. Wu and T. Schrijvers . Fusion for free - efficient algebraic effect handlers . In Hinze and Voigtl\u00e4nder {22} , pages 302\u2013 322 . N. Wu and T. Schrijvers. Fusion for free - efficient algebraic effect handlers. In Hinze and Voigtl\u00e4nder {22}, pages 302\u2013322."}],"event":{"name":"POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","location":"Paris France","acronym":"POPL '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009897","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3009837.3009897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:05:34Z","timestamp":1750259134000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":62,"alternative-id":["10.1145\/3009837.3009897","10.1145\/3009837"],"URL":"https:\/\/doi.org\/10.1145\/3009837.3009897","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3093333.3009897","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,1]]},"assertion":[{"value":"2017-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}