Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Category theory for computing science, 2nd ed.
Category theory for computing science, 2nd ed.
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Logical foundations of cafeOBJ
Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Rewriting Logic and Maude: Concepts and Applications
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
A general framework for lazy functional logic programming with algebraic polymorphic types
Theory and Practice of Logic Programming
A new generic scheme for functional logic programming with constraints
Higher-Order and Symbolic Computation
| Hi-index | 0.00 |
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed with different objectives. Here we study the relationships between them, both at a syntactic and at a semantic level. Even though it is not possible to establish an entailment system map between them, both can be naturally simulated in each other. Semantically, there is no embedding between the corresponding institutions. Along the way, the notions of entailment and satisfaction in Meseguer's rewriting logic are generalized.