{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:41:35Z","timestamp":1725457295534},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633983"},{"type":"electronic","value":"9783540695370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0033849","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T07:27:37Z","timestamp":1134286057000},"page":"259-273","source":"Crossref","is-referenced-by-count":1,"title":["Evaluation under lambda abstraction"],"prefix":"10.1007","author":[{"given":"Hongwei","family":"Xi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,21]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0956796800000186","volume":"4","author":"M. Abadi","year":"1991","unstructured":"M. Abadi, L. Cardelli, P.-L. Curien, and I.-I. L\u00e9vy (1991), Explicit substitutions, Journal of Functional Programming, 4(1), pp. 375\u2013416.","journal-title":"Journal of Functional Programming"},{"key":"17_CR2","unstructured":"S. Abramsky (1990), The lazy lambda calculus. In D. Turner, editor, Declarative Programming, Addison-Wesley Publishing Company."},{"key":"17_CR3","unstructured":"Z.M. Ariola, M. Felleisen, J. Maraist, M. Odersky and P. Wadler (1996), A Callby-Need Lambda Calculus, Proceedings of the 22 nd ACM Symposium on Principles of Programming Languages, San Francisco, pp. 233\u2013246"},{"key":"17_CR4","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H.P. Barendregt","year":"1984","unstructured":"H.P. Barendregt, The Lambda Calculus: Its Syntax and Semantics, North-Holland, Amsterdam, 1984."},{"issue":"2","key":"17_CR5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1006\/inco.1996.0041","volume":"126","author":"R. Bloo","year":"1996","unstructured":"R. Bloo, F. Kamareddine and R. Nederpelt (1996), The Barendregt cube with definitions and generalised reduction, Information and Computation, vol 126(2), pp. 123\u2013143. A useful lambda-notation, Theoretical Computer Science, vol. 155(1), pp 85\u2013109.","journal-title":"Information and Computation"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"R. Davies and F. Pfenning (1996), A Modal Analysis of Staged Computation, In Proceedings of the 23 rd ACM Symposium on Principles of Programming Languages, pp. 206\u2013209","DOI":"10.1145\/237721.237788"},{"key":"17_CR7","unstructured":"A.J. Field and P.G. Harrison (1988), Functional Programming, Addison-Wesley Publishing Company."},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1090\/S0002-9947-1978-0489603-9","volume":"240","author":"J.R. Hindley","year":"1978","unstructured":"J.R. Hindley (1978), Reductions of residuals are finite, Trans. Amer. Math. Soc. 240, pp. 345\u2013361.","journal-title":"Trans. Amer. Math. Soc."},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1017\/S0956796800001106","volume":"4","author":"G. Hu\u00e9t","year":"1994","unstructured":"G. Hu\u00e9t (1994), Residual Theory in \u03bb-Calculus: A Formal Development, Journal of Functional Programming Vol. 4, pp. 371\u2013394.","journal-title":"Journal of Functional Programming"},{"key":"17_CR10","unstructured":"R.J.M. Hughes (1984), The design and implementation of programming languages, Ph.D. thesis, University of Oxford."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"C.K. Holst and C.K. Gomard (1991), Partial Evaluation is Fuller Laziness, in Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 223\u2013233.","DOI":"10.1145\/115865.115890"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"R. Gl\u00fcck and J. J\u00f8rgensen (1995), Efficient multi-level generating extensions for program specialisation. In S.D. Swierstra and M. Hermenegildo, editors, Programming Languages, Implementations Logics and Programs, Springer-Verlag LNCS 982, pp. 259\u2013278.","DOI":"10.1007\/BFb0026825"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"T. Johnsson (1985), Lambda lifting: transforming programs to recursive equations, In Proceedings of the Conference on Functional programming Languages and Computer Architecture, Nancy, pp. 190\u2013203.","DOI":"10.1007\/3-540-15975-4_37"},{"issue":"1","key":"17_CR14","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(95)00101-8","volume":"155","author":"F. Kamareddine","year":"1996","unstructured":"F. Kamareddine and R. Nederpelt (1996), A useful lambda-notation, Theoretical Computer Science, vol. 155(1), pp 85\u2013109.","journal-title":"Theoretical Computer Science"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"J. Lamping (1990), An Algorithm for Optimal Lambda Calculus Reduction, In Seventeenth ACM Symposium on Principles of Programming Languages, pp 16\u201330.","DOI":"10.1145\/96709.96711"},{"issue":"4","key":"17_CR16","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P.J. Landin","year":"1964","unstructured":"P.J. Landin (1964), The mechanical evaluation of expressions, BCS Computing Journal 6(4), pp. 308\u2013320.","journal-title":"BCS Computing Journal"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"S.L. Peyton Jones (1991), A fully-lazy \u03bb-lifter in Haskell, Software practice and experience 21.","DOI":"10.1002\/spe.4380210505"},{"key":"17_CR18","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"G.D. Plotkin (1975), Call-by-name, call-by-value and the lambda-calculus, Theoretical Computer Science 1, pp. 125\u2013159.","journal-title":"Theoretical Computer Science"},{"key":"17_CR19","unstructured":"C. Reade (1989), Elements of Functional Programming, Addison-Wesley Publishing Company."},{"key":"17_CR20","unstructured":"H. Xi (1996), Separating developments in \u03bb-calculus http:\/\/www.cs.cmu.edu\/-hwxi\/papers\/SepDev.ps"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"H. Xi (1996), Evaluation under lambda abstraction: http:\/\/www.cs.cmu.edu\/-hwxi\/papers\/EvUdLam.ps","DOI":"10.1007\/BFb0033849"},{"key":"17_CR22","unstructured":"H. Xi (1997), Generalized Lambda-Calculi: http:\/\/www.cs.cmu.edu\/-hwxi\/papers\/GLam.ps"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"N. Yoshida (1993), Optimal reduction in weak \u03bb-calculus with shared environments. In Proc. ACM conference on Functional Programming Languages and Computer Architecture, Copenhagen.","DOI":"10.1145\/165180.165217"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics, and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0033849","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:51:21Z","timestamp":1586613081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0033849"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633983","9783540695370"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0033849","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}