{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T14:15:50Z","timestamp":1784211350670,"version":"3.55.0"},"reference-count":75,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:00:00Z","timestamp":1767830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2026,1,8]]},"abstract":"<jats:p>\n                    This paper studies the design of programming languages with handlers of\n                    <jats:italic toggle=\"yes\">higher-order effectful operations<\/jats:italic>\n                    - effectful operations that may take in computations as arguments or return computations as output. We present and analyse a core calculus with higher-kinded impredicative polymorphism, handlers of higher-order effectful operations, and optionally general recursion. The distinctive design choice of this calculus is that handlers are carried by lawless raw monads, while the computation judgements still satisfy the monadic laws judgementally. We present the calculus with a logical framework and give denotational models of the calculus using realizability semantics. We prove closed-term\n                    <jats:italic toggle=\"yes\">canonicity and parametricity<\/jats:italic>\n                    for the recursion-free fragment of the language using synthetic Tait computability and a novel form of the \u22a4\u22a4-lifting technique.\n                  <\/jats:p>","DOI":"10.1145\/3776678","type":"journal-article","created":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:59:43Z","timestamp":1767898783000},"page":"1036-1065","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Handling Higher-Order Effectful Operations with Judgemental Monadic Laws"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5573-3357","authenticated-orcid":false,"given":"Zhixuan","family":"Yang","sequence":"first","affiliation":[{"name":"Imperial College London, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4161-985X","authenticated-orcid":false,"given":"Nicolas","family":"Wu","sequence":"additional","affiliation":[{"name":"Imperial College London, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,1,8]]},"reference":[{"key":"e_1_3_2_2_1","unstructured":"Agda Developers. 2025. Agda. https:\/\/agda.readthedocs.io"},{"key":"e_1_3_2_3_1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/3-540-60164-3_27","volume-title":"Category Theory and Computer Science","author":"Altenkirch Thorsten","year":"1995","unstructured":"Thorsten Altenkirch, Martin Hofmann, and Thomas Streicher. 1995. Categorical reconstruction of a reduction free normalization proof. In Category Theory and Computer Science, David Pitt, David E. Rydeheard, and Peter Johnstone (Eds.). Springer Berlin Heidelberg, 182\u2013199."},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","unstructured":"Casper Bach Poulsen and Cas van der Rest. 2023. Hefty Algebras: Modular Elaboration of Higher-Order Algebraic Effects. Proc. ACM Program. Lang. 7 POPL (2023). doi:10.1145\/3571255","DOI":"10.1145\/3571255"},{"key":"e_1_3_2_5_1","article-title":"Lecture notes for the Midlands Graduate School 2022 lecture series on realizability","author":"Bauer Andrej","year":"2022","unstructured":"Andrej Bauer. 2022. Notes on Realizability. https:\/\/github.com\/andrejbauer\/notes-on-realizability Lecture notes for the Midlands Graduate School 2022 lecture series on realizability.","journal-title":"Notes on Realizability"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-10(4:9)2014"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90088-x"},{"key":"e_1_3_2_8_1","volume-title":"Handbook of Categorical Algebra: Volume 3, Sheaf Theory","author":"Borceux Francis","year":"1994","unstructured":"Francis Borceux. 1994. Handbook of Categorical Algebra: Volume 3, Sheaf Theory. Vol. 3. Cambridge University Press."},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.46298\/lmcs-20(4:17)2024"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209197"},{"key":"e_1_3_2_11_1","unstructured":"Tom de Jong. 2024. Categorical Realizability. https:\/\/github.com\/andrejbauer\/notes-on-realizability Lecture notes for the course on Categorical Realizability at the Midlands Graduate School 2024."},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500582"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","unstructured":"Marcelo Fiore. 2022. Semantic Analysis of Normalisation by Evaluation for Typed Lambda Calculus. arXiv:2207.08777 [cs.LO] doi:10.48550\/arXiv.2207.08777.","DOI":"10.48550\/arXiv.2207.08777"},{"key":"e_1_3_2_14_1","unstructured":"Peter Freyd. 1978. On proving that 1 is an indecomposable projective in various free categories. Manuscript (1978)."},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","unstructured":"Dan Frumin Amin Timany and Lars Birkedal. 2024. Modular Denotational Semantics for Effects with Guarded Interaction Trees. Proc. ACM Program. Lang. 8 POPL (2024). doi:10.1145\/3632854","DOI":"10.1145\/3632854"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034777"},{"key":"e_1_3_2_17_1","volume-title":"nterpr\u00e9tation fonctionelle et \u00e9limination des coupures de l\u2019arithm\u00e9tique d\u2019ordre sup\u00e9rieur","author":"Girard Jean-Yves","year":"1972","unstructured":"Jean-Yves Girard. 1972. nterpr\u00e9tation fonctionelle et \u00e9limination des coupures de l\u2019arithm\u00e9tique d\u2019ordre sup\u00e9rieur. Th\u00e8se d\u2019\u00c9tat. Universit\u00e9. Paris VII."},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90044-7"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/64805"},{"key":"e_1_3_2_20_1","unstructured":"Daniel Gratzer Michael Shulman and Jonathan Sterling. 2022. Strict universes for Grothendieck topoi. arXiv:2202.12012 https:\/\/arxiv.org\/abs\/2202.12012"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","unstructured":"Harrison Grodin Yue Niu Jonathan Sterling and Robert Harper. 2024. Decalf: A Directed Effectful Cost-Aware Logical Framework. Proceedings of the ACM on Programming Languages 8 POPL (2024) 273\u2013301. doi:10.1145\/3632852","DOI":"10.1145\/3632852"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/3002812"},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/138027.138060"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526619.004"},{"key":"e_1_3_2_25_1","unstructured":"Xu Huang. 2023. Synthetic Tait Computability the Hard Way. arXiv:2310.02051 [cs.LO] https:\/\/arxiv.org\/abs\/2310.02051"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0084217"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/9783-64200590-9_6"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.09.011"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1017\/s0956796806006034"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","unstructured":"Ohad Kammar and Gordon Plotkin. 2012. Algebraic foundations for effect-dependent optimisations. In Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM 349\u2013360. doi:10.1145\/2103656.2103698","DOI":"10.1145\/2103656.2103698"},{"key":"e_1_3_2_31_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796820000271"},{"key":"e_1_3_2_32_1","doi-asserted-by":"crossref","unstructured":"S\u00f8ren B\u00f8gh Lassen. 1998. Relational Reasoning about Functions and Nondeterminism. Ph. D. Dissertation. Aarhus University.https:\/\/www.brics.dk\/DS\/98\/2\/ Series: BRICS Dissertation Series.","DOI":"10.7146\/brics.v4i24.18950"},{"key":"e_1_3_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411245"},{"key":"e_1_3_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)000889"},{"key":"e_1_3_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/11417170_20"},{"key":"e_1_3_2_36_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129597002387"},{"key":"e_1_3_2_37_1","doi-asserted-by":"publisher","unstructured":"J. M. Lucassen and D. K. Gifford. 1988. Polymorphic effect systems. In Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (San Diego California USA) (POPL '88). Association for Computing Machinery 47\u201357. doi:10.1145\/73560.73564","DOI":"10.1145\/73560.73564"},{"key":"e_1_3_2_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/184757"},{"key":"e_1_3_2_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2012.10.020"},{"key":"e_1_3_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/9781\u20134612-0927-0"},{"key":"e_1_3_2_41_1","first-page":"81","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"Martin-L\u00f6f Per","year":"1975","unstructured":"Per Martin-L\u00f6f. 1975a. About models for intuitionistic type theories and the notion of definitional equality. In Studies in Logic and the Foundations of Mathematics. Vol. 82. Elsevier, 81\u2013109."},{"key":"e_1_3_2_42_1","first-page":"73","volume-title":"Logic Colloquium 73 Proceedings of the Logic Colloquium","author":"Martin-L\u00f6f Per","year":"1975","unstructured":"Per Martin-L\u00f6f. 1975b. An Intuitionistic Theory of Types: Predicative Part. In Logic Colloquium 73 Proceedings of the Logic Colloquium, H. E. Rose and J. C. Shepherdson (Eds.). Elsevier, 73\u2013118."},{"key":"e_1_3_2_43_1","unstructured":"Per Martin-L\u00f6f. 1987. The Logic of Judgements. https:\/\/raw.githubusercontent.com\/michaelt\/martin-lof\/master\/pdfs\/Thelogic-of-judgements-typeset-1987.pdf Talk at Workshop on General Logic Laboratory for Foundations of Computer Science University of Edinburgh 23-27 February 1987."},{"key":"e_1_3_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3731678"},{"key":"e_1_3_2_45_1","unstructured":"Eugenio Moggi. 1989. An Abstract View of Programming Languages. Technical Report ECS-LFCS-90-113. Edinburgh University Department of Computer Science."},{"key":"e_1_3_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498670"},{"key":"e_1_3_2_47_1","unstructured":"Wesley Phoa. 1991. Domain Theory in Realizability Toposes. Ph. D. Dissertation. University of Edinburgh. https:\/\/www.lfcs.inf.ed.ac.uk\/reports\/91\/ECS-LFCS-91-171\/"},{"key":"e_1_3_2_48_1","doi-asserted-by":"publisher","unstructured":"Maciej Pir\u00f3g Tom Schrijvers Nicolas Wu and Mauro Jaskelioff. 2018. Syntax and Semantics for Operations with Scopes. In Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS '18). Association for Computing Machinery 809\u2013818. doi:10.1145\/3209108.3209166","DOI":"10.1145\/3209108.3209166"},{"key":"e_1_3_2_49_1","unstructured":"Gordon Plotkin. 1973. Lambda Definability and Logical Relations. Memorandum SAI-RM-4. University of Edinburgh. https:\/\/homepages.inf.ed.ac.uk\/gdp\/publications\/logical_relations_1973.pdf"},{"key":"e_1_3_2_50_1","first-page":"363","volume-title":"To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism","author":"Plotkin Gordon","year":"1980","unstructured":"Gordon Plotkin. 1980. Lambda-Definability in the Full Type Hierarchy. In To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism, J. P. Seldin and J. R. Hindley (Eds.). Academic Press, 363\u2013373. https:\/\/homepages.inf.ed.ac.uk\/gdp\/publications\/Lambda_Definability.pdf"},{"key":"e_1_3_2_51_1","doi-asserted-by":"publisher","unstructured":"Gordon Plotkin and John Power. 2001. Semantics for algebraic operations. Electronic Notes in Theoretical Computer Science45 (2001) 332\u2013345. doi:10.1016\/S1571-0661(04)80970-8","DOI":"10.1016\/S1571-0661(04)80970-8"},{"key":"e_1_3_2_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45931-6_24"},{"key":"e_1_3_2_53_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023064908962"},{"key":"e_1_3_2_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00590-9_7"},{"key":"e_1_3_2_55_1","doi-asserted-by":"publisher","DOI":"10.2168\/lmcs-9(4:23)2013"},{"key":"e_1_3_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498693"},{"key":"e_1_3_2_57_1","volume-title":"Continuity and effectiveness in topoi","author":"Rosolini Giuseppe","year":"1986","unstructured":"Giuseppe Rosolini. 1986. Continuity and effectiveness in topoi. Ph. D. Dissertation. University of Oxford."},{"key":"e_1_3_2_58_1","doi-asserted-by":"publisher","unstructured":"Tom Schrijvers Maciej Pir\u00f3g Nicolas Wu and Mauro Jaskelioff. 2019. 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\u201323 2019. 98\u2013113. doi:10.1145\/3331545.3342595","DOI":"10.1145\/3331545.3342595"},{"key":"e_1_3_2_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(90)90056-J"},{"key":"e_1_3_2_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80001-2"},{"key":"e_1_3_2_61_1","doi-asserted-by":"publisher","unstructured":"Jonathan Sterling. 2021. First Steps in Synthetic Tait Computability: The Objective Metatheory of Cubical Type Theory. Ph. D. Dissertation. Carnegie Mellon University. doi:10.5281\/zenodo.6990769 Version 1.1 revised May 2022.","DOI":"10.5281\/zenodo.6990769"},{"key":"e_1_3_2_62_1","unstructured":"Jonathan Sterling. 2022. Na\u00efve logical relations in synthetic Tait computability. (June 2022). Unpublished manuscript."},{"key":"e_1_3_2_63_1","doi-asserted-by":"publisher","unstructured":"Jonathan Sterling and Carlo Angiuli. 2021. Normalization for Cubical Type Theory. Proceedings - Symposium on Logic in Computer Science 2021-June (2021) 1\u201322. doi:10.1109\/LICS52264.2021.9470719 arXiv: 2101.11479.","DOI":"10.1109\/LICS52264.2021.9470719"},{"key":"e_1_3_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3474834"},{"key":"e_1_3_2_65_1","doi-asserted-by":"publisher","unstructured":"Jonathan Sterling and Robert Harper. 2022. Sheaf Semantics of Termination-Insensitive Noninterference. In 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022) (Leibniz International Proceedings in Informatics (LIPIcs) Vol. 228) Amy P. Felty (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik 5:1\u20135:19. doi:10.4230\/LIPIcs.FSCD.2022.5","DOI":"10.4230\/LIPIcs.FSCD.2022.5"},{"key":"e_1_3_2_66_1","unstructured":"Thomas Streicher. 2017. Realizability. https:\/\/www2.mathematik.tu-darmstadt.de\/~streicher\/REAL\/REAL.pdf Lecture notes."},{"key":"e_1_3_2_67_1","first-page":"198","article-title":"Intensional Interpretations of Functionals of Finite Type I.","volume":"2","author":"W. Tait William","year":"1967","unstructured":"William W. Tait. 1967. Intensional Interpretations of Functionals of Finite Type I. The Journal of Symbolic Logic 32, 2 (1967), 198\u2013212. http:\/\/www.jstor.org\/stable\/2271658","journal-title":"The Journal of Symbolic Logic"},{"key":"e_1_3_2_68_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2024.103086"},{"key":"e_1_3_2_69_1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/978-3-030-89051-3_11","volume-title":"Programming Languages and Systems","author":"van den Berg Birthe","year":"2021","unstructured":"Birthe van den Berg, Tom Schrijvers, Casper Bach Poulsen, and Nicolas Wu. 2021. Latent Effects for Reusable Language Components. In Programming Languages and Systems, Hakjoo Oh (Ed.). Springer International Publishing, Cham, 182\u2013201."},{"key":"e_1_3_2_70_1","unstructured":"Jaap van Oosten. 2008. Realizability: an introduction to its categorical side (1st ed.). Elsevier Oxford."},{"key":"e_1_3_2_71_1","doi-asserted-by":"publisher","unstructured":"Nicolas Wu Tom Schrijvers and Ralf Hinze. 2014. Effect Handlers in Scope. Proceedings of the 2014 ACM SIGPLAN Symposium on Haskell - Haskell '14 (2014) 1\u201312. doi:10.1145\/2633357.2633358","DOI":"10.1145\/2633357.2633358"},{"key":"e_1_3_2_72_1","unstructured":"Zhixuan Yang. 2025. Revisiting the Logical Framework for Locally Cartesian Closed Categories. (2025). https:\/\/yangzhixuan.github.io\/pdf\/lcclf.pdf Manuscript."},{"key":"e_1_3_2_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99336-8_17"},{"key":"e_1_3_2_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3473578"},{"key":"e_1_3_2_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/3607850"},{"key":"e_1_3_2_76_1","doi-asserted-by":"publisher","unstructured":"Zhixuan Yang and Nicolas Wu. 2025. Handling Higher-Order Effectful Operations with Judgemental Monadic Laws. arXiv:2511.05739 [cs.PL] doi:10.48550\/arXiv.2511.05739","DOI":"10.48550\/arXiv.2511.05739"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3776678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T13:43:30Z","timestamp":1784209410000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3776678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,8]]},"references-count":75,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2026,1,8]]}},"alternative-id":["10.1145\/3776678"],"URL":"https:\/\/doi.org\/10.1145\/3776678","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,8]]},"assertion":[{"value":"2025-07-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}