Conditions for efficiency improvement by tree transducer composition

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

Volumn 2378, Issue , 2002, Pages 222-236

  Voigtlönder, Janis ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENCY; FORESTRY; SEMANTICS; TRANSDUCERS;

CALL-BY-NEED; COMPUTATION TIME; EFFICIENCY IMPROVEMENT; FUNCTIONAL PROGRAMS; NORMAL FORM; PROGRAM TRANSFORMATION TECHNIQUES; TREE TRANSDUCERS;

MACROS;

EID: 0012611336     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. R.M. Burstall and J. Darlington. A transformation system for developing recursive programs. J. ACM, 24:44–67, 1977.
2. W.N. Chin. Safe fusion of functional expressions II: Further improvements. J. Funct. Prog., 4:515–555, 1994.
3. N. Dershowitz and J. P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 243–320. Elsevier Science Publishers B.V., 1990.
4. J. Engelfriet and H. Vogler. Macro tree transducers. J. Comput. Syst. Sci., 31:71–145, 1985.
5. Z. Fülöp and H. Vogler. Syntax-Directed Semantics—Formal Models Based on Tree Transducers. Monographs in Theoretical Computer Science. Springer-Verlag, 1998.
6. M. Höff. Vergleich von Verfahren zur Elimination von Zwischenergebnissen bei funktionalen Programmen. Master thesis, Dresden University of Technology, 1999.
7. A. Kühnemann. Benefits of tree transducers for optimizing functional programs. In Foundationsof Software Technology & Theoretical Computer Science, Chennai, India, Proceedings, volume 1530 of LNCS, pages 146–157. Springer-Verlag, 1998.
8. A. Kühnemann. Comparison of deforestation techniques for functional programs and for tree transducers. In Functional and Logic Programming, Tsukuba, Japan, Proceedings, volume 1722 of LNCS, pages 114–130. Springer-Verlag, 1999.
9. A. Kühnemann and J. Voigtländer. Tree transducer composition as deforestation method for functional programs. Technical Report TUD-FI01-07, Dresden University of Technology, 2001.
10. M. Rosendahl. Automatic complexity analysis. In Functional Programming Languagesand Computer Architecture, London, England, Proceedings, pages 144–156. ACM Press, 1989.
11. D. Sands. Total correctness by local improvement in the transformation of functional programs. ACM Trans. on Prog. Lang. and Systems, 18:175–234, 1996.
12. J. Voigtländer and A. Kühnemann. Composition of functions with accumulating parameters. Technical Report TUD-FI01-08, Dresden University of Technology, 2001. http://wwwtcs.inf.tu-dresden.de/˜voigt/TUD-FI01-08.ps.gz.
13. P. Wadler. Deforestation: Transforming programs to eliminate trees. Theoret. Comput. Sci., 73:231–248, 1990.
14. C.P. Wadsworth. Semanticsand Pragmaticsof the Lambda Calculus. PhD thesis, Oxford University, 1971.