Using circular programs to deforest in accumulating parameters

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue SEP., 2002, Pages 126-137

  Voigtländer, Janis ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Accumulating parameters; Circular programs; Deforestation; Intermediate data structures; Lazy composition; Lazy evaluation; Multiple traversals; Program transformation; Tupling

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; DATA STRUCTURES; RECURSIVE FUNCTIONS; TIME SHARING PROGRAMS;

CIRCULAR PROGRAMS; FUNCTIONAL LANGUAGES; MODULAR PROGRAMMING;

PROGRAM DIAGNOSTICS;

EID: 0036957022     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/568173.568187     Document Type: Conference Paper

References (28)

1. R. Bird. Using circular programs to eliminate multiple traversals of data. Acta Informatica, 21:239-250, 1984.
2. R. Burstall and J. Darlington. A transformation system for developing recursive programs. J. ACM, 24:44-67, 1977.
3. W. Chin. Safe fusion of functional expressions II: Further improvements. J. Funct. Prog., 4:515-555, 1994.
4. W. Chin, A. Goh, and S. Khoo. Effective optimisation of multiple traversals in lazy languages. In Partial Evaluation and Semantics-Based Program Manipulation, San Antonio, Texas, Proceedings, Technical Report, University of Aarhus, Denmark, pages 119-130, 1999.
5. O. Chitil. Type-Inference Based Deforestation of Functional Programs. PhD thesis, RWTH Aachen, 2000.
6. L. Correnson, E. Duris, D. Parigot, and G. Roussel. Declarative program transformation: A deforestation case-study. In Principles and Practice of Declarative Programming, Paris, France, Proceedings, Volume 1702 of LNCS, pages 360-377. Springer-Verlag, 1999.
7. J. Engelfriet and H. Vogler. Macro tree transducers. J. Comput. Syst. Sci., 31:71-145, 1985.
8. Z. Fülöp. On attributed tree transducers. Acta Cybernetica, 5:261-279, 1981.
9. G. Gill, J. Launchbury, and S. Peyton Jones. A short cut to deforestation. In Functional Programming Languages and Computer Architecture, Copenhagen, Denmark, Proceedings, pages 223-232. ACM Press, 1993.
10. J. Groningen. Optimising recursive functions yielding multiple results in tuples in a lazy functional language. In Implementation of Functional Languages, Lochem, The Netherlands, Proceedings, Volume 1868 of LNCS, pages 59-76. Springer-Verlag, 1999.
11. G. Hamilton and S. Jones. Extending deforestation for first order functional programs. In 1991 Glasgow Workshop on Functional Programming, Portree, Scotland, Proceedings, Series of Workshops in Computing, pages 134-145. Springer-Verlag, 1992.
12. +. Progress report, Dresden University of Technology, 2001. http://wwwtcs.inf.tu-dresden.de/~voigt/hpgreport.ps.gz.
13. P. Johann. Short cut fusion: Proved and improved. In Semantics, Applications, and Implementation of Program Generation, Florence, Italy, Proceedings, Volume 2196 of LNCS, pages 47-71. Springer-Verlag, 2001.
14. T. Johnsson. Attribute grammars as a functional programming paradigm. In Functional Programming Languages and Computer Architecture, Portland, Oregon, Proceedings, Volume 274 of LNCS, pages 154-173. Springer-Verlag, 1987.
15. K. Kakehi, R. Glück, and Y. Futamura. On deforesting parameters of accumulating maps. In Logic Based Program Synthesis and Transformation, Paphos, Cyprus, Proceedings, Volume 2372 of LNCS, pages 46-56. Springer-Verlag, 2001.
16. A. Kühnemann. Benefits of tree transducers for optimizing functional programs. In Foundations of Software Technology & Theoretical Computer Science, Chennai, India, Proceedings, Volume 1530 of LNCS, pages 146-157. Springer-Verlag, 1998.
17. 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.
18. M. Kuiper and S Swiestra. Using attribute grammars to derive efficient functional programs. In Computing Science in the Netherlands, Amsterdam, The Netherlands, Proceedings. SION, 1987.
19. R. Milner. A theory of type polymorphism in programming. J. Comput. Syst. Sci., 17:348-375, 1978.
20. A. Pettorossi. Transformation of programs and use of tupling strategy. In Informatica, Bled, Yugoslavia, Proceedings, pages 1-6, 1977.
21. A. Pettorossi. Derivation of programs which traverse their input data only once. In Advanced School on Programming Methodologies, Rome, Italy, Proceedings, pages 165-184. Academic Press, 1987.
22. S. Peyton Jones and S. Marlow. Secrets of the Glasgow Haskell Compiler inliner. In Workshop on Implementing Declarative Languages, Paris, France, Proceedings, 1999.
23. D. Sands. Total correctness by local improvement in the transformation of functional programs. ACM Trans. on Prog. Lang. and Systems, 18:175-234, 1996.
24. J. Svenningsson. Shortcut fusion for accumulating parameters & zip-like functions. In International Conference on Functional Programming, Pittsburgh, Pennsylvania, Proceedings. ACM Press, to appear, 2002.
25. J. Voigtländer. Composition of restricted macro tree transducers. Master's thesis, Dresden University of Technology, 2001. http://wwwtcs.inf.tu-dresden.de/~voigt/mscthesis.ps.gz.
26. J. Voigtländer. Conditions for efficiency improvement by tree transducer composition. In Rewriting Techniques and Applications, Copenhagen, Denmark, Proceedings, Volume 2378 of LNCS, pages 222-236. Springer-Verlag, 2002.
27. J. Voigtländer and A. Kühnemann. Composition of functions with accumulating parameters. Technical Report TUD-FI01-08, Dresden University of Technology, 2001.
28. P. Wadler. Deforestation: Transforming programs to eliminate trees. Theoret. Comput. Sci., 73:231-248, 1990.