On deforesting parameters of accumulating maps

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

Volumn 2372, Issue , 2002, Pages 46-56

  Kakehi, Kazuhiko ^a   Gluck, Robert ^c   Futamura, Yoshihiko ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b WASEDA UNIVERSITY   (Japan)

^c UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; DEFORESTATION; LOGIC PROGRAMMING; METADATA; RECONFIGURABLE HARDWARE;

ACCUMULATING PARAMETERS; ATTRIBUTE GRAMMARS; COMPOSITION RULE; FUNCTIONAL PROGRAMS; NEW FUNCTIONS; PROGRAM TRANSFORMATION TECHNIQUES; SYMMETRIC EXTENSION;

METADATA; COMPUTER CIRCUITS;

EID: 36849041532     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45607-4_3     Document Type: Conference Paper

References (26)

1. R. Burstall and J. Darlington. A transformation system for developing recursive programs. J. ACM, 24(1): 44-67, 1977
2. W.-N. Chin. Safe fusion of functional expressions II: Further improvements. J. Funct. Prog., 4(4): 515-555, 1994
3. O. Chitil. Type inference builds a short cut to deforestation. Proc. of the International Conference on Functional Programming, 249-260, ACM Press 1999
4. L. Correnson, E. Duris, D. Parigot, and G. Roussel. Declarative program transformation: A deforestation case-study. In G. Nadathur (ed.), Principles and Practice of Declarative Programming, LNCS 1702, 360-377, Springer-Verlag 1999
5. Z. Fulop. On attributed tree transducers. Acta Cybern., 5: 261-279, 1981
6. Z. Fulop and H. Vogler. Syntax-directed semantics: Formal models based on tree transducers. EATCS Monographs Theoret. Comp. Sci., Springer-Verlag 1998
7. H. Ganzinger. Increasing modularity and language-independency in automatically generated compilers. Sci. Comput. Prog., 3: 223-278, 1983
8. R. Giegerich. Composition and evaluation of attribute coupled grammars. Acta Inf., 25(4): 355-423, 1988
9. A. Gill, J. Launchbury, and S. Jones. A short cut to deforestation. In Proc. Conference on Functional Programming Languages and Computer Architecture, 223-232, ACM Press 1993
10. Z. Hu, H. Iwasaki, and M. Takeichi. Calculating accumulations. New Gener. Comput., 17(2): 153-173, 1999
11. T. Johnsson. Attribute grammars as a functional programming paradigm. In G. Kahn (ed.), Functional Programming Languages and Computer Architecture, LNCS 274, 154-173, Springer-Verlag 1987
12. K. Kakehi, R. Gluck, and Y. Futamura. An Extension of Shortcut Deforestation for Accumulative List Folding. IEICE Trans. on Inf. & Syst., to appear
13. A. Kuhnemann. Berechnungsstarken von Teilklassen primitiv-rekursiver Programmschemata. Ph.D thesis, Technical University of Dresden, 1997. In German
14. A. Kuhnemann. Benefits of tree transducers for optimizing functional programs. In V. Arvind and R. Pamanujan (eds.), Foundations of Software Technology and Theoretical Computer Science, LNCS 1530, 146-157, Springer-Verlag 1998
15. A. Kuhnemann. Comparison of deforestation techniques for functional programs and for tree transducers. In A. Middeldorp and T. Sato (eds.), Functional and Logic Programming, LNCS 1722, 114-130, Springer-Verlag 1999
16. A. Kuhnemann, R. Gluck, and K. Kakehi. Relating accumulative and nonaccumulative functional programs. In A. Middeldorp (ed.), Rewriting Techniques and Applications, LNCS 2051, 154-168, Springer-Verlag 2001
17. J. Launchbury and T. Sheard. Warm fusion: Deriving build-catas from recursive definitions. In Proc. International Conference on Functional Programming Languages and Computer Architecture, 314-323, ACM Press 1995
18. A. Pettorossi. Program development using lambda abstraction. In K. Nori (ed.), Foundations of Software Technology and Theoretical Computer Science, LNCS 287, 420-434, Springer-Verlag 1987
19. A. Pettorossi and A. Skowron. The lambda abstraction strategy for program derivation. Fund. Inform., 12(4): 541-561, 1989
20. D. Sands. Total correctness by local improvement in the transformation of functional programs. ACM TOPLAS, 18(2): 175-234, 1996
21. M. H. Srensen, R. Gluck, and N. D. Jones. A positive supercompiler. J. Funct. Prog., 6(6): 811-838, 1996
22. V. Turchin. The concept of a supercompiler. ACM TOPLAS, 8(3): 292-325, 1986
23. P. Wadler. The concatenate vanishes. Internal report, Dept. of Comp. Sci., Univ. of Glasgow, 1987
24. P. Wadler. Deforestation: transforming programs to eliminate trees. Theoret. Comput. Sci., 73(2): 231-248, 1990
25. M. Wand. Continuation-based program transformation strategies. J. ACM, 27(1): 164-180, 1980
26. D. Whitfield and M. Soffa. An approach for exploring code-improving transformations. ACM TOPLAS, 19(6): 1053-1084, 1997.