Confluent term rewriting system

From HaskellWiki

In a confluent term rewriting system you will always end up in the same result if you apply rewriting rules in different order until no more rules can be applied.

See also[edit]