Term rewriting with traversal functions

ACM Transactions on Software Engineering and Methodology

Volumn 12, Issue 2, 2003, Pages 152-190

  Van Den Brand, Mark G J ^a   Klint, Paul ^a   Vinju, Jurgen J ^a  

^a CWI   (Netherlands)

Author keywords

Automated tree traversal; Term rewriting; Types

Indexed keywords

AUTOMATED TREE TRAVERSAL; TERM REWRITING; TRAVERSAL FUNCTIONS; TYPES;

AUTOMATION; MAPPING; MATHEMATICAL TRANSFORMATIONS; SEMANTICS; SOFTWARE ENGINEERING; TREES (MATHEMATICS);

PROGRAM PROCESSORS;

EID: 3042810925     PISSN: 1049331X     EISSN: 1049331X     Source Type: Journal    
DOI: 10.1145/941566.941568     Document Type: Article

References (43)

1. ALBLAS, H. 1991. Introduction to attribute grammars. In International Summer School on Attribute Grammars, Applications and Systems, H. Alblas and B. Melichar, Eds. Lecture Notes in Computer Science, vol. 545. Springer Verlag, Berlin Heidelberg New York, 1-15.
2. BERGSTRA, J. A., HEERING, J., AND KLINT, P., Eds. 1989. Algebraic specification. ACM Press/Addison-Wesley.
3. BOROVANSKÝ, P., KIRCHNER, C., KIRCHNER, H., MOREAU, P.-E., AND RINGEISSEN, C. 1998. An overview of ELAN. In Proceedings of the International Workshop on Rewriting Logic and its Applications, C. Kirchner and H. Kirchner, Eds. Electronic Notes in Theoretical Computer Science, vol. 15. Elsevier.
4. CARDELLI, L. 1997. Type systems. In Handbook of Computer Science and Engineering. CRC Press.
5. CORDY, J., HALPERN-HAMU, C., AND PROMISLOW, E. 1991. TXL: A rapid prototyping system for programming language dialects. Comp. Lang. 16, 1, 97-107.
6. FELTY, A. 1992. A logic programming approach to implementing higher-order term rewriting. In Extensions of Logic Programming (ELP '91), L.-H. Eriksson, L. Hallnäs, and P. Schroeder-Heister, Eds. Lecture Notes in Artifial Intelligence, vol. 596. Springer-Verlag, 135-158.
7. GAMMA, E., HELM, R., JOHNSON, R., AND VLISSIDES, J. 1994. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, Reading, Mass.
8. HEDIN, G. 1992. Incremental semantic analysis. Ph.D. thesis, Lund University.
9. HEDIN, G. AND MAGNUSSON, E. 2001. JastAdd - a Java-based system for implementing frontends. In Proceedings of the Workshop on Language Descriptions, Tools and Applications (LDTA'01), M. van den Brand and D. Parigot, Eds. Electronic Notes in Theoretical Computer Science, vol. 44-2. Elsevier Science.
10. HEERING, J. 1992. Implementing higher-order algebraic specifications. In Proceedings of the Workshop on the Prolog Programming Language, D. Miller, Ed. University of Pennsylvania, Philadelphia, Pa., 141-157. Published as Tech. Rep. MS-CIS-92-86.
11. HEERING, J. 1996. Second-order term rewriting specification of static semantics: An exercise. In Language Prototyping, A. van Deursen, J. Hearing, and P. Klint, Eds. AMAST Series in Computing, vol. 5. World Scientific, 295-305.
12. HEERING, J., HENDRIKS, P., KLINT, P., AND REKERS, J. 1989. The syntax definition formalism SDF - reference manual. SIGPLAN Notices 24, 11, 43-75.
13. HUET, G. AND LANG, B. 1978. Proving and applying program transformations expressed with second-order patterns. Acta Inf. 11, 31-55.
14. KLINT, P. 2001. Is strategic programming a viable paradigm? In Workshop on Reduction Strategies in Rewriting and Programming (WRS'01), B. Gramlich and S. Lucas, Eds. Electronic Notes in Theoretical Computer Science, vol. 57/2. Elsevier Science Publishers.
15. KLINT, P. 2003. How understanding and restructuring differ from compiling - A rewriting perspective. In Proceedings of the 11th International Workshop on Program Comprehension (IWPC03). IEEE Computer Society, 2-12.
16. KNUTH, D. 1968. The Art of Computer Programming, Volume 1. Addison-Wesley.
17. KUIPERS, T. AND VISSER, J. 2001. Object-oriented tree traversal with JJForester. In Proc. of Workshop on Language Descriptions, Tools and Applications (LDTA). Electronic Notes in Theoretical Computer Science, M. van den Brand and D. Parigot, Eds. Vol. 44. Elsevier Science Publishers.
18. LÄMMEL, R. 2003. Typed generic traversal with term rewriting strategies. J. Log. and Algebr. Program. 54, 1-64.
19. LÄMMEL, R. AND VISSER, J. 2002. Typed combinators for generic traversal. In PADL 2002: Practical Aspects of Declarative Languages. Lecture Notes in Computer Science No. 2257. Springer.
20. LÄMMEL, R., VISSER, J., AND KORT, J. 2000. Dealing with large bananas. In Workshop on Generic Programming, J. Jeuring, Ed. Ponte de Lima. Published as Technical Report UU-CS-2000-19, Department of Information and Computing Sciences, Universiteit Utrecht.
21. LÄMMEL, R. AND WACHSMUTH, G. 2001. Transformation of SDF syntax definitions in the ASF+SDF Meta-Environment. In Proceedings of the Workshop on Language Descriptions, Tools and Applications (LDTA'01), M. van den Brand and D. Parigot, Eds. Electronic Notes in Theoretical Computer Science, vol. 44-2. Elsevier Science.
22. SELLINK, M., SNEED, H., AND VERHOEF, C. 1999. Restructuring of COBOL/ CICS legacy systems. In Proceedings of the Conference on Maintenance and Reengineering (CSMR'99). Amsterdam, 72-82.
23. TERESE. 2003. Term Rewriting Systems. Number 55 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press.
24. TIP, F. AND DINESH, T. 2001. A slicing-based approach for locating type errors. ACM Trans. Softw. Engin. and Method. 10, 5-55.
25. VAN DEN BRAND, M., VAN DEURSEN, A., KLINT, P., KLUSENER, S., AND VAN DEN MEULEN, E. 1996a. Industrial applications of ASF+SDF. In Algebraic Methodology and Software Technology (AMAST'96), M. Wirsing and M. Nivat, Eds. Lecture Notes in Computer Science, vol. 1101. Springer-Verlag, 9-18.
26. VAN DEN BRAND, M., HEERING, J., KLINT, P., AND OLIVIER, P. 2002. Compiling language definitions: The ASF + SDF compiler. ACM Trans. Program. Lang. Syst. 24, 4, 334-368.
27. VAN DEN BRAND, M., KLINT, P., AND OLIVIER, P. 1999. Compilation and memory management for ASF+SDF. In Compiler Construction. Lecture Notes in Computer Science, vol. 1575. Springer-Verlag, 198-213.
28. VAN DEN BRAND, M., KLINT, P., AND VERHOEF, C. 1996b. Core technologies for system renovation. In SOFSEM'96: Theory and Practice of Informatics, K Jeffery, J. Krai, and M. Bartosek, Eds. Lecture Notes in Computer Science, vol. 1175. Springer-Verlag, 235-255.
29. VAN DEN BRAND, M., KLINT, P., AND VERHOEF, C. 1998. Term rewriting for sale. In Second International Workshop on Rewriting Logic and its Applications, (WRLA 98), C. Kirchner and H. Kirchner, Eds.
30. VAN DEN BRAND, M., KLINT, P., AND VINJU, J. 2001. Term rewriting with traversal functions. Tech. Rep. SEN-R0121, Centrum voor Wiskunde en Informatica.
31. VAN DEN BRAND, M., SELLINK, M., AND VERHOEF, C. 2000. Generation of components for software renovation factories from context-free grammars. Science of Com. Program. 36, 209-266.
32. VAN DEURSEN, A., HEERING, J., AND KLINT, P., Eds. 1996. Language Prototyping: An Algebraic Specification Approach. AMAST Series in Computing, vol. 5. World Scientific.
33. VAN DEURSEN, A., KLINT, P., AND TIP, F. 1993. Origin tracking. J. Symb. Comput. 15, 523-545.
34. VAN DEURSEN, A. AND MOONEN, L. 1998. Type inference for COBOL systems. In Proceedings of the 5th Working Conf. on Reverse Engineering, I. Baxter, A. Quilici, and C. Verhoef, Eds. IEEE Computer Society, 220-230.
35. VEERMAN, N. 2003. Revitalizing modifiability of legacy assets. In Proceedings of the Seventh European Conference on Software Maintenance and Reengineering, M. van den Brand, G. Canfora, and T. Gymóthy, Eds. IEEE Computer Society Press, 19-29.
36. VISSER, E. 2000. Language independent traversais for program transformation. In Proceedings of the Workshop on Generic Programming, J. Jeuring, Ed. Ponte de Lima, 86-104. Published as Technical Report UU-CS-2000-19, Department of Information and Computing Sciences, Universiteit Utrecht.
37. VISSER, E. 2001a. Stratego: A language for program transformation based on rewriting strategies. System description of Stratego 0.5. In Rewriting Techniques and Applications (RTA'01), A. Middeldorp, Ed. Lecture Notes in Computer Science. Springer-Verlag.
38. VISSER, E. 2001b. A survey of strategies in program transformation systems. In Workshop on Reduction Strategies in Rewriting and Programming (WRS'01), B. Gramlich and S. Lucas, Eds. Electronic Notes in Theoretical Computer Science, vol. 57/2. Elsevier Science Publishers.
39. VISSER, J. 2001c. Visitor combination and traversal control. ACM SIGPLAN Notices 36, 11 (Nov.), 270-282.
40. (OOPSLA 2001 Conference Proceedings: Object-Oriented Programming Systems, Languages, and Applications).
41. VOGT, H. H., SWIERSTRA, S. D., AND KUIPER, M. F. 1989. Higher order attribute grammars. SIGPLAN Notices 24, 7, 131-145.
42. In (Proceedings of the ACM SIGPLAN '89 Conference on Programming Language Design and Implementation).
43. ZAADNOORDIJK, H. 2001. Source code transformations using the new ASF+SDF meta-environment. M.S. thesis, University of Amsterdam, Programming Research Group.