Personal tools

Confluent term rewriting system

From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
 
(bold keyword)
 
Line 1: Line 1:
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.
+
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 ==
 
== See also ==

Latest revision as of 19:38, 27 February 2008

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.

[edit] See also