BIROn - Birkbeck Institutional Research Online

    First-order formative rules

    Fuhs, Carsten and Kop, C. (2014) First-order formative rules. In: Dowek, G. (ed.) Rewriting and Typed Lambda Calculi. Lecture Notes in Computer Science 8560. New York, U.S.: Springer, pp. 240-256. ISBN 9783319089171.

    [img]
    Preview
    Text
    RTATLCA14-formative.pdf - Author's Accepted Manuscript

    Download (454kB) | Preview

    Abstract

    This paper discusses the method of formative rules for first-order term rewriting, which was previously defined for a higher-order setting. Dual to the well-known usable rules, formative rules allow dropping some of the term constraints that need to be solved during a termination proof. Compared to the higher-order definition, the first-order setting allows for significant improvements of the technique.

    Metadata

    Item Type: Book Section
    Additional Information: Proceedings, Joint International Conference, RTA-TLCA 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-08918-8_17
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Dr. Carsten Fuhs
    Date Deposited: 10 Dec 2015 13:16
    Last Modified: 30 Jul 2019 21:56
    URI: http://eprints.bbk.ac.uk/id/eprint/13547

    Statistics

    Downloads
    Activity Overview
    126Downloads
    133Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item