Relating accumulative and non-accumulative functional programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2051 LNCS, Issue , 2001, Pages 154-168

  Kühnemann, Armin ^a   Glück, Robert ^b   Kakehi, Kazuhiko ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b WASEDA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; TRANSDUCERS;

ACCUMULATING PARAMETERS; FUNCTIONAL PROGRAMS; INVERSE TRANSFORMATIONS; TRANSFORMATION ALGORITHM; TREE TRANSDUCERS;

TREES (MATHEMATICS);

EID: 84888252431     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45127-7_13     Document Type: Conference Paper

References (25)

1. R. M. Burstall and J. Darlington. A transformation system for developing recursive programs. J. Assoc. Comput. Mach., 24:44-67, 1977.
2. W.-N. Chin. Safe fusion of functional expressions II: Further improvements. Journal of Functional Programming, 4:515-555, 1994.
3. O. Chitil. Type-inference based short cut deforestation (nearly) without inlining. In IFL'99, Lochem, The Netherlands, Proceedings, September 1999, volume 1868 of LNCS, pages 19-36. Springer-Verlag, April 2000.
4. B. Courcelle and P. Franchi-Zannettacci. Attribute grammars and recursive program schemes. Theor. Comp. Sci. , 17:163-191, 235-257, 1982.
5. J. Engelfriet. Some open questions and recent results on tree transducers and tree languages. In R.V. Book, editor, Formal language theory; perspectives and open problems, pages 241-286. New York, Academic Press, 1980.
6. J. Engelfriet and H. Vogler. Macro tree transducers. J. Comp. Syst. Sci., 31:71-145, 1985.
7. J. Engelfriet and H. Vogler. Modular tree transducers. Theor. Comp. Sci. , 78:267-304, 1991.
8. Z. Fulop. On attributed tree transducers. Acta Cybernetica, 5:261-279, 1981.
9. Z. Fulöp, F. Herrmann, S. Vagvolgyi, and H. Vogler. Tree transducers with external functions. Theor. Comp. Sci., 108:185-236, 1993.
10. Z. Fulop and H. Vogler. Syntax-directed semantics - Formal models based on tree transducers. Monographs in Theoretical Computer Science. Springer-Verlag, 1998.
11. H. Ganzinger. Increasing modularity and language-independency in automatically generated compilers. Science ofComputer Programming, 3:223-278, 1983.
12. R. Giegerich. Composition and evaluation of attribute coupled grammars. Acta Informatica, 25:355-423, 1988.
13. A.Gill. Cheap deforestation for non-strict functional languages. PhD thesis, University of Glasgow, 1996.
14. A. Gill, J. Launchbury, and S.L. Peyton Jones. A short cut to deforestation. In FPCA'93, Copenhagen, Denmark, Proceedings, pages 223-231. ACM Press, 1993.
15. M. Hoff. Vergleich von Verfahren zur Elimination von Zwischenergebnissen bei funktionalen Programmen. Master's thesis, Dresden University of Technology,1999.
16. D.E. Knuth. Semantics of context-free languages. Math. Syst. Th., 2:127-145, 1968.
17. Corrections in Math. Syst. Th., 5:95-96, 1971.
18. A. Kuhnemann. Benefits of tree transducers for optimizing functional programs. In FST & TCS'98, Chennai, India, Proceedings, volume 1530 of LNCS, pages 146157. Springer-Verlag, December 1998.
19. A. Kuöhnemann. Comparison of deforestation techniques for functional programs and for tree transducers. In FLOPS'99, Tsukuba, Japan, Proceedings, volume 1722 of LNCS, pages 114-130. Springer-Verlag, November 1999.
20. W.C. Rounds. Mappings and grammars on trees. Math. Syst.Th. , 4:257-287, 1970.
21. M. H. S0ørensen, R. Gluck, and N. D. Jones. A positive supercompiler. Journal of Functional Programming, 6:811-838, 1996.
22. J.W. Thatcher. Generalized2 sequential machine maps. J. Comp. Syst. Sci., 4:339-367, 1970.
23. V. F. Turchin. The concept of a supercompiler. ACM TOPLAS, 8:292-325, 1986.
24. P. Wadler. The concatenate vanishes. Note, University of Glasgow, December 1987 (Revised, November 1989).
25. P. Wadler. Deforestation: Transforming programs to eliminate trees. Theor. Comp. Sci. , 73:231-248, 1990.