Dynamic dependency pairs for algebraic functional systems

Research output: Contribution to journalJournal articlepeer-review

  • Cynthia Louisa Martina Kop
  • Femke van Raamsdonk
We extend the higher-order termination method of dynamic dependency pairs to Algebraic Functional Systems (AFSs). In this setting, simply typed lambda-terms with algebraic reduction and separate beta-steps are considered. For left-linear AFSs, the method is shown to be complete. For so-called local AFSs we define a variation of usable rules and an extension of argument filterings. All these techniques have been implemented in the higher-order termination tool WANDA.
Original languageEnglish
Article number10
JournalLogical Methods in Computer Science
Volume8
Issue number2
Number of pages51
ISSN1860-5974
Publication statusPublished - 2012
Externally publishedYes

ID: 148058703