{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T00:42:10Z","timestamp":1767919330586,"version":"3.49.0"},"reference-count":66,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","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>Relative monads provide a controlled view of computation. We generalise the monadic metalanguage to a relative setting and give a complete semantics with strong relative monads. Adopting this perspective, we generalise two existing program calculi from the literature. We provide a linear-non-linear language for graded monads, LNL-RMM, along with a semantic proof that it is a conservative extension of the graded monadic metalanguage. Additionally, we provide a complete semantics for the arrow calculus, showing it is a restricted relative monadic metalanguage. This motivates the introduction of ARMM, a computational lambda calculus-style language for arrows that conservatively extends the arrow calculus.<\/jats:p>","DOI":"10.1145\/3776702","type":"journal-article","created":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:59:43Z","timestamp":1767898783000},"page":"1730-1758","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Relative Monadic Metalanguage"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-7121-8095","authenticated-orcid":false,"given":"Jack","family":"Liell-Cock","sequence":"first","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7578-2881","authenticated-orcid":false,"given":"Zev","family":"Shirazi","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7149-3805","authenticated-orcid":false,"given":"Sam","family":"Staton","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2026,1,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proc. FoSSaCS \u201910","author":"Altenkirch Thosten","year":"2010","unstructured":"Thosten Altenkirch, James Chapman, and Tarmo Uustalu. 2010. Monads need not be endofunctors. In Proc. FoSSaCS \u201910. https:\/\/doi.org\/10.2168\/LMCS-11(1:3)2015 10.2168\/LMCS-11(1:3)2015"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","unstructured":"Nathanael Arkor and Dylan McDermott. 2024. The formal theory of relative monads. J. Pure Appl. Algebra https:\/\/doi.org\/10.1016\/j.jpaa.2024.107676 10.1016\/j.jpaa.2024.107676","DOI":"10.1016\/j.jpaa.2024.107676"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","unstructured":"Nathanael Arkor and Dylan McDermott. 2025. The nerve theorem for relative monads. TAC https:\/\/doi.org\/10.70930\/tac\/jjc9mnky 10.70930\/tac\/jjc9mnky","DOI":"10.70930\/tac\/jjc9mnky"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","unstructured":"Nathanael Arkor and Dylan McDermott. 2025. Relative monadicity. J. Algebra https:\/\/doi.org\/10.1016\/j.jalgebra.2024.08.040 10.1016\/j.jalgebra.2024.08.040","DOI":"10.1016\/j.jalgebra.2024.08.040"},{"key":"e_1_2_1_5_1","volume-title":"Proc. MSFP \u201908","author":"Atkey Robert","year":"2011","unstructured":"Robert Atkey. 2011. What is a Categorical Model of Arrows? In Proc. MSFP \u201908. https:\/\/doi.org\/10.1016\/j.entcs.2011.02.014 10.1016\/j.entcs.2011.02.014"},{"key":"e_1_2_1_6_1","volume-title":"Triples and Theories","author":"Barr Michael","unstructured":"Michael Barr and Charles Wells. 1985. Toposes, Triples and Theories. Springer, New York."},{"key":"e_1_2_1_7_1","volume-title":"Proc. CSL \u201994","author":"Benton Nick","year":"1994","unstructured":"Nick Benton. 1994. A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract). In Proc. CSL \u201994. https:\/\/doi.org\/10.5555\/647844.736565"},{"key":"e_1_2_1_8_1","volume-title":"Proc. TLCA \u201993","author":"Benton Nick","year":"1993","unstructured":"Nick Benton, Gavin Bierman, Valeria de Paiva, and Martin Hyland. 1993. A term calculus for Intuitionistic Linear Logic. In Proc. TLCA \u201993. https:\/\/doi.org\/10.1007\/BFb0037099 10.1007\/BFb0037099"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2012.02.039"},{"key":"e_1_2_1_10_1","volume-title":"Handbook of categorical algebra: Basic category theory. 1","author":"Borceux Francis","unstructured":"Francis Borceux. 1994. Handbook of categorical algebra: Basic category theory. 1, Cambridge University Press."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2019.05.016"},{"key":"e_1_2_1_12_1","volume-title":"Cost-analysis: How do monads and comonads differ? Slides available from the author\u2019s webpage. https:\/\/drezgi.wordpress.com\/wp-content\/uploads\/2019\/01\/dice16.pdf","author":"Ci\u00e7ek Ezgi","year":"2016","unstructured":"Ezgi Ci\u00e7ek, Marco Gaboardi, and Deepak Garg. 2016. Cost-analysis: How do monads and comonads differ? Slides available from the author\u2019s webpage. https:\/\/drezgi.wordpress.com\/wp-content\/uploads\/2019\/01\/dice16.pdf"},{"key":"e_1_2_1_13_1","volume-title":"Haskell Workshop. 41\u201369","author":"Courtney Antony","year":"2001","unstructured":"Antony Courtney and Conal Elliott. 2001. Genuinely functional user interfaces. In Haskell Workshop. 41\u201369."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","unstructured":"Brian Day. 1970. On closed categories of functors. In Reports of the Midwest Category Seminar IV. https:\/\/doi.org\/10.1007\/BFb0060438 10.1007\/BFb0060438","DOI":"10.1007\/BFb0060438"},{"key":"e_1_2_1_15_1","volume-title":"Proc. CSL","author":"Egger Jeff","year":"2009","unstructured":"Jeff Egger, Rasmus Ejlers M\u00f8gelberg, and Alex Simpson. 2009. Enriching an Effect Calculus with Linear Types. In Proc. CSL 2009. https:\/\/doi.org\/10.1007\/978-3-642-04027-6_19 10.1007\/978-3-642-04027-6_19"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2020.107239"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","unstructured":"Tobias Fritz Tom\u00e1\u0161 Gonda Nicholas Houghton-Larsen Antonio Lorenzin Paolo Perrone and Dario Stein. 2023. Dilations and information flow axioms in categorical probability. Math. Struct. Comput. Sci. https:\/\/doi.org\/10.1017\/S0960129523000324 10.1017\/S0960129523000324","DOI":"10.1017\/S0960129523000324"},{"key":"e_1_2_1_18_1","volume-title":"Proc. FoSSaCS \u201916","author":"Fujii Soichiro","year":"2016","unstructured":"Soichiro Fujii, Shinya Katsumata, and Paul-Andr\u00e9 Melli\u00e8s. 2016. Towards a Formal Theory of Graded Monads. In Proc. FoSSaCS \u201916. https:\/\/doi.org\/10.1007\/978-3-662-49630-5_30 10.1007\/978-3-662-49630-5_30"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","unstructured":"Jean-Yves Girard. 1987. Linear logic. Theor. Comput. Sci. https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4 10.1016\/0304-3975(87)90045-4","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","unstructured":"Mich\u00e8le Giry. 1982. A categorical approach to probability theory. In Categorical Aspects of Topology and Analysis. https:\/\/doi.org\/10.1007\/BFb0092872 10.1007\/BFb0092872","DOI":"10.1007\/BFb0092872"},{"key":"e_1_2_1_21_1","volume-title":"Polymonadic Programming. In Proc. MSFP \u201914","author":"Hicks Michael","year":"2014","unstructured":"Michael Hicks, Gavin M. Bierman, Nataliya Guts, Daan Leijen, and Nikhil Swamy. 2014. Polymonadic Programming. In Proc. MSFP \u201914. https:\/\/doi.org\/10.4204\/EPTCS.153.7 10.4204\/EPTCS.153.7"},{"key":"e_1_2_1_22_1","volume-title":"Proc. OOPSLA \u201920","author":"Holtzen Steven","year":"2020","unstructured":"Steven Holtzen, Guy Van den Broeck, and Todd Millstein. 2020. Scaling exact inference for discrete probabilistic programs. In Proc. OOPSLA \u201920. https:\/\/doi.org\/10.1145\/3428208 10.1145\/3428208"},{"key":"e_1_2_1_23_1","volume-title":"Proc. AFP \u201902","author":"Hudak Paul","year":"2003","unstructured":"Paul Hudak, Antony Courtney, Henrik Nilsson, and John Peterson. 2003. Arrows, Robots, and Functional Reactive Programming. In Proc. AFP \u201902. https:\/\/doi.org\/10.1007\/978-3-540-44833-4_6 10.1007\/978-3-540-44833-4_6"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","unstructured":"John Hughes. 2000. Generalising monads to arrows. Sci. Comput. Program. https:\/\/doi.org\/10.1016\/S0167-6423(99)00023-4 10.1016\/S0167-6423(99)00023-4","DOI":"10.1016\/S0167-6423(99)00023-4"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.2307\/421214"},{"key":"e_1_2_1_26_1","volume-title":"Proc. ESOP \u201999","author":"Jansson Patrik","year":"1999","unstructured":"Patrik Jansson and Johan Jeuring. 1999. Polytypic Compact Printing and Parsing. In Proc. ESOP \u201999. https:\/\/doi.org\/10.1007\/3-540-49099-X_18 10.1007\/3-540-49099-X_18"},{"key":"e_1_2_1_27_1","volume-title":"Proc. OOPSLA \u201925","author":"Jiang Yuchen","year":"2043","unstructured":"Yuchen Jiang, Runze Xue, and Max S. New. 2025. Notions of Stack-Manipulating Computation and Relative Monads. Proc. OOPSLA \u201925, https:\/\/doi.org\/10.1145\/3720434 10.1145\/3720434"},{"key":"e_1_2_1_28_1","volume-title":"Proc. CSL \u201905","author":"Katsumata Shinya","year":"2005","unstructured":"Shinya Katsumata. 2005. A semantic formulation of TT-lifting and logical predicates for computational metalanguage. In Proc. CSL \u201905. https:\/\/doi.org\/10.1007\/11538363_8 10.1007\/11538363_8"},{"key":"e_1_2_1_29_1","volume-title":"Proc. POPL \u201914","author":"Katsumata Shinya","year":"2014","unstructured":"Shinya Katsumata. 2014. Parametric effect monads and semantics of effect systems. In Proc. POPL \u201914. https:\/\/doi.org\/10.1145\/2535838.2535846 10.1145\/2535838.2535846"},{"key":"e_1_2_1_30_1","volume-title":"Proc. ICFP \u201922","author":"Katsumata Shinya","year":"2022","unstructured":"Shinya Katsumata, Dylan McDermott, Tarmo Uustalu, and Nicolas Wu. 2022. Flexible presentations of graded monads. In Proc. ICFP \u201922. https:\/\/doi.org\/10.1145\/3547654 10.1145\/3547654"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","unstructured":"Shinya Katsumata Tetsuya Sato and Uustalu Tarmo. 2018. Codensity Lifting of Monads and its Dual. LMCS https:\/\/doi.org\/10.23638\/LMCS-14(4:6)2018 10.23638\/LMCS-14(4:6)2018","DOI":"10.23638\/LMCS-14(4:6)2018"},{"key":"e_1_2_1_32_1","volume-title":"Basic Concepts of Enriched Category Theory","author":"Kelly Max","unstructured":"Max Kelly. 1982. Basic Concepts of Enriched Category Theory. Cambridge University Press."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","unstructured":"Max Kelly and John Power. 1993. Adjunctions whose counits are coequalizers and presentations of finitary enriched monads. J. Pure Appl. Algebra https:\/\/doi.org\/10.1016\/0022-4049(93)90092-8 10.1016\/0022-4049(93)90092-8","DOI":"10.1016\/0022-4049(93)90092-8"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","unstructured":"Anders Kock. 1970. Monads on symmetric monoidal closed categories. Archiv der Mathematik https:\/\/doi.org\/10.1007\/BF01220868 10.1007\/BF01220868","DOI":"10.1007\/BF01220868"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","unstructured":"Anders Kock. 1972. Strong functors and monoidal monads. Archiv der Mathematik https:\/\/doi.org\/10.1007\/BF01304852 10.1007\/BF01304852","DOI":"10.1007\/BF01304852"},{"key":"e_1_2_1_36_1","volume-title":"Proc. FoSSaCS \u201920","author":"Kura Satoshi","year":"2020","unstructured":"Satoshi Kura. 2020. Graded Algebraic Theories. In Proc. FoSSaCS \u201920. https:\/\/doi.org\/10.1007\/978-3-030-45231-5_2 10.1007\/978-3-030-45231-5_2"},{"key":"e_1_2_1_37_1","volume-title":"Scott","author":"Lambek Joachim","year":"1986","unstructured":"Joachim Lambek and Philip J. Scott. 1986. Introduction to higher order categorical logic. Cambridge University Press."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48959-2_17"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00088-9"},{"key":"e_1_2_1_40_1","volume-title":"Proc. POPL \u201920","author":"Lew Alexander","year":"2020","unstructured":"Alexander Lew, Marco Cusumano-Towner, Benjamin Sherman, Michael Carbin, and Vikash Mansinghka. 2020. Trace types and denotational semantics for sound programmable inference in probabilistic languages. In Proc. POPL \u201920. https:\/\/doi.org\/10.1145\/3371087 10.1145\/3371087"},{"key":"e_1_2_1_41_1","unstructured":"Jack Liell-Cock Zev Shirazi and Sam Staton. 2025. The Relative Monadic Metalanguage. arxiv:2512.11762. Extended version with appendices"},{"key":"e_1_2_1_42_1","volume-title":"Proc. POPL \u201925","author":"Liell-Cock Jack","year":"2025","unstructured":"Jack Liell-Cock and Samuel Staton. 2025. Compositional imprecise probability: a solution from graded monads and Markov categories. In Proc. POPL \u201925. https:\/\/doi.org\/10.1145\/3704890 10.1145\/3704890"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","unstructured":"Sam Lindley Philip Wadler and Jeremy Yallop. 2010. The arrow calculus. J. Funct. Program. https:\/\/doi.org\/10.1017\/S095679680999027X 10.1017\/S095679680999027X","DOI":"10.1017\/S095679680999027X"},{"key":"e_1_2_1_44_1","volume-title":"Categories for the Working Mathematician","author":"Lane Saunders Mac","unstructured":"Saunders Mac Lane. 1998. Categories for the Working Mathematician. Springer, New York. isbn:978-1-4419-3123-8"},{"key":"e_1_2_1_45_1","volume-title":"Proc. POPL \u201920","author":"Maillard Kenji","year":"2020","unstructured":"Kenji Maillard, C\u0103t\u0103lin Hri\u0163cu, Exequiel Rivas, and Antoine Van Muylder. 2020. The next 700 relational program logics. In Proc. POPL \u201920. https:\/\/doi.org\/10.1145\/3371072 10.1145\/3371072"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9860-1"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","unstructured":"Francisco Marmolejo and Richard Wood. 2010. Monads as Extension Systems - No Iteration is Necessary. TAC https:\/\/doi.org\/10.70930\/tac\/sbn7nctd 10.70930\/tac\/sbn7nctd","DOI":"10.70930\/tac\/sbn7nctd"},{"key":"e_1_2_1_48_1","volume-title":"Proc. MPC \u201922","author":"McDermott Dylan","year":"2022","unstructured":"Dylan McDermott and Tarmo Uustalu. 2022. Flexibly graded monads and graded algebras. In Proc. MPC \u201922. https:\/\/doi.org\/10.1007\/978-3-031-16912-0_4 10.1007\/978-3-031-16912-0_4"},{"key":"e_1_2_1_49_1","volume-title":"Proc. MSFP \u201922","author":"McDermott Dylan","year":"2022","unstructured":"Dylan McDermott and Tarmo Uustalu. 2022. What makes a strong monad? In Proc. MSFP \u201922. https:\/\/doi.org\/10.4204\/EPTCS.360.6 10.4204\/EPTCS.360.6"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","unstructured":"Eugenio Moggi. 1991. Notions of computation and monads. Inf. Comput. https:\/\/doi.org\/10.1016\/0890-5401(91)90052-4 10.1016\/0890-5401(91)90052-4","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"e_1_2_1_51_1","volume-title":"Proc. MSFP \u201920","author":"Orchard Dominic","year":"2020","unstructured":"Dominic Orchard, Philip Wadler, and Harley Eades III. 2020. Unifying graded and parameterised monads. In Proc. MSFP \u201920. https:\/\/doi.org\/10.4204\/EPTCS.317.2 10.4204\/EPTCS.317.2"},{"key":"e_1_2_1_52_1","volume-title":"Proc. ICFP \u201901","author":"Paterson Ross","year":"2001","unstructured":"Ross Paterson. 2001. A New Notation for Arrows. In Proc. ICFP \u201901. https:\/\/doi.org\/10.1145\/507669.507664 10.1145\/507669.507664"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","unstructured":"Michael Pilquist Runar Bjarnason and Paul Chiusano. 2014. Functional Programming in Scala. Manning. https:\/\/doi.org\/10.5555\/2688794","DOI":"10.5555\/2688794"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/2512979"},{"key":"e_1_2_1_55_1","volume-title":"Proc. FoSSaCS \u201902","author":"Plotkin Gordon","year":"2002","unstructured":"Gordon Plotkin and John Power. 2002. Notions of Computation Determine Monads. In Proc. FoSSaCS \u201902. https:\/\/doi.org\/10.1007\/3-540-45931-6_24 10.1007\/3-540-45931-6_24"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023064908962"},{"key":"e_1_2_1_57_1","volume-title":"Proc. ACT \u201922","author":"Rom\u00e1n Mario","year":"2022","unstructured":"Mario Rom\u00e1n. 2022. Promonads and String Diagrams for Effectful Categories. In Proc. ACT \u201922. https:\/\/doi.org\/10.4204\/EPTCS.380.20 10.4204\/EPTCS.380.20"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","unstructured":"Takahiro Sanada. 2024. Algebraic effects and handlers for arrows. JFP https:\/\/doi.org\/10.1017\/S0956796824000066 10.1017\/S0956796824000066","DOI":"10.1017\/S0956796824000066"},{"key":"e_1_2_1_59_1","unstructured":"Andrew Slattery. [n. d.]. Strong relative monads on multicategories and on monoidal categories. PDF available on author\u2019s webpage. https:\/\/aslattery.co.uk\/files\/Strong_Relative_Monads_on_Multicategories_and_on_Monoidal_Categories.pdf"},{"key":"e_1_2_1_60_1","volume-title":"Commutativity of Relative Pseudomonads. Ph. D. Dissertation","author":"Slattery Andrew","unstructured":"Andrew Slattery. 2024. Commutativity of Relative Pseudomonads. Ph. D. Dissertation. University of Leeds."},{"key":"e_1_2_1_61_1","volume-title":"Proc. FoSSaCS \u201910","author":"Staton Sam","year":"2010","unstructured":"Sam Staton. 2010. Completeness for Algebraic Theories of Local State. In Proc. FoSSaCS \u201910. https:\/\/doi.org\/10.1007\/978-3-642-12032-9_5 10.1007\/978-3-642-12032-9_5"},{"key":"e_1_2_1_62_1","volume-title":"Proc. WACT \u201913","author":"Staton Sam","year":"2014","unstructured":"Sam Staton. 2014. Freyd categories are Enriched Lawvere Theories. In Proc. WACT \u201913. https:\/\/doi.org\/10.1016\/j.entcs.2014.02.010 10.1016\/j.entcs.2014.02.010"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","unstructured":"Marshall Stone. 1949. Postulates for the barycentric calculus. Annali di Matematica Pura ed Applicata https:\/\/doi.org\/10.1007\/bf02413910 10.1007\/bf02413910","DOI":"10.1007\/bf02413910"},{"key":"e_1_2_1_64_1","volume-title":"Proc. POPL \u201913","author":"Tate Ross","year":"2013","unstructured":"Ross Tate. 2013. The sequential semantics of producer effect systems. In Proc. POPL \u201913. https:\/\/doi.org\/10.1145\/2429069.2429074 10.1145\/2429069.2429074"},{"key":"e_1_2_1_65_1","volume-title":"Proc. CMCS \u201910","author":"Uustalu Tarmo","year":"2010","unstructured":"Tarmo Uustalu. 2010. Strong Relative Monads (Extended Abstract). In Proc. CMCS \u201910. https:\/\/cs.ioc.ee\/~tarmo\/papers\/uustalu-cmcs10short.pdf"},{"key":"e_1_2_1_66_1","volume-title":"Proc. Program Design Calculi \u201993","author":"Wadler Philip","year":"1993","unstructured":"Philip Wadler. 1993. Monads for functional programming. In Proc. Program Design Calculi \u201993. https:\/\/doi.org\/10.1007\/978-3-662-02880-3_8 10.1007\/978-3-662-02880-3_8"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3776702","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T19:06:08Z","timestamp":1767899168000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3776702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,8]]},"references-count":66,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2026,1,8]]}},"alternative-id":["10.1145\/3776702"],"URL":"https:\/\/doi.org\/10.1145\/3776702","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,8]]},"assertion":[{"value":"2025-07-10","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"}}]}}