{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:12Z","timestamp":1772163912916,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,9,19]],"date-time":"2004-09-19T00:00:00Z","timestamp":1095552000000},"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":[[2004,9,19]]},"DOI":"10.1145\/1016850.1016860","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T13:39:48Z","timestamp":1097156388000},"page":"40-53","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["A type-theoretic foundation of continuations and prompts"],"prefix":"10.1145","author":[{"given":"Zena M.","family":"Ariola","sequence":"first","affiliation":[{"name":"University of Oregon"}]},{"given":"Hugo","family":"Herbelin","sequence":"additional","affiliation":[{"name":"INRIA-Futurs"}]},{"given":"Amr","family":"Sabry","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN"}]}],"member":"320","published-online":{"date-parts":[[2004,9,19]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","first-page":"128","volume-title":"Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP'03)","author":"Ariola Z. M.","year":"2003","unstructured":"Z. M. Ariola and H. Herbelin . Minimal classical logic and control operators . In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP'03) , volume 2719 of LNCS , pages 128 -- 136 , Eindhoven, The Netherlands , June 30 - July 4, 2003 . Springer-Verlag ,]] Z. M. Ariola and H. Herbelin. Minimal classical logic and control operators. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP'03), volume 2719 of LNCS, pages 128--136, Eindhoven, The Netherlands, June 30 - July 4, 2003. Springer-Verlag,]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00124-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/14.4.529"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351262"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91622"},{"key":"e_1_3_2_1_7_1","volume-title":"Monadic functional subcontinuations. Unpublished manuscript","author":"Dybvig R. K.","year":"2004","unstructured":"R. K. Dybvig , S. Peyton-Jones , E. Moggi , A. Sabry , and O. Waddell . Monadic functional subcontinuations. Unpublished manuscript , 2004 .]] R. K. Dybvig, S. Peyton-Jones, E. Moggi, A. Sabry, and O. Waddell. Monadic functional subcontinuations. Unpublished manuscript, 2004.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73576"},{"key":"e_1_3_2_1_9_1","first-page":"134","volume-title":"ESOP '90 3rd European Symposium on Programming","author":"Felleisen M.","year":"1990","unstructured":"M. Felleisen . On the expressive power of programming languages. In N. Jones, editor, ESOP '90 3rd European Symposium on Programming , Copenhagen, Denmark , volume 432 , pages 134 -- 151 . Springer-Verlag , New York, N.Y., 1990 .]] M. Felleisen. On the expressive power of programming languages. In N. Jones, editor, ESOP '90 3rd European Symposium on Programming, Copenhagen, Denmark, volume 432, pages 134--151. Springer-Verlag, New York, N.Y., 1990.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90109-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/62678.62684"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.178047"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292557"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/317636.317779"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96714"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224173"},{"key":"e_1_3_2_1_17_1","volume-title":"Record of the 5th ACM SIGPLAN workshop on ML and its Applications","author":"Guzm\u00e1n J.","year":"1994","unstructured":"J. Guzm\u00e1n and A. Su\u00e1rez . An extended type system for exceptions . In Record of the 5th ACM SIGPLAN workshop on ML and its Applications , June 1994 . Also appears as Research Report 2265, INRIA, BP 105 - 78153 Le Chesnay Cedex, France.]] J. Guzm\u00e1n and A. Su\u00e1rez. An extended type system for exceptions. In Record of the 5th ACM SIGPLAN workshop on ML and its Applications, June 1994. Also appears as Research Report 2265, INRIA, BP 105 - 78153 Le Chesnay Cedex, France.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645520.656114"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(86)90007-X"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01019946"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/99164.99178"},{"key":"e_1_3_2_1_22_1","first-page":"479","volume-title":"To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism","author":"Howard W.","year":"1980","unstructured":"W. Howard . The formulae-as-types notion of construction . In J. R. Hindley and J. P. Seldin, editors, To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism , pages 479 -- 490 . Academic Press , 1980 .]] W. Howard. The formulae-as-types notion of construction. In J. R. Hindley and J. P. Seldin, editors, To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism, pages 479--490. Academic Press, 1980.]]"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/647318.723491"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the Third ACM SIGPLAN Workshop on Continuations (CW'01)","author":"Kameyama Y.","year":"2001","unstructured":"Y. Kameyama . Towards logical understanding of delimited continuations . In Proceedings of the Third ACM SIGPLAN Workshop on Continuations (CW'01) , 2001 .]] Y. Kameyama. Towards logical understanding of delimited continuations. In Proceedings of the Third ACM SIGPLAN Workshop on Continuations (CW'01), 2001.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/944746.944722"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010020917337"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/77350.77353"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010087314987"},{"key":"e_1_3_2_1_29_1","volume-title":"International Conference on Programming Language Implementation and Logic Programming (PLILP'94)","author":"Moreau L.","unstructured":"L. Moreau and C. Queinnec . Partial Continuations as the Difference of Continuations. A Duumvirate of Control Operators . In International Conference on Programming Language Implementation and Logic Programming (PLILP'94) , number 844 in LNCS pages 182--197, Madrid, Spain, Sept. 1994. Springer-Verlag.]] L. Moreau and C. Queinnec. Partial Continuations as the Difference of Continuations. A Duumvirate of Control Operators. In International Conference on Programming Language Implementation and Logic Programming (PLILP'94), number 844 in LNCS pages 182--197, Madrid, Spain, Sept. 1994. Springer-Verlag.]]"},{"key":"e_1_3_2_1_30_1","first-page":"49","volume-title":"ACM work-shop on Continuations","author":"Murthy C.","year":"1992","unstructured":"C. Murthy . Control operators, hierarchies, and pseudo-classical type systems: A-translation at work . In ACM work-shop on Continuations , pages 49 -- 71 , 1992 .]] C. Murthy. Control operators, hierarchies, and pseudo-classical type systems: A-translation at work. In ACM work-shop on Continuations, pages 49--71, 1992.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/645706.663989"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm-83-3-219-249"},{"key":"e_1_3_2_1_33_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/3-540-48523-6_60","volume-title":"Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP)","author":"Riecke J. G.","year":"1999","unstructured":"J. G. Riecke and H. Thielecke . Typed exceptions and continuations cannot macro-express each other . In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP) , volume 1644 of LNCS , pages 635 -- 644 , Berlin, 1999 . Springer-Verlag .]] J. G. Riecke and H. Thielecke. Typed exceptions and continuations cannot macro-express each other. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP), volume 1644 of LNCS, pages 635--644, Berlin, 1999. Springer-Verlag.]]"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01019462"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01806126"},{"key":"e_1_3_2_1_36_1","unstructured":"The SML\/NJ library. Available from http:\/\/smlnj.org\/.]]  The SML\/NJ library. Available from http:\/\/smlnj.org\/.]]"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/645394.651920"},{"key":"e_1_3_2_1_38_1","volume-title":"Contrasting exceptions and continuations. Version available from http:\/\/www.cs.bham.ac.uk\/~hxt\/research\/exncontjournal.pdf","author":"Thielecke H.","year":"2001","unstructured":"H. Thielecke . Contrasting exceptions and continuations. Version available from http:\/\/www.cs.bham.ac.uk\/~hxt\/research\/exncontjournal.pdf , 2001 .]] H. Thielecke. Contrasting exceptions and continuations. Version available from http:\/\/www.cs.bham.ac.uk\/~hxt\/research\/exncontjournal.pdf, 2001.]]"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020887011500"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01019944"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010093700911"}],"event":{"name":"ICFP04: ACM SIGPLAN International Conference on Functional Programming","location":"Snow Bird UT USA","acronym":"ICFP04","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the ninth ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1016850.1016860","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1016850.1016860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:31:00Z","timestamp":1750249860000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1016850.1016860"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9,19]]},"references-count":40,"alternative-id":["10.1145\/1016850.1016860","10.1145\/1016850"],"URL":"https:\/\/doi.org\/10.1145\/1016850.1016860","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1016848.1016860","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2004,9,19]]},"assertion":[{"value":"2004-09-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}