Comparison of deforestation techniques for functional programs and for tree transducers

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

Volumn 1722, Issue , 1999, Pages 114-130

  Kühnemann, Armin ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; DEFORESTATION; LOGIC PROGRAMMING; TRANSDUCERS;

COMPOSITION TECHNIQUE; FIRST-ORDER FUNCTIONAL PROGRAMS; FUNCTION DEFINITIONS; FUNCTIONAL PROGRAMS; INTERMEDIATE RESULTS; TREE TRANSDUCERS;

FUNCTIONAL PROGRAMMING;

EID: 84957700875     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10705424_8     Document Type: Conference Paper

References (20)

1. R. M. Burstall and J. Darlington. A transformation system for developing recursive programs. J. Assoc. Comput. Mach., 24:44-67, 1977. 118
2. B. Courcelle and P. Franchi-Zannettacci. Attribute grammars and recursive program schemes. Theoret. Comput. Sci., 17:163-191, 235-257, 1982. 114
3. 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. 114
4. J. Engelfriet and H. Vogler. Macro tree transducers. J. Comput. Syst. Sci., 31:71-145, 1985. 114, 115, 117, 121, 121, 122, 123
5. A.B. Ferguson and P. Wadler. When will deforestation stop? In 1988 Glasgow Workshop on Functional Programming, pages 39-56, 1988. 114, 118
6. Z. Fülöp. On attributed tree transducers. Acta Cybernetica, 5:261-279, 1981. 129, 129
7. Z. Fülöp and H. Vogler. Syntax-directed semantics - Formal models based on tree transducers. Monographs in Theoretical Computer Science, An EATCS Series. Springer-Verlag, 1998. 114, 117
8. H. Ganzinger. Increasing modularity and language-independency in automatically generated compilers. Science of Computer Programming, 3:223-278, 1983. 129
9. R. Giegerich. Composition and evaluation of attribute coupled grammars. Acta Informatica, 25:355-423, 1988. 129
10. A. Gill. Cheap deforestation for non-strict functional languages. PhD thesis, University of Glasgow, 1996. 129
11. 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. 129
12. G. W. Hamilton and S. B. Jones. Extending deforestation for first order functional programs. In 1991 Glasgow Workshop on Functional Programming, Series of Workshops in Computing, pages 134-145. Springer-Verlag, 1992. 119
13. J. Hughes. Why functional programming matters. In D. Turner, editor, Research Topics in Functional Programming. Addison-Wesley, 1990. 114
14. D.E. Knuth. Semantics of context-free languages. Math. Syst. Th., 2:127-145, 1968. Corrections in Math. Syst. Th., 5:95-96, 1971. 129
15. A. Kühnemann. Benefits of tree transducers for optimizing functional programs. In FST & TCS’98, Chennai, India, Proceedings, volume 1530 of LNCS, pages 146-157. Springer-Verlag, December 1998. 129
16. A. Kühnemann and H. Vogler. Synthesized and inherited functions - a new compu- tational model for syntax-directed semantics. Acta Informatica,31: 431-477, 1994. 129
17. W.C. Rounds. Mappings and grammars on trees. Math. Syst. Th.,4:257-287, 1970. 115, 121
18. M. H. Sørensen, R. Glück, and N. D. Jones. Towards unifying partial evaluation, deforestation, supercompilation, and GPC. In ESOP’94, Edinburgh, U.K., Proceedings, volume 788 of LNCS, pages 485-500. Springer-Verlag, 1994. 118, 119, 120, 120, 120, 120, 125
19. J.W. Thatcher. Generalized2 sequential machine maps. J. Comput. Syst. Sci., 4: 339-367, 1970. 115
20. P. Wadler. Deforestation: Transforming programs to eliminate trees. Theor. Comp. Sci., 73:231-248, 1990. 114, 118, 119, 119, 120, 120, 124, 125