Scoped dynamic rewrite rules

Electronic Notes in Theoretical Computer Science

Volumn 59, Issue 4, 2001, Pages 375-396

  Visser, Eelco ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; BOOLEAN ALGEBRA; CONTEXT FREE LANGUAGES; ENCODING (SYMBOLS); MATHEMATICAL TRANSFORMATIONS; SYNTACTICS; TREES (MATHEMATICS);

ABSTRACT SYNTAX TREE; DYNAMIC VARIABLES; PROGRAM EQUALITIES; TERM REWRITING;

COMPUTER PROGRAMMING;

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

References (18)

1. Appel A.W. Modern Compiler Implementation in ML. 1998;Cambridge University Press
2. Appel A.W., Jim T. Shrinking lambda expressions in linear time. Journal of Functional Programming. 7:(5):September 1997;515-540
3. 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. Boyle J.M., Harmer T.J., Winter V.L. The TAMPR program transforming system: Simplifying the development of numerical software. Arge E., Bruaset A.M., Langtangen H.P. Modern Software Tools in Scientific Computing. 1997;353-372 Birkhäuser
5. 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.
6. 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.
7. S. Dietzen and F. Pfenning. A declarative alternative to "assert" in logic programming. In V. Saraswat and K. Ueda, editors, Logic Programming, Proceedings of the 1991 International Symposium, pages 372-386, San Diego, USA, 1991. The MIT Press.
8. D. R. Hanson and T. A. Proebsting. Dynamic variables. In Programming Language Design and Implementation (PLDI'01), Snowbird, UT, USA, June 2001. ACM.
9. Johann P., Visser E. Warm fusion in Stratego: A case study in the generation of program transformation systems. Annals of Mathematics and Artificial Intelligence. 29:(1-4):2000;1-34
10. H. Kirchner, and P.-E. Moreau. A reflective extension of ELAN. 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.
11. Launchbury J., Sheard T. Warm fusion: Deriving build-catas from recursive definitions. Jones S.L.P. Functional Programming Languages and Computer Architecture (FPCA'95). June 1995;314-323 ACM Press
12. J. R. Lewis, J. Launchbury, E. Meijer, and M. Shields. Implicit parameters: Dynamic scoping with static types. In Symposium on Principles of Programming Languages (POPL'00), pages 108-118. ACM, January 2000.
13. P. Maes. Concepts and experiments in computational reflection. SIGPLAN Notices, 22(12):147-155, 1987. Proceedings of OOPSLA'87.
14. S. Peyton Jones, A. Tolmach, and T. Hoare. Playing by the rules: rewriting as a practical optimisation technique in GHC. In R. Hinze, editor, 2001 Haskell Workshop, Firenze, Italy, September 2001. ACM SIGPLAN.
15. 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.
16. E. Visser. A survey of strategies in program transformation systems. In B. Gramlich and S. L. Alba, editors, Workshop on Reduction Strategies in Rewriting and Programming (WRS'01), volume 57 of Electronic Notes in Theoretical Computer Science, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers.
17. 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).
18. Wadler P. Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science. 73:1990;231-248