Termination of dependently typed rewrite rules - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Termination of dependently typed rewrite rules


Our interest is in automated termination proofs of higher-order rewrite rules in presence of dependent types modulo a theory T on base types. We first describe an original transformation to a type discipline without type dependencies which preserves non-termination. Since the user must reason on expressions of the transformed language, we then introduce an extension of the computability path ordering CPO for comparing dependently typed expressions named DCPO. Using the previous result, we show that DCPO is a well-founded order, behaving well in practice.
Fichier principal
Vignette du fichier
TLCA.pdf (514.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01239083 , version 1 (07-12-2015)



Jean-Pierre Jouannaud, Jian-Qi Li. Termination of dependently typed rewrite rules. Proc. TLCA 2015, Jul 2015, Varsaw, Poland. ⟨10.4230/LIPIcs.TLCA.2015.x⟩. ⟨hal-01239083⟩
137 View
79 Download



Gmail Facebook Twitter LinkedIn More