{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:47:56Z","timestamp":1725670076752},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642288685"},{"type":"electronic","value":"9783642288692"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28869-2_12","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T20:44:36Z","timestamp":1332449076000},"page":"234-253","source":"Crossref","is-referenced-by-count":1,"title":["A Systematic Approach to Delimited Control with Multiple Prompts"],"prefix":"10.1007","author":[{"given":"Paul","family":"Downen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zena M.","family":"Ariola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1017\/S0956796807006612","volume":"18","author":"Z.M. Ariola","year":"2008","unstructured":"Ariola, Z.M., Herbelin, H.: Control reduction theories: The benefit of structural substitution. J. Funct. Program.\u00a018, 373\u2013419 (2008)","journal-title":"J. Funct. Program."},{"issue":"3","key":"12_CR2","first-page":"233","volume":"22","author":"Z.M. Ariola","year":"2009","unstructured":"Ariola, Z.M., Herbelin, H., Sabry, A.: A type-theoretic foundation of delimited continuations. HOSC\u00a022(3), 233\u2013273 (2009)","journal-title":"HOSC"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Curien, P.L., Herbelin, H.: The duality of computation. In: ICFP 2000, pp. 233\u2013243 (2000)","DOI":"10.1145\/357766.351262"},{"key":"12_CR4","unstructured":"Danvy, O.: On evaluation contexts, continuations, and the rest of the computation. In: ACM SIGPLAN Workshop on Continuations, pp. 13\u201323 (2004)"},{"key":"12_CR5","unstructured":"Danvy, O., Filinski, A.: A functional abstraction of typed contexts. Tech. Rep. 89\/12, DIKU, University of Copenhagen, Copenhagen, Denmark (1989)"},{"issue":"8","key":"12_CR6","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/j.scico.2007.10.007","volume":"74","author":"O. Danvy","year":"2009","unstructured":"Danvy, O., Millikin, K.: Refunctionalization at work. Science of Computer Programming\u00a074(8), 534\u2013549 (2009)","journal-title":"Science of Computer Programming"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: Proceedings of the 1990 ACM Conference on LISP and Functional Programming, pp. 151\u2013160. ACM Press (1990)","DOI":"10.1145\/91556.91622"},{"issue":"06","key":"12_CR8","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1017\/S0956796807006259","volume":"17","author":"R. Dybvig","year":"2007","unstructured":"Dybvig, R., Jones, S.P., Sabry, A.: A monadic framework for delimited continuations. Journal of Functional Programming\u00a017(06), 687\u2013730 (2007)","journal-title":"Journal of Functional Programming"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Felleisen, M.: The theory and practice of first-class prompts. In: POPL 1988 (1988)","DOI":"10.1145\/73560.73576"},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(87)90109-5","volume":"52","author":"M. Felleisen","year":"1987","unstructured":"Felleisen, M., Friedman, D., Kohlbecker, E.: A syntactic theory of sequential control. Theoretical Computer Science\u00a052(3), 205\u2013237 (1987)","journal-title":"Theoretical Computer Science"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Filinski, A.: Representing monads. In: POPL 1994, pp. 446\u2013457 (1994)","DOI":"10.1145\/174675.178047"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Filinski, A.: Representing layered monads. In: POPL 1999, pp. 175\u2013188 (1999)","DOI":"10.1145\/292540.292557"},{"key":"12_CR13","first-page":"153","volume-title":"Proceedings of POPL 2009","author":"R. Garcia","year":"2009","unstructured":"Garcia, R., Lumsdaine, A., Sabry, A.: Lazy evaluation and delimited control. In: Proceedings of POPL 2009, pp. 153\u2013164. ACM, New York (2009)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Kiselyov, O.: Delimited control in OCaml, abstractly and concretely: System description. Functional and Logic Programming, 304\u2013320 (2010)","DOI":"10.1007\/978-3-642-12251-4_22"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/1159803.1159808","volume-title":"Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming, ICFP 2006","author":"O. Kiselyov","year":"2006","unstructured":"Kiselyov, O., Shan, C.-c., Sabry, A.: Delimited dynamic binding. In: Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming, ICFP 2006, pp. 26\u201337. ACM, New York (2006)"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/2034773.2034786","volume-title":"Proceeding of the 16th ACM SIGPLAN International Conference on Functional Programming, ICFP 2011","author":"M. Materzok","year":"2011","unstructured":"Materzok, M., Biernacki, D.: Subtyping delimited continuations. In: Proceeding of the 16th ACM SIGPLAN International Conference on Functional Programming, ICFP 2011, pp. 81\u201393. ACM, New York (2011)"},{"issue":"3","key":"12_CR17","first-page":"233","volume":"11","author":"L. Moreau","year":"1998","unstructured":"Moreau, L.: A syntactic theory of dynamic binding. HOSC\u00a011(3), 233\u2013279 (1998)","journal-title":"HOSC"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BFb0013061","volume-title":"Logic Programming and Automated Reasoning","author":"M. Parigot","year":"1992","unstructured":"Parigot, M.: \u03bb\u03bc-Calculus: An Algorithmic Interpretation of Classical Natural Deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol.\u00a0624, pp. 190\u2013201. Springer, Heidelberg (1992)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. In: Proceedings of the 25th ACM National Conference, pp. 717\u2013740 (1972)","DOI":"10.1145\/800194.805852"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Sitaram, D., Felleisen, M.: Reasoning with continuations II: Full abstraction for models of control. In: Conference on Lisp and Functional Programming (1990)","DOI":"10.1145\/91556.91626"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28869-2_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:13:38Z","timestamp":1620126818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28869-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642288685","9783642288692"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28869-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}