As in standard term rewriting, we can use local confluence and strong normalisation to prove the confluence of a relation.
Both conditional and non-conditional term rewriting are covered; but the treatment is still mathematical rather than implementation based.
Conditional rewriting logic as a unified model of concurrency.
The rewriting structure is checked for consistency with the term.
It would be of interest to know whether such groups must have a finite convergent rewriting system.
Both classes of languages share concepts like pattern matching (first-order versus higher-order), (tree or graph) rewriting, guards (or conditions), sometimes "where" blocks and "let" expressions.
In the following we will consider only term graphs in flat form and without useless equations (garbage), which we remove systematically during rewriting.
All these observations also hold for rewriting modulo associativity and commutativity.
