LIPIcs.RTA.2011.203.pdf
- Filesize: 0.64 MB
- 16 pages
Document
Higher Order Dependency Pairs for Algebraic Functional Systems
Authors
-
Part of:
Volume:
22nd International Conference on Rewriting Techniques and Applications (RTA'11)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Rewriting Techniques and Applications (RTA) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication date: 2011-04-26
Cite AsGet BibTex
Cynthia Kop and Femke van Raamsdonk. Higher Order Dependency Pairs for Algebraic Functional Systems. In 22nd International Conference on Rewriting Techniques and Applications (RTA'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 10, pp. 203-218, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.RTA.2011.203
https://doi.org/10.4230/LIPIcs.RTA.2011.203
Abstract
We extend the termination method using dynamic dependency pairs to higher order rewriting systems with beta as a rewrite step, also called Algebraic Functional Systems (AFSs). We introduce a variation of usable rules, and use monotone algebras to solve the constraints generated by dependency pairs. This approach differs in several respects from those dealing with higher order rewriting modulo beta (e.g. HRSs).
Keywords
- higher order rewriting
- termination
- dynamic dependency pairs
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads