{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T07:37:45Z","timestamp":1790840265778,"version":"4.1.0"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2017,12,27]],"date-time":"2017-12-27T00:00:00Z","timestamp":1514332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>We study algebraic computational effects and their handlers in the dependently typed setting. We describe computational effects using a generalisation of Plotkin and Pretnar's effect theories, whose dependently typed operations allow us to capture precise notions of computation, e.g., state with location-dependent store types and dependently typed update monads. Our treatment of handlers is based on an observation that their conventional term-level definition leads to unsound program equivalences being derivable in languages that include a notion of homomorphism. We solve this problem by giving handlers a novel type-based treatment via a new computation type, the user-defined algebra type, which pairs a value type (the carrier) with a set of value terms (the operations), capturing Plotkin and Pretnar's insight that effect handlers denote algebras. We then show that the conventional presentation of handlers can be routinely derived, and demonstrate that this type-based treatment of handlers provides a useful mechanism for reasoning about effectful computations. We also equip the resulting language with a sound denotational semantics based on families fibrations.<\/jats:p>","DOI":"10.1145\/3158095","type":"journal-article","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T14:21:49Z","timestamp":1514557309000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Handling fibred algebraic effects"],"prefix":"10.1145","volume":"2","author":[{"given":"Danel","family":"Ahman","sequence":"first","affiliation":[{"name":"Inria, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,12,27]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511600579"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-10(3:14)2014"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49630-5_3"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009878"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2013.09.007"},{"key":"e_1_2_2_7_1","volume-title":"Update Monads: Cointerpreting Directed Containers. In Post-proc. of 19th Meeting \u201cTypes for Proofs and Programs\", TYPES 2013 (LIPIcs)","volume":"26","author":"Ahman D."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2014.02.001"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500581"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/360933.360975"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48959-2_11"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exs025"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2013.30"},{"key":"e_1_2_2_15_1","volume-title":"Universal Algebra","author":"Gr\u00e4tzer G. A.","edition":"2"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44622-2_21"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003153"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976022.2976033"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526619.004"},{"key":"e_1_2_2_21_1","volume-title":"Proc. of 7th European Symp. on Programming, ESOP 1998 (LNCS)","volume":"1381","author":"Honda K."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.03.013"},{"key":"e_1_2_2_23_1","volume-title":"Categorical Logic and Type Theory. Number 141 in Studies in Logic and the Foundations of Mathematics. North Holland","author":"Jacobs B."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500590"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103698"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009872"},{"key":"e_1_2_2_27_1","volume-title":"A Functional\/Imperative Synthesis. Semantics Structures in Computation","author":"Levy P. B."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.04.014"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009898"},{"key":"e_1_2_2_30_1","volume-title":"Proc. of 44th ACM SIGPLAN Symp. on Principles of Programming Languages, POPL 2017. ACM, 500\u2013514","author":"Lindley S."},{"key":"e_1_2_2_31_1","volume-title":"Proc. of Logic Colloquium","author":"Martin-L\u00f6f P.","year":"1975"},{"key":"e_1_2_2_32_1","unstructured":"P. Martin-L\u00f6f. 1984. Intuitionistic Type Theory. Bibliopolis.  P. Martin-L\u00f6f. 1984. Intuitionistic Type Theory. Bibliopolis."},{"key":"e_1_2_2_33_1","volume-title":"Functional Pearl: Kleisli arrows of outrageous fortune. J. Funct. Program.","author":"McBride C.","year":"2011"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1989.39155"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796808006953"},{"key":"e_1_2_2_38_1","first-page":"47","article-title":"A Note on Rewriting Theory for Uniqueness of Iteration","volume":"6","author":"Okada M.","year":"1999","journal-title":"Theory Appl. Categ."},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005113"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-3182-3_11"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2015.04.003"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80970-8"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45931-6_24"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.45"},{"key":"e_1_2_2_45_1","doi-asserted-by":"crossref","unstructured":"G. D. Plotkin and M. Pretnar. 2013. Handling Algebraic Effects. Logical Methods in Computer Science 9 4:23 (2013).  G. D. Plotkin and M. Pretnar. 2013. Handling Algebraic Effects. Logical Methods in Computer Science 9 4:23 (2013).","DOI":"10.2168\/LMCS-9(4:23)2013"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.04.025"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/2591370.2591394"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0433-6"},{"key":"e_1_2_2_49_1","unstructured":"The Agda Team. 2017. The Agda Wiki. Available at http:\/\/appserv.cs.chalmers.se\/users\/ulfn\/wiki\/agda.php . (2017).  The Agda Team. 2017. The Agda Wiki. Available at http:\/\/appserv.cs.chalmers.se\/users\/ulfn\/wiki\/agda.php . (2017)."},{"key":"e_1_2_2_50_1","volume-title":"Homotopy Type Theory: Univalent Foundations of Mathematics"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3158095","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3158095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:30Z","timestamp":1750212690000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3158095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,27]]},"references-count":46,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1145\/3158095"],"URL":"https:\/\/doi.org\/10.1145\/3158095","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,27]]},"assertion":[{"value":"2017-12-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}