Fuhs, Carsten and Kop, C. (2019) A static higher-order dependency pair framework. In: Caires, L. (ed.) Programming Languages and Systems, 28th European Symposium on Programming, ESOP 2019, Proceedings. Lecture Notes in Computer Science 11423. Springer, pp. 752-782. ISBN 9783030171834.
|
Text
26410a.pdf - Published Version of Record Available under License Creative Commons Attribution. Download (598kB) | Preview |
Abstract
We revisit the static dependency pair method for proving termination of higher-order term rewriting and extend it in a number of ways: (1) We introduce a new rewrite formalism designed for general applicability in termination proving of higher-order rewriting, Algebraic Functional Systems with Meta-variables. (2) We provide a syntactically checkable soundness criterion to make the method applicable to a large class of rewrite systems. (3) We propose a modular dependency pair framework for this higher-order setting. (4) We introduce a fine-grained notion of formative and computable chains to render the framework more powerful. (5) We formulate several existing and new termination proving techniques in the form of processors within our framework. The framework has been implemented in the (fully automatic) higher-order termination tool WANDA.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Carsten Fuhs |
| Date Deposited: | 24 Jun 2019 12:23 |
| Last Modified: | 09 Aug 2023 12:45 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/26410 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
