Building interpreters with rewriting strategies

Electronic Notes in Theoretical Computer Science

Volumn 65, Issue 3, 2002, Pages 57-76

  Dolstra, Eelco ^a   Visser, Eelco ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROGRAM INTERPRETERS; SEMANTICS; SOFTWARE PROTOTYPING;

COMPUTATIONAL VALUE; LANGUAGE PROTOTYPING; NORMALIZATION; PROTOTYPE INTERPRETERS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 18244388922     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80427-4     Document Type: Conference Paper

References (18)

1. Appel A.W. Modern Compiler Implementation in ML. 1998;18 Cambridge University Press
2. 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). 2.
3. P. Borra, D. Clement, T. Despeyroux, J. Incerpi, G. Kahn, B. Lang, and V. Pascual. Centaur: The system. Technical Report 777, INRIA, Sophia Antipolis, 1987. 2.
4. van Deursen A., Heering J., Klint P. Language Prototyping. An Algebraic Specification Approach, volume 5 of AMAST Series in Computing. September 1996;2 World Scientific, Singapore
5. K.-G. Doh and P. D. Mosses. Composing programming languages by combining action-semantics modules. In Workshop on Language Descriptions, Tools and Applications (LDTA'2001), Genova, Italy, April 2001. 1, 2.
6. E. Dolstra. First-class rules and generic traversal for program transformation languages. Master's thesis, Utrecht University, Utrecht, The Netherlands, August 2001. 2, 3, 10, 14, 17, 18.
7. M. Felleisen and R. Hieb. The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science, 103(2):235-271, 1992. 2.
8. Johann P., Visser E. Fusing logic and control with local transformations: An example optimization. Gramlich B., Lucas S. Workshop on Reduction Strategies in Rewriting and Programming (WRS'01), volume 57 of Electronic Notes in Theoretical Computer Science. May 2001;6 Elsevier Science Publishers, Utrecht, The Netherlands
9. G. Kahn. Natural semantics. In Proceedings of the Symposium on Theoretical Aspects of Computer Science, Passau, Germany, 1987. 2.
10. Kutter P.W., Pierantonio A. Montages specifications of realistic programming languages. Journal of Universal Computer Science. 3:(5):May 1997;416-442. 1
11. J. E. Labra Gayo, M. C. Luengo Díez, J. M. Cueva Lovelle, and A. Cernuda del Río. Lps: A language prototyping system using modular monadic semantics. In Workshop on Language Definitions, Tools and Applications (LDTA'01), volume 44/2 of Electronic Notes in Theoretical Computer Science. Elsevier Science. 1.
12. G. L. Steele Jr. Building interpreters by composing monads. In 21st ACM Symp. on Principles of Programming Languages (POPL'94), pages 472-492, Portland, Oregon, January 1994. 1.
13. Visser E. Scoped dynamic rewrite rules. van den Brand M., Verma R. Rule Based Programming (RULE'01), volume 59/4 of Electronic Notes in Theoretical Computer Science. 2001;3-11 Elsevier Science Publishers
14. 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. 3.
15. Visser E. Meta-programming with concrete object syntax. Batory D., Consel C. Generative Programming and Component Engineering (GPCE'02). Lecture Notes in Computer Science :October 2002;Springer-Verlag. (To appear). 3
16. E. Visser, Z.-e.-A. Benaissa, and A. Tolmach. Building program optimizers with rewriting strategies. In Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP'98), pages 13-26. ACM Press, September 1998. 2, 3.
17. Y. Xiao, Z. M. Ariola, and M. Mauny. From syntactic theories to interpreters: A specification language and its compilation. In N. Dershowitz and C. Kirchner, editors, Proceedings of the First International Workshop on Rule-Based Programming (RULE'00), Montréal, Canada, September 2000. http://www.loria.fr/~ckirchne/=rule2000/proceedings/. 2.
18. Xiao Y., Sabry A., Ariola Z.M. From syntactic theories to interpreters: Automating the proof of unique decomposition. Higher-Order and Symbolic Computation. 14:(4):2001;. 2