{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T10:37:56Z","timestamp":1791283076224,"version":"4.1.0"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,10,24]],"date-time":"2007-10-24T00:00:00Z","timestamp":1193184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2007,11,20]]},"DOI":"10.1007\/s10990-007-9010-4","type":"journal-article","created":{"date-parts":[[2007,10,23]],"date-time":"2007-10-23T16:14:06Z","timestamp":1193156046000},"page":"371-401","source":"Crossref","is-referenced-by-count":32,"title":["A static simulation of dynamic delimited control"],"prefix":"10.1007","volume":"20","author":[{"given":"Chung-chieh","family":"Shan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,10,24]]},"reference":[{"key":"9010_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-44904-3_2","volume-title":"TLCA 2003: Proceedings of the 6th International Conference on Typed Lambda Calculi and Applications","author":"M. Abbott","year":"2003","unstructured":"Abbott, M., Altenkirch, T., Ghani, N., McBride, C.: Derivatives of containers. In: Hofmann, M. (ed.) TLCA 2003: Proceedings of the 6th International Conference on Typed Lambda Calculi and Applications. Lecture Notes in Computer Science, vol. 2701, pp. 16\u201330. Springer, Berlin (2003)"},{"key":"9010_CR2","first-page":"8","volume-title":"Proceedings of the 5th International Conference on Principles and Practice of Declarative Programming","author":"M.S. Ager","year":"2003","unstructured":"Ager, M.S., Biernacki, D., Danvy, O., Midtgaard, J.: A functional correspondence between evaluators and abstract machines. In: Proceedings of the 5th International Conference on Principles and Practice of Declarative Programming, pp. 8\u201319. ACM Press, New York (2003)"},{"issue":"5","key":"9010_CR3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.ipl.2004.02.012","volume":"90","author":"M.S. Ager","year":"2004","unstructured":"Ager, M.S., Danvy, O., Midtgaard, J.: A functional correspondence between call-by-need evaluators and lazy abstract machines. Inf. Process. Lett. 90(5), 223\u2013232 (2004). Extended version available as BRICS Report RS-04-3","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9010_CR4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.tcs.2005.06.008","volume":"342","author":"M.S. Ager","year":"2005","unstructured":"Ager, M.S., Danvy, O., Midtgaard, J.: A functional correspondence between monadic evaluators and abstract machines for languages with computational effects. Theor. Comput. Sci. 342(1), 149\u2013172 (2005). Extended version available as BRICS Report RS-04-28","journal-title":"Theor. Comput. Sci."},{"key":"9010_CR5","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/1016850.1016860","volume-title":"ICFP\u201904: Proceedings of the ACM International Conference on Functional Programming","author":"Z.M. Ariola","year":"2004","unstructured":"Ariola, Z.M., Herbelin, H., Sabry, A.: A type-theoretic foundation of continuations and prompts. In: ICFP\u201904: Proceedings of the ACM International Conference on Functional Programming, pp. 40\u201353. ACM Press, New York (2004)"},{"key":"9010_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/3-540-45821-2_5","volume-title":"Proceedings of GPCE 2002: 1st ACM Conference on Generative Programming and Component Engineering","author":"V. Balat","year":"2002","unstructured":"Balat, V., Danvy, O.: Memoization in type-directed partial evaluation. In: Batory, D.S., Consel, C., Taha, W. (eds.) Proceedings of GPCE 2002: 1st ACM Conference on Generative Programming and Component Engineering. Lecture Notes in Computer Science, vol. 2487, pp. 78\u201392. Springer, Berlin (2002)"},{"key":"9010_CR7","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/964001.964007","volume-title":"POPL\u201904: Conference Record of the Annual ACM Symposium on Principles of Programming Languages","author":"V. Balat","year":"2004","unstructured":"Balat, V., Di Cosmo, R., Fiore, M.: Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums. In: POPL\u201904: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pp. 64\u201376. ACM Press, New York (2004)"},{"key":"9010_CR8","unstructured":"Barker, C.: Continuations in natural language. In: Thielecke, H. (ed.) CW\u201904: Proceedings of the 4th ACM SIGPLAN Continuations Workshop, pp. 1\u201311. Tech. Rep. CSR-04-1, School of Computer Science, University of Birmingham (2004)."},{"issue":"1\u20133","key":"9010_CR9","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.tcs.2006.12.028","volume":"375","author":"M. Biernacka","year":"2007","unstructured":"Biernacka, M., Danvy, O.: A syntactic correspondence between context-sensitive calculi and abstract machines. Theor. Comput. Sci. 375(1\u20133), 76\u2013108 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9010_CR10","doi-asserted-by":"crossref","unstructured":"Biernacka, M., Biernacki, D., Danvy, O.: An operational foundation for delimited continuations in the CPS hierarchy. Log. Methods Comput. Sci. 1(2:5) (2005)","DOI":"10.2168\/LMCS-1(2:5)2005"},{"key":"9010_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/978-3-540-25938-1_13","volume-title":"LOPSTR 2003: 13th International Symposium on Logic Based Program Synthesis and Transformation","author":"D. Biernacki","year":"2004","unstructured":"Biernacki, D., Danvy, O.: From interpreter to logic engine by defunctionalization. In: Bruynooghe, M. (ed.) LOPSTR 2003: 13th International Symposium on Logic Based Program Synthesis and Transformation. Lecture Notes in Computer Science, vol. 3018, pp. 143\u2013159. Springer, Berlin (2004)"},{"issue":"3","key":"9010_CR12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1017\/S0956796805005782","volume":"16","author":"D. Biernacki","year":"2006","unstructured":"Biernacki, D., Danvy, O.: A simple proof of a folklore theorem about delimited control. J. Funct. Program. 16(3), 269\u2013280 (2006)","journal-title":"J. Funct. Program."},{"key":"9010_CR13","doi-asserted-by":"crossref","unstructured":"Biernacki, D., Danvy, O., Millikin, K.: A dynamic continuation-passing style for dynamic delimited continuations. Report RS-05-16, BRICS, Denmark (2005)","DOI":"10.7146\/brics.v12i16.21882"},{"issue":"1","key":"9010_CR14","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.ipl.2005.04.003","volume":"96","author":"D. Biernacki","year":"2005","unstructured":"Biernacki, D., Danvy, O., Shan, C.-c.: On the dynamic extent of delimited continuations. Inf. Process. Lett. 96(1), 7\u201317 (2005)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"9010_CR15","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.scico.2006.01.002","volume":"60","author":"D. Biernacki","year":"2006","unstructured":"Biernacki, D., Danvy, O., Shan, C.-c.: On the static and dynamic extents of delimited continuations. Sci. Comput. Program. 60(3), 274\u2013297 (2006)","journal-title":"Sci. Comput. Program."},{"key":"9010_CR16","first-page":"174","volume-title":"POPL\u201998: Conference Record of the Annual ACM Symposium on Principles of Programming Languages","author":"W.D. Clinger","year":"1998","unstructured":"Clinger, W.D.: Proper tail recursion and space efficiency. In: POPL\u201998: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pp. 174\u2013185. ACM Press, New York (1998)"},{"key":"9010_CR17","series-title":"ACM SIGPLAN Notices","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/301618.301641","volume-title":"PLDI\u201999: Proceedings of the ACM Conference on Programming Language Design and Implementation","author":"K. Crary","year":"1999","unstructured":"Crary, K., Harper, R., Puri, S.: What is a recursive module? In: PLDI\u201999: Proceedings of the ACM Conference on Programming Language Design and Implementation. ACM SIGPLAN Notices, vol. 34(5), pp. 50\u201363. ACM Press, New York (1999)"},{"issue":"3","key":"9010_CR18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0167-6423(94)00003-4","volume":"22","author":"O. Danvy","year":"1994","unstructured":"Danvy, O.: Back to direct style. Sci. Comput. Program. 22(3), 183\u2013195 (1994)","journal-title":"Sci. Comput. Program."},{"key":"9010_CR19","first-page":"242","volume-title":"POPL\u201996: Conference Record of the Annual ACM Symposium on Principles of Programming Languages","author":"O. Danvy","year":"1996","unstructured":"Danvy, O.: Type-directed partial evaluation. In: POPL\u201996: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pp. 242\u2013257. ACM Press, New York (1996)"},{"key":"9010_CR20","unstructured":"Danvy, O.: On evaluation contexts, continuations, and the rest of the computation. In: Thielecke, H. (ed.) CW\u201904: Proceedings of the 4th ACM SIGPLAN Continuations Workshop, Tech. Rep. CSR-04-1, School of Computer Science, University of Birmingham (2004)"},{"key":"9010_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/11431664_4","volume-title":"Implementation and Application of Functional Languages: 16th International Workshop, IFL 2004","author":"O. Danvy","year":"2005","unstructured":"Danvy, O.: A rational deconstruction of Landin\u2019s SECD machine. In: Grelck, C., Huch, F., Michaelson, G., Trinder, P.W. (eds.) Implementation and Application of Functional Languages: 16th International Workshop, IFL 2004. Lecture Notes in Computer Science, vol. 3474, pp. 52\u201371. Springer, Berlin (2005)"},{"key":"9010_CR22","unstructured":"Danvy, O., Filinski, A.: A functional abstraction of typed contexts. Tech. Rep. 89\/12, DIKU, University of Copenhagen, Denmark. http:\/\/www.daimi.au.dk\/~danvy\/Papers\/fatc.ps.gz (1989)"},{"key":"9010_CR23","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/91556.91622","volume-title":"Proceedings of the 1990 ACM Conference on Lisp and Functional Programming","author":"O. Danvy","year":"1990","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pp. 151\u2013160. ACM Press, New York (1990)"},{"issue":"4","key":"9010_CR24","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1017\/S0960129500001535","volume":"2","author":"O. Danvy","year":"1992","unstructured":"Danvy, O., Filinski, A.: Representing control: a study of the CPS transformation. Math. Struct. Comput. Sci. 2(4), 361\u2013391 (1992)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9010_CR25","series-title":"Lisp Pointers","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/141471.141564","volume-title":"Proceedings of the 1992 ACM Conference on Lisp and Functional Programming","author":"O. Danvy","year":"1992","unstructured":"Danvy, O., Lawall, J.L.: Back to direct style II: first-class continuations. In: Clinger, W.D. (ed.) Proceedings of the 1992 ACM Conference on Lisp and Functional Programming. Lisp Pointers, vol. V(1), pp. 299\u2013310. ACM Press, New York (1992)"},{"key":"9010_CR26","first-page":"162","volume-title":"Proceedings of the 3rd International Conference on Principles and Practice of Declarative Programming","author":"O. Danvy","year":"2001","unstructured":"Danvy, O., Nielsen, L.R.: Defunctionalization at work. In: Proceedings of the 3rd International Conference on Principles and Practice of Declarative Programming, pp. 162\u2013174. ACM Press, New York (2001)"},{"key":"9010_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-49099-X_15","volume-title":"Programming Languages and Systems: Proceedings of ESOP\u201999, 8th European Symposium on Programming","author":"O. Danvy","year":"1999","unstructured":"Danvy, O., Yang, Z.: An operational investigation of the CPS hierarchy. In: Swierstra, S.D. (ed.) Programming Languages and Systems: Proceedings of ESOP\u201999, 8th European Symposium on Programming. Lecture Notes in Computer Science, vol. 1576, pp. 224\u2013242. Springer, Berlin (1999)"},{"key":"9010_CR28","unstructured":"Double, C.: Partial continuations. http:\/\/www.double.co.nz\/scheme\/partial-continuations\/partial- continuations.html (2004)"},{"key":"9010_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-45699-6_4","volume-title":"APPSEM 2000: International Summer School on Applied Semantics, Advanced Lectures","author":"P. Dybjer","year":"2002","unstructured":"Dybjer, P., Filinski, A.: Normalization and partial evaluation. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000: International Summer School on Applied Semantics, Advanced Lectures. Lecture Notes in Computer Science, vol. 2395, pp. 137\u2013192. Springer, Berlin (2002)"},{"key":"9010_CR30","unstructured":"Dybvig, R.K., Peyton Jones, S.L., Sabry, A.: A monadic framework for delimited continuations. Tech. Rep. 615, Computer Science Department, Indiana University (2005)"},{"key":"9010_CR31","unstructured":"Felleisen, M.: The calculi of \u03bb v -CS conversion: a syntactic theory of control and state in imperative higher-order programming languages. Ph.D. thesis, Computer Science Department, Indiana University. Also as Tech. Rep. 226 (1987)"},{"key":"9010_CR32","first-page":"180","volume-title":"POPL\u201988: Conference Record of the Annual ACM Symposium on Principles of Programming Languages","author":"M. Felleisen","year":"1988","unstructured":"Felleisen, M.: The theory and practice of first-class prompts. In: POPL\u201988: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pp. 180\u2013190. ACM Press, New York (1988)"},{"issue":"1\u20133","key":"9010_CR33","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0167-6423(91)90036-W","volume":"17","author":"M. Felleisen","year":"1991","unstructured":"Felleisen, M.: On the expressive power of programming languages. Sci. Comput. Program. 17(1\u20133), 35\u201375 (1991)","journal-title":"Sci. Comput. Program."},{"key":"9010_CR34","first-page":"193","volume-title":"Formal Description of Programming Concepts III","author":"M. Felleisen","year":"1987","unstructured":"Felleisen, M., Friedman, D.P.: Control operators, the SECD machine, and the \u03bb-calculus. In: Wirsing, M. (ed.) Formal Description of Programming Concepts III, pp. 193\u2013217. Elsevier, Amsterdam (1987)"},{"key":"9010_CR35","unstructured":"Felleisen, M., Friedman, D.P., Duba, B.F., Merrill, J.: Beyond continuations. Tech. Rep. 216, Computer Science Department, Indiana University (1987)"},{"key":"9010_CR36","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/62678.62684","volume-title":"Proceedings of the 1988 ACM Conference on Lisp and Functional Programming","author":"M. Felleisen","year":"1988","unstructured":"Felleisen, M., Wand, M., Friedman, D.P., Duba, B.F.: Abstract continuations: a mathematical semantics for handling full jumps. In: Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, pp. 52\u201362. ACM Press, New York (1988)"},{"key":"9010_CR37","first-page":"446","volume-title":"POPL\u201994: Conference Record of the Annual ACM Symposium on Principles of Programming Languages","author":"A. Filinski","year":"1994","unstructured":"Filinski, A.: Representing monads. In: POPL\u201994: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pp. 446\u2013457. ACM Press, New York (1994)"},{"key":"9010_CR38","unstructured":"Filinski, A.: Controlling effects. Ph.D. thesis, School of Computer Science, Carnegie Mellon University. Also as Tech. Rep. CMU-CS-96-119 (1996)"},{"key":"9010_CR39","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/292540.292557","volume-title":"POPL\u201999: Conference Record of the Annual ACM Symposium on Principles of Programming Languages","author":"A. Filinski","year":"1999","unstructured":"Filinski, A.: Representing layered monads. In: POPL\u201999: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pp. 175\u2013188. ACM Press, New York (1999)"},{"key":"9010_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-45413-6_15","volume-title":"TLCA 2001: Proceedings of the 5th International Conference on Typed Lambda Calculi and Applications","author":"A. Filinski","year":"2001","unstructured":"Filinski, A.: Normalization by evaluation for the computational lambda-calculus. In: Abramsky, S. (ed.) TLCA 2001: Proceedings of the 5th International Conference on Typed Lambda Calculi and Applications. Lecture Notes in Computer Science, vol. 2044, pp. 151\u2013165. Springer, Berlin (2001)"},{"key":"9010_CR41","first-page":"245","volume-title":"POPL\u201985: Conference Record of the Annual ACM Symposium on Principles of Programming Languages","author":"D.P. Friedman","year":"1985","unstructured":"Friedman, D.P., Haynes, C.T.: Constraining control. In: POPL\u201985: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pp. 245\u2013254. ACM Press, New York (1985)"},{"key":"9010_CR42","volume-title":"Essentials of Programming Languages","author":"D.P. Friedman","year":"2001","unstructured":"Friedman, D.P., Wand, M., Haynes, C.T.: Essentials of Programming Languages, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"9010_CR43","series-title":"ACM SIGPLAN Notices","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/351240.351261","volume-title":"ICFP\u201900: Proceedings of the ACM International Conference on Functional Programming","author":"V. Gapeyev","year":"2000","unstructured":"Gapeyev, V., Levin, M.Y., Pierce, B.C.: Recursive subtyping revealed. In: ICFP\u201900: Proceedings of the ACM International Conference on Functional Programming. ACM SIGPLAN Notices, vol. 35(9), pp. 221\u2013231. ACM Press, New York (2000)"},{"key":"9010_CR44","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1145\/581478.581504","volume-title":"ICFP\u201902: Proceedings of the ACM International Conference on Functional Programming","author":"M. Gasbichler","year":"2002","unstructured":"Gasbichler, M., Sperber, M.: Final shift for call\/cc: direct implementation of shift and reset. In: ICFP\u201902: Proceedings of the ACM International Conference on Functional Programming, pp. 271\u2013282. ACM Press, New York (2002)"},{"key":"9010_CR45","doi-asserted-by":"crossref","unstructured":"Graunke, P.T.: Web interactions. Ph.D. thesis, College of Computer Science, Northeastern University (2003)","DOI":"10.1007\/3-540-36575-3_17"},{"issue":"2\u20133","key":"9010_CR46","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/A:1012992731199","volume":"14","author":"B. Grobauer","year":"2001","unstructured":"Grobauer, B., Yang, Z.: The second Futamura projection for type-directed partial evaluation. Higher-Order Symb. Comput. 14(2\u20133), 173\u2013219 (2001)","journal-title":"Higher-Order Symb. Comput."},{"key":"9010_CR47","first-page":"12","volume-title":"Functional Programming Languages and Computer Architecture: 7th Conference","author":"C.A. Gunter","year":"1995","unstructured":"Gunter, C.A., R\u00e9my, D., Riecke, J.G.: A generalization of exceptions and control in ML-like languages. In: Peyton Jones, S.L. (ed.) Functional Programming Languages and Computer Architecture: 7th Conference, pp. 12\u201323. ACM Press, New York (1995)"},{"key":"9010_CR48","unstructured":"Gunter, C.A., R\u00e9my, D., Riecke, J.G.: Return types for functional continuations. http:\/\/pauillac.inria.fr\/~remy\/work\/cupto\/ (1998)"},{"key":"9010_CR49","first-page":"128","volume-title":"Proceedings of the 2nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","author":"R. Hieb","year":"1990","unstructured":"Hieb, R., Dybvig, R.K.: Continuations and concurrency. In: Proceedings of the 2nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 128\u2013136. ACM Press, New York (1990)"},{"issue":"6","key":"9010_CR50","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1017\/S0956796801004129","volume":"11","author":"R. Hinze","year":"2001","unstructured":"Hinze, R., Jeuring, J.: Weaving a web. J. Funct. Program. 11(6), 681\u2013689 (2001)","journal-title":"J. Funct. Program."},{"issue":"5","key":"9010_CR51","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1017\/S0956796897002864","volume":"7","author":"G. Huet","year":"1997","unstructured":"Huet, G.: The zipper. J. Funct. Program. 7(5), 549\u2013554 (1997)","journal-title":"J. Funct. Program."},{"key":"9010_CR52","first-page":"158","volume-title":"POPL\u201988: Conference Record of the Annual ACM Symposium on Principles of Programming Languages","author":"G.F. Johnson","year":"1988","unstructured":"Johnson, G.F., Duggan, D.: Stores and partial continuations as first-class objects in a language and its environment. In: POPL\u201988: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pp. 158\u2013168. ACM Press, New York (1988)"},{"issue":"1","key":"9010_CR53","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1010051815785","volume":"11","author":"R. Kelsey","year":"1998","unstructured":"Kelsey, R., Clinger, W.D., Rees, J., Abelson, H., Dybvig, R.K., Haynes, C.T., Rozas, G.J., Adams IV, N.I., Friedman, D.P., Kohlbecker, E., Steele, G.L., Bartley, D.H., Halstead, R., Oxley, D., Sussman, G.J., Brooks, G., Hanson, C., Pitman, K.M., Wand, M.: Revised5 report on the algorithmic language Scheme. Higher-Order Symb. Comput. 11(1), 7\u2013105 (1998). Also as ACM SIGPLAN Notices 33(9), 26\u201376","journal-title":"Higher-Order Symb. Comput."},{"key":"9010_CR54","unstructured":"Kiselyov, O.: General ways to traverse collections. http:\/\/okmij.org\/ftp\/Scheme\/enumerators-callcc.html ; http:\/\/okmij.org\/ftp\/Computation\/Continuations.html (2004)"},{"key":"9010_CR55","unstructured":"Kiselyov, O.: How to remove a dynamic prompt: static and dynamic delimited continuation operators are equally expressible. Tech. Rep. 611, Computer Science Department, Indiana University (2005)"},{"key":"9010_CR56","unstructured":"Kiselyov, O.: Two-hole zippers and transactions of various isolation modes. Message to the Haskell mailing list; http:\/\/okmij.org\/ftp\/Haskell\/Zipper2.lhs ; http:\/\/okmij.org\/ftp\/Computation\/Continuations.html (2005)"},{"key":"9010_CR57","unstructured":"Kiselyov, O.: Zipper as a delimited continuation. Message to the Haskell mailing list; http:\/\/okmij.org\/ftp\/Haskell\/Zipper1.lhs ; http:\/\/okmij.org\/ftp\/Computation\/Continuations.html (2005)"},{"key":"9010_CR58","unstructured":"Kiselyov, O.: Native delimited continuations in (byte-code) OCaml. http:\/\/okmij.org\/ftp\/ Computation\/Continuations.html#caml-shift (2006)"},{"key":"9010_CR59","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1145\/1086365.1086390","volume-title":"ICFP\u201905: Proceedings of the ACM International Conference on Functional Programming","author":"O. Kiselyov","year":"2005","unstructured":"Kiselyov, O., Shan, C.-c., Friedman, D.P., Sabry, A.: Backtracking, interleaving, and terminating monad transformers (functional pearl). In: ICFP\u201905: Proceedings of the ACM International Conference on Functional Programming, pp. 192\u2013203. ACM Press, New York (2005)"},{"key":"9010_CR60","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/1159803.1159808","volume-title":"ICFP \u201906: Proceedings of the ACM International Conference on Functional Programming","author":"O. Kiselyov","year":"2006","unstructured":"Kiselyov, O., Shan, C.-C., Sabry, A.: Delimited dynamic binding. In: ICFP \u201906: Proceedings of the ACM International Conference on Functional Programming, pp. 26\u201337. ACM Press, New York (2006)"},{"key":"9010_CR61","unstructured":"Krivine, J.-L.: Un interpr\u00e9teur du lambda-calcul. http:\/\/www.pps.jussieu.fr\/~krivine\/articles\/interprt.pdf (1985)"},{"issue":"4","key":"9010_CR62","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P.J. Landin","year":"1964","unstructured":"Landin, P.J.: The mechanical evaluation of expressions. Comput. J. 6(4), 308\u2013320 (1964)","journal-title":"Comput. J."},{"key":"9010_CR63","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/182409.182483","volume-title":"Proceedings of the 1994 ACM Conference on Lisp and Functional Programming","author":"J.L. Lawall","year":"1994","unstructured":"Lawall, J.L., Danvy, O.: Continuation-based partial evaluation. In: Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, pp. 227\u2013238. ACM Press, New York (1994)"},{"key":"9010_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-15648-8_17","volume-title":"Logics of Programs","author":"A.R. Meyer","year":"1985","unstructured":"Meyer, A.R., Wand, M.: Continuation semantics in typed lambda-calculi (summary). In: Parikh, R. (ed.) Logics of Programs. Lecture Notes in Computer Science, vol. 193, pp. 219\u2013224. Springer, Berlin (1985)"},{"issue":"1","key":"9010_CR65","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comput. 93(1), 55\u201392 (1991)","journal-title":"Inf. Comput."},{"key":"9010_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/11538363_6","volume-title":"Computer Science Logic: 19th International Workshop, CSL 2005","author":"T. Murphy VII","year":"2005","unstructured":"Murphy VII, T., Crary, K., Harper, R.: Distributed control flow with classical modal logic. In: Ong, C.-H.L. (ed.) Computer Science Logic: 19th International Workshop, CSL 2005. Lecture Notes in Computer Science, vol. 3634, pp. 51\u201369. Springer, Berlin (2005)"},{"key":"9010_CR67","unstructured":"Murthy, C.R.: Control operators, hierarchies, and pseudo-classical type systems: A-translation at work. In: Danvy O., Talcott C. (eds.) CW\u201992: Proceedings of the ACM SIGPLAN Workshop on Continuations, pp.\u00a049\u201371. Tech. Rep. STAN-CS-92-1426, Department of Computer Science, Stanford University. ftp:\/\/cstr.stanford.edu\/pub\/cstr\/reports\/cs\/tr\/92\/1426 (1992)"},{"issue":"2","key":"9010_CR68","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the \u03bb-calculus. Theor. Comput. Sci. 1(2), 125\u2013159 (1975)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9010_CR69","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/181889.181891","volume":"6","author":"C. Queinnec","year":"1993","unstructured":"Queinnec, C.: A library of high-level control operators. Lisp Pointers 6(4), 11\u201326 (1993)","journal-title":"Lisp Pointers"},{"issue":"4","key":"9010_CR70","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s10990-004-4866-z","volume":"17","author":"C. Queinnec","year":"2004","unstructured":"Queinnec, C.: Continuations and web servers. Higher-Order Symb. Comput. 17(4), 277\u2013295 (2004)","journal-title":"Higher-Order Symb. Comput."},{"key":"9010_CR71","first-page":"174","volume-title":"POPL\u201991: Conference Record of the Annual ACM Symposium on Principles of Programming Languages","author":"C. Queinnec","year":"1991","unstructured":"Queinnec, C., Serpette, B.: A dynamic extent control operator for partial continuations. In: POPL\u201991: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pp. 174\u2013184. ACM Press, New York (1991)"},{"key":"9010_CR72","first-page":"717","volume-title":"Proceedings of the ACM National Conference","author":"J.C. Reynolds","year":"1972","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. In: Proceedings of the ACM National Conference, vol. 2, pp. 717\u2013740. ACM Press, New York. Reprinted with a foreword in Higher-Order Symb. Comput. 11(4), 363\u2013397 (1972)"},{"issue":"3\u20134","key":"9010_CR73","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01019462","volume":"6","author":"A. Sabry","year":"1993","unstructured":"Sabry, A., Felleisen, M.: Reasoning about programs in continuation-passing style. Lisp Symb. Comput. 6(3\u20134), 289\u2013360 (1993)","journal-title":"Lisp Symb. Comput."},{"key":"9010_CR74","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1086365.1086370","volume-title":"ICFP\u201905: Proceedings of the ACM International Conference on Functional Programming","author":"P. Sewell","year":"2005","unstructured":"Sewell, P., Leifer, J.J., Wansbrough, K., Nardelli, F.Z., Allen-Williams, M., Habouzit, P., Vafeiadis, V.: Acute: high-level programming language design for distributed computation. In: ICFP\u201905: Proceedings of the ACM International Conference on Functional Programming, pp. 15\u201326. ACM Press, New York (2005)"},{"key":"9010_CR75","unstructured":"Shan, C.-c.: Delimited continuations in natural language: quantification and polarity sensitivity. In: Thielecke H. (ed.) CW\u201904: Proceedings of the 4th ACM SIGPLAN Continuations Workshop, pp. 55\u201364. Tech. Rep. CSR-04-1, School of Computer Science, University of Birmingham (2004)"},{"key":"9010_CR76","series-title":"ACM SIGPLAN Notices","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/155090.155104","volume-title":"PLDI\u201993: Proceedings of the ACM Conference on Programming Language Design and Implementation","author":"D. Sitaram","year":"1993","unstructured":"Sitaram, D.: Handling control. In: PLDI\u201993: Proceedings of the ACM Conference on Programming Language Design and Implementation. ACM SIGPLAN Notices, vol. 28(6), pp. 147\u2013155. ACM Press, New York (1993)"},{"issue":"1","key":"9010_CR77","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF01806126","volume":"3","author":"D. Sitaram","year":"1990","unstructured":"Sitaram, D., Felleisen, M.: Control delimiters and their hierarchies. Lisp Symb. Comput. 3(1), 67\u201399 (1990)","journal-title":"Lisp Symb. Comput."},{"key":"9010_CR78","unstructured":"Steele, G.L., Jr.: RABBIT: a compiler for SCHEME. Master\u2019s thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology. Also as Memo 474, Artificial Intelligence Laboratory, Massachusetts Institute of Technology (1978)"},{"key":"9010_CR79","doi-asserted-by":"crossref","unstructured":"Strachey, C., Wadsworth, C.P.: Continuations: a mathematical semantics for handling full jumps. Technical Monograph PRG-11, Programming Research Group, Oxford University Computing Laboratory. Reprinted with a foreword in Higher-Order Symb. Comput. 13(1\u20132), 135\u2013152 (1974)","DOI":"10.1023\/A:1010026413531"},{"key":"9010_CR80","unstructured":"Sumii, E.: An implementation of transparent migration on standard Scheme. In: Felleisen M. (ed.) Proceedings of the Workshop on Scheme and Functional Programming, pp. 61\u201363. Tech. Rep. 00-368, Department of Computer Science, Rice University (2000)"},{"key":"9010_CR81","unstructured":"Thielecke, H.: Contrasting exceptions and continuations (2001)"},{"issue":"5","key":"9010_CR82","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1017\/S0956796899003469","volume":"9","author":"P. Thiemann","year":"1999","unstructured":"Thiemann, P.: Combinators for program generation. J. Funct. Program. 9(5), 483\u2013525 (1999)","journal-title":"J. Funct. Program."},{"issue":"1","key":"9010_CR83","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF01019944","volume":"7","author":"P.L. Wadler","year":"1994","unstructured":"Wadler, P.L.: Monads and composable continuations. Lisp Symb. Comput. 7(1), 39\u201356 (1994)","journal-title":"Lisp Symb. Comput."},{"issue":"1","key":"9010_CR84","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/322169.322183","volume":"27","author":"M. Wand","year":"1980","unstructured":"Wand, M.: Continuation-based program transformation strategies. J. ACM 27(1), 164\u2013180 (1980)","journal-title":"J. ACM"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9010-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-007-9010-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9010-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T16:22:52Z","timestamp":1708273372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-007-9010-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,24]]},"references-count":84,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,11,20]]}},"alternative-id":["9010"],"URL":"https:\/\/doi.org\/10.1007\/s10990-007-9010-4","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,24]]}}}