Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
On Coherence Properties in Team Rewriting Models of Concurrency
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
HOL-lambdasigma: An Intentional First-Order Expression of Higher-Order Logic
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
HOL-λσ: an intentional first-order expression of higher-order logic
Mathematical Structures in Computer Science
Hi-index | 0.00 |
We introduce rewriting with two sets of rules, the first interpreted equationally and the second not. A semantic view considers equational rules as defining an equational theory and reduction rules as defining a rewrite relation modulo this theory. An operational view considers both sets of rules as similar. We introduce sufficient properties for these two views to be equivalent (up to different notions of equivalence). The paper ends with a collection of example showing the effectiveness of this approach.