{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:16Z","timestamp":1772163916285,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,1,7]],"date-time":"2008-01-07T00:00:00Z","timestamp":1199664000000},"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":[[2008,1,7]]},"DOI":"10.1145\/1328438.1328484","type":"proceedings-article","created":{"date-parts":[[2008,1,7]],"date-time":"2008-01-07T09:45:40Z","timestamp":1199699140000},"page":"383-394","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["An approach to call-by-name delimited continuations"],"prefix":"10.1145","author":[{"given":"Hugo","family":"Herbelin","sequence":"first","affiliation":[{"name":"INRIA Futurs, Palaiseau, France"}]},{"given":"Silvia","family":"Ghilezan","sequence":"additional","affiliation":[{"name":"University of Novi Sad, Novi Sad, Serbia"}]}],"member":"320","published-online":{"date-parts":[[2008,1,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796807006612"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9006-0"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80878-8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351262"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/788018.788795"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.2307\/2694930"},{"key":"e_1_3_2_1_10_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BFb0017475","volume-title":"Proceedings of the Colloquium on Trees in Algebra and Programming, CAAP'94","author":"de Groote Philippe","year":"1994","unstructured":"Philippe de Groote . A CPS-translation of the \u03bb\u03bc-calculus . In STison, editor, Proceedings of the Colloquium on Trees in Algebra and Programming, CAAP'94 , Edinburgh, U.K. , April 11-13, 1994 , volume 787 of Lecture Notes in Computer Science , pages 85 -- 99 . Springer-Verlag , 1994. ISBN 3-540-57879-X. Philippe de Groote. A CPS-translation of the \u03bb\u03bc-calculus. In STison, editor, Proceedings of the Colloquium on Trees in Algebra and Programming, CAAP'94, Edinburgh, U.K., April 11-13, 1994, volume 787 of Lecture Notes in Computer Science, pages 85--99. Springer-Verlag, 1994. ISBN 3-540-57879-X."},{"key":"e_1_3_2_1_11_1","volume-title":"Greece","volume":"13","author":"Do\u0161en Kosta","year":"2001","unstructured":"Kosta Do\u0161en and Zoran Petri\u0107 . The typed B\u00f6hm teorem. In B\u00f6hm theorem: applications to Computer Science Theory -- BOTH 2001 Crete , Greece , volume 50(2) of Electronic Notes in Theoretical Computer Science, page 13 , 2001 . Kosta Do\u0161en and Zoran Petri\u0107. The typed B\u00f6hm teorem. In B\u00f6hm theorem: applications to Computer Science Theory -- BOTH 2001 Crete, Greece, volume 50(2) of Electronic Notes in Theoretical Computer Science, page 13, 2001."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73576"},{"key":"e_1_3_2_1_13_1","first-page":"193","volume-title":"Formal description of programming concepts-III","author":"Felleisen Matthias","year":"1986","unstructured":"Matthias Felleisen and Daniel Friedman . Control operators, the secd machine, and the \u03bb-calculus . In Formal description of programming concepts-III , pages 193 -- 217 . North-Holland , 1986 . Matthias Felleisen and Daniel Friedman. Control operators, the secd machine, and the \u03bb-calculus. In Formal description of programming concepts-III, pages 193--217. North-Holland, 1986."},{"key":"e_1_3_2_1_14_1","first-page":"131","volume-title":"First Symposium on Logic and Computer Science","author":"Felleisen Matthias","year":"1986","unstructured":"Matthias Felleisen , Daniel P. Friedman , Eugene Kohlbecker , and Bruce F. Duba . Reasoning with continuations . In First Symposium on Logic and Computer Science , pages 131 -- 141 , 1986 . Matthias Felleisen, Daniel P. Friedman, Eugene Kohlbecker, and Bruce F. Duba. Reasoning with continuations. In First Symposium on Logic and Computer Science, pages 131--141, 1986."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.178047"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/942578.807077"},{"key":"e_1_3_2_1_17_1","first-page":"120","volume-title":"TLCA","year":"2003","unstructured":"Ken-etsu Fujita. A sound and complete cps-translation for \u03bb\u03bc-calculus . In TLCA , pages 120 -- 134 , 2003 . Ken-etsu Fujita. A sound and complete cps-translation for \u03bb\u03bc-calculus. In TLCA, pages 120--134, 2003."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96714"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/232627.232632"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/11.3.431"},{"key":"e_1_3_2_1_21_1","volume-title":"Universit\u00e9 Paris","author":"Herbelin Hugo","year":"2005","unstructured":"Hugo Herbelin . C'est maintenant qu'on calcule : au c\u00e6 ur de la dualit\u00e9. Habilitation \u00e0 diriger les recherches , Universit\u00e9 Paris 11, December 2005 . Hugo Herbelin. C'est maintenant qu'on calcule: au c\u00e6 ur de la dualit\u00e9. Habilitation \u00e0 diriger les recherches, Universit\u00e9 Paris 11, December 2005."},{"key":"e_1_3_2_1_22_1","volume-title":"Universit\u00e9 Paris","author":"Herbelin Hugo","year":"1995","unstructured":"Hugo Herbelin . S\u00e9quents qu'on calcule: de l'interpr\u00e9tation du calcul des s\u00e9quents comme calcul de \u03bb-termes et comme calcul de strat\u00e9gies gagnantes. Th\u00e9se de doctorat , Universit\u00e9 Paris 7, January 1995 . Hugo Herbelin. S\u00e9quents qu'on calcule: de l'interpr\u00e9tation du calcul des s\u00e9quents comme calcul de \u03bb-termes et comme calcul de strat\u00e9gies gagnantes. Th\u00e9se de doctorat, Universit\u00e9 Paris 7, January 1995."},{"key":"e_1_3_2_1_23_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-62688-3_38","volume-title":"Third International Conference on Typed Lambda Calculi and Applications, TLCA '97","author":"Herbelin Hugo","year":"1997","unstructured":"Hugo Herbelin . Games and weak-head reduction for classical PCF . In Philippe de Groote and JRoger Hindley, editors, Third International Conference on Typed Lambda Calculi and Applications, TLCA '97 , Nancy, France, April 2-4, 1997 , Proceedings, volume 1210 of Lecture Notes in Computer Science , pages 214 -- 230 . Springer , 1997. ISBN 3-540-62688-3. Hugo Herbelin. Games and weak-head reduction for classical PCF. In Philippe de Groote and JRoger Hindley, editors, Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, Nancy, France, April 2-4, 1997, Proceedings, volume 1210 of Lecture Notes in Computer Science, pages 214--230. Springer, 1997. ISBN 3-540-62688-3."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/29650.29668"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73574"},{"key":"e_1_3_2_1_26_1","volume-title":"Universit\u00e9 Paris","author":"Joly Thierry","year":"2000","unstructured":"Thierry Joly . Codages , s\u00e9parabilit\u00e9 et repr\u00e9sentation de fonctions dans divers \u03bb-calculs typ\u00e9s. Phd thesis , Universit\u00e9 Paris 7, January 2000 . Thierry Joly. Codages, s\u00e9parabilit\u00e9 et repr\u00e9sentation de fonctions dans divers \u03bb-calculs typ\u00e9s. Phd thesis, Universit\u00e9 Paris 7, January 2000."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944722"},{"key":"e_1_3_2_1_29_1","first-page":"230","volume-title":"Proceedings of 11th IEEE Annual Symposium on Logic in Computer Science","author":"Luke Ong C.-H.","year":"1996","unstructured":"C.-H. Luke Ong . A semantic view of classical proofs: type-theoretic, categorical, denotational characterizations . In Proceedings of 11th IEEE Annual Symposium on Logic in Computer Science , pages 230 -- 241 . IEEE Computer Society Press , 1996 . C.-H. Luke Ong. A semantic view of classical proofs: type-theoretic, categorical, denotational characterizations. In Proceedings of 11th IEEE Annual Symposium on Logic in Computer Science, pages 230--241. IEEE Computer Society Press, 1996."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263722"},{"key":"e_1_3_2_1_31_1","volume-title":"7th Italian Conference Theoretical Computer Science, ICTCS'05","volume":"2202","author":"Paolini Luca","year":"2001","unstructured":"Luca Paolini . Call-by-Value separability and computability. In ARestivo and SRonchi della Rocca, editors , 7th Italian Conference Theoretical Computer Science, ICTCS'05 , volume 2202 of Lecture Notes in Computer Science, pages 74--89. Springer-Verlag , 2001 . Luca Paolini. Call-by-Value separability and computability. In ARestivo and SRonchi della Rocca, editors, 7th Italian Conference Theoretical Computer Science, ICTCS'05, volume 2202 of Lecture Notes in Computer Science, pages 74--89. Springer-Verlag, 2001."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/645706.663989"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(00)00161-4"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01019462"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.48"},{"key":"e_1_3_2_1_37_1","volume-title":"14th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR '07)","author":"Saurin Alexis","year":"2007","unstructured":"Alexis Saurin . Typing streams in the \u03bb\u03bc-calculus . In 14th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR '07) , Lecture Notes in Artificial Intelligence. Springer-Verlag , 2007 . to appear. Alexis Saurin. Typing streams in the \u03bb\u03bc-calculus. In 14th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR '07), Lecture Notes in Artificial Intelligence. Springer-Verlag, 2007. to appear."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1017\/S096012950000311X"},{"key":"e_1_3_2_1_39_1","first-page":"99","volume-title":"Proceedings of the 5th workshop on Scheme and Functional Programming","year":"2004","unstructured":"Chung-chieh Shan. Shift to control. In Olin Shivers and Oscar Waddell, editors , Proceedings of the 5th workshop on Scheme and Functional Programming , pages 99 -- 107 , 2004 . Chung-chieh Shan. Shift to control. In Olin Shivers and Oscar Waddell, editors, Proceedings of the 5th workshop on Scheme and Functional Programming, pages 99--107, 2004."},{"key":"e_1_3_2_1_40_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1007\/BFb0014068","volume-title":"Typed Lambda Calculus and Applications TLCA'95","author":"Simpson Alex K.","year":"1995","unstructured":"Alex K. Simpson . Categorical completeness results for simply typed lambda calculus . In MDezani-Ciancaglini and GPlotkin, editors, Typed Lambda Calculus and Applications TLCA'95 , volume 902 of Lecture Notes in Computer Science , pages 414 -- 427 . Springer-Verlag , 1995 . Alex K. Simpson. Categorical completeness results for simply typed lambda calculus. In MDezani-Ciancaglini and GPlotkin, editors, Typed Lambda Calculus and Applications TLCA'95, volume 902 of Lecture Notes in Computer Science, pages 414--427. Springer-Verlag, 1995."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91626"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273377"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944723"}],"event":{"name":"POPL08: The 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"San Francisco California USA","acronym":"POPL08","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1328438.1328484","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1328438.1328484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:56:07Z","timestamp":1750240567000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1328438.1328484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,7]]},"references-count":38,"alternative-id":["10.1145\/1328438.1328484","10.1145\/1328438"],"URL":"https:\/\/doi.org\/10.1145\/1328438.1328484","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1328897.1328484","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008,1,7]]},"assertion":[{"value":"2008-01-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}