{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T19:41:18Z","timestamp":1790797278803,"version":"4.1.0"},"reference-count":26,"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":[[2007,11,20]]},"DOI":"10.1007\/s10990-007-9014-0","type":"journal-article","created":{"date-parts":[[2007,10,23]],"date-time":"2007-10-23T16:15:17Z","timestamp":1193156117000},"page":"271-293","source":"Crossref","is-referenced-by-count":19,"title":["Improving the lazy Krivine machine"],"prefix":"10.1007","volume":"20","author":[{"given":"Daniel P.","family":"Friedman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abdulaziz","family":"Ghuloum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeremy G.","family":"Siek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Onnie Lynn","family":"Winebarger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,10,24]]},"reference":[{"key":"9014_CR1","volume-title":"The Structure and Interpretation of Computer Programs","author":"H. Abelson","year":"1985","unstructured":"Abelson, H., Sussman, G.J.: The Structure and Interpretation of Computer Programs. MIT Press, Cambridge (1985)"},{"key":"9014_CR2","doi-asserted-by":"crossref","unstructured":"Ager, M.S., Biernacki, D., Danvy, O., Midtgaard, J.: From interpreter to compiler and virtual machine: a functional derivation. Technical Report RS-03-14, 36 pp. (2003)","DOI":"10.7146\/brics.v10i14.21784"},{"key":"9014_CR3","doi-asserted-by":"crossref","unstructured":"Ager, M.S., Biernacki, D., Danvy, O., Midtgaard, J.: A functional correspondence between evaluators and abstract machines. In: International Conference on Principles and Practice of Declarative Programming, pp.\u00a08\u201319 (2003)","DOI":"10.1145\/888251.888254"},{"key":"9014_CR4","doi-asserted-by":"crossref","unstructured":"Ager, M.S., Danvy, O., Midtgaard, J.: A functional correspondence between call-by-need evaluators and lazy abstract machines. Technical Report RS-03-24, 13\u00a0pp. (2003)","DOI":"10.7146\/brics.v10i24.21955"},{"key":"9014_CR5","doi-asserted-by":"crossref","unstructured":"Ager, M.S., Danvy, O., Midtgaard, J.: A functional correspondence between monadic evaluators and abstract machines for languages with computational effects. Technical Report RS-03-35, 31\u00a0pp. (2003)","DOI":"10.7146\/brics.v10i35.21803"},{"key":"9014_CR6","doi-asserted-by":"crossref","unstructured":"Argo, G.: Improving the three instruction machine. In: Fourth International Conference on Functional Programming Languages and Computer Architecture, Reading, MA, pp. 100\u2013112 (1989)","DOI":"10.1145\/99370.99378"},{"key":"9014_CR7","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H.P. Barendregt","year":"1981","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam (1981)"},{"key":"9014_CR8","doi-asserted-by":"crossref","unstructured":"Clements, J., Felleisen, M.: A tail-recursive semantics for stack inspections. In: European Symposium on Programming (2003)","DOI":"10.1007\/3-540-36575-3_3"},{"key":"9014_CR9","doi-asserted-by":"crossref","unstructured":"Cr\u00e9gut, P.: An abstract machine for the normalization of \u03bb-terms. In: Proc. 1990 ACM Symposium on Lisp and Functional Programming, pp. 333\u2013340 (1990)","DOI":"10.1145\/91556.91681"},{"key":"9014_CR10","unstructured":"Cr\u00e9gut, P.: Machines \u00e0 environment pour la r\u00e9duction symbolique et l\u2019\u00e9valuation partielle. Ph.D. Thesis, Universit\u00e9 de Paris VII, Paris, France (1991)"},{"key":"9014_CR11","doi-asserted-by":"crossref","unstructured":"Danvy, O.: A lambda-revelation of the SECD machine. Technical Report RS-02-53, 15\u00a0pp. (2003). Superseeded by the BRICS report RS-03-33","DOI":"10.7146\/brics.v9i53.21768"},{"key":"9014_CR12","doi-asserted-by":"crossref","unstructured":"Danvy, O.: A rational deconstruction of Landin\u2019s SECD machine. Technical Report RS-03-33, 32\u00a0pp. (2003). This report supersedes the earlier BRICS report RS-02-53","DOI":"10.7146\/brics.v10i33.21801"},{"key":"9014_CR13","doi-asserted-by":"crossref","unstructured":"Fairbairn, J., Wray, S.C.: Tim: a simple lazy abstract-machine to execute supercombinators. In: G. Kahn (ed.) IFIP Functional Programming Languages and Computer Architecture, pp. 34\u201345 (1987)","DOI":"10.1007\/3-540-18317-5_3"},{"key":"9014_CR14","unstructured":"Krivine, J.-L.: Un interpr\u00e8te du \u03bb-calcul (1985)"},{"key":"9014_CR15","doi-asserted-by":"crossref","unstructured":"Launchbury, J.: A natural semantics for lazy evaluation. In: Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina, pp. 144\u2013154 (1993)","DOI":"10.1145\/158511.158618"},{"key":"9014_CR16","unstructured":"Launchbury, J., Gill, A., Hughes, J., Marlow, S., Peyton Jones, S., Wadler, P.: Avoiding unnecessary updates. In: J. Launchbury and P.M. Sansom (eds.) Functional Programming, Glasgow, 1992"},{"key":"9014_CR17","unstructured":"Mycroft, A.: Abstract interpretation and optimising transformations for applicative programs. Ph.D. Thesis, University of Edinburgh, Edinburgh, Scotland (1981)"},{"key":"9014_CR18","volume-title":"Recursive Functions","author":"R. P\u00e9ter","year":"1967","unstructured":"P\u00e9ter, R.: Recursive Functions. Academic, New York (1967)"},{"issue":"2","key":"9014_CR19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1017\/S0956796800000319","volume":"2","author":"S.L. Peyton Jones","year":"1992","unstructured":"Peyton Jones, S.L.: Implementing lazy functional languages on stock hardware: the spineless tagless G-machine. J. Funct. Program. 2(2), 127\u2013202 (1992)","journal-title":"J. Funct. Program."},{"key":"9014_CR20","volume-title":"Algol 60 Implementation","author":"B. Randell","year":"1964","unstructured":"Randell, B., Russell, L.J.: Algol 60 Implementation. Academic, New York (1964)"},{"key":"9014_CR21","unstructured":"Reinke, C.: GHood\u2013graphical visualisation and animation of Haskell object observations. In: R. Hinze (ed.) Haskell Workshop (2001)"},{"key":"9014_CR22","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. In: Proceedings ACM National Conference, pp. 717\u2013740 (1972)","DOI":"10.1145\/800194.805852"},{"issue":"3","key":"9014_CR23","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1017\/S0956796897002712","volume":"7","author":"P. Sestoft","year":"1997","unstructured":"Sestoft, P.: Deriving a lazy abstract machine. J. Funct. Program. 7(3), 231\u2013264 (1997)","journal-title":"J. Funct. Program."},{"key":"9014_CR24","volume-title":"Formal Language Description Languages for Computer Programming","year":"1966","unstructured":"Steel, T.B. (ed.): Formal Language Description Languages for Computer Programming. North-Holland, Amsterdam (1966)"},{"key":"9014_CR25","unstructured":"Wakeling, D., Dix, A.: Optimising partial applications in TIM, Technical Report, University of York (1993)"},{"key":"9014_CR26","doi-asserted-by":"crossref","unstructured":"Wand, M.: On the correctness of the Krivine machine. Higher-Order Symb. Comput. Special issue on Krivine\u2019s abstract machine (2007)","DOI":"10.1007\/s10990-007-9019-8"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9014-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-007-9014-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-9014-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:29:41Z","timestamp":1559352581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-007-9014-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,24]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,11,20]]}},"alternative-id":["9014"],"URL":"https:\/\/doi.org\/10.1007\/s10990-007-9014-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]]}}}