Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
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
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 as a Unifying Framework for Petri Nets
Unifying Petri Nets, Advances in Petri Nets
Proving termination of membership equational programs
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Observational congruences for dynamically reconfigurable tile systems
Theoretical Computer Science - Process algebra
Operational termination of conditional term rewriting systems
Information Processing Letters
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude
Formal Methods in System Design
Semantics and pragmatics of Real-Time Maude
Higher-Order and Symbolic Computation
Proving operational termination of membership equational programs
Higher-Order and Symbolic Computation
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Cybernetics and Systems Analysis
Cybernetics and Systems Analysis
First-order logic with dependent types
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Functorial semantics of rewrite theories
Formal Methods in Software and Systems Modeling
Theoroidal maps as algebraic simulations
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
Localized fairness: a rewriting semantics
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
Since its introduction, more than a decade ago, rewriting logic has attracted the interest of both theorists and practitioners, who have contributed in showing its generality as a semantic and logical framework and also as a programming paradigm. The experimentation conducted in these years has suggested that some significant extensions to the original definition of the logic would be very useful in practice. In particular, the Maude system now supports subsorting and conditions in the equational logic for data, and also frozen arguments to block undesired nested rewritings; moreover, it allows equality and membership assertions in rule conditions. In this paper, we give a detailed presentation of the inference rules, model theory, and completeness of such generalized rewrite theories.