A type-based termination criterion for dependently-typed higher-order rewrite systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

A type-based termination criterion for dependently-typed higher-order rewrite systems

Abstract

Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent types, hence providing a powerful termination criterion for the combination of rewriting and beta-reduction in the Calculus of Constructions.
Fichier principal
Vignette du fichier
main.pdf (370.33 Ko) Télécharger le fichier

Dates and versions

inria-00100254 , version 1 (11-10-2006)

Identifiers

Cite

Frédéric Blanqui. A type-based termination criterion for dependently-typed higher-order rewrite systems. 15th International Conference on Rewriting Techniques and Applications - RTA'04, 2004, Aachen, Germany. ⟨inria-00100254⟩
87 View
107 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More