Comparing Böhm-Like Trees

J. Ketema

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    5 Citations (Scopus)

    Abstract

    Extending the infinitary rewriting definition of Böhm-like trees to infinitary Combinatory Reduction Systems (iCRSs), we show that each Böhm-like tree defined by means of infinitary rewriting can also be defined by means of a direct approximant function. In addition, we show that counterexamples exists to the reverse implication.
    Original languageUndefined
    Title of host publicationRewriting Techniques and Applications: 20th International Conference, RTA 2009
    EditorsR. Treinen
    Place of PublicationBerlin
    PublisherSpringer
    Pages239-254
    Number of pages16
    ISBN (Print)978-3-642-02347-7
    DOIs
    Publication statusPublished - Jun 2009

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer Verlag
    Volume5595
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Keywords

    • METIS-263922
    • Infinitary Rewriting
    • Böhm trees
    • EWI-15709
    • Higher-order rewriting
    • CR-F.3
    • CR-F.4
    • IR-67804

    Cite this

    Ketema, J. (2009). Comparing Böhm-Like Trees. In R. Treinen (Ed.), Rewriting Techniques and Applications: 20th International Conference, RTA 2009 (pp. 239-254). [10.1007/978-3-642-02348-4_17] (Lecture Notes in Computer Science; Vol. 5595). Berlin: Springer. https://doi.org/10.1007/978-3-642-02348-4_17