{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:24:15Z","timestamp":1743009855454,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642164774"},{"type":"electronic","value":"9783642164781"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16478-1_12","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T09:07:22Z","timestamp":1288688842000},"page":"198-217","source":"Crossref","is-referenced-by-count":1,"title":["The Very Lazy \u03bb-Calculus and the STEC Machine"],"prefix":"10.1007","author":[{"given":"Jan","family":"Rochel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/3-540-18317-5_3","volume-title":"Functional Programming Languages and Computer Architecture","author":"J. Fairbairn","year":"1987","unstructured":"Fairbairn, J., Wray, S.: Tim: A simple, lazy abstract machine to execute supercombinators. In: Kahn, G. (ed.) FPCA 1987. LNCS, vol.\u00a0274, pp. 34\u201345. Springer, Heidelberg (1987)"},{"issue":"3","key":"12_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10990-007-9018-9","volume":"20","author":"J.-L. Krivine","year":"2007","unstructured":"Krivine, J.-L.: A call-By-name lambda-calculus machine. Higher Order and Symbolic Computation\u00a020(3), 199\u2013207 (2007)","journal-title":"Higher Order and Symbolic Computation"},{"key":"12_CR3","volume-title":"The implementation of functional programming languages","author":"S.L. Peyton Jones","year":"1987","unstructured":"Peyton Jones, S.L., Wadler, P., Hancock, P.: The implementation of functional programming languages. Prentice Hall International, Englewood Cliffs (1987)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/62678.62717","volume-title":"Proceedings of the 1988 ACM conference on LISP and functional programming","author":"G.L. Burn","year":"1988","unstructured":"Burn, G.L., Peyton Jones, S.L., Robson, J.D.: The spineless G-machine. In: Proceedings of the 1988 ACM conference on LISP and functional programming, pp. 244\u2013258. ACM, New York (1988)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Peyton Jones, S.L.: Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine - Version 2.5, Department of Computing Science, University of Glasgow, July 9 (1992)","DOI":"10.1017\/S0956796800000319"},{"key":"12_CR6","unstructured":"Leijen, D.: The lazy virtual machine specification, Institute of Information and Computing Sciences, Utrecht University, August 22 (2005)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Holyer, I., Spiliopoulou, E.: The Brisk Machine: a simplified STG machine, University of Bristol, Department of Computer Science (March 1998)","DOI":"10.1007\/BFb0055422"},{"key":"12_CR8","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its syntax and semantics (1984)"},{"key":"12_CR9","unstructured":"Danos, V., Regnier, L.: Head linear reduction (unpublished), http:\/\/iml.univ-mrs.fr\/~regnier\/articles.html (June 7, 2004)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Danos, V., Herbelin, H., Regnier, L.: Game semantics and abstract machines. In: Symposium on Logic in Computer Science, September 2, p. 394. IEEE Computer Society, Los Alamitos (1996)","DOI":"10.1109\/LICS.1996.561456"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"De Bruijn, N.G.: Lambda Calculus Notation with Nameless Dummies \u2013 a Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem. Indagationes Mathematicae, 381\u2013392 (1972)","DOI":"10.1016\/1385-7258(72)90034-0"},{"key":"12_CR12","first-page":"1","volume-title":"Proceedings of the 1982 ACM symposium on LISP and functional programming","author":"R.J.M. Hughes","year":"1982","unstructured":"Hughes, R.J.M.: Super-Combinators \u2013 a new implementation method for applicative languages. In: Proceedings of the 1982 ACM symposium on LISP and functional programming, pp. 1\u201310. ACM, New York (1982)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Kamareddine, F., Bloo, R., Nederpelt, R.: De Bruijn\u2019s syntax and reductional equivalence of \u03bb-terms. In: Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, pp. 16\u201327. ACM, New York (2001)","DOI":"10.1145\/773184.773187"},{"issue":"1-2","key":"12_CR14","first-page":"243","volume":"248","author":"O. Danvy","year":"2000","unstructured":"Danvy, O., Schultz, U.P.: Lambda-dropping: transforming recursive equations into programs with block structure. Partial evaluation and semantics-based program manipulation\u00a0248(1-2), 243\u2013287 (2000)","journal-title":"Partial evaluation and semantics-based program manipulation"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1017\/S0956796806005995","volume":"16","author":"S. Marlow","year":"2006","unstructured":"Marlow, S., Peyton Jones, S.: Making a fast curry: push\/enter vs. eval\/apply for higher-order languages. Journal of Functional Programming\u00a016, 415\u2013449 (2006)","journal-title":"Journal of Functional Programming"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-36377-7_19","volume-title":"The Essence of Computation","author":"P. Sestoft","year":"2002","unstructured":"Sestoft, P.: Demonstrating lambda calculus reduction. In: Jones, D., Mogensen, T.\u00c6., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol.\u00a02566, pp. 420\u2013435. Springer, Heidelberg (2002)"},{"key":"12_CR17","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"J.-J. L\u00e9vy","year":"1978","unstructured":"L\u00e9vy, J.-J.: Optimal reductions in the lambda-calculus. In: Seldin, J.P., Hindley, J.R. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, London (1978)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Functional Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16478-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T20:54:39Z","timestamp":1559768079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16478-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642164774","9783642164781"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16478-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}