zbMATH — the first resource for mathematics

Controlling rewriting by rewriting. (English) Zbl 0912.68088
Meseguer, J. (ed.), Rewriting logic and its applications. Proceedings of the 1st international workshop, Pacific Grove, CA, USA, September 3–6, 1996. Amsterdam: Elsevier, Electronic Notes in Theoretical Computer Science. 4, 21 p. (1996).
Summary: In this paper, we investigate the idea of controlling rewriting by strategies and we develop a strategy language whose operational semantics is also based on rewriting. This language is described in ELAN, a language based on computational systems that are simply rewriting theories controlled by strategies. We illustrate the syntax, semantics and different features of this strategy language. Finally, we sketch its bootstrapping implementation by a transformation into a computational system, whose heart is a rewrite theory controlled by a lower-level strategy of ELAN.
For the entire collection see [Zbl 0903.00068].

68Q42 Grammars and rewriting systems
Maude; ELAN
Full Text: Link
[1] P. Borovanský. Strategies for computational systems. Technical report, CRIN & INRIA-Lorraine, France, 1996.
[2] 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, volume 4 of Electronic Notes in Theoretical Computer Science, Asilomar (California), September 1996. Elsevier. · Zbl 0912.68095
[3] M. G. Clavel and J. Meseguer. Axiomatizing Reflective Logics and Languages. In G. Kiczales, editor, Proceedings of Reflection’96, San Francisco, California, April 1996, pages 263–288. Xerox PARC, 1996.
[4] Goguen, J.; Stevens, A.; Hobley, K.; Hilberdink, H.: 2OBJ, a metalogical framework based on equational logic. Philosophical transactions of the royal society, series A 339, 69-86 (1992)
[5] J. Goguen, A. Stevens, K. Hobley, and H. Hilberdink. Mechanised Theorem Proving with 2OBJ: A Tutorial Introduction. ftp prg.oxford.ac.uk, 1994.
[6] Jouannaud, J. -P.; Kirchner, C.: Solving equations in abstract algebras: a rule-based survey of unification. Computational logic. Essays in honor of alan Robinson, chapter 8, 257-321 (1991)
[7] Kirchner, C.; Kirchner, H.; Vittek, M.: Designing constraint logic programming languages using computational systems. Principles and practice of constraint programming. The newport papers, 131-158 (1995)
[8] C. Kirchner, H. Kirchner, and M. Vittek. ELAN V 1.17 User Manual. INRIA Lorraine & CRIN, Nancy (France), first edition, November 1995.
[9] Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical computer science 96, No. 1, 73-155 (1992) · Zbl 0758.68043
[10] E. Meijer and J. Johan. Merging Monads and Folds for Functional Programming. In E. Meijer and J. Johan, editor, Proceedings of Advanced Fonctional Programming, volume 925 of Lecture Notes in Computer Science, pages 228–266. Springer-Verlag, 1995.
[11] N. Martì-Oliet and J. Meseguer. Rewriting logic as a logical and semantical framework. Technical report, SRI International, May 1993. · Zbl 0912.68096
[12] M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. Thèse de Doctorat d’Université, Université Henri Poincaré – Nancy 1, October 1994.
[13] M. Vittek. A compiler for nondeterministic term rewriting systems. In H. Ganzinger, editor, Proceedings of RTA’96, volume 1103 of Lecture Notes in Computer Science, pages 154–168, New Brunswick (New Jersey), July 1996. Springer-Verlag.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.