{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:14:41Z","timestamp":1726409681027},"publisher-location":"Berlin, Heidelberg","reference-count":51,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030338"},{"type":"electronic","value":"9783642030345"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03034-5_1","type":"book-chapter","created":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T01:08:34Z","timestamp":1246410514000},"page":"1-19","source":"Crossref","is-referenced-by-count":0,"title":["J Is for JavaScript: A Direct-Style Correspondence between Algol-Like Languages and JavaScript Using First-Class Continuations"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Danvy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-chieh","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Zerny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0096-0551(75)90017-X","volume":"1","author":"S. Kamal Abdali","year":"1976","unstructured":"Kamal Abdali, S.: A lambda-calculus model of programming languages, part I: Simple constructs. Computer Languages\u00a01(4), 287\u2013301 (1976)","journal-title":"Computer Languages"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0096-0551(75)90018-1","volume":"1","author":"S. Kamal Abdali","year":"1976","unstructured":"Kamal Abdali, S.: A lambda-calculus model of programming languages, part II: Jumps and procedures. Computer Languages\u00a01(4), 303\u2013320 (1976)","journal-title":"Computer Languages"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-16816-8_22","volume-title":"Mathematical Foundation of Programming Semantics","author":"S. Kamal Abdali","year":"1986","unstructured":"Kamal Abdali, S., Wise, D.S.: Standard, storeless semantics for ALGOL-style block structure and call-by-name. In: Melton, A.C. (ed.) MFPS 1985. LNCS, vol.\u00a0239, pp. 1\u201319. Springer, Heidelberg (1986)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1145\/62678.62726","volume-title":"Proceedings of the 1988 ACM Conference on Lisp and Functional Programming","author":"A. Bawden","year":"1988","unstructured":"Bawden, A.: Reification without evaluation. In: (Corky) Cartwright, R. (ed.) Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, Snowbird, Utah, July 1988, pp. 342\u2013351. ACM Press, New York (1988)"},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","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. Science of Computer Programming\u00a060(3), 274\u2013297 (2006)","journal-title":"Science of Computer Programming"},{"key":"1_CR6","volume-title":"Formal Specification & Software Development","author":"D. Bj\u00f8rner","year":"1982","unstructured":"Bj\u00f8rner, D., Jones, C.B.: Formal Specification & Software Development. Prentice-Hall International, London (1982)"},{"issue":"5","key":"1_CR7","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1145\/355592.365646","volume":"9","author":"C. B\u00f6hm","year":"1966","unstructured":"B\u00f6hm, C., Jacopini, G.: Flow diagrams, Turing machines and languages with only two formation rules. Communications of the ACM\u00a09(5), 366\u2013371 (1966)","journal-title":"Communications of the ACM"},{"key":"1_CR8","volume-title":"Recursive Programming Techniques","author":"W.H. Burge","year":"1975","unstructured":"Burge, W.H.: Recursive Programming Techniques. Addison-Wesley, Reading (1975)"},{"key":"1_CR9","unstructured":"Burstall, R.M.: Writing search algorithms in functional form. In: Michie, D. (ed.) Machine Intelligence, vol.\u00a05, pp. 373\u2013385. Edinburgh University Press (1969)"},{"key":"1_CR10","unstructured":"Clements, J., Sundaram, A., Herman, D.: Implementing continuation marks in JavaScript. In: Clinger, W. (ed.) Proceedings of the 2008 ACM SIGPLAN Workshop on Scheme and Functional Programming, Victoria, British Columbia, September 2008, pp. 1\u20139 (2008)"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0020-0190(89)90113-0","volume":"30","author":"C. Consel","year":"1989","unstructured":"Consel, C., Danvy, O.: Partial evaluation of pattern matching in strings. Information Processing Letters\u00a030(2), 79\u201386 (1989)","journal-title":"Information Processing Letters"},{"issue":"7","key":"1_CR12","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1145\/366663.366704","volume":"6","author":"M.E. Conway","year":"1963","unstructured":"Conway, M.E.: Design of a separable transition-diagram compiler. Communications of the ACM\u00a06(7), 396\u2013408 (1963)","journal-title":"Communications of the ACM"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Danvy, O.: Sur un exemple de Patrick Greussay. Research Report BRICS RS-04-41, DAIMI, Department of Computer Science, Aarhus University, Aarhus, Denmark (December 2004)","DOI":"10.7146\/brics.v11i41.21866"},{"issue":"4:12","key":"1_CR14","first-page":"1","volume":"4","author":"O. Danvy","year":"2008","unstructured":"Danvy, O., Millikin, K.: A rational deconstruction of Landin\u2019s SECD machine with the J operator. Logical Methods in Computer Science\u00a04(4:12), 1\u201367 (2008)","journal-title":"Logical Methods in Computer Science"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0096-0551(89)90018-0","volume":"14","author":"R. Kent Dybvig","year":"1989","unstructured":"Kent Dybvig, R., Hieb, R.: Engines from continuations. Computer Languages\u00a014(2), 109\u2013123 (1989)","journal-title":"Computer Languages"},{"issue":"3\/4","key":"1_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01019461","volume":"6","author":"M.J. Fischer","year":"1993","unstructured":"Fischer, M.J.: Lambda-calculus schemata. LISP and Symbolic Computation\u00a06(3\/4), 259\u2013288 (1993), http:\/\/www.brics.dk\/~hosc\/vol06\/03-fischer.html ; A preliminary version was presented at the ACM Conference on Proving Assertions about Programs, SIGPLAN Notices\u00a07(1) (January 1972)","journal-title":"LISP and Symbolic Computation"},{"key":"1_CR17","volume-title":"The Ruby Programming Language","author":"D. Flanagan","year":"2008","unstructured":"Flanagan, D., Matsumoto, Y.: The Ruby Programming Language. O\u2019Reilly Media, Inc., Sebastopol (2008)"},{"key":"1_CR18","first-page":"18","volume-title":"Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming, SIGPLAN Notices","author":"S.E. Ganz","year":"1999","unstructured":"Ganz, S.E., Friedman, D.P., Wand, M.: Trampolined style. In: Lee, P. (ed.) Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming, SIGPLAN Notices, Paris, France, vol.\u00a034(9), pp. 18\u201327. ACM Press, New York (1999)"},{"issue":"3","key":"1_CR19","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1017\/S096012950100336X","volume":"11","author":"J.-Y. Girard","year":"2001","unstructured":"Girard, J.-Y.: Locus solum. Mathematical Structures in Computer Science\u00a011(3), 301\u2013506 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-06859-7_147","volume-title":"Programming Symposium","author":"C. Hewitt","year":"1974","unstructured":"Hewitt, C., Bishop, P., Steiger, R., Greif, I., Smith, B., Matson, T., Hale, R.: Behavioral semantics of nonrecursive control structures. In: Robinet, B. (ed.) Programming Symposium. LNCS, vol.\u00a019, pp. 385\u2013407. Springer, Heidelberg (1974)"},{"key":"1_CR21","volume-title":"Partial Evaluation and Automatic Program Generation","author":"N.D. Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall International, London (1993), http:\/\/www.dina.kvl.dk\/~sestoft\/pebook\/"},{"key":"1_CR22","first-page":"7","volume":"17","author":"D.E. Knuth","year":"1964","unstructured":"Knuth, D.E.: Man or boy? ALGOL Bulletin\u00a017, 7 (1964)","journal-title":"ALGOL Bulletin"},{"issue":"4","key":"1_CR23","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/356635.356640","volume":"6","author":"D.E. Knuth","year":"1974","unstructured":"Knuth, D.E.: Structured programming with go to statements. Computing Surveys\u00a06(4), 261\u2013301 (1974)","journal-title":"Computing Surveys"},{"issue":"2","key":"1_CR24","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM Journal on Computing\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1145\/12276.13333","volume-title":"Proceedings of the ACM SIGPLAN 1986 Symposium on Compiler Construction","author":"D. Kranz","year":"1986","unstructured":"Kranz, D., Kesley, R., Rees, J., Hudak, P., Philbin, J., Adams, N.: Orbit: An optimizing compiler for Scheme. In: Proceedings of the ACM SIGPLAN 1986 Symposium on Compiler Construction, Palo Alto, California, pp. 219\u2013233. ACM Press, New York (1986)"},{"key":"1_CR26","unstructured":"Kranz, D.A.: ORBIT: An Optimizing Compiler for Scheme. PhD thesis, Computer Science Department, Yale University, New Haven, Connecticut (February 1988), Research Report 632"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/363744.363749","volume":"8","author":"P.J. Landin","year":"1965","unstructured":"Landin, P.J.: A correspondence between Algol 60 and Church\u2019s lambda notation, Parts 1 and 2. Communications of the ACM\u00a08, 89\u2013101, 158\u2013165 (1965)","journal-title":"Communications of the ACM"},{"issue":"3","key":"1_CR28","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/365230.365257","volume":"9","author":"P.J. Landin","year":"1966","unstructured":"Landin, P.J.: The next 700 programming languages. Communications of the ACM\u00a09(3), 157\u2013166 (1966)","journal-title":"Communications of the ACM"},{"key":"#cr-split#-1_CR29.1","unstructured":"Landin, P.J.: Histories of discoveries of continuations: Belles-lettres with equivocal tenses. In: Danvy, O. (ed.) Proceedings of the Second ACM SIGPLAN Workshop on Continuations, CW 1997 (1997);"},{"key":"#cr-split#-1_CR29.2","unstructured":"Technical report BRICS NS-96-13, Aarhus University, pp. 1:1???9, Paris, France (January 1997)"},{"key":"1_CR30","unstructured":"Loitsch, F.: Scheme to JavaScript Compilation. PhD thesis, Universit\u00e9 de Nice, Nice, France (March 2009)"},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/S0019-9958(71)90355-X","volume":"18","author":"A.W. Mazurkiewicz","year":"1971","unstructured":"Mazurkiewicz, A.W.: Proving algorithms by tail functions. Information and Control\u00a018, 220\u2013226 (1971)","journal-title":"Information and Control"},{"issue":"4","key":"1_CR32","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/367177.367199","volume":"3","author":"J. McCarthy","year":"1960","unstructured":"McCarthy, J.: Recursive functions of symbolic expressions and their computation by machine, part I. Communications of the ACM\u00a03(4), 184\u2013195 (1960)","journal-title":"Communications of the ACM"},{"key":"1_CR33","first-page":"21","volume-title":"Information Processing 1962, Proceedings of IFIP Congress 62","author":"J. McCarthy","year":"1962","unstructured":"McCarthy, J.: Towards a mathematical science of computation. In: Popplewell, C.M. (ed.) Information Processing 1962, Proceedings of IFIP Congress 62, pp. 21\u201328. North-Holland, Amsterdam (1962)"},{"key":"1_CR34","first-page":"1","volume-title":"Formal Language Description Languages for Computer Programming","author":"J. McCarthy","year":"1966","unstructured":"McCarthy, J.: A formal description of a subset of ALGOL. In: Steel, T.B. (ed.) Formal Language Description Languages for Computer Programming, pp. 1\u201312. North-Holland, Amsterdam (1966)"},{"key":"1_CR35","unstructured":"McCarthy, J.: Another samefringe. SIGART Newsletter\u00a061 (February 1977)"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"McDermott, D.: An efficient environment allocation scheme in an interpreter for a lexically-scoped Lisp. In: Davis, R.E., Allen, J.R. (eds.) Conference Record of the 1980 LISP Conference, Stanford, California, August 1980, pp. 154\u2013162 (1980)","DOI":"10.1145\/800087.802801"},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-44898-5_9","volume-title":"Static Analysis","author":"Y. Minamide","year":"2003","unstructured":"Minamide, Y.: Selective tail call elimination. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 153\u2013170. Springer, Heidelberg (2003)"},{"key":"1_CR38","doi-asserted-by":"publisher","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. Information and Computation\u00a093, 55\u201392 (1991)","journal-title":"Information and Computation"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Lockwood Morris, F.: Correctness of Translations of Programming Languages \u2013 an Algebraic Approach. PhD thesis, Computer Science Department, Stanford University (August 1972), Technical report STAN-CS-72-303","DOI":"10.21236\/ADA954771"},{"issue":"3\/4","key":"1_CR40","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01019460","volume":"6","author":"F. Lockwood Morris","year":"1993","unstructured":"Lockwood Morris, F.: The next 700 formal language descriptions. Lisp and Symbolic Computation\u00a06(3\/4), 249\u2013258 (1993); Reprinted from a manuscript dated (1970)","journal-title":"Lisp and Symbolic Computation"},{"key":"#cr-split#-1_CR41.1","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. In: Proceedings of 25th ACM National Conference, Boston, Massachusetts, pp. 717???740 (1972);","DOI":"10.1145\/800194.805852"},{"key":"#cr-split#-1_CR41.2","doi-asserted-by":"crossref","unstructured":"Reprinted in Higher-Order and Symbolic Computation 11(4), 363???397 (1998), with a foreword??[42]","DOI":"10.1023\/A:1010027404223"},{"issue":"4","key":"1_CR42","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1023\/A:1010075320153","volume":"11","author":"J.C. Reynolds","year":"1998","unstructured":"Reynolds, J.C.: Definitional interpreters revisited. Higher-Order and Symbolic Computation\u00a011(4), 355\u2013361 (1998)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"1_CR43","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"155","volume-title":"BABEL 2001: First International Workshop on Multi-Language Infrastructure and Interoperability","author":"M. Schinz","year":"2001","unstructured":"Schinz, M., Odersky, M.: Tail call elimination on the Java Virtual Machine. In: Benton, N., Kennedy, A. (eds.) BABEL 2001: First International Workshop on Multi-Language Infrastructure and Interoperability, Firenze, Italy, September 2001. Electronic Notes in Theoretical Computer Science, vol.\u00a0(59), pp. 155\u2013168. Elsevier Science, Amsterdam (2001)"},{"key":"1_CR44","unstructured":"Stallman, R.M.: Phantom stacks: If you look too hard, they aren\u2019t there. In: AI Memo 556, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts (July 1980)"},{"key":"1_CR45","unstructured":"Steele Jr., G.L.: Rabbit: A compiler for Scheme. Master\u2019s thesis, Artificial Intelligence Laboratory. Massachusetts Institute of Technology, Cambridge, Massachusetts, Technical report AI-TR-474 (May 1978)"},{"key":"1_CR46","unstructured":"Talcott, C.L.: The Essence of $\\cal R$ um: A Theory of the Intensional and Extensional Aspects of Lisp-type Computation. PhD thesis, Department of Computer Science, Stanford University, Stanford, California (August 1985)"},{"issue":"2","key":"1_CR47","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/151333.151343","volume":"1","author":"D. Tarditi","year":"1992","unstructured":"Tarditi, D., Lee, P., Acharya, A.: No assembly required: Compiling Standard ML to C. ACM Letters on Programming Languages and Systems\u00a01(2), 161\u2013177 (1992)","journal-title":"ACM Letters on Programming Languages and Systems"},{"issue":"2\/3","key":"1_CR48","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1020887011500","volume":"15","author":"H. Thielecke","year":"2002","unstructured":"Thielecke, H.: Comparing control constructs by double-barrelled CPS. Higher-Order and Symbolic Computation\u00a015(2\/3), 141\u2013160 (2002)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"1_CR49","first-page":"1","volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Principles of Programming Languages","author":"P. Wadler","year":"1992","unstructured":"Wadler, P.: The essence of functional programming (invited talk). In: Appel, A.W. (ed.) Proceedings of the Nineteenth Annual ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, pp. 1\u201314. ACM Press, New York (1992)"}],"container-title":["Lecture Notes in Computer Science","Domain-Specific Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03034-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T00:49:07Z","timestamp":1558399747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03034-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030338","9783642030345"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03034-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}