= Confluence (abstract rewriting)
{wiki=Confluence_(abstract_rewriting)}
Confluence, in the context of abstract rewriting systems, refers to a property of rewriting systems (such as term rewriting systems, lambda calculus, and various forms of programming languages) that guarantees the uniqueness of results. More specifically, a rewriting system is said to be confluent if, whenever there are two different ways to rewrite a term to produce two results, there is a way to further rewrite those results to a common successor.
Back to article page
