License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2012.176
URN: urn:nbn:de:0030-drops-34924
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2012/3492/
Fuhs, Carsten ;
Kop, Cynthia
Polynomial Interpretations for Higher-Order Rewriting
Abstract
The termination method of weakly monotonic algebras, which has been defined for higher-order rewriting in the HRS formalism, offers a lot of power, but has seen little use in recent years. We adapt and extend this method to the alternative formalism of algebraic functional systems, where the simply-typed lambda-calculus is combined with algebraic reduction. Using this theory, we define higher-order polynomial interpretations, and show how the implementation challenges of this technique can be tackled.
A full implementation is provided in the termination tool Wanda.
BibTeX - Entry
@InProceedings{fuhs_et_al:LIPIcs:2012:3492,
author = {Carsten Fuhs and Cynthia Kop},
title = {{Polynomial Interpretations for Higher-Order Rewriting}},
booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12) },
pages = {176--192},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-38-5},
ISSN = {1868-8969},
year = {2012},
volume = {15},
editor = {Ashish Tiwari},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3492},
URN = {urn:nbn:de:0030-drops-34924},
doi = {10.4230/LIPIcs.RTA.2012.176},
annote = {Keywords: higher-order rewriting, termination, polynomial interpretations, weakly monotonic algebras, automation}
}
Keywords: |
|
higher-order rewriting, termination, polynomial interpretations, weakly monotonic algebras, automation |
Collection: |
|
23rd International Conference on Rewriting Techniques and Applications (RTA'12) |
Issue Date: |
|
2012 |
Date of publication: |
|
29.05.2012 |