{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:17:07Z","timestamp":1781893027054,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642122507","type":"print"},{"value":"9783642122514","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12251-4_18","type":"book-chapter","created":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T23:32:42Z","timestamp":1270855962000},"page":"240-256","source":"Crossref","is-referenced-by-count":17,"title":["Defunctionalized Interpreters for Call-by-Need Evaluation"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Danvy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kevin","family":"Millikin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johan","family":"Munk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ian","family":"Zerny","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"5","key":"18_CR1","doi-asserted-by":"publisher","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. Information Processing Letters\u00a090(5), 223\u2013232 (2004)","journal-title":"Information Processing Letters"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1017\/S0956796897002724","volume":"7","author":"Z.M. Ariola","year":"1997","unstructured":"Ariola, Z.M., Felleisen, M.: The call-by-need lambda calculus. Journal of Functional Programming\u00a07(3), 265\u2013301 (1997)","journal-title":"Journal of Functional Programming"},{"key":"18_CR3","unstructured":"Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. In: Studies in Logic and the Foundation of Mathematics, revised edn., vol.\u00a0103, North-Holland, Amsterdam (1984)"},{"issue":"1-3","key":"18_CR4","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0375(1-3), 76\u2013108 (2007)","journal-title":"Theoretical Computer Science"},{"key":"18_CR5","unstructured":"Bloo, R., Rose, K.H.: Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection. In: CSN 1995: Computer Science in the Netherlands, pp. 62\u201372 (1995)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/3-540-57887-0_99","volume-title":"Theoretical Aspects of Computer Software","author":"R. Cartwright","year":"1994","unstructured":"Cartwright, R., Felleisen, M.: Extensible denotational language specifications. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol.\u00a0789, pp. 244\u2013272. Springer, Heidelberg (1994)"},{"issue":"3","key":"18_CR7","doi-asserted-by":"publisher","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. Science of Computer Programming\u00a022(3), 183\u2013195 (1994)","journal-title":"Science of Computer Programming"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Danvy, O.: Defunctionalized interpreters for programming languages. In: Thiemann, P. (ed.) Proceedings of the 2008 ACM SIGPLAN International Conference on Functional Programming (ICFP 2008), SIGPLAN Notices, Victoria, British Columbia, vol.\u00a043(9), pp. 131\u2013142. ACM Press, New York (2008) (invited talk)","DOI":"10.1145\/1411204.1411206"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-04652-0_3","volume-title":"Advanced Functional Programming","author":"O. Danvy","year":"2009","unstructured":"Danvy, O.: From reduction-based to reduction-free normalization. In: Koopman, P., Plasmeijer, R., Swierstra, D. (eds.) AFP 2008. LNCS, vol.\u00a05832, pp. 66\u2013164. Springer, Heidelberg (2009)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/141471.141564","volume-title":"Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, LISP Pointers","author":"O. Danvy","year":"1992","unstructured":"Danvy, O., Lawall, J.L.: Back to direct style II: First-class continuations. In: Clinger, W. (ed.) Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, LISP Pointers, San Francisco, California, vol.\u00a0V(1), pp. 299\u2013310. ACM Press, New York (1992)"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ipl.2007.10.010","volume":"106","author":"O. Danvy","year":"2008","unstructured":"Danvy, O., Millikin, K.: On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion. Information Processing Letters\u00a0106(3), 100\u2013109 (2008)","journal-title":"Information Processing Letters"},{"issue":"8","key":"18_CR12","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":"18_CR13","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1145\/773184.773202","volume-title":"Proceedings of the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2001)","author":"O. Danvy","year":"2001","unstructured":"Danvy, O., Nielsen, L.R.: Defunctionalization at work. In: S\u00f8ndergaard, H. (ed.) Proceedings of the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2001), Firenze, Italy, pp. 162\u2013174. ACM Press, New York (2001)"},{"key":"#cr-split#-18_CR14.1","doi-asserted-by":"crossref","unstructured":"Danvy, O., Nielsen, L.R.: Refocusing in reduction semantics. Research Report BRICS RS-04-26, Department of Computer Science, Aarhus University, Aarhus, Denmark (November 2004);","DOI":"10.7146\/brics.v11i26.21851"},{"key":"#cr-split#-18_CR14.2","unstructured":"A preliminary version appeared in the informal proceedings of the Second International Workshop on Rule-Based Programming (RULE 2001). Electronic Notes in Theoretical Computer Science, vol.??59.4 (2001)"},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0103(2), 235\u2013271 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10990-007-9014-0","volume":"20","author":"D.P. Friedman","year":"2007","unstructured":"Friedman, D.P., Ghuloum, A., Siek, J.G., Winebarger, L.: Improving the lazy Krivine machine. Higher-Order and Symbolic Computation\u00a020(3), 271\u2013293 (2007)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0057646","volume-title":"Mobile Agents","author":"S. F\u00fcnfrocken","year":"1998","unstructured":"F\u00fcnfrocken, S.: Transparent migration of Java-based mobile agents. In: Rothermel, K., Hohl, F. (eds.) MA 1998. LNCS, vol.\u00a01477, pp. 26\u201337. Springer, Heidelberg (1998)"},{"key":"18_CR18","first-page":"153","volume-title":"Proceedings of the Thirty-Sixth Annual ACM Symposium on Principles of Programming Languages, SIGPLAN Notices","author":"R. Garcia","year":"2009","unstructured":"Garcia, R., Lumsdaine, A., Sabry, A.: Lazy evaluation and delimited control. In: Pierce, B.C. (ed.) Proceedings of the Thirty-Sixth Annual ACM Symposium on Principles of Programming Languages, SIGPLAN Notices, Savannah, GA, vol.\u00a044(1), pp. 153\u2013164. ACM Press, New York (2009)"},{"key":"18_CR19","first-page":"95","volume-title":"Proceedings of the Third Annual ACM Symposium on Principles of Programming Languages","author":"P. Henderson","year":"1976","unstructured":"Henderson, P., Morris Jr., J.H.: A lazy evaluator. In: Graham, S.L. (ed.) Proceedings of the Third Annual ACM Symposium on Principles of Programming Languages, pp. 95\u2013103. ACM Press, New York (1976)"},{"issue":"5","key":"18_CR20","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S0956796897002864","volume":"7","author":"G. Huet","year":"1997","unstructured":"Huet, G.: The zipper. Journal of Functional Programming\u00a07(5), 549\u2013554 (1997)","journal-title":"Journal of Functional Programming"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0304-3975(89)90122-9","volume":"68","author":"M.B. Josephs","year":"1989","unstructured":"Josephs, M.B.: The semantics of lazy functional languages. Theoretical Computer Science\u00a068, 105\u2013111 (1989)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"18_CR22","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. The Computer Journal\u00a06(4), 308\u2013320 (1964)","journal-title":"The Computer Journal"},{"key":"18_CR23","first-page":"144","volume-title":"Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages","author":"J. Launchbury","year":"1993","unstructured":"Launchbury, J.: A natural semantics for lazy evaluation. In: Graham, S.L. (ed.) Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages, Charleston, South Carolina, pp. 144\u2013154. ACM Press, New York (1993)"},{"key":"18_CR24","unstructured":"Loitsch, F.: Scheme to JavaScript Compilation. PhD thesis, Universit\u00e9 de Nice, Nice, France (March 2009)"},{"issue":"3","key":"18_CR25","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1017\/S0956796898003037","volume":"8","author":"J. Maraist","year":"1998","unstructured":"Maraist, J., Odersky, M., Wadler, P.: The call-by-need lambda calculus. Journal of Functional Programming\u00a08(3), 275\u2013317 (1998)","journal-title":"Journal of Functional Programming"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Munk, J.: A study of syntactic and semantic artifacts and its application to lambda definability, strong normalization, and weak normalization in the presence of state. Master\u2019s thesis, Department of Computer Science, Aarhus University, Aarhus, Denmark. BRICS research report RS-08-3 (May 2007)","DOI":"10.7146\/brics.v15i3.21938"},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/1190216.1190241","volume-title":"Proceedings of the Thirty-Fourth Annual ACM Symposium on Principles of Programming Languages, SIGPLAN Notices","author":"A. Ohori","year":"2007","unstructured":"Ohori, A., Sasano, I.: Lightweight fusion by fixed point promotion. In: Felleisen, M. (ed.) Proceedings of the Thirty-Fourth Annual ACM Symposium on Principles of Programming Languages, SIGPLAN Notices, Nice, France, vol.\u00a042(1), pp. 143\u2013154. ACM Press, New York (2007)"},{"key":"18_CR28","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/1086365.1086393","volume-title":"Proceedings of the 2005 ACM SIGPLAN International Conference on Functional Programming (ICFP 2005), SIGPLAN Notices","author":"G. Pettyjohn","year":"2005","unstructured":"Pettyjohn, G., Clements, J., Marshall, J., Krishnamurthi, S., Felleisen, M.: Continuations from generalized stack inspection. In: Pierce, B. (ed.) Proceedings of the 2005 ACM SIGPLAN International Conference on Functional Programming (ICFP 2005), SIGPLAN Notices, Tallinn, Estonia, vol.\u00a040(9), pp. 216\u2013227. ACM Press, New York (2005)"},{"key":"#cr-split#-18_CR29.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#-18_CR29.2","doi-asserted-by":"crossref","unstructured":"Reprinted in Higher-Order and Symbolic Computation 11(4), 363???397 (1998), with a foreword [30]","DOI":"10.1023\/A:1010027404223"},{"issue":"4","key":"18_CR30","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":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/3-540-48919-3_16","volume-title":"Coordination Languages and Models","author":"T. Sekiguchi","year":"1999","unstructured":"Sekiguchi, T., Masuhara, H., Yonezawa, A.: A simple extension of Java language for controllable transparent migration and its portable implementation. In: Ciancarini, P., Wolf, A.L. (eds.) COORDINATION 1999. LNCS, vol.\u00a01594, pp. 211\u2013226. Springer, Heidelberg (1999)"},{"issue":"3","key":"18_CR32","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1017\/S0956796897002712","volume":"7","author":"P. Sestoft","year":"1997","unstructured":"Sestoft, P.: Deriving a lazy abstract machine. Journal of Functional Programming\u00a07(3), 231\u2013264 (1997)","journal-title":"Journal of Functional Programming"},{"key":"18_CR33","unstructured":"Tao, W.: A portable mechanism for thread persistence and migration. PhD thesis, University of Utah, Salt Lake City, Utah (2001)"},{"key":"18_CR34","unstructured":"Zerny, I.: On graph rewriting, reduction and evaluation. In: Horv\u00e1th, Z., Zs\u00f3k, V., Achten, P., Koopman, P. (eds.) Trends in Functional Programming, Kom\u00e1rno, Slovakia, June 2009, vol.\u00a010. Intellect Books (2009) (to appear)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12251-4_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:52:00Z","timestamp":1606186320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12251-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642122507","9783642122514"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12251-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}