Size-based termination of higher-order rewriting

Abstract : We provide a general and modular criterion for the termination of simply-typed λ -calculus extended with function symbols defined by user-defined rewrite rules. Following a work of Hughes, Pareto and Sabry for functions defined with a fixpoint operator and pattern-matching, several criteria use typing rules for bounding the height of arguments in function calls. In this paper, we extend this approach to rewriting-based function definitions and more general user-defined notions of size.
Complete list of metadatas

Cited literature [161 references]  Display  Hide  Download

https://hal.inria.fr/hal-01424921
Contributor : Frédéric Blanqui <>
Submitted on : Tuesday, February 20, 2018 - 12:42:22 PM
Last modification on : Thursday, February 7, 2019 - 3:25:16 PM

Files

Identifiers

Citation

Frédéric Blanqui. Size-based termination of higher-order rewriting. Journal of Functional Programming, Cambridge University Press (CUP), 2018, ⟨10.1017/S0956796818000072⟩. ⟨hal-01424921v5⟩

Share

Metrics

Record views

155

Files downloads

169