Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (Q1176247)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
scientific article

    Statements

    Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (English)
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    transfinite derivations
    0 references
    normal forms
    0 references
    termination
    0 references
    confluence
    0 references
    algebraic semantics
    0 references
    0 references