A property of a rewriting or reduction system stating that whenever a term can be reduced by two (possibly different) sequences to terms s and t, there exists a term u to which both s and t can further reduce (i.e., s ↓ u and t ↓ u). Confluence is often called the Church–Rosser property.

Principle

Different reduction paths from the same starting point can be joined: local divergence is harmless because reductions rejoin to a common descendant, which ensures consistency of equational reasoning and canonical results when normal forms exist.

Demonstration

In lambda-calculus with β-reduction, the Church–Rosser theorem shows that if two terms are β-convertible, they have a common reduct. Practically, this means that different choices of evaluation order (when reductions terminate) yield the same normal form up to conversion.

Misapplication

Assuming confluence implies termination (i.e., that every reduction sequence reaches a normal form) is incorrect. Also presuming confluence in systems with side effects, context-sensitive rules, or non-deterministic operations can produce unsound conclusions.

Consequence

Guarantees uniqueness of normal forms up to conversion and allows interchangeable reduction strategies: equational reasoning and program transformation become sound because different rewrite sequences do not produce irreconcilable results.

Reversal

Non-confluent systems admit critical divergences where different reduction sequences lead to irreconcilable normal forms or to terms without a common reduct, making the outcome dependent on reduction choices.

Boundary

Confluence is a property of the reduction relation and need not hold in presence of side-effects, unrestricted context-sensitive rewrites, or when reductions are not closed under the relation's closure properties. Newman's lemma relates local confluence plus termination to global confluence.

Semantic Tension

Tension appears between confluence as a correctness guarantee and practical concerns like evaluation efficiency or resource usage: a confluent system may still allow expensive or non-terminating reduction paths, so confluence does not solve performance or termination issues.

Synthesis

Confluence (the Church–Rosser property) ensures that divergent reduction sequences from the same term can be joined to a common reduct, providing consistency for rewriting and program transformation while remaining distinct from termination or complexity properties.