Higher-Order Constrained Dependency Pairs for (Universal) Computability
<|reference_start|>Higher-Order Constrained Dependency Pairs for (Universal) Computability: Dependency pairs constitute a series of very effective techniques for the termination analysis of term rewriting systems. In this paper, we adapt the static dependency pair framework to logically constrained simply-typed term rewriting systems (LCSTRSs), a higher-order formalism with logical constraints built in. We also propose the concept of universal computability, which enables a form of open-world termination analysis through the use of static dependency pairs.<|reference_end|>
@article{guo2024higher-order,
    title={Higher-Order Constrained Dependency Pairs for (Universal) Computability},
    author={Liye Guo, Kasper Hagens, Cynthia Kop, Deivid Vale},
    journal={arXiv preprint arXiv:2406.19379},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.19379},
    primaryClass={cs.LO}
}