| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems
Abstract : Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are computational models of functional programs. We recently proposed an extremely powerful method, the static dependency pair method, which is based on the notion of strong computability, in order to prove termination in STRSs. In this paper, we extend the method to HRSs. Since HRSs include λ-abstraction but STRSs do not, we restructure the static dependency pair method to allow λ-abstraction, and show that the static dependency pair method also works well on HRSs without new restrictions.
Cited literature [23 references]
https://hal.inria.fr/inria-00397820
Contributor : Frédéric Blanqui <>
Submitted on : Monday, September 26, 2011 - 3:42:34 AM
Last modification on : Tuesday, March 17, 2020 - 3:27:44 AM
Long-term archiving on: : Tuesday, December 27, 2011 - 2:20:06 AM
Contributor : Frédéric Blanqui <>
Submitted on : Monday, September 26, 2011 - 3:42:34 AM
Last modification on : Tuesday, March 17, 2020 - 3:27:44 AM
Long-term archiving on: : Tuesday, December 27, 2011 - 2:20:06 AM
Files
main.pdf
Files produced by the author(s)