Computer Science – Logic in Computer Science
Scientific paper
2012-04-25
EPTCS 82, 2012, pp. 17-36
Computer Science
Logic in Computer Science
In Proceedings WRS 2011, arXiv:1204.5318
Scientific paper
10.4204/EPTCS.82.2
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.
Martí-Oliet Narciso
Verdejo Alberto
No associations
LandOfFree
Basic completion strategies as another application of the Maude strategy language does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Basic completion strategies as another application of the Maude strategy language, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Basic completion strategies as another application of the Maude strategy language will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-137335