An LPO-based termination ordering for higher-order terms without λ-abstraction.
In: Theorem Proving in Higher Order Logics; 1998, p277-293, 17p
Buch
Zugriff:
We present a new precedence-based termination ordering for (polymorphic) higher-order terms without λ-abstraction. The ordering has been designed to strictly generalize the lexicographic path ordering (on first-order terms). It is relatively simple, but can be used to prove termination of many higher-order rewrite systems, especially those corresponding to typical functional programs. We establish the relevant properties of the ordering, include a number of examples, and also discuss certain limitations of the ordering and possible extensions. [ABSTRACT FROM AUTHOR]
Copyright of Theorem Proving in Higher Order Logics is the property of Springer eBooks and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Titel: |
An LPO-based termination ordering for higher-order terms without λ-abstraction.
|
---|---|
Autor/in / Beteiligte Person: | Goos, Gerhard ; Hartmanis, Juris ; Leeuwen, Jan ; Grundy, Jim ; Newey, Malcolm ; Lifantsev, Maxim ; Bachmair, Leo |
Quelle: | Theorem Proving in Higher Order Logics; 1998, p277-293, 17p |
Veröffentlichung: | 1998 |
Medientyp: | Buch |
ISBN: | 978-3-540-64987-8 (print) |
DOI: | 10.1007/BFb0055142 |
Sonstiges: |
|