{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:43:18Z","timestamp":1725493398150},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667100"},{"type":"electronic","value":"9783540470182"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-47018-2_15","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T13:01:22Z","timestamp":1184590882000},"page":"356-366","source":"Crossref","is-referenced-by-count":0,"title":["Eta-Redexes in Partial Evaluation"],"prefix":"10.1007","author":[{"given":"Jens","family":"Palsberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Henk P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, 1984."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"U. Berger and H. Schwichtenberg. An inverse of the evaluation functional for typed \u03bb-calculus. In LICS\u201991, Sixth Annual Symposium on Logic in Computer Science, pages 203\u2013211, 1991.","DOI":"10.1007\/3-540-54487-9"},{"issue":"1\u20133","key":"15_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0167-6423(91)90035-V","volume":"17","author":"A. Bondorf","year":"1991","unstructured":"Anders Bondorf. Automatic autoprojection of higher order recursive equations. Science of Computer Programming, 17(1\u20133):3\u201334, December 1991.","journal-title":"Science of Computer Programming"},{"key":"15_CR4","unstructured":"Anders Bondorf and Dirk Dussart. Improving CPS-based partial evaluation: Writing cogen by hand. In Proc. ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 1\u201310, 1994."},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1017\/S0956796800001684","volume":"6","author":"A. Bondorf","year":"1996","unstructured":"Anders Bondorf and Jens Palsberg. Generating action compilers by partial evaluation. Journal of Functional Programming, 6(2):269\u2013298, 1996. Preliminary version in Proc. FPCA\u201993, Sixth ACM Conference on Functional Programming Languages and Computer Architecture, pages 308\u2013317, Copenhagen, Denmark, June 1993.","journal-title":"Journal of Functional Programming"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Charles Consel and Olivier Danvy. Tutorial notes on partial evaluation. In Proc. POPL\u201993, Twentieth Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 493\u2013501, 1993.","DOI":"10.1145\/158511.158707"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Olivier Danvy. Type-directed partial evaluation. In Proc. POPL\u201996, 23nd Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 242\u2013257, 1996.","DOI":"10.1145\/237721.237784"},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S0960129500001535","volume":"2","author":"O. Danvy","year":"1992","unstructured":"Olivier Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361\u2013391, 1992.","journal-title":"Mathematical Structures in Computer Science"},{"issue":"3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01019004","volume":"8","author":"O. Danvy","year":"1995","unstructured":"Olivier Danvy, Karoline Malmkj\u00e6r, and Jens Palsberg. The essence of eta-expansion in partial evaluation. Lisp and Symbolic Computation, 8(3):209\u2013227, 1995. Preliminary version in Proc. PEPM\u201994, ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 11\u201320, Orlando, Florida, June 1994.","journal-title":"Lisp and Symbolic Computation"},{"issue":"6","key":"15_CR10","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1145\/236114.236119","volume":"18","author":"O. Danvy","year":"1996","unstructured":"Olivier Danvy, Karoline Malmkj\u00e6r, and Jens Palsberg. Eta-expansion does the trick. ACM Transactions on Programming Languages and Systems, 18(6):730\u2013751, November 1996.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"15_CR11","unstructured":"Carsten K. Gomard. Program Analysis Matters. PhD thesis, DIKU, University of Copenhagen, November 1991. DIKU Report 91-17."},{"key":"15_CR12","unstructured":"Nevin Heintze. Set Based Program Analysis. PhD thesis, Carnegie Mellon University, October 1992. CMU-CS-92-201."},{"key":"15_CR13","unstructured":"Neil D. Jones. Automatic program specialization: A re-examination from basic principles. In Proc. Partial Evaluation and Mixed Computation, pages 225\u2013282, 1988."},{"key":"15_CR14","unstructured":"Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall International, 1993."},{"key":"15_CR15","series-title":"Technical Report","volume-title":"Rabbit: A compiler for Scheme","author":"G. L. Steele Jr","year":"1978","unstructured":"Guy L. Steele Jr. Rabbit: A compiler for Scheme. Technical Report AI-TR-474, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, May 1978."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Y. Minamide, G. Morrisett, and R. Harper. Typed closure conversion. In Proc. POPL\u201996, 23nd Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 271\u2013283, 1996.","DOI":"10.1145\/237721.237791"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Torben \u00c6 Mogensen. Constructor specialization. In Proc. PEPM\u201993, Second ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 22\u201332, 1993.","DOI":"10.1145\/154630.154633"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Christian Mossin. Partial evaluation of general parsers. In Proc. PEPM\u201993, Second ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 13\u201321, 1993.","DOI":"10.1145\/154630.154632"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Flemming Nielson and Hanne Riis Nielson. Two-Level Functional Languages. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511526572"},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1017\/S0956796800000770","volume":"3","author":"J. Palsberg","year":"1993","unstructured":"Jens Palsberg. Correctness of binding-time analysis. Journal of Functional Programming, 3(3):347\u2013363, 1993.","journal-title":"Journal of Functional Programming"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G. D. Plotkin","year":"1975","unstructured":"Gordon D. Plotkin. Call-by-name, call-by-value and the \u03bb-calculus. Theoretical Computer Science, 1:125\u2013159, 1975.","journal-title":"Theoretical Computer Science"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"John C. Reynolds. Definitional interpreters for higher-order programming languages. In Proc. 25th ACM National Conference, pages 717\u2013740. ACM Press, 1972.","DOI":"10.1145\/800194.805852"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Peter Sestoft. Replacing function parameters by global variables. In Proc. Conference on Functional Programming Languages and Computer Architecture, pages 39\u201353, 1989.","DOI":"10.1145\/99370.99374"},{"key":"15_CR24","unstructured":"Olin Shivers. Control-Flow Analysis of Higher-Order Languages. PhD thesis, CMU, May 1991. CMU-CS-91-145."},{"issue":"3","key":"15_CR25","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1017\/S0956796800000782","volume":"3","author":"M. Wand","year":"1993","unstructured":"Mitchell Wand. Specifying the correctness of binding-time analysis. Journal of Functional Programming, 3(3):365\u2013387, 1993.","journal-title":"Journal of Functional Programming"}],"container-title":["Lecture Notes in Computer Science","Partial Evaluation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47018-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:53:48Z","timestamp":1556668428000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47018-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667100","9783540470182"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-47018-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}