Confluent term rewriting system

From HaskellWiki
Revision as of 16:46, 18 January 2008 by Lemming (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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