Fuhs, Carsten and Guo, L. and Kop, C. (2025) An Innermost DP Framework for Constrained Higher-Order Rewriting. In: Fernández, M. (ed.) Proceedings of the 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025). Leibniz International Proceedings in Informatics. Dagstuhl Publishing, 20:1-20:24.
![[img]](https://eprints.bbk.ac.uk/style/images/fileicons/text.png) |
Text
FSCD2025-innermost-dps-lcstrs.pdf - Published Version of Record Available under License Creative Commons Attribution. Download (774kB) |
Abstract
Logically constrained simply-typed term rewriting systems (LCSTRSs) are a higher-order formalism for program analysis with support for primitive data types. The termination problem of LCSTRSs has been studied so far in the setting of full rewriting. This paper modifies the higher-order constrained dependency pair framework to prove innermost termination, which corresponds to the termination of programs under call by value. We also show that the notion of universal computability with respect to innermost rewriting can be effectively handled in the modified, innermost framework, which lays the foundation for open-world termination analysis of programs under call by value via LCSTRSs.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | ISSN: 1868-8969 |
| Keyword(s) / Subject(s): | Higher-order term rewriting, Constrained rewriting, Open-world analysis, Dependency Pairs, Innermost termination, Call by value |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Carsten Fuhs |
| Date Deposited: | 23 Jul 2025 13:43 |
| Last Modified: | 19 Sep 2025 20:51 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/55675 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
