{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:21:56Z","timestamp":1770294116795,"version":"3.49.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","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":[[2009,9]]},"DOI":"10.1007\/s10990-007-9006-0","type":"journal-article","created":{"date-parts":[[2007,10,23]],"date-time":"2007-10-23T16:18:18Z","timestamp":1193156298000},"page":"233-273","source":"Crossref","is-referenced-by-count":20,"title":["A type-theoretic foundation of delimited continuations"],"prefix":"10.1007","volume":"22","author":[{"given":"Zena M.","family":"Ariola","sequence":"first","affiliation":[]},{"given":"Hugo","family":"Herbelin","sequence":"additional","affiliation":[]},{"given":"Amr","family":"Sabry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,24]]},"reference":[{"key":"9006_CR1","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1007\/3-540-45061-0_68","volume-title":"Thirtieth International Colloquium on Automata, Languages and Programming, ICALP\u201903, Eindhoven, The Netherlands, June 30\u2013July 4, 2003","author":"Z.M. Ariola","year":"2003","unstructured":"Ariola, Z.M., Herbelin, H.: Minimal classical logic and control operators. In: Thirtieth International Colloquium on Automata, Languages and Programming, ICALP\u201903, Eindhoven, The Netherlands, June 30\u2013July 4, 2003. Lecture Notes in Comput. Sci., vol.\u00a02719, pp.\u00a0871\u2013885. Springer, New York (2003)"},{"key":"9006_CR2","doi-asserted-by":"crossref","unstructured":"Ariola, Z.M., Herbelin, H.: Control reduction theories: the benefit of structural substitution. J.\u00a0Funct. Program. (2007, to appear)","DOI":"10.1017\/S0956796807006612"},{"key":"9006_CR3","first-page":"40","volume-title":"ACM SIGPLAN 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: ACM SIGPLAN International Conference on Functional Programming, pp.\u00a040\u201353. ACM Press, New York (2004)"},{"key":"9006_CR4","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/S1571-0661(04)80878-8","volume":"42","author":"K. Baba","year":"2001","unstructured":"Baba, K., Hirokawa, S., Fujita, K.: Parallel reduction in type free \u03bb \u03bc-calculus. Electron. Notes Theor. Comput. Sci. 42, 52\u201366 (2001)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"9006_CR5","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BFb0037097","volume-title":"Proceedings 1st Intl. Conf. on Typed Lambda Calculi and Applications, TLCA\u201993, Utrecht, The Netherlands, 16\u201318 March 1993","author":"F. Barbanera","year":"1993","unstructured":"Barbanera, F., Berardi, S.: Extracting constructive content from classical logic via control-like reductions. In: Bezem, M., Groote, J.F. (eds.) Proceedings 1st Intl. Conf. on Typed Lambda Calculi and Applications, TLCA\u201993, Utrecht, The Netherlands, 16\u201318 March 1993. Lecture Notes in Comput. Sci., vol.\u00a0664, pp.\u00a045\u201359. Springer, Berlin (1993)"},{"issue":"1\u20132","key":"9006_CR6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0304-3975(99)00124-3","volume":"254","author":"T. Crolard","year":"2001","unstructured":"Crolard, T.: Subtractive logic. Theor. Comput. Sci. 254(1\u20132), 151\u2013185 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9006_CR7","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1093\/logcom\/14.4.529","volume":"14","author":"T. Crolard","year":"2004","unstructured":"Crolard, T.: A formulae-as-types interpretation of subtractive logic. J.\u00a0Log. Comput. 14(4), 529\u2013570 (2004) (Special issue on Modalities in Constructive Logics and Type Theories)","journal-title":"J.\u00a0Log. Comput."},{"key":"9006_CR8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/351240.351262","volume-title":"ACM SIGPLAN International Conference on Functional Programming","author":"P.-L. Curien","year":"2000","unstructured":"Curien, P.-L., Herbelin, H.: The duality of computation. In: ACM SIGPLAN International Conference on Functional Programming, pp.\u00a0233\u2013243. ACM Press, New York (2000)"},{"key":"9006_CR9","unstructured":"Danvy, O., Filinski, A.: A functional abstraction of typed contexts. Technical Report 89\/12, DIKU, University of Copenhagen, Copenhagen, Denmark (1989)"},{"key":"9006_CR10","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, Nice","author":"O. Danvy","year":"1990","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: Proceedings of the 1990 ACM Conference on LISP and Functional Programming, Nice, pp.\u00a0151\u2013160. ACM Press, New York (1990)"},{"issue":"1","key":"9006_CR11","doi-asserted-by":"crossref","first-page":"407","DOI":"10.2307\/2694930","volume":"66","author":"R. David","year":"2001","unstructured":"David, R., Py, W.: Lambda-mu-calculus and B\u00f6hm\u2019s theorem. J.\u00a0Symb. Log. 66(1), 407\u2013413 (2001)","journal-title":"J.\u00a0Symb. Log."},{"key":"9006_CR12","unstructured":"Dybvig, R.K., Peyton-Jones, S., Sabry, A.: A monadic framework for subcontinuations. J.\u00a0Funct. Program. (2007, to appear). http:\/\/journals.cambridge.org\/action\/displayIssue?iid=168229"},{"key":"9006_CR13","first-page":"180","volume-title":"Proceedings of the 15th ACM Symposium on Principles of Programming Languages (POPL \u201988)","author":"M. Felleisen","year":"1988","unstructured":"Felleisen, M.: The theory and practice of first-class prompts. In: Proceedings of the 15th ACM Symposium on Principles of Programming Languages (POPL \u201988), pp.\u00a0180\u2013190. ACM Press, New York (1988)"},{"key":"9006_CR14","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-52592-0_60","volume-title":"ESOP \u201990 3rd European Symposium on Programming, Copenhagen, Denmark","author":"M. Felleisen","year":"1990","unstructured":"Felleisen, M.: On the expressive power of programming languages. In: Jones, N. (ed.) ESOP \u201990 3rd European Symposium on Programming, Copenhagen, Denmark. Lecture Notes in Comput. Sci., vol.\u00a0432, pp.\u00a0134\u2013151. Springer, New York (1990)"},{"issue":"2","key":"9006_CR15","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M. Felleisen","year":"1992","unstructured":"Felleisen, M., Hieb, R.: The revised report on the syntactic theories of sequential control and state. Theor. Comput. Sci. 103(2), 235\u2013271 (1992)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9006_CR16","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 52(3), 205\u2013237 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"9006_CR17","first-page":"52","volume-title":"Conference on LISP and Functional Programming, Snowbird, Utah","author":"M. Felleisen","year":"1988","unstructured":"Felleisen, M., Wand, M., Friedman, D.P., Duba, B.F.: Abstract continuations: a mathematical semantics for handling full functional jumps. In: Conference on LISP and Functional Programming, Snowbird, Utah, pp.\u00a052\u201362. ACM Press, New York (1988)"},{"key":"9006_CR18","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/BFb0018355","volume-title":"Category Theory and Computer Science, Manchester, UK, September 5\u20138, 1989, Proceedings","author":"A. Filinski","year":"1989","unstructured":"Filinski, A.: Declarative continuations: an investigation of duality in programming language semantics. In: Category Theory and Computer Science, Manchester, UK, September 5\u20138, 1989, Proceedings. Lecture Notes in Comput. Sci., vol.\u00a0389, pp.\u00a0224\u2013249. Springer, New York (1989)"},{"key":"9006_CR19","first-page":"446","volume-title":"Conf. Record 21st ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL\u201994, Portland, OR, USA, 17\u201321 Jan. 1994","author":"A. Filinski","year":"1994","unstructured":"Filinski, A.: Representing monads. In: Conf. Record 21st ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL\u201994, Portland, OR, USA, 17\u201321 Jan. 1994, pp.\u00a0446\u2013457. ACM Press, New York (1994)"},{"key":"9006_CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/292540.292557","volume-title":"Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"A. Filinski","year":"1999","unstructured":"Filinski, A.: Representing layered monads. In: Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.\u00a0175\u2013188. ACM Press, New York (1999)"},{"key":"9006_CR21","series-title":"SIGPLAN Notices","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1145\/800235.807077","volume-title":"Proc. ACM Conference on Proving Assertions About Programs","author":"M.J. Fischer","year":"1972","unstructured":"Fischer, M.J.: Lambda-calculus schemata. In: Proc. ACM Conference on Proving Assertions About Programs. SIGPLAN Notices, vol.\u00a07(1), pp.\u00a0104\u2013109. ACM Press, New York (1972)"},{"issue":"3\/4","key":"9006_CR22","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01019461","volume":"6","author":"M.J. Fischer","year":"1993","unstructured":"Fischer, M.J.: Lambda-calculus schemata. Lisp Symb. Comput. 6(3\/4), 259\u2013288 (1993). http:\/\/www.brics.dk\/~hosc\/vol06\/03-fischer.html. Earlier version available in the proceedings of an ACM Conference on Proving Assertions about Programs, SIGPLAN Notices, vol.\u00a07, no.\u00a01, January 1972","journal-title":"Lisp Symb. Comput."},{"key":"9006_CR23","first-page":"47","volume-title":"Conf. Record 17th Annual ACM Symp. on Principles of Programming Languages, POPL\u201990, San Francisco, CA, USA, 17\u201319 Jan. 1990","author":"T.G. Griffin","year":"1990","unstructured":"Griffin, T.G.: The formulae-as-types notion of control. In: Conf. Record 17th Annual ACM Symp. on Principles of Programming Languages, POPL\u201990, San Francisco, CA, USA, 17\u201319 Jan. 1990, pp.\u00a047\u201357. ACM Press, New York (1990)"},{"key":"9006_CR24","volume-title":"Functional Programming & Computer Architecture","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: Functional Programming & Computer Architecture. ACM Press, New York (1995)"},{"key":"9006_CR25","unstructured":"Guzm\u00e1n, J., Su\u00e1rez, A.: An extended type system for exceptions. In: Record of the fifth ACM SIGPLAN workshop on ML and its Applications. Also appeared as Research Report 2265, INRIA, BP 105-78153, Le Chesnay Cedex, France (1994)"},{"key":"9006_CR26","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/3-540-16492-8_117","volume-title":"Proceedings of the Third International Conference on Logic Programming","author":"C.T. Haynes","year":"1986","unstructured":"Haynes, C.T.: Logic continuations. In: Proceedings of the Third International Conference on Logic Programming. Lecture Notes in Comput. Sci., vol.\u00a0225, pp.\u00a0671\u2013685. Springer, Berlin (1986)"},{"key":"9006_CR27","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0096-0551(86)90007-X","volume":"11","author":"C.T. Haynes","year":"1986","unstructured":"Haynes, C.T., Friedman, D., Wand, M.: Obtaining coroutines from continuations. J.\u00a0Comput. Lang. 11, 143\u2013153 (1986)","journal-title":"J.\u00a0Comput. Lang."},{"issue":"3","key":"9006_CR28","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1093\/logcom\/11.3.431","volume":"11","author":"H. Herbelin","year":"2001","unstructured":"Herbelin, H.: Explicit substitutions and reducibility. J.\u00a0Log. Comput. 11(3), 431\u2013451 (2001)","journal-title":"J.\u00a0Log. Comput."},{"key":"9006_CR29","series-title":"SIGPLAN Notices","first-page":"128","volume-title":"PPoPP \u201990, Symposium on Principles and Practice of Parallel Programming","author":"R. Hieb","year":"1990","unstructured":"Hieb, R., Dybvig, R.K.: Continuations and concurrency. In: PPoPP \u201990, Symposium on Principles and Practice of Parallel Programming, Seattle, Washington, March 14\u201316. SIGPLAN Notices, vol.\u00a025(3), pp.\u00a0128\u2013136. ACM Press, New York (1990)"},{"issue":"1","key":"9006_CR30","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01019946","volume":"7","author":"R. Hieb","year":"1994","unstructured":"Hieb, R., Dybvig, K., Anderson, C.W. III: Subcontinuations. Lisp Symb. Comput. 7(1), 83\u2013110 (1994)","journal-title":"Lisp Symb. Comput."},{"issue":"4","key":"9006_CR31","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1017\/S0960129500001195","volume":"5","author":"M. Hofmann","year":"1995","unstructured":"Hofmann, M.: Sound and complete axiomatisations of call-by-balue control operators. Math. Struct. Comput. Sci. 5(4), 461\u2013482 (1995)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9006_CR32","first-page":"479","volume-title":"To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism","author":"W. Howard","year":"1980","unstructured":"Howard, W.: The formulae-as-types notion of construction. In: Hindley, J.R., Seldin, J.P. (eds.) To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism, pp.\u00a0479\u2013490. Academic, New York (1980)"},{"key":"9006_CR33","doi-asserted-by":"crossref","unstructured":"Kameyama, Y.: A type-theoretic study on partial continuations. In: IFIP TCS, pp.\u00a0489\u2013504 (2000)","DOI":"10.1007\/3-540-44929-9_34"},{"key":"9006_CR34","unstructured":"Kameyama, Y.: Towards logical understanding of delimited continuations. In: Proceedings of the Third ACM SIGPLAN Workshop on Continuations (CW\u201901) (2001)"},{"key":"9006_CR35","series-title":"SIGPLAN Notices","first-page":"177","volume-title":"Proc. of 8th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP\u201903, Uppsala, Sweden, 25\u201329 Aug. 2003","author":"Y. Kameyama","year":"2003","unstructured":"Kameyama, Y., Hasegawa, M.: A sound and complete axiomatization of delimited continuations. In: Proc. of 8th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP\u201903, Uppsala, Sweden, 25\u201329 Aug. 2003. SIGPLAN Notices, vol.\u00a038(9), pp.\u00a0177\u2013188. ACM Press, New York (2003)"},{"issue":"1","key":"9006_CR36","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1023\/A:1010020917337","volume":"12","author":"M. Lillibridge","year":"1999","unstructured":"Lillibridge, M.: Unchecked exceptions can be strictly more powerful than Call\/CC. Higher-Order Symb. Comput. 12(1), 75\u2013104 (1999)","journal-title":"Higher-Order Symb. Comput."},{"key":"9006_CR37","doi-asserted-by":"crossref","unstructured":"Moggi, E.: Computational lambda-calculus and monads. In: Proceedings of the Fourth Annual Symposium on Logic in Computer Science, pp.\u00a014\u201323. IEEE Press (1989)","DOI":"10.1109\/LICS.1989.39155"},{"issue":"3","key":"9006_CR38","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1010087314987","volume":"11","author":"L. Moreau","year":"1998","unstructured":"Moreau, L.: A syntactic theory of dynamic binding. Higher-Order Symb. Comput. 11(3), 233\u2013279 (1998)","journal-title":"Higher-Order Symb. Comput."},{"key":"9006_CR39","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/3-540-58402-1_14","volume-title":"International Conference on Programming Language Implementation and Logic Programming (PLILP\u201994), Madrid, Spain","author":"L. Moreau","year":"1994","unstructured":"Moreau, L., Queinnec, C.: Partial continuations as the difference of continuations. A\u00a0duumvirate of control operators. In: International Conference on Programming Language Implementation and Logic Programming (PLILP\u201994), Madrid, Spain, pp.\u00a0182\u2013197. Springer, Berlin (1994)"},{"key":"9006_CR40","unstructured":"Murthy, C.: Control operators, hierarchies, and pseudo-classical type systems: a\u2014translation at work. In: ACM workshop on Continuations, pp.\u00a049\u201371 (1992)"},{"key":"9006_CR41","first-page":"215","volume-title":"Conf. Record 24th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL\u201997, Paris, France, 15\u201317 Jan. 1997","author":"C.-H.L. Ong","year":"1997","unstructured":"Ong, C.-H.L., Stewart, C.A.: A Curry-Howard foundation for functional computation with control. In: Conf. Record 24th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL\u201997, Paris, France, 15\u201317 Jan. 1997, pp.\u00a0215\u2013227. ACM Press, New York (1997)"},{"key":"9006_CR42","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/BFb0013061","volume-title":"Logic Programming and Automated Reasoning: International Conference LPAR \u201992 Proceedings, St. Petersburg, Russia","author":"M. Parigot","year":"1992","unstructured":"Parigot, M.: Lambda-mu-calculus: an algorithmic interpretation of classical natural deduction. In: Logic Programming and Automated Reasoning: International Conference LPAR \u201992 Proceedings, St. Petersburg, Russia, pp.\u00a0190\u2013201. Springer, Berlin (1992)"},{"key":"9006_CR43","doi-asserted-by":"crossref","first-page":"219","DOI":"10.4064\/fm-83-3-219-249","volume":"83","author":"C. Rauszer","year":"1974","unstructured":"Rauszer, C.: Semi-boolean algebras and their application to intuitionistic logic with dual connectives. Fundam. Math. 83, 219\u2013249 (1974)","journal-title":"Fundam. Math."},{"key":"9006_CR44","series-title":"Lecture Notes in Comput. Sci.","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":"J.G. Riecke","year":"1999","unstructured":"Riecke, J.G., Thielecke, H.: Typed exceptions and continuations cannot macro-express each other. In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Comput. Sci., vol.\u00a01644, pp.\u00a0635\u2013644. Springer, Berlin (1999)"},{"key":"9006_CR45","unstructured":"Shan, C.: Shift to control. In: Shivers, O., Waddell, O. (eds.) Proceedings of the 5th Workshop on Scheme and Functional Programming, pp.\u00a099\u2013107. Technical report, Computer Science Department, Indiana University (2004)"},{"issue":"1","key":"9006_CR46","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 (1990a)","journal-title":"Lisp Symb. Comput."},{"key":"9006_CR47","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/91556.91626","volume-title":"LFP \u201990: Proceedings of the 1990 ACM Conference on LISP and Functional Programming","author":"D. Sitaram","year":"1990","unstructured":"Sitaram, D., Felleisen, M.: Reasoning with continuations II: full abstraction for models of control. In: LFP \u201990: Proceedings of the 1990 ACM Conference on LISP and Functional Programming, pp.\u00a0161\u2013175. ACM Press, New York (1990b)"},{"key":"9006_CR48","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/3-540-46425-5_26","volume-title":"Proceedings of the Ninth European Symposium On Programming (ESOP)","author":"H. Thielecke","year":"2000","unstructured":"Thielecke, H.: On exceptions versus continuations in the presence of state. In: Proceedings of the Ninth European Symposium On Programming (ESOP). Lecture Notes in Comput. Sci., vol.\u00a01782, pp.\u00a0397\u2013411. Springer, Berlin (2000)"},{"key":"9006_CR49","unstructured":"Thielecke, H.: Contrasting exceptions and continuations. Available from http:\/\/www.cs.bham.ac.uk\/~hxt\/research\/exncontjournal.pdf (2001)"},{"issue":"2\/3","key":"9006_CR50","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1023\/A:1020887011500","volume":"15","author":"H. Thielecke","year":"2002","unstructured":"Thielecke, H.: Comparing control constructs by double-barrelled CPS. Higher-Order Symb. Comput. 15(2\/3), 119\u2013136 (2002)","journal-title":"Higher-Order Symb. Comput."},{"issue":"1","key":"9006_CR51","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF01019944","volume":"7","author":"P. Wadler","year":"1994","unstructured":"Wadler, P.: Monads and composable continuations. Lisp Symb. Comput. 7(1), 39\u201356 (1994)","journal-title":"Lisp Symb. Comput."},{"issue":"3","key":"9006_CR52","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1010093700911","volume":"12","author":"M. Wand","year":"1999","unstructured":"Wand, M.: Continuation-based multiprocessing. Higher-Order Symb. Comput. 12(3), 285\u2013299 (1999), http:\/\/www.brics.dk\/~hosc\/vol12\/3-wand.html. Reprinted from the Proceedings of the 1980 Lisp Conference, with a foreword","journal-title":"Higher-Order Symb. Comput."}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9006-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-007-9006-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9006-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T21:04:21Z","timestamp":1737493461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-007-9006-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,24]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["9006"],"URL":"https:\/\/doi.org\/10.1007\/s10990-007-9006-0","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]]}}}