Warm fusion in Stratego: A case study in generation of program transformation systems

Annals of Mathematics and Artificial Intelligence

Volumn 29, Issue 1-4, 2000, Pages 1-34

  Johann, Patricia ^a   Visser, Eelco ^b  

^a BATES COLLEGE   (United States)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034559071     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018956702672     Document Type: Article

References (39)

1. A.W. Appel, Compiling with Continuations (Cambridge University Press, 1992).
2. R.M. Burstall and J. Darlington, A transformational system for developing recursive programs, J. of the ACM 24(1) (1977) 44-67.
3. W.N. Chin, Safe fusion of functional expressions, ACM Lisp Pointers 5(1) (1992) 11-20, Proceedings of the 1992 ACM Conference on Lisp and Functional Programming.
4. M. de Jonge, A pretty-printer for every occasion, in: Proceedings of the 2nd International Symposium on Constructing Software Engineering Tools (CoSET2000), eds. I. Ferguson, J. Gray and L. Scott, Limerick, Ireland (June 2000); also: Technical Report, University of Wollongong, Australia.
5. M. de Jonge, A pretty-printer for every occasion, in: Proceedings of the 2nd International Symposium on Constructing Software Engineering Tools (CoSET2000), eds. I. Ferguson, J. Gray and L. Scott, Limerick, Ireland (June 2000); also: Technical Report, University of Wollongong, Australia.
6. M. Fokkinga, Law and order in algorithmics, Ph.D. thesis, Twente University (1992).
7. P. Fradet and D. Le Métayer, Compilation of functional languages by program transformation, ACM Trans. Programming Languages Syst. 13(1) (1991) 21-51.
8. A.J. Gill, Cheap deforestation for non-strict functional languages, Ph.D. thesis, University of Glasgow (January 1996).
9. A. Gill, J. Launchbury and S.L. Peyton Jones, A short cut to deforestation, in: Functional Programming Languages and Computer Architecture (FPCA'93), ed. Arvind (ACM Press, 1993) pp. 223-232.
10. T. Hagino, A categorical programming language, Ph.D. thesis, University of Edinburgh (1987).
11. Z. Hu, H. Iwasaki and M. Takeichi, Deriving structural hylomorphisms from recursive definitions, ACM SIGPLAN Notices 31(6) (1996) 73-82, Proceedings of the International Conference on Functional Programming (ICFP'96), Philadelphia.
12. P. Johann, An implementation of warm fusion, available at ftp://ftp.cse.ogi.edu/pub/ pacsoft/wf/ (1997).
13. P. Johann, Short cut fusion is correct, Technical report, Bates College, Lewiston, Maine, USA (2000).
14. P. Johann and E. Visser, Warm fusion in Stratego: A case study in the generation of program transformation systems, Technical report, Institute of Information and Computing Sciences, Universiteit Utrecht, Utrecht, The Netherlands (2000).
15. J. Launchbury and T. Sheard, Warm fusion: Deriving build-catas from recursive definitions, in: Functional Programming Languages and Computer Architecture (FPCA'95), ed. S.L. Peyton Jones (ACM Press, 1995) pp. 314-323.
16. B. Luttik and E. Visser, Specification of rewriting strategies, in: 2nd International Workshop on the Theory and Practice of Algebraic Specifications (ASF+SDF'97), ed. M.P.A. Sellink, Electronic Workshops in Computing, Berlin, November 1997 (Springer, Berlin, 1997).
17. G. Malcolm, Homomorphisms and promotability, in: Mathematics of Program Construction, Lecture Notes in Computer Science, Vol. 375 (Springer, Berlin, 1989) pp. 335-347.
18. G.J. Malcolm, Data structures and program transformation, Sci. Comput. Programming 14 (1990) 255-279.
19. E. Meijer, M. Fokkinga and R. Paterson, Functional programming with bananas, lenses, envelopes and barbed wire, in: Functional Programming and Computer Architecture (FPCA'91), ed. R.J.M. Hughes, Lecture Notes in Computer Science, Vol. 523 (Springer, Berlin, 1991) pp. 124-144.
20. L. Németh, Catamorphism based program transformation for non-strict functional langauges, Draft, Ph.D. thesis, University of Glasgow (2000).
21. W. Partain, The nofib benchmark suite of Haskell programs, in: Functional Programming, eds. J. Launchbury and P.M. Sansom (Springer, Berlin, 1992) pp. 195-202.
22. S. Peyton Jones, J. Hughes et al., Report of the programming language Haskell98 a non-strict, purely functional language (February 1999).
23. S.L. Peyton Jones and J. Launchbury, Unboxed values as first class citizens in a non-strict functional language, in: Functional Programming and Computer Architecture (FPCA'91), ed. R.J.M. Hughes, Lecture Notes in Computer Science, Vol. 523 (Springer, Berlin, 1991) pp. 636-666.
24. S.L. Peyton Jones and A.L.M. Santos, A transformation-based optimiser for Haskell, Sci. Comput. Programming 32(1-3) (1998) 3-47.
25. T. Sheard and L. Fegaras, A fold for all seasons, in: Functional Programming and Computer Architecture (FPCA'93), ed. Arvind, Copenhagen, Denmark (ACM Press, 1993) pp. 233-242.
26. A. Takano and E. Meijer, Shortcut deforestation in calculational form, in: Functional Programming and Computer Architecture (FPCA'95), ed. S.L. Peyton-Jones, San Diego, CA (June 1995).
27. A. Tolmach and D. Oliva, From ML to Ada: Strongly-typed language interoperability via source translation, J. Funct. Programming 8(4) (1998) 367-412.
28. V. Turchin, The concept of a supercompiler, ACM Trans. Programming Languages Syst. 8(3) (1986) 292-326.
29. M.G.J. van den Brand, H.A. de Jong, P. Klint and P.A. Olivier, Efficient annotated terms, Software Practice Exper. 30 (2000) 259-291.
30. M.G.J. van den Brand and E. Visser, Generation of formatters for context-free languages, ACM Trans. Software Engrg. Methodol. 5(1) (1996) 1-41.
31. E. Visser, Syntax definition for language prototyping, Ph.D. thesis, University of Amsterdam (September 1997).
32. E. Visser, Strategic pattern matching, in: Rewriting Techniques and Applications (RTA'99), eds. P. Narendran and M. Rusinowitch, Lecture Notes in Computer Science, Vol. 1631, Trento, Italy, July 1999 (Springer, Berlin, 1999) pp. 30-44.
33. E. Visser, The Stratego Library, Institute of Information and Computing Sciences, Universiteit Utrecht, Utrecht, The Netherlands (1999).
34. E. Visser, Language independent traversals for program transformation, in: Workshop on Generic Programming (WGP2000), ed. J. Jeuring, Ponte de Lima, Portugal, July 6 (2000); also: Technical Report UU-CS-2000-19, Universiteit Utrecht.
35. E. Visser, Language independent traversals for program transformation, in: Workshop on Generic Programming (WGP2000), ed. J. Jeuring, Ponte de Lima, Portugal, July 6 (2000); also: Technical Report UU-CS-2000-19, Universiteit Utrecht.
36. E. Visser and Zine-el-Abidine Benaissa, A core language for rewriting, in: Proceedings of the Second International Workshop on Rewriting Logic and its Applications (WRLA'98), eds. C. Kirchner and H. Kirchner, Electronic Notes in Theoretical Computer Science, Vol. 15 (1998).
37. E. Visser, Zine-el-Abidine Benaissa and A. Tolmach, Building program optimizers with rewriting strategies, ACM SIGPLAN Notices 34(1) (1999) 13-26, Proceedings of the International Conference on Functional Programming (ICFP'98).
38. P. Wadler, Deforestation: Transforming programs to eliminate trees, Theor. Comput. Sci. 73 (1990) 231-248.
39. www.stratego-language.org.