{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:59Z","timestamp":1725664199280},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584858"},{"type":"electronic","value":"9783540490050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58485-4_57","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:28:21Z","timestamp":1330273701000},"page":"432-448","source":"Crossref","is-referenced-by-count":17,"title":["Generating transformers for deforestation and supercompilation"],"prefix":"10.1007","author":[{"given":"Robert","family":"Gl\u00fcck","sequence":"first","affiliation":[]},{"given":"Jesper","family":"J\u00f8rgensen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R. M. Burstall","year":"1977","unstructured":"Rod M. Burstall, and John Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1):44\u201367, 1977.","journal-title":"Journal of the ACM"},{"key":"28_CR2","series-title":"Workshops in Computing","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/978-1-4471-3810-5_2","volume-title":"Functional Programming","author":"A. Bondorf","year":"1991","unstructured":"Anders Bondorf. Compiling laziness by partial evaluation. In [JHH91]. Springer-Verlag, August 1991., pages 9\u201322, 1991."},{"key":"28_CR3","volume-title":"Similix 5.0 Manual","author":"A. Bondorf","year":"1993","unstructured":"Anders Bondorf. Similix 5.0 Manual. DIKU, University of Copenhagen, Denmark, May 1993. Included in Similix distribution, 82 pages."},{"issue":"5","key":"28_CR4","first-page":"45","volume":"2","author":"Y. Futamura","year":"1971","unstructured":"Yoshihiko Futamura. Partial evaluation of computing process \u2014 an approach to a compiler-compiler. Systems, Computers, Controls, 2(5):45\u201350, 1971.","journal-title":"Systems, Computers, Controls"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Robert Gl\u00fcck and Jesper J\u00f8rgensen. Generating optimizing specializers. In IEEE International Conference on Computer Languages, pages 183\u2013194. IEEE Computer Society Press, 1994.","DOI":"10.1109\/ICCL.1994.288382"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Robert Gl\u00fcck and Andrei V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot, M. Falaschi, G. Fil\u00e8, and G. Rauzy, editors, Static Analysis. Proceedings. Lecture Notes in Computer Science, Vol. 724, pages 112\u2013123. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57264-3_34"},{"key":"28_CR7","volume-title":"Technical report","author":"R. Gl\u00fcck","year":"1991","unstructured":"Robert Gl\u00fcck. On the generation of S\u2192R-specializers. Technical report, University of Technology Vienna, 1991. (Presented at the NYU Partial Computation and Program Analysis Day. June 21, 1991, New York)."},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Robert Gl\u00fcck. On the generation of specializers. Journal of Functional Programming, 4(3):(to appear), 1994.","DOI":"10.1017\/S0956796800001167"},{"issue":"2","key":"28_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/128861.128864","volume":"14","author":"C. K. Gomard","year":"1992","unstructured":"Carsten K. Gomard. A self-applicable partial evaluator for the lambda calculus: correctness and pragmatics. ACM TOPLAS, 14(2):147\u2013172, 1992.","journal-title":"ACM TOPLAS"},{"key":"28_CR10","unstructured":"Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993."},{"key":"28_CR11","series-title":"Workshops in Computing","volume-title":"Functional Programming","year":"1991","unstructured":"Simon L. Peyton Jones, Graham Hutton, and Carsten Kehler Holst, editors. Functional Programming, Glasgow 1990. Workshops in Computing. Springer-Verlag, August 1991."},{"key":"28_CR12","series-title":"Workshops in Computing","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-1-4471-3810-5_15","volume-title":"Functional Programming","author":"J. J\u00f8rgensen","year":"1991","unstructured":"Jesper J\u00f8rgensen. Generating a pattern matching compiler by partial evaluation. In [JHH91], pages 177\u2013195, 1991."},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Jesper J\u00f8rgensen. Generating a compiler for a lazy language by partial evaluation. In Nineteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. Albuquerque, New Mexico, pages 258\u2013268, January 1992.","DOI":"10.1145\/143165.143220"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science 202","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/3-540-15976-2_6","volume-title":"Rewriting Techniques and Applications","author":"N. D. Jones","year":"1985","unstructured":"Neil D. Jones, Peter Sestoft, and Harald S\u00f8ndergaard. An experiment in partial evaluation: the generation of a compiler generator. In J.-P. Jouannaud, editor, Rewriting Techniques and Applications, Dijon, France. Lecture Notes in Computer Science 202, pages 124\u2013140. Springer-Verlag, 1985."},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01806312","volume":"2","author":"N. D. Jones","year":"1989","unstructured":"Neil D. Jones, Peter Sestoft, and Harald S\u00f8ndergaard. Mix: a self-applicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, 2(1):9\u201350, 1989.","journal-title":"LISP and Symbolic Computation"},{"key":"28_CR16","unstructured":"David Sands. Total correctness and improvement in the transformation of functional programs. Unpublished, May 1994."},{"key":"28_CR17","unstructured":"Peter Sestoft. Automatic call unfolding in a partial evaluator. In Dines Bj\u00f8rner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 485\u2013506. North-Holland, 1988."},{"key":"28_CR18","first-page":"485","volume-title":"volume 788 of Lecture Notes in Computer Science","author":"M. H. S\u00f8rensen","year":"1994","unstructured":"Morten Heine S\u00f8rensen, Robert Gl\u00fcck, and Neil D. Jones. Towards unifying partial evaluation, deforestation, supercompilation, and GPC. In Donald Sannella, editor, Programming Languages and Systems \u2014 ESOP'94. Proceedings, volume 788 of Lecture Notes in Computer Science, pages 485\u2013500, Edinburgh, Scotland, 1994. Springer-Verlag."},{"key":"28_CR19","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/3-540-10003-2_105","volume-title":"Automata, Languages and Programming, volume 85 of Lecture Notes in Computer Science","author":"V. F. Turchin","year":"1980","unstructured":"Valentin F. Turchin. The use of metasystem transition in theorem proving and program optimization. In J. W. de Bakker, and J. van Leeuwen, editors, Automata, Languages and Programming, volume 85 of Lecture Notes in Computer Science, pages 645\u2013657, Noordwijkerhout, Netherlands, 1980. Springer-Verlag."},{"issue":"3","key":"28_CR20","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/5956.5957","volume":"8","author":"V. F. Turchin","year":"1986","unstructured":"Valentin F. Turchin. The concept of a supercompiler. Transactions on Programming Languages and Systems, 8(3):292\u2013325, 1986.","journal-title":"Transactions on Programming Languages and Systems"},{"issue":"3","key":"28_CR21","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1017\/S0956796800000757","volume":"3","author":"V. F. Turchin","year":"1993","unstructured":"Valentin F. Turchin. Program transformation with metasystem transitions. Journal of Functional Programming, 3(3):283\u2013313, 1993.","journal-title":"Journal of Functional Programming"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P. Wadler","year":"1990","unstructured":"Philip Wadler. Deforestation: transforming programs to eliminate trees. Theoretical Computer Science, 73:231\u2013248, 1990.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58485-4_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:45:34Z","timestamp":1687286734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58485-4_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584858","9783540490050"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-58485-4_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}