Basic completion strategies as another application of the Maude strategy language

Alberto Verdejo
(Universidad Complutense de Madrid)
Narciso Martí-Oliet
(Universidad Complutense de Madrid)

The two levels of data and actions on those data provided by the separation between equations and rules in rewriting logic are completed by a third level of strategies to control the application of those actions. This level is implemented on top of Maude as a strategy language, which has been successfully used in a wide range of applications. First we summarize the Maude strategy language design and review some of its applications; then, we describe a new case study, namely the description of completion procedures as transition rules + control, as proposed by Lescanne.

Invited Paper in Santiago Escobar: Proceedings 10th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011), Novi Sad, Serbia, 29 May 2011 , Electronic Proceedings in Theoretical Computer Science 82, pp. 17–36.
Published: 24th April 2012.

ArXived at: http://dx.doi.org/10.4204/EPTCS.82.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org