| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Higher-order dependency pairs
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.
Cited literature [11 references]
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
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)