A logic for rewriting strategies

Electronic Notes in Theoretical Computer Science

Volumn 58, Issue 2, 2001, Pages 138-154

  Kieburtz, Richard B ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; SET THEORY; THEOREM PROVING;

DENOTATIONAL SEMANTICS; LAMBDA CALCULUS; MU-CALCULUS; REWRITING STRATEGIES;

SYNTACTICS;

EID: 1242263657     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00283-X     Document Type: Conference Paper

References (16)

1. Peter Borovansky. Le controle de la reecriture: etude et implantation d'un formalisme de strategies. PhD thesis, Universite Henri Poincare - Nancy I, October 1998.
2. Peter Borovansky, Claude Kirchner, and Helene Kirchner. Controlling rewriting by rewriting. Electronic Notes in Theoretical Computer Science, 5, 1997.
3. E. M. Clarke and A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In D. Kozen, editor, Logics of Programs, volume 131 of Lecture Notes in Computer Science, pages 52-71. Springer Verlag, 1981.
4. Dijkstra E.W. A Discipline of Programming. 1976;Prentice Hall
5. X. Du, K McDonnell, E. Nanos, Y. S. Ramakrishan, and Scott A. Smolka. Software design, specification and verification: Lessons learned from the Rether case study. In Proc. of Sixth International Conference on Algebraic Methods and Software Technology, volume 1349 of Lecture Notes in Computer Science, pages 185-198. Springer Verlag, 1997.
6. Emerson E.A., Clarke E.M. Using branching time temporal logic to synthesize synchronizations skeletons. Science of Computer Programming. 2:1982;241-266
7. Kozen Dexter. Results on the propositional μ-calculus. Theoretical Computer Science. 27:(3):December 1983;333-354
8. M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In Proceedings of the First International Workshop on Rewriting Logic and its Applications, volume 5. Elsevier, September 1996.
9. M. Clavel and J. Meseguer. Reflection and strategies in rewriting logic. In Proceedings of the First International Workshop on Rewriting Logic and its Applications, volume 5. Elsevier, September 1996.
10. Robin Milner, Mike Gordon, and Christopher Wadsworth. Edinburgh LCF, volume 78 of Lecture Notes in Computer Science. Springer Verlag, 1979.
11. M. G. J. van den Brand, S. M. Eijkelkamp, D. K. A. Geluk, H. Meijer, M. J. F. Polling, and H. R. Osburne. Program transformation using ASF+SDF. Technical Report P9504, Programming Research Group, University of Amsterdam, 1995.
12. Visser Eelco. A bootstrapped compiler for strategies. Gramlich B., Kirchner H., Pfenning F. Strategies in Automated Deduction (STRATEGIES'99). July 1999;78-83
13. Eelco 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. Springer Verlag, July 1999.
14. Eelco Visser and Zine el Abidine Benaissa. A core language for rewriting. In Claude Kirchner and Helene Kirchner, editors, Second International Workshop on Rewriting Logic and its Applications (WRLA'98), Electronic Notes in Theoretical Computer Science. Elsevier, September 1998.
15. Eelco Visser, Zine el Abidine Benaissa, and Andrew Tolmach. Building program optimizers with rewriting strategies. In Proc. of 1998 ACM/SIGPLAN International Conference on Functional Programming, pages 13-26. ACM Press, September 1998.
16. M. Vittek. A compiler for nondeterministic rewriting systems. In H. Ganzinger, editor, Proceedings of RTA'96, volume 1103 of Lecture Notes in Computer Science. Springer Verlag, July 1996.