| | |
| | |
Stat |
Members: 3667 Articles: 2'599'751 Articles rated: 2609
07 February 2025 |
|
| | | |
|
Article overview
| |
|
Reduction Operators and Completion of Rewriting Systems | Cyrille Chenavier
; | Date: |
1 May 2016 | Abstract: | We propose a functional description of rewriting systems where reduction
rules are represented by linear maps called reduction operators. We show that
reduction operators admit a lattice structure. Using this structure we define
the notion of confluence and we show that this notion is equivalent to the
Church-Rosser property of reduction operators. In this paper we give an
algebraic formulation of completion using the lattice structure. We relate
reduction operators and Gr"obner bases. Finally, we introduce generalised
reduction operators relative to non total ordered sets. | Source: | arXiv, 1605.0174 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|