Dynamic dependency pairs for algebraic functional systems
Research output: Contribution to journal › Journal article › Research › peer-review
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 language | English |
---|---|
Article number | 10 |
Journal | Logical Methods in Computer Science |
Volume | 8 |
Issue number | 2 |
Number of pages | 51 |
ISSN | 1860-5974 |
Publication status | Published - 2012 |
Externally published | Yes |
ID: 148058703