A survey of rewriting strategies in program transformation systems

Electronic Notes in Theoretical Computer Science

Volumn 57, Issue , 2001, Pages 109-143

  Visser, Eelco ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; GRAPH THEORY; OBJECT ORIENTED PROGRAMMING; OPTIMIZATION; REVERSE ENGINEERING; SEMANTICS; VISUALIZATION;

COMPILER CONSTRUCTION; PROGRAM SYNTHESIS; PROGRAM TRANSFORMATION; STRATEGY SYSTEMS;

SOFTWARE ENGINEERING;

EID: 0347780120     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00270-1     Document Type: Conference Paper

References (57)

1. Aho A., Sethi R., Ullman J. Compilers: Principles, techniques, and tools. 1986;Addison Wesley, Reading, Massachusetts. 2.1.1
2. Appel A.W. Modern Compiler Implementation in ML. 1998;Cambridge University Press. 2.1.1, 2.2.2, 3.2
3. P. Borovanský, H. Cirstea, H. Dubois, C. Kirchner, H. Kirchner, P.-E. Moreau, C. Ringeissen, and M. Vittek. ELAN: User Manual. Loria, Nancy, France, v3.4 edition, January 27 2000. 5.9
4. P. Borovanský, C. Kirchner, and H. Kirchner. Controlling rewriting by rewriting. In J. Meseguer, editor, Proceedings of the First International Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science, Asilomar, Pacific Grove, CA, September 1996. Elsevier. 4.1
5. P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek. Elan: A logical framework based on computational systems. In J. Meseguer, editor, Electronic Notes in Theoretical Computer Science, volume 4. Elsevier Science Publishers, 1996. Proceedings of the First Workshop on Rewriting Logic and Applications 1996 (WRLA'96). 5.5
6. Boyle J.M. Abstract programming and program transformation - An approach to reusing programs. Biggerstaff T.J., Perlis A.J. Software Reusability, volume 1. 1989;361-413 ACM Press. 5.8
7. Boyle J.M., Harmer T.J., Winter V.L. The TAMPR program transformation system: Simplifying the development of numerical software. Arge E., Bruaset A.M., Langtangen H.P. Modern Software Tools for Scientific Computing. 1997;353-372 Birkhäuser. 5.8
8. van den Brand M.G.J., de Jong H., Klint P., Olivier P. Efficient annotated terms. Software, Practice & Experience. 30:(3):2000;259-291. 3.2, 3.4
9. M. G. J. van den Brand, P. Klint, and J. Vinju. Term rewriting with traversal functions. Technical Report SEN-R0121, Centrum voor Wiskunde en Informatica, 2001. 5.6
10. van den Brand M.G.J., Sellink M.P.A., Verhoef C. Generation of components for software renovation factories from context-free grammars. Science of Computer Programming. 36:2000;209-266. 5.6
11. van den Brand M.G.J., Visser E. Generation of formatters for contextfree languages. ACM Transactions on Software Engineering and Methodology. 5:(1):January 1996;1-41. 2.1.1, 5.6
12. Chikofski E., Cross J. Reverse engineering and design recovery: A taxonomy. IEEE Software. 1990;. 2.1.3
13. M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In J. Meseguer, editor, Proceedings of the First International Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science, pages 65-89, Asilomar, Pacific Grove, CA, September 1996. Elsevier. 4.1, 5.10
14. M. Clavel and J. Meseguer. Reflection and strategies in rewriting logic. In J. Meseguer, editor, Electronic Notes in Theoretical Computer Science, volume 4. Elsevier Science Publishers, 1996. Proceedings of the First International Workshop on Rewriting Logic and its Applications. 5.10
15. M. G. Clavel. Reflection in General Logics and in Rewriting Logic with Applications to the Maude Language. PhD thesis, Universidad de Navarra, Facultad de Filosofia y Letras, Pamplona, España, 1998. 5.10
16. C. Collberg, C. Thomborson, and D. Low. Manufacturing cheap, resilient and stealthy opaque constructs. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 98), pages 184-196, San Diego CA, USA, January 1998. 2.2.3
17. Czarnecki K., Eisenecker U.W. Intentional programming. Generative Programming. Methods, Tools, and Applications, chapter 11. 2000;Addison-Wesley. 3, 3.2, 5.2
18. Dershowitz N., Jouannaud J.-P. Rewrite systems. van Leeuwen J. Handbook of Theoretical Computer Science, volume B, chapter 6. 1990;243-320 Elsevier. 4.2, 5.5
19. A. van Deursen, J. Heering, and P. Klint, editors. Language Prototyping. An Algebraic Specification Approach, volume 5 of AMAST Series in Computing. World Scientific, Singapore, September 1996. 4.1, 5.5, 5.5
20. van Deursen A., Klint P., Tip F. Origin tracking. Journal of Symbolic Computation. 15:(5-6):1993;523-546. 3.1, 6.3
21. C. Elliott, S. Finne, and O. de Moor. Compiling embedded languages. In Semantics, Applications and Implementation of Program Generation (SAIG'OO), Springer Lecture Notes in Computer Science, 2000. 5.5
22. A. Felty. A logic programming approach to implementing higher-order term rewriting. In L.-H. Eriksson, L. Hallnäs and P. Schroeder-Heister, editors, Extensions of Logic Programming (ELP '91), volume 596 of Lecture Notes in Artifial Intelligence, pages 135-158. Springer-Verlag, 1992. 4.1
23. Fokkink W.J., Kamperman J.F.T., Walters H.R. Lazy rewriting on eager machinery. ACM Transactions on Programming Languages and Systems. 22:(1):January 2000;45-86. 5.7.3, 12
24. Fowler M. Refactoring: Improving the Design of Existing Programs. 1999;AddisonWesley. 2.2.3
25. Fraser C.W., Hanson D.R., Proebsting T.A. Engineering a simple, efficient code-generator generator. ACM Letters on Programming Languages and Systems. 1:(3):September 1992;213-226. 5.4
26. Fraser C.W., Henry R.R., Proebsting T.A. BURG - fast optimal instruction selection and tree parsing. ACM SIGPLAN Notices. 27:(4):April 1992;68-76. 5.4
27. J. A. Goguen and T. W. et. al. Introducing OBJ. Technical Report SRI-CSL92-03, SRI International Computer Science Laboratory, March 1992. 5.5
28. Kienle T.E.H., Czeranski J. Exchange format bibliography. Workshop on Standard Exchange Format (WoSEF). June 2000;2-9 Limerick, Ireland. 3.4
29. J. Heering. Implementing higher-order algebraic specifications. In D. Miller, editor, Proceedings of the Workshop on the λProlog Programming Language, pages 141-157. University of Pennsylvania, Philadelphia, 1992. Published as Technical Report MS-CIS-92-86; http://www.cwi.nl/~jan/HO.WLP.ps. 4.1
30. Huet G., Lang B. Proving and applying program transformations expressed with second-order patterns. Acta Informatica. 11:1978;31-55. 3.3
31. P. Johann and E. Visser. Fusing logic and control with local transformations: An example optimization. In B. Gramlich and S. Lucas, editors, Workshop on Reduction Strategies in Rewriting and Programming (WRS'O1), volume 57 of Electronic Notes in Theoretical Computer Science, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers. 5.11.5, 6.3
32. G. Kiczales, J. Lamping, A. Mendhekar, C. Maeda, C. Lopes, J.-M. Loingtier, and J. Irwin. Aspect-oriented programming. Technical report, Xerox Palo Alto Research Center, 1997. 6.3
33. D. Lacey and O. de Moor. Imperative program transformation by rewriting. In Compiler Construction (CC'O1), Lecture Notes in Computer Science. SpringerVerlag, April 2001. 3.2, 6.3
34. de Moor O., Sittampalam G. Higher-order matching for program transformation. Theoretical Computer Science. 269:(1-2):2001;135-162. 3.3
35. P.-E. Moreau. Compilation de règles de réécriture et de stratégies nondéterministes. PhD thesis, L'Université Henri Poincaré-Nancy 1, June 22 1999. 5.9, 13
36. Muchnick S.S. Advanced Compiler Design and Implementation. 1997;Morgan Kaufmann Publishers. 2.1.1, 2.2.2, 3.2
37. G. Nadathur and D. Miller. An overview of λProlog. In R. A. Kowalski, editor, Logic Programming. Proceedings of the Fifth International Conference and Symposium, volume 1, pages 810-827, Cambridge, Mass., USA, 1988. MIT Press. 4.1
38. J. M. Neighbors. Software Construction Using Components. PhD thesis, Department of Information and Computer Science, University of California, Irvine, 1980. 5.1
39. J. M. Neighbors. Draco 1.2 Users Manual. Department of Information and Computer Science, University of California, Irvine, Irvine, CA, USA, June 1983. 5.1
40. Neighbors J.M. The Draco approach to constructing software from reusable components. IEEE Transactions on Software Engineering. SE-10:(5):September 1984;564-573. 5.1
41. K. Ogata and K. Futatsugi. Implementation of term rewritings with the evaluation strategy. In Proceedings 9th Symposium on Programming Languages: Implementations, Logics, and Programs (PLILP'97), volume 1292 of Lecture Notes in Computer Science, pages 225-239, Southampton, 1997. SpringerVerlag. 11, 5.7.2
42. Parr T.J. SORCERER reference. Language Translation Using PCCTS and C++. A Reference Guide, chapter 4. 1993;161-199 Automata Publishing Company. Available at http://www.antlr.org/buybook.html. 5.3
43. T. J. Parr. An overview of SORCERER: A simple tree-parser generator. http://www.antlr.org/papers/sorcerer.ps, April 1994. 5.3
44. S. Peyton Jones, J. Hughes, et al. Report of the programming language Haskell98. a non-strict, purely functional language, February 1999. 2.2.1
45. F. Pfenning and C. Elliot. Higher-order abstract syntax. In Proc. SIGPLAN Conference on Programming Language Design and Implementation (PLDI'88), pages 199-208. ACM, 1988. 3.3, 4.1
46. A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. In R. Backhouse and J. N. Oliveira, editors, Proceedings of the 5th International Conference on Mathematics of Programme Construction (MPC2000), volume 1837 of Lecture Notes in Computer Science, pages 230-255, Ponte de Lima, Portugal, July 2000. Springer-Verlag. 3.3
47. J. van der Pol. Just-in-time: On strategy annotations. In Proceedings of the International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001), 2001. 5.7.1
48. Proebsting T.A. BURS automata generation. ACM Transactions on Programming Languages and Systems. 17:(3):May 1995;461-486. 5.4, 5.4
49. Sarkar. Automatic selection of high-order transformations in the IBM XL FORTRAN compilers. IBM Journal for Research and Development. 41:(3):May 1997;233-264. 6.3
50. Smith D.R. KIDS: A semiautomatic program development system. IEEE Transactions on Software Engineering. 16:(9):1990;1024-1043. 2.1.1
51. E. Visser. Syntax Definition for Language Prototyping. PhD thesis, University of Amsterdam, September 1997. 2.2.1, 5.5
52. E. Visser. Strategic pattern matching. In P. Narendran and M. Rusinowitch, editors, Rewriting Techniques and Applications (RTA'99), volume 1631 of Lecture Notes in Computer Science, pages 30-44, Trento, Italy, July 1999. Springer-Verlag. 4.1, 5.11.4
53. E. Visser. Language independent traversals for program transformation. In J. Jeuring, editor, Workshop on Generic Programming (WGP'00), Ponte de Lima, Portugal, July 2000. Technical Report UU-CS-2000-19, Department of Information and Computing Sciences, Universiteit Utrecht. 5.11.5
54. E. Visser. Stratego: A language for program transformation based on rewriting strategies. System description of Stratego 0.5. In A. Middeldorp, editor, Rewriting Techniques and Applications (RTA '01), volume 2051 of Lecture Notes in Computer Science, pages 357-361. Springer-Verlag, May 2001. 5.11
55. E. Visser, Z.-e.-A. Benaissa, and A. Tolmach. Building program optimizers with rewriting strategies. ACM SIGPLAN Notices, 34(1):13-26, January 1999. Proceedings of the International Conference on Functional Programming (ICFP'98). 5.11
56. E. Visser et al. The online survey of program transformation. www.program-transformation.org, 2000-2001. 6.4
57. P. Wadler. Views: A way for pattern matching to cohabit with data abstraction. In ACM Symposium on Principles of Programming Languages, pages 307-313, Munich, January 1987. ACM. 4.1