Abstract : The static dependency pair method is a method for proving the termination of higher-order rewrite systems a la Nipkow. It combines the dependency pair method introduced for first-order rewrite systems with the notion of strong computability introduced for typed lambda-calculi. Argument filterings and usable rules are two important methods of the dependency pair framework used by current state-of-the-art first-order automated termination provers. In this paper, we extend the class of higher-order systems on which the static dependency pair method can be applied. Then, we extend argument filterings and usable rules to higher-order rewriting, hence providing the basis for a powerful automated termination prover for higher-order rewrite systems.
https://hal.inria.fr/inria-00555008 Contributor : Frédéric BlanquiConnect in order to contact the contributor Submitted on : Tuesday, September 20, 2011 - 6:34:43 AM Last modification on : Friday, February 4, 2022 - 3:08:32 AM Long-term archiving on: : Wednesday, December 21, 2011 - 2:20:27 AM