Declarative program transformation: A deforestation case-study

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

Volumn 1702, Issue , 1999, Pages 360-377

  Correnson, Loïc ^a   Duris, Etienne ^b   Parigot, Didier ^a   Roussel, Gilles ^c  

^a INRIA   (France)

^b CEDRIC IIE   (France)

^c Université de Marne la Vallée   (France)

Author keywords

Attribute grammars; Deforestation; Functional programming; Partial evaluation; Program transformation

Indexed keywords

CONTEXT SENSITIVE GRAMMARS; DEFORESTATION; LOGIC PROGRAMMING; SOFTWARE ENGINEERING; STRUCTURES (BUILT OBJECTS);

ACCUMULATING PARAMETERS; ATTRIBUTE GRAMMARS; DECLARATIVE PROGRAMS; GENERIC PROGRAMMING; PARTIAL EVALUATION; PROGRAM TRANSFORMATIONS; STRUCTURE CONSTRUCTIONS; TRANSFORMATION METHODS;

FUNCTIONAL PROGRAMMING;

EID: 84978963602     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10704567_22     Document Type: Conference Paper

References (29)

1. R. M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1): 44-67, January 1977. 361.
2. W. N. Chin and S. C. Khoo. Better consumers for deforestation. In Prog. Lang.: Impl., Logic and Programs (PLILP'95), LNCS # 982, Springer-Verlag, 1995. 361.
3. L. M. Chirica and D. F. Martin. An order-algebraic definition of Knuthian semantics. Mathematical Systems Theory, 13(1): 1-27, 1979. 364.
4. C. Consel. Program adaptation based on program specialization. In Workshop on Partial Evaluation and Semantics-Based Program Manipulation. PEPM'99, San Antonio, Texas, January 1999. ACM press. 361.
5. L. Correnson. Généricité dans les grammaires attribuées. Rapport de stage d'option, École Polytechnique, 1996. 375.
6. L. Correnson, E. Duris, D. Parigot, and G. Roussel. Generic programming by program composition (position paper). In Workshop on Generic Programming (WGP'98), Marstrand, Sweden, June 1998. 361, 375.
7. L. Correnson, E. Duris, D. Parigot and G. Roussel. Equational Semantics. In International Static Anaysis Symposium, Veneszia, Italy, September 1999. 375.
8. E. Duris. Contribution aux relations entre les grammaires attribuées et la program-mation fonctionnelle. PhD thesis, Université d'Orléans, October 1998. 362, 364, 373.
9. H. Ganzinger, R. Giegerich, and M. Vach. MARVIN: a tool for applicative and modular compiler specifications. Forschungsbericht 220, Fachbereich Informatik, University Dortmund, July 1986. 364.
10. R. Giegerich. Composition and evaluation of attribute coupled grammars. Acta Informatica, 25: 355-423, 1988. 369, 371, 371, 374.
11. A. Gill, J. Launchbury, and S. L. Peyton Jones. A short cut to deforestation. In Functional Programming and Computer Architecture (FPCA'93), Copenhagen, Denmark, June 1993. ACM Press. 361, 362.
12. G. W. Hamilton. Higher order deforestation. In Prog. Lang.: Impl., Logics and Programs (PLILP'96), LNCS # 1140, Aachen, September 1996. Springer-Verlag. 361.
13. Z. Hu, H. Iwasaki, and M. Takeishi. Deriving structural hylomorphisms from recursive definitions. In International Conference on Functional Programming (ICFP'96), Philadelphia, May 1996. ACM Press. 361, 362, 373.
14. P. Jansson and J. Jeuring. PolyP-a polytypic programming language extension. In Principles of Programming Languages (POPL'97), January 1997. ACM Press. 375.
15. T. Johnsson. Attribute grammars as a functional programming paradigm. In Functional Programming and Computer Architecture (FPCA'87), LNCS # 274, Portland, September 1987. Springer-Verlag. 363.
16. J. Launchbury and T. Sheard. Warm fusion: Deriving build-cata's from recursive definitions. In Functional Programming Languages and Computer Architecture (FPCA'95), La Jolla, CA, 1995. ACM Press. 361.
17. C. Le Bellec, M. Jourdan, D. Parigot, and G. Roussel. Specification and Implementation of Grammar Coupling Using Attribute Grammars. In Prog. Lang.: Impl., Logic and Programs (PLILP '93), LNCS # 714, Tallinn, August 1993. Springer-Verlag. 375.
18. E. Meijer, M. M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In Functional Programming and Computer Architecture (FPCA'91), LNCS # 523, Cambridge, September 1991. Springer-Verlag. 361.
19. J. Paakki. Attribute grammar paradigms-A high-level methodology in language implementation. ACM Computing Surveys, 27(2): 196-255, June 1995. 363.
20. J. Palsberg, B. Patt-Shamir, and K. Lieberherr. A new approach to compiling adaptive programs. In European Symposium on Programming (ESOP'96), Linkoping, Sweden, 1996. Springer Verlag. 375.
21. D. Parigot, E. Duris, G. Roussel, and M. Jourdan. Attribute grammars: a declarative functional language. Research Report 2662, INRIA, October 1995. 363.
22. D. Parigot, G. Roussel, M. Jourdan, and E. Duris. Dynamic Attribute Grammars. In Prog. Lang.: Impl., Logics and Programs (PLILP'96), LNCS # 1140, Aachen, September 1996. Springer-Verlag. 364.
23. G. Roussel. Algorithmes de base pour la modularité et la réutilisabilité des gram-maires attribuées. PhD thesis, Université de Paris 6, March 1994. 363, 375.
24. G. Roussel, D. Parigot, and M. Jourdan. Coupling Evaluators for Attribute Coupled Grammars. In Compiler Construction (CC' 94), LNCS # 786, Edinburgh, April 1994. Springer-Verlag. 375.
25. H. Seidl and M. H. Sárensen. Constraints to stop deforestation. Science of Com-puter Programming, 32(1-3): 73-107, September 1998. 361.
26. T. Sheard and L. Fegaras. A fold for all seasons. In Functional Programming and Computer Architecture (FPCA'93), Copenhagen, Denmark, June 1993. ACM Press. 361, 362, 362.
27. M. H. Sárensen, R. Glück, and N. D. Jones. Towards unifying deforestation, supercompilation, partial evaluation, and generalized partial computation. In European Symposium on Programming (ESOP'94), LNCS # 788, Springer-Verlag, 1994. 361.
28. A. Takano and E. Meijer. Shortcut deforestation in calculational form. In Func-tional Programming Languages and Computer Architecture (FPCA'95), La Jolla, CA, 1995. ACM Press. 361, 373.
29. P. Wadler. Deforestation: Transforming Programs to Eliminate Trees. In Euro-pean Symposium on Programming (ESOP '88), LNCS # 300, Nancy, March 1988. Springer-Verlag. 360, 361, 362.