{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T14:14:12Z","timestamp":1784211252292,"version":"3.55.0"},"reference-count":57,"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                    A hyperfunction is a continuation-like construction that can be used to implement communication in the context of concurrency. Though it has been reinvented many times, it remains obscure: since its definition by\n                    <jats:xref ref-type=\"bibr\">Launchbury et al.<\/jats:xref>\n                    , hyperfunctions have been used to implement certain algebraic effect handlers, coroutines, and breadth-first traversals; however, in each of these examples, the hyperfunction type went unrecognised.\n                  <\/jats:p>\n                  <jats:p>We identify the hyperfunctions hidden in all of these algorithms, and we exposit the common pattern between them, building a framework for working with and reasoning about hyperfunctions. We use this framework to solve a long-standing problem: giving a fully-abstract continuation-based semantics for a concurrent calculus, the Calculus of Communicating Systems. Finally, we use hyperfunctions to build a monadic Haskell library for efficient first-class coroutines.<\/jats:p>","DOI":"10.1145\/3776649","type":"journal-article","created":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:59:43Z","timestamp":1767898783000},"page":"174-203","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Hyperfunctions: Communicating Continuations"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4952-7359","authenticated-orcid":false,"given":"Donnacha Ois\u00edn","family":"Kidney","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","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429075"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90025-X"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380190202"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","unstructured":"Patrick Bahr and Graham Hutton. 2023. Calculating Compilers for Concurrency. 7 ICFP (Aug. 2023) 213:740\u2013213:767. doi:10.1145\/3607855","DOI":"10.1145\/3607855"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.TYPES.2018.1"},{"key":"e_1_3_2_8_1","unstructured":"Jan Bergstra and Jan Willem Klop. 1984. Process Algebra for Communication and Mutual Exclusion. R 8409 (Jan. 1984). https:\/\/ir.cwi.nl\/pub\/6504"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90088-X"},{"issue":"89","key":"e_1_3_2_10_1","first-page":"9","article-title":"Algebra of Communicating Processes","volume":"1","author":"Bergstra Jan A","year":"1986","unstructured":"Jan A Bergstra and Jan Willem Klop. 1986. Algebra of Communicating Processes. Mathematics and Computer Science, CWI Monograph 1, 89-138 (1986), 9. https:\/\/dspace.library.uu.nl\/handle\/1874\/13997","journal-title":"Mathematics and Computer Science, CWI Monograph"},{"key":"e_1_3_2_11_1","unstructured":"Mario Bla\u017eevi\u0107. 2011. Coroutine Pipelines. The Monad.Reader 19 (Oct. 2011) 29\u201348. https:\/\/themonadreader.wordpress.com\/wp-content\/uploads\/2011\/10\/issue19.pdf"},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42900-7_11"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","unstructured":"Nicolas Chappe Paul He Ludovic Henrio Yannick Zakowski and Steve Zdancewic. 2023. Choice Trees: Representing Nondeterministic Recursive and Impure Programs in Coq. Proceedings of the ACM on Programming Languages 7 POPL (Jan. 2023) 61:1770\u201361:1800. doi:10.1145\/3571254","DOI":"10.1145\/3571254"},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","unstructured":"Gabriel Ciobanu and Eneia Nicolae Todoran. 2017. Abstract Continuation Semantics for Asynchronous Concurrency. In 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). 296\u2013303. doi:10.1109\/SYNASC.2017.00056","DOI":"10.1109\/SYNASC.2017.00056"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","unstructured":"Gabriel Ciobanu and Eneia Nicolae Todoran. 2018. On the Abstractness of Continuation Semantics. In 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). 167\u2013174. doi:10.1109\/SYNASC.2018.00036","DOI":"10.1109\/SYNASC.2018.00036"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796899003342"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58085-9_72"},{"key":"e_1_3_2_18_1","unstructured":"Thierry Coquand. 2013. [Agda] Defining Coinductive Types. https:\/\/lists.chalmers.se\/pipermail\/agda\/2013\/006189.html"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291220.1291199"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.2307\/2269292"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.2307\/2312726"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-16912-0_1"},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165214"},{"key":"e_1_3_2_24_1","unstructured":"Gabriella Gonzalez. 2012. Pipes: Compositional Pipelines. http:\/\/hackage.haskell.org\/package\/pipes-3.0.0"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034675.2034682"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(86)90007-X"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3632869"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/99164.99178"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24276-2_2"},{"key":"e_1_3_2_30_1","unstructured":"Martin Hofmann. 1993. Non Strictly Positive Datatypes in System F. https:\/\/www.seas.upenn.edu\/~sweirich\/types\/archive\/1993\/msg00027.html"},{"key":"e_1_3_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/289423.289457"},{"key":"e_1_3_2_32_1","volume-title":"Linear-Time Breadth-First Tree Algorithms: An Exercise in the Arithmetic of Folds and Zips","author":"Jones Geraint","year":"1993","unstructured":"Geraint Jones and Jeremy Gibbons. 1993. Linear-Time Breadth-First Tree Algorithms: An Exercise in the Arithmetic of Folds and Zips. Technical Report 71. Dept of Computer Science, University of Auckland. http:\/\/www.cs.ox.ac.uk\/people\/jeremy.gibbons\/publications\/linear.ps.gz"},{"key":"e_1_3_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59451-5_4"},{"key":"e_1_3_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500590"},{"key":"e_1_3_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086390"},{"key":"e_1_3_2_36_1","unstructured":"Edward Kmett. 2015. Hyperfunctions: Hyperfunctions. https:\/\/hackage.haskell.org\/package\/hyperfunctions"},{"key":"e_1_3_2_37_1","unstructured":"Edward Kmett. 2025. Machines. https:\/\/hackage.haskell.org\/package\/machines"},{"key":"e_1_3_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45315-6_20"},{"key":"e_1_3_2_39_1","volume-title":"FICS 2001 Workshop on Fixed Points in Computer Science","author":"Krsti\u0107 Sava","year":"2001","unstructured":"Sava Krsti\u0107, John Launchbury, and Du\u0161ko Pavlovi\u0107. 2001b. Hyperfunctions. In FICS 2001 Workshop on Fixed Points in Computer Science. Firenze, Italy. http:\/\/wwwusers.di.uniroma1.it\/~labella\/partecipation.html"},{"key":"e_1_3_2_40_1","volume-title":"Zip Fusion with Hyperfunctions","author":"Launchbury John","year":"2000","unstructured":"John Launchbury, Sava Krsti\u0107, and Timothy E. Sauerwein. 2000. Zip Fusion with Hyperfunctions. Technical Report. Oregon Graduate Institute. https:\/\/launchbury.blog\/wp-content\/uploads\/2019\/01\/zip-fusion-with-hyperfunctions.pdf"},{"key":"e_1_3_2_41_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.129.9"},{"key":"e_1_3_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3"},{"key":"e_1_3_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290317"},{"key":"e_1_3_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0032072"},{"key":"e_1_3_2_45_1","doi-asserted-by":"publisher","unstructured":"F. Moller. 1990b. The Nonexistence of Finite Axiomatisations for CCS Congruences. In [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science. 142\u2013153. doi:10.1109\/LICS.1990.113741","DOI":"10.1109\/LICS.1990.113741"},{"key":"e_1_3_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-736-3_8"},{"key":"e_1_3_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04652-0_5"},{"key":"e_1_3_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05998-9_9"},{"key":"e_1_3_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01019459"},{"key":"e_1_3_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133255.1134016"},{"key":"e_1_3_2_51_1","unstructured":"Vilhelm Sj\u00f6berg. 2015. Why Must Inductive Types Be Strictly Positive? https:\/\/vilhelms.github.io\/posts\/why-must-inductive-types-be-strictly-positive\/"},{"issue":"14","key":"e_1_3_2_52_1","first-page":"28","article-title":"Lloyd Allison\u2019s Corecursive Queues: Why Continuations Matter","volume":"14","author":"Smith Leon P","year":"2009","unstructured":"Leon P Smith. 2009. Lloyd Allison\u2019s Corecursive Queues: Why Continuations Matter. The Monad.Reader 14, 14 (July 2009) 28. https:\/\/meldingmonads.files.wordpress.com\/2009\/06\/corecqueues.pdf","journal-title":"The Monad.Reader"},{"key":"e_1_3_2_53_1","unstructured":"Michael Snoyman. 2011. Conduit. https:\/\/hackage.haskell.org\/package\/conduit-0.0.0.1"},{"key":"e_1_3_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3110249"},{"key":"e_1_3_2_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)80632-2"},{"key":"e_1_3_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372885.3373814"},{"key":"e_1_3_2_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2022.100846"},{"key":"e_1_3_2_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59451-5_2"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3776649","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T13:41:07Z","timestamp":1784209267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3776649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,8]]},"references-count":57,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2026,1,8]]}},"alternative-id":["10.1145\/3776649"],"URL":"https:\/\/doi.org\/10.1145\/3776649","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"}}]}}