Termination of dependently typed rewrite rules - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Termination of dependently typed rewrite rules

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

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⟩
139 Consultations
86 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More