Problem
Research questions and friction points this paper is trying to address.
higher-order rewriting
termination
HRS
TermCOMP
benchmark
Towards an HRS Category in TermCOMP
🤖 AI Summary
TermCOMP currently lacks a standardized competition category supporting Nipkow’s higher-order rewriting systems (HRS), hindering fair comparisons among relevant tools. This work proposes a syntactically concise subclass of HRS benchmarks and formally establishes that, within this subclass, the standard semantics of HRS coincides with the beta-first reduction strategy employed in TermCOMP’s higher-order category. By proving this semantic equivalence, the study provides the first rigorous theoretical foundation for introducing an HRS subcategory into TermCOMP, thereby ensuring semantic consistency between the two frameworks over this specific subset. This advancement enables broader participation of HRS-compatible tools in unified benchmarking evaluations under TermCOMP.
📝 Abstract
We show that there is a simple syntactically-defined subclass of higher-order benchmarks in the termination problem database for which rewriting according to Nipkow's higher-order rewrite systems (HRSs) and rewriting according to a beta-first strategy in the semantics of TermCOMP's higher-order category coincide. This lays the formal foundation for an HRS (sub)category in TermCOMP which would allow more tools to compete against each other.
Innovation
Methods, ideas, or system contributions that make the work stand out.
higher-order rewriting
HRS
TermCOMP
beta-first strategy
termination
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
