Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (Q1176247)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 13896
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rewrite, rewrite, rewrite, rewrite, rewrite, \dots |
scientific article; zbMATH DE number 13896 |
Statements
Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (English)
0 references
25 June 1992
0 references
Transfinite derivations having a limit and (infinitary) \(\alpha\)-normal forms (\(\alpha\) is an ordinal number) in term-rewriting systems are introduced. The following properties are particularly studied: \(\omega\)- closure, top-termination, \(\omega\)-normalization, \(\omega\)-confluence (sufficient and necessary conditions are derived). The usual connections between term-rewriting and (one-sorted) algebraic semantics are established. Sufficient completeness of hierarchical systems using constructors for the many-sorted case is also pointed out. The proofs are not omitted and clarifying examples are provided.
0 references
transfinite derivations
0 references
normal forms
0 references
termination
0 references
confluence
0 references
algebraic semantics
0 references
0 references
0 references
0 references
