Size-based termination of higher-order rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Functional Programming Year : 2018

Size-based termination of higher-order rewriting


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.
Fichier principal
Vignette du fichier
main.pdf (818.54 Ko) Télécharger le fichier
jfp.bst (31.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01424921 , version 1 (06-01-2017)
hal-01424921 , version 2 (12-12-2017)
hal-01424921 , version 3 (09-02-2018)
hal-01424921 , version 4 (19-02-2018)
hal-01424921 , version 5 (20-02-2018)



Frédéric Blanqui. Size-based termination of higher-order rewriting. Journal of Functional Programming, 2018, ⟨10.1017/S0956796818000072⟩. ⟨hal-01424921v5⟩
316 View
340 Download



Gmail Facebook X LinkedIn More