Confluence
Builds on Rewriting systemTransitive closure
Definition
Let be an abstract rewriting system, and let be the reflexive and transitive closure of . Two elements are joinable if and for some . The system is:
- confluent if for all with and , the elements and are joinable;
- locally confluent if for all with and , the elements and are joinable;
- convergent if it is confluent and terminating.
Remarks
Example: with for ; any two elements reachable from both reduce to , so the system is confluent. Non-example: with and ; here and 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 , , , , the system is locally confluent, yet and with and distinct normal forms. Confluence is equivalent to the Church–Rosser property: implies that and 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
- no evidence level
- Rewriting system concept
- Transitive closure concept
- Confluence definition
Further reading
About this page
| Tag | ERX969YV99 |
|---|---|
| URI | m2://ERX969YV99 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 68Q42, 03B70 |
| Defines | Confluence |
| Uses | Rewriting system, Transitive closure |
| Changed | 3 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.