2026-08-16T06:39:00Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3117 2024-03-06T10:33:51Z ddc:004 open_access

Higher Order Dependency Pairs for Algebraic Functional Systems Kop, Cynthia van Raamsdonk, Femke higher order rewriting termination dynamic dependency pairs 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). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Cynthia Kop and Femke van Raamsdonk 2011 Is Part Of LIPIcs, Volume 10, 22nd International Conference on Rewriting Techniques and Applications (RTA'11) (2011) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.RTA.2011.203 urn:nbn:de:0030-drops-31177 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.203 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode