{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:07:54Z","timestamp":1751983674694,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543961"},{"type":"electronic","value":"9783540475996"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3540543961_14","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:43:30Z","timestamp":1330209810000},"page":"289-312","source":"Crossref","is-referenced-by-count":4,"title":["What is an efficient implementation of the \u03bb-calculus?"],"prefix":"10.1007","author":[{"given":"Gudmund S.","family":"Frandsen","sequence":"first","affiliation":[]},{"given":"Carl","family":"Sturtivant","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,6]]},"reference":[{"key":"14_CR1","unstructured":"Barendregt, H. P., The Lambda Calculus. Its Syntax and Semantics. North Holland, 1981."},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(82)90014-X","volume":"14","author":"F. W. Burton","year":"1982","unstructured":"Burton, F. W., A Linear Space Translation of Functional Programs to Turner Combinators. Information Processing Letters, 14 (1982), pp. 201\u2013204.","journal-title":"Information Processing Letters"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"N. G. Bruijn de","year":"1972","unstructured":"de Bruijn, N. G., Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation. Indag Math, 34 (1972), pp. 381\u2013392.","journal-title":"Indag Math"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"346","DOI":"10.2307\/1968337","volume":"33","author":"A. Church","year":"1932","unstructured":"Church, A., A Set of Postulates for the Foundation of Logic. Annals of Math. 33, 2nd series (1932), pp. 346\u2013366.","journal-title":"Annals of Math."},{"key":"14_CR5","unstructured":"Curry, H. B. and Feys, R. Combinatory Logic, Vol. 1. North Holland, 1958."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Field, J., On Laziness and Optimality in Lambda Interpreters: Tools for Specification and Analysis. In [PoPL90], pp. 1\u201315.","DOI":"10.1145\/96709.96710"},{"volume-title":"Handbook of Theoretical Computer Science, vol A","year":"1990","key":"14_CR7","unstructured":"the Handbook of Theoretical Computer Science, vol A (ed. J. van Leeuwen). Elsevier, Amsterdam, 1990."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Hughes, R. J. M., Super Combinators: A New Implementation Method for Applicative Languages. In Proceedings of the 1982 ACM Symposium on Lisp and Functional Programming, pp.1\u201310.","DOI":"10.1145\/800068.802129"},{"key":"14_CR9","unstructured":"Hughes, R. J. M., The Design and Implementation of Programming Languages. Ph.D. Thesis, Oxford University, 1984. (PRG-40)"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0020-0190(87)90161-X","volume":"24","author":"J. R. Kennaway","year":"1987","unstructured":"Kennaway, J. R. and Sleep, M. R., Variable Abstraction in O(n log(n)) Space. Information Processing Letters, 24 (1987), pp. 343\u2013349.","journal-title":"Information Processing Letters"},{"key":"14_CR11","series-title":"Mathematical Centre Tracts","volume-title":"Combinatory Reduction Systems","author":"J. W. Klop","year":"1980","unstructured":"Klop, J. W., Combinatory Reduction Systems. Mathematical Centre Tracts 127. Mathematisch Centrum, Amsterdam, 1980."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Lamping, J., An Algorithm for Optimal Lambda Calculus Reduction. In [PoPL90], pp. 16\u201330.","DOI":"10.1145\/96709.96711"},{"key":"14_CR13","unstructured":"L\u00e9vy, Jean-Jacques, Optimal Reductions in the Lambda-Calculus. In Seldon, J. P. and Hindley, J. R. (editors), To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, 1980, pp. 159\u2013191."},{"key":"14_CR14","unstructured":"L\u00e9vy, Jean-Jacques, Sharing in the Evaluation of Lambda Expressions. In Fuchi,K. and Kott,L. (editors), Programming of Future Generation Computers II, North Holland, 1988, pp. 183\u2013189."},{"key":"14_CR15","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0020-0190(85)90066-3","volume":"20","author":"K. Noshita","year":"1985","unstructured":"Noshita, K., Translation of Turner Combinators in O(n log(n)) Space. Information Processing Letters, 20 (1985), pp. 71\u201374.","journal-title":"Information Processing Letters"},{"key":"14_CR16","unstructured":"Proceedings of Seventeenth Annual ACM Symposium on Principles of Programming Languages. ACM, New York, 1990."},{"key":"14_CR17","unstructured":"R\u00e9v\u00e9sz, G. E., Lambda-Calculus, Combinators and Functional Programming. Cambridge University Press, 1988."},{"key":"14_CR18","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/MAHC.1984.10040","volume":"6","author":"J. B. Rosser","year":"1984","unstructured":"Rosser, J. B., Highlights of the History of the Lambda-Calculus. Annals of the History of Computing 6 (1984), pp. 337\u2013349.","journal-title":"Annals of the History of Computing"},{"key":"14_CR19","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01448013","volume":"92","author":"M. Sch\u00f6nfinkel","year":"1924","unstructured":"Sch\u00f6nfinkel, M., \u00dcber die Bausteine der mathematischen Logik. Matematische Annalen, 92 (1924), pp. 305\u2013316.","journal-title":"Matematische Annalen"},{"key":"14_CR20","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1137\/0209036","volume":"9","author":"A. Sch\u00f6nhage","year":"1980","unstructured":"Sch\u00f6nhage, A., Storage Modification Machines. SIAM Journal on Computing 9 (1980), pp. 490\u2013508.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR21","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1145\/44483.44492","volume":"35","author":"A. Sch\u00f6nhage","year":"1988","unstructured":"Sch\u00f6nhage, A., A Nonlinear Lower Bound for Random-Access Machines under Logarithmic Cost. Journal of the ACM 35 (1988), pp. 748\u2013754.","journal-title":"Journal of the ACM"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Staples, J., Two-Level Expression Representation for Faster Evaluation. In Ehrig,H., Nagl,M. and Rozenberg,G. (editors), Proceedings from 2nd International workshop \u201cGraph Grammars and their Application to Computer Science\u201d. Springer Verlag (LNCS 153), 1983, pp. 392\u2013404.","DOI":"10.1007\/BFb0000121"},{"key":"14_CR23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.2307\/2273733","volume":"44","author":"D. A. Turner","year":"1979","unstructured":"Turner, D. A., Another Algorithm for Bracket Abstraction. The Journal of Symbolic Logic 44 (1979), pp. 267\u2013270.","journal-title":"The Journal of Symbolic Logic"},{"key":"14_CR24","first-page":"31","volume":"9","author":"D. A. Turner","year":"1979","unstructured":"Turner, D. A., New Implementation Techniques for Applicative Languages. Software: Practice & Experience. 9 (1979), pp. 31\u201349.","journal-title":"Software: Practice & Experience"}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540543961_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:17:24Z","timestamp":1742591844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540543961_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543961","9783540475996"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3540543961_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}