Skip to Main content Skip to Navigation
Conference papers

Higher-order dependency pairs

Frédéric Blanqui 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00084821
Contributor : Frédéric Blanqui <>
Submitted on : Monday, April 23, 2018 - 4:28:12 PM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM
Long-term archiving on: : Tuesday, September 18, 2018 - 11:21:23 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00084821, version 3
  • ARXIV : 1804.08855

Collections

Citation

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

Share

Metrics

Record views

54

Files downloads

25