{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:21Z","timestamp":1761611181344},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643012"},{"type":"electronic","value":"9783540697213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0052377","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:31:11Z","timestamp":1149658271000},"page":"286-301","source":"Crossref","is-referenced-by-count":4,"title":["Higher-order rewriting and partial evaluation"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Danvy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristoffer H\u00d8gsbro","family":"Rose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,18]]},"reference":[{"key":"22_CR1","unstructured":"Henk Barendregt. The Lambda Calculus \u2014Its Syntax and Semantics. North-Holland, 1984."},{"key":"22_CR2","unstructured":"Anders Bondorf. Towards a self-applicable partial evaluator for term rewriting systems. In Dines Bj\u00d8rner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 27\u201350. North-Holland, 1988."},{"key":"22_CR3","first-page":"493","volume-title":"Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages","author":"C. Consel","year":"1993","unstructured":"Charles Consel and Olivier Danvy. Tutorial notes on partial evaluation. In Susan L. Graham, editor, Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages, pages 493\u2013501, Charleston, South Carolina, January 1993. ACM Press."},{"issue":"4","key":"22_CR4","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, December 1992.","journal-title":"Mathematical Structures in Computer Science"},{"key":"22_CR5","volume-title":"Technical report CMU-CS-95-121","author":"O. Danvy","year":"1995","unstructured":"Olivier Danvy and Frank Pfenning. The occurrence of continuation parameters in CPS terms. Technical report CMU-CS-95-121, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, February 1995."},{"key":"22_CR6","volume-title":"Technical Report BRICS RS-97-46","author":"O. Danvy","year":"1997","unstructured":"Olivier Danvy and Kristoffer H0gsbro Rose. Higher-order rewriting and partial evaluation. Technical Report BRICS RS-97-46, Department of Computer Science, University of Aarhus, Aarhus, Denmark, December 1997."},{"issue":"3","key":"22_CR7","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1145\/3916.3986","volume":"7","author":"N. Dershowitz","year":"1985","unstructured":"Nachum Dershowitz. Program abstraction and instantiation. ACM Transactions on Programming Languages and Systems, 7(3):446\u2013477, 1985.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"8","key":"22_CR8","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Nachum Dershowitz and Zohar Manna. Proving termination with multiset orderings. Communications of the ACM, 22(8):465\u2013476, 1979.","journal-title":"Communications of the ACM"},{"key":"22_CR9","unstructured":"Daniel P. Friedman, Mitchell Wand, and Christopher T. Haynes. Essentials of Programming Languages. The MIT Press and McGraw-Hill, 1991."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"John Hughes. Super combinators: A new implementation method for applicative languages. In Daniel P. Friedman and David S. Wise, editors, Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming, pages 1\u201310, Pittsburgh, Pennsylvania, August 1982.","DOI":"10.1145\/800068.802129"},{"key":"22_CR11","unstructured":"Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall International Series in Computer Science. Prentice-Hall, 1993."},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Neil D. Jones, Peter Sestoft, and Harald S\u00d8ndergaard. An experiment in partial evaluation: The generation of a compiler generator. In Jean-Pierre Jouannaud, editor, Rewriting Techniques and Applications, number 202 in Lecture Notes in Computer Science, pages 124\u2013140, Dijon, France, May 1985.","DOI":"10.1007\/3-540-15976-2_6"},{"key":"22_CR13","volume-title":"Introduction to Metamathematics","author":"S. C. Kleene","year":"1952","unstructured":"Stephen C. Kleene. Introduction to Metamathematics. D. van Nostrand, Princeton, New Jersey, 1952."},{"key":"22_CR14","volume-title":"Mathematical Centre Tracts 127","author":"J. W. Klop","year":"1980","unstructured":"Jan Willem Klop. Combinatory Reduction Systems. Mathematical Centre Tracts 127. Mathematisch Centrum, Amsterdam, 1980."},{"key":"22_CR15","first-page":"2","volume-title":"Handbook of Logic in Computer Science, Vol. 2","author":"J. W. Klop","year":"1992","unstructured":"Jan Willem Klop. Term rewriting systems. In Samson Abramsky, Dov M. Gabby, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Vol. 2, chapter 1, pages 2\u2013116. Oxford University Press, Oxford, 1992."},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","volume":"121","author":"J. W. Klop","year":"1993","unstructured":"Jan Willem Klop, Vincent van Oostrom, and Femke van Raamsdonk. Combinatory reduction systems: Introduction and survey. Theoretical Computer Science, 121:279\u2013308, 1993.","journal-title":"Theoretical Computer Science"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Flemming Nielson and Hanne Riis Nielson. 2-level \u03bb-lifting. In Harald Ganzinger, editor, Proceedings of the Second European Symposium on Programming, number 300 in Lecture Notes in Computer Science, pages 328\u2013343, Nancy, France, March 1988.","DOI":"10.1007\/3-540-19027-9_22"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Tobias Nipkow. Orthogonal higher-order rewrite systems are confluent. In M. Bezem and J. F. Groote, editors, Typed Lambda Calculi and Applications, number 664 in Lecture Notes in Computer Science, pages 306\u2013317, Utrecht, The Netherlands, March 1993.","DOI":"10.1007\/BFb0037114"},{"issue":"3","key":"22_CR19","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, July 1993.","journal-title":"Journal of Functional Programming"},{"key":"22_CR20","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":"22_CR21","unstructured":"Kristoffer H\u00d8gsbro Rose. Operational Reduction Models for Functional Programming Languages. PhD thesis, DIKU, Computer Science Department, University of Copenhagen, Universitetsparken 1, DK-2100 K\u00d8benhavn \u00d8, February 1996. DIKU report 96\/1, available from (URL: http:\/\/www.diku.dk\/ research\/published\/96-1.ps.gz)."},{"issue":"3\/4","key":"22_CR22","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01019462","volume":"6","author":"A. Sabry","year":"1993","unstructured":"Amr Sabry and Matthias Felleisen. Reasoning about programs in continuationpassing style. LISP and Symbolic Computation, 6(3\/4):289\u2013360, December 1993.","journal-title":"LISP and Symbolic Computation"},{"key":"22_CR23","first-page":"13","volume-title":"Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming","author":"A. Sabry","year":"1996","unstructured":"Amr Sabry and Philip Wadler. Compiling with reflections. In R. Kent Dybvig, editor, Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, pages 13\u201324, Philadelphia, Pennsylvania, May 1996. ACM Press."},{"key":"22_CR24","first-page":"72","volume-title":"Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, SIGPLAN Notices, Vol. 26","author":"D. Sherman","year":"1991","unstructured":"David Sherman and Robert Strandh. Optimization of equational programs using partial evaluation. In Paul Hudak and Neil D. Jones, editors, Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, SIGPLAN Notices, Vol. 26, No 9, pages 72\u201382, New Haven, Connecticut, June 1991. ACM Press."},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Vincent van Oostrom and Femke van Raamsdonk. Comparing combinatory reduction systems and higher-order rewrite systems. In HOA-93, volume 816 of LNCS, pages 276\u2013304. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-58233-9_13"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Vincent van Oostrom and Femke van Raamsdonk. Weak orthogonality implies confluence: the higher-order case. Technical Report CS-R9501, CWI, 1995.","DOI":"10.1007\/3-540-58140-5_35"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T06:33:36Z","timestamp":1555655616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643012","9783540697213"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0052377","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}