Confluent term rewriting system

From HaskellWiki
Revision as of 19:38, 27 February 2008 by Lemming (talk | contribs) (bold keyword)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to 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

Retrieved from "https://wiki.haskell.org/index.php?title=Confluent_term_rewriting_system&oldid=19604"