An account of implementing applicative term rewriting

M.J. Weerdenburg, van

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

    4 Citations (Scopus)

    Abstract

    Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation of two rewriters of the mCRL2 toolset. These rewriters work on open terms and use nonlinear match trees. A comparison is made with other commonly used efficient rewriters.
    Original languageEnglish
    Title of host publicationProceedings Sixth International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2006) 11 August 2006, Seattle, Washington, USA
    EditorsS. Antoy
    Place of PublicationAmsterdam
    PublisherElsevier
    Pages139-155
    DOIs
    Publication statusPublished - 2007
    Event6th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2006), August 11, 2006, Seattle, WA, USA - Seattle, WA, United States
    Duration: 11 Aug 200611 Aug 2006

    Publication series

    NameElectronic Notes in Theoretical Computer Science
    Volume174
    ISSN (Print)1571-0061

    Workshop

    Workshop6th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2006), August 11, 2006, Seattle, WA, USA
    Abbreviated titleWRS 2006
    Country/TerritoryUnited States
    CitySeattle, WA
    Period11/08/0611/08/06

    Fingerprint

    Dive into the research topics of 'An account of implementing applicative term rewriting'. Together they form a unique fingerprint.

    Cite this