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

Frédéric Blanqui
Constraints, automatic deduction and software properties proofs

Abstract

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.

Domains

Logic in Computer Science [cs.LO]
Fichier principal
Vignette du fichier
main.pdf (126.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Frédéric Blanqui  : Connect in order to contact the contributor

https://inria.hal.science/inria-00084821

Submitted on : Monday, April 23, 2018-4:28:12 PM

Last modification on : Thursday, February 15, 2024-3:31:49 AM

Long-term archiving on: Tuesday, September 18, 2018-11:21:23 PM

Download

Dates and versions

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

Identifiers

Cite

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

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-RENNES1 CNRS INRIA IRISA UNIV-LORRAINE INRIA2 LORIA UR1-MATH-STIC UR1-UFR-ISTIC UNIV-RENNES UR1-MATH-NUM
110 View
53 Download

Altmetric

Share

Gmail Facebook X LinkedIn More