Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering (Q1275015)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering
scientific article

    Statements

    Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering (English)
    0 references
    0 references
    0 references
    12 January 1999
    0 references
    0 references
    higher-order rewriting
    0 references
    typed lambda calculus
    0 references
    termination orderings
    0 references
    0 references
    0 references