Path of subterms ordering and recursive decomposition ordering revisited (Q1099655)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Path of subterms ordering and recursive decomposition ordering revisited |
scientific article |
Statements
Path of subterms ordering and recursive decomposition ordering revisited (English)
0 references
1987
0 references
The relationship between several simplification orderings is investigated: the path of subterms ordering, the recursive path ordering and the recursive decomposition ordering. The recursive decomposition ordering is improved in order to deal with more pairs of terms, and is made more efficient and easier to handle, by removing useless computations.
0 references
rewriting systems
0 references
computing of normal forms
0 references
subterms ordering
0 references
recursive path ordering
0 references
recursive decomposition ordering
0 references
