Basic completion strategies as another application of the Maude strategy language

In S. Escobar, editor, Proceedings of the 10th International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2011, EPTCS 82, pages 17-36, 2012.

Abstract: 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.

[pdf]

@inproceedings{wrs/VMO12,
  author    = {Alberto Verdejo and
               Narciso Mart\'{\i}-Oliet},
  title     = {Basic completion strategies as another application of the
               {Maude} strategy language},
  pages     = {17-36},
  url       = {http://dx.doi.org/10.4204/EPTCS.82.2},
  editor    = {Santiago Escobar},
  booktitle = {Proceedings of the 10th International Workshop on Reduction Strategies
               in Rewriting and Programming, WRS 2011, Novi Sad, Serbia, May 29, 2011},
  series    = {Electronic Proceedings in Theoretical Computer Science},
  volume    = {82},
  year      = {2012}
}