Higher Order Dependency Pairs for Algebraic Functional Systems

Kop, Cynthia; van Raamsdonk, Femke

doi:10.4230/LIPIcs.RTA.2011.203

Document

Higher Order Dependency Pairs for Algebraic Functional Systems

Authors Cynthia Kop, Femke van Raamsdonk

Part of: Volume: 22nd International Conference on Rewriting Techniques and Applications (RTA'11) (RTA 2011)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: International Conference on Rewriting Techniques and Applications (RTA)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2011-04-26

PDF

File

PDF

LIPIcs.RTA.2011.203.pdf

Filesize: 0.64 MB
16 pages

Document Identifiers

DOI: 10.4230/LIPIcs.RTA.2011.203
URN: urn:nbn:de:0030-drops-31177

Subject Classification

Keywords

higher order rewriting
termination
dynamic dependency pairs

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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).

Cite As Get 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

Author Details

Cynthia Kop

Femke van Raamsdonk

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail