IPSJ Online Transactions
Online ISSN : 1882-6660
Argument Filterings and Usable Rules in Higher-order Rewrite Systems
Sho SuzukiKeiichirou KusakariFrédéric Blanqui
Author information
JOURNALS FREE ACCESS

2011 Volume 4 Pages 114-125

Details
Abstract

The static dependency pair method is a method for proving the termination of higher-order rewrite systems à la Nipkow. It combines the dependency pair method introduced for first-order rewrite systems with the notion of strong computability introduced for typed λ-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.

Information related to the author
© 2011 by the Information Processing Society of Japan
Previous article Next article
feedback
Top