Term rewriting with traversal functions

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    51 Citaten (Scopus)


    Term rewriting is an appealing technique for performing program analysis and program transformation. Tree (term) traversal is frequently used but is not supported by standard term rewriting. We extend many-sorted, first-order term rewriting with traversal functions that automate tree traversal in a simple and type-safe way. Traversal functions can be bottom-up or top-down traversals and can either traverse all nodes in a tree or can stop the traversal at a certain depth as soon as a matching node is found. They can either define sort-preserving transformations or mappings to a fixed sort. We give small and somewhat larger examples of traversal functions and describe their operational semantics and implementation. An assessment of various applications and a discussion conclude the article.
    Originele taal-2Engels
    Pagina's (van-tot)152-190
    Aantal pagina's39
    TijdschriftACM Transactions on Software Engineering and Methodology
    Nummer van het tijdschrift2
    StatusGepubliceerd - 2003


    Duik in de onderzoeksthema's van 'Term rewriting with traversal functions'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit