{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T23:09:47Z","timestamp":1784848187737,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540578802","type":"print"},{"value":"9783540483762","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57880-3_14","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:36:19Z","timestamp":1330263379000},"page":"211-224","source":"Crossref","is-referenced-by-count":2,"title":["Compilation of head and strong reduction"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Fradet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"A. W. Appel. Compiling with Continuations. Cambridge University Press. 1992.","DOI":"10.1017\/CBO9780511609619"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/3-540-10003-2_58","volume":"85","author":"E. Astesiano","year":"1980","unstructured":"E. Astesiano and G. Costa. Languages with reducing reflexive types. In 7th Coll on Automata, Languages and Programming, LNCS Vol. 85, pp. 38\u201350, 1980.","journal-title":"7th Coll on Automata, Languages and Programming, LNCS"},{"key":"14_CR3","unstructured":"H.P. Barendregt. The Lambda Calculus. Its Syntax and Semantics. North-Holland, 1981."},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0890-5401(87)90001-0","volume":"75","author":"H.P. Barendregt","year":"1987","unstructured":"H.P. Barendregt, J.R. Kennaway, J.W. Klop and M.R. Sleep. Needed reduction and spine strategies for the lambda calculus. Information and Computation, Vol. 75, pp. 191\u2013231, 1987.","journal-title":"Information and Computation"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"P. Cr\u00e9gut. An abstract machine for the normalization of \u03bb-terms. In Proc. of the ACM Conf. on Lisp and Functional Programming, pp. 333\u2013340, 1990.","DOI":"10.1145\/91556.91681"},{"issue":"1","key":"14_CR6","first-page":"104","volume":"7","author":"M. J. Fischer","year":"1972","unstructured":"M. J. Fischer. Lambda-calculus schemata. In Proc. of the ACM Conf. on Proving Properties about Programs, Sigplan Notices, Vol. 7(1), pp. 104\u2013109, 1972. Revised version in Lisp and Symb. Comp., Vol. 6, Nos. 3\/4, 1993.","journal-title":"Proc. of the ACM Conf. on Proving Properties about Programs, Sigplan Notices"},{"issue":"1","key":"14_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/114005.102805","volume":"13","author":"P. Fradet","year":"1991","unstructured":"P. Fradet and D. Le M\u00e9tayer. Compilation of functional languages by program transformation. ACM Trans. on Prog. Lang. and Sys., 13(1), pp. 21\u201351, 1991.","journal-title":"ACM Trans. on Prog. Lang. and Sys."},{"key":"14_CR8","first-page":"289","volume":"523","author":"G.S. Frandsen","year":"1991","unstructured":"G.S. Frandsen and C. Sturtivant. What is an efficient implementation of the \u03bb-calculus? In Proc. of the ACM Conf. on Functional Prog. Languages and Comp. Arch., LNCS Vol. 523, pp. 289\u2013312, 1991.","journal-title":"Proc. of the ACM Conf. on Functional Prog. Languages and Comp. Arch., LNCS"},{"issue":"4","key":"14_CR9","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1145\/1780.1803","volume":"6","author":"M. Georgeff","year":"1984","unstructured":"M. Georgeff. Transformations and reduction strategies for typed lambda expressions. ACM Trans. on Prog. Lang. and Sys., 6(4), pp. 603\u2013631, 1984.","journal-title":"ACM Trans. on Prog. Lang. and Sys."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"R.J.M. Hughes. Supercombinators, a new implementation method for applicative languages. In Proc. of the ACM Conf. on Lisp and Functional Programming, pp. 1\u201310, 1982.","DOI":"10.1145\/800068.802129"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"D. Kranz, R. Kelsey, J. Rees, P. Hudak, J. Philbin and N. Adams. Orbit: An optimizing compiler for scheme. In proc. of 1986 ACM SIGPLAN Symp. on Comp. Construction, 219\u2013233, 1986.","DOI":"10.1145\/13310.13333"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"J. Lamping. An algorithm for lambda calculus optimal reductions, In Proc. of the ACM Conf. on Princ. of Prog. Lang., pp. 16\u201330, 1990.","DOI":"10.1145\/96709.96711"},{"key":"14_CR13","unstructured":"J.-J. L\u00e9vy. R\u00e9ductions correctes et optimales dans le lambda calcul. Doctorat d'\u00e9tat, Paris VII, 1978."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"G. Nadathur and D.S.Wilson. A representation of lambda terms suitable for operations on their intensions, In Proc. of the ACM Conf. on Lisp and Functional Programming, pp. 341\u2013348, 1990.","DOI":"10.1145\/91556.91682"},{"key":"14_CR15","unstructured":"G. Nadathur and D. Miller. An overview of \u03bbProlog. In Proc. of the 5th Int. Conf. on Logic Prog., MIT Press, pp. 810\u2013827, 1988."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"G.D. Plotkin. Call-by-name, call-by-value and the \u03bb-calculus. Theoretical Computer Science, pp. 125\u2013159, 1975.","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"14_CR17","first-page":"440","volume":"73","author":"J. Staples","year":"1978","unstructured":"J. Staples. A graph-like lambda calculus for which leftmost-outermost reduction is optimal. In Graph Grammars and their Application, LNCS vol. 73, pp. 440\u2013455, 1978.","journal-title":"Graph Grammars and their Application, LNCS"},{"key":"14_CR18","unstructured":"C.P. Wadsworth. Semantics and Pragmatics of the Lambda-Calculus. PhD thesis, Oxford, 1971."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems \u2014 ESOP '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57880-3_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:14Z","timestamp":1605647714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57880-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578802","9783540483762"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-57880-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}