Higher-order dependency pairs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Higher-order dependency pairs


Arts and Giesl proved that the termination of a first-order rewrite system can be reduced to the study of its ``dependency pairs''. We extend these results to rewrite systems on simply typed lambda-terms by using Tait's computability technique.
Fichier principal
Vignette du fichier
main.pdf (126.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00084821 , version 1 (05-09-2006)
inria-00084821 , version 2 (11-09-2006)
inria-00084821 , version 3 (23-04-2018)



Frédéric Blanqui. Higher-order dependency pairs. Eighth International Workshop on Termination - WST 2006, Aug 2006, Seattle, United States. ⟨inria-00084821v3⟩
106 View
52 Download



Gmail Facebook Twitter LinkedIn More