Document Open Access Logo

Higher Order Dependency Pairs for Algebraic Functional Systems

Authors Cynthia Kop, Femke van Raamsdonk

Thumbnail PDF


  • Filesize: 0.64 MB
  • 16 pages

Document Identifiers

Author Details

Cynthia Kop
Femke van Raamsdonk

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)


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).
  • higher order rewriting
  • termination
  • dynamic dependency pairs


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
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