Counterexamples in Infinitary Rewriting with Non-Fully-Extended Rules

J. Ketema

    Research output: Contribution to journalArticleAcademicpeer-review

    Abstract

    We show counterexamples exist to confluence modulo hypercollapsing subterms, fair normalisation, and the normal form property in orthogonal infinitary higher-order rewriting with non-fully-extended rules. This sets these systems apart from both fully-extended and finite systems, where no such counterexamples are possible.
    Original languageUndefined
    Pages (from-to)642-646
    Number of pages5
    JournalInformation processing letters
    Volume111
    Issue number13
    DOIs
    Publication statusPublished - 1 Jul 2011

    Keywords

    • Programming calculi
    • EWI-20011
    • Higher-order rewriting
    • IR-76651
    • Infinitary Rewriting
    • METIS-277606

    Cite this