Benefits of tree transducers for optimizing functional programs

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

Volumn 1530 LNCS, Issue , 1998, Pages 146-158

  Kühnemann, Armin ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTE GRAMMARS; FUNCTION DEFINITIONS; FUNCTIONAL PROGRAMS; INITIAL FUNCTIONS; TREE TRANSDUCERS;

SOFTWARE ENGINEERING; TRANSDUCERS;

FORESTRY;

EID: 84887071127     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49382-2_13     Document Type: Conference Paper

References (18)

1. L. Correnson, E. Duris, D. Parigot, and G. Roussel. Symbolic composition. Technical Report 3348, INRIA, France, 1998. 147
2. B. Courcelle and P. Franchi-Zannettacci. Attribute grammars and recursive program schemes. Theoret. Comput. Sci., 17:163-191, 235-257, 1982. 147, 156
3. E. Duris, D. Parigot, G. Roussel, and M. Jourdan. Attribute grammars and folds: generic control operators. Technical Report 2957, INRIA, France, 1996. 157
4. 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. 147, 152
5. J. Engelfriet. Tree transducers and syntax directed semantics. Technical Report Memorandum 363, Technische Hogeschool Twente, 1981. 147, 153, 154
6. J. Engelfriet and H. Vogler. Macro tree transducers. J. Comp. Syst. Sci., 31:71-145, 1985. 147, 152, 155, 157
7. Z. Fülöp. On attributed tree transducers. Acta Cybernetica, 5:261-279, 1981. 147, 155, 156
8. H. Ganzinger. Increasing modularity and language-independency in automatically generated compilers. Science of Computer Programming, 3:223-278, 1983. 146, 155, 156 (Pubitemid 14530390)
9. H. Ganzinger and R. Giegerich. Attribute coupled grammars. In Symposium on Compiler Construction, SIGPLAN Notices Vol.19, No.6, pages 157-170, 1984. 146, 155
10. R. Giegerich. Composition and evaluation of attribute coupled grammars. Acta Informatica, 25:355-423, 1988. 146, 155, 156
11. T. Johnsson. Attribute grammars as a functional programming paradigm. In FPCA'87, Portland, volume 274 of LNCS, pages 154-173. Springer-Verlag, 1987. 146
12. D.E. Knuth. Semantics of context-free languages. Math. Syst. Th., 2:127-145, 1968. Corrections in Math. Syst. Th., 5:95-96, 1971. 146, 147
13. A. Kühnemann. Berechnungsstärken von Teilklassen primitiv-rekursiver Programmschemata. PhD thesis, Technical Univ. of Dresden, 1997. Shaker Verlag. 147, 153, 154, 155, 156
14. A. Kühnemann and H. Vogler. Synthesized and inherited functions-a new computational model for syntax-directed semantics. Acta Informatica, 31:431-477, 1994. 147, 149, 151, 152, 156
15. W.C. Rounds. Mappings and grammars on trees. Math. Syst.Th., 4:257-287, 1970. 147, 156
16. H. Seidl and M.H. Sorensen. Constraints to stop higher-order deforestation. In POPL'97, Paris, pages 400-413. ACM Press, 1997. 147
17. J.W. Thatcher. Generalized2 sequential machine maps. J.Comp.Syst.Sci., 4:339- 367, 1970. 147
18. P. Wadler. Deforestation: Transforming programs to eliminate trees. Theor. Comp. Sci., 73:231-248, 1990. 146 (Pubitemid 20720962)