Math 2.0

Computer science Definition

Confluence

Builds on Rewriting systemTransitive closure

Definition

Let (A,→)(A, \to) be an abstract rewriting system, and let →∗\to^* be the reflexive and transitive closure of →\to. Two elements b,c∈Ab, c \in A are joinable if b→∗db \to^* d and c→∗dc \to^* d for some d∈Ad \in A. The system is:

  1. confluent if for all a,b,c∈Aa, b, c \in A with a→∗ba \to^* b and a→∗ca \to^* c, the elements bb and cc are joinable;
  2. locally confluent if for all a,b,c∈Aa, b, c \in A with a→ba \to b and a→ca \to c, the elements bb and cc are joinable;
  3. convergent if it is confluent and terminating.

Remarks

Example: A=ℕA = \N with n→n−1n \to n - 1 for n≥1n \ge 1; any two elements reachable from aa both reduce to 00, so the system is confluent. Non-example: A={a,b,c}A = \set{a, b, c} with a→ba \to b and a→ca \to c; here bb and cc are distinct normal forms, so they are not joinable and the system is not even locally confluent. Every confluent system is locally confluent, but not conversely: with b→ab \to a, b→cb \to c, c→bc \to b, c→dc \to d, the system is locally confluent, yet b→∗ab \to^* a and b→∗db \to^* d with aa and dd distinct normal forms. Confluence is equivalent to the Church–Rosser property: a↔∗ba \leftrightarrow^* b implies that aa and bb are joinable. In a confluent system each element has at most one normal form.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Rewriting system concept
  2. Transitive closure concept
  3. Confluence definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Confluence_(abstract_rewriting)
About this page
TagERX969YV99
URIm2://ERX969YV99
Kinddefinition
WritingW0 stub
MSC68Q42, 03B70
DefinesConfluence
UsesRewriting system, Transitive closure
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.