Argument Filterings and Usable Rules in Higher-order Rewrite Systems

スポンサーリンク

概要

• 論文の詳細を見る

• 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 λ-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.

• 2011-03-25

著者

• Keiichirou Kusakari

  Graduate School Of Information Science Nagoya University

• Sho Suzuki

  Graduate School Of Information Science Nagoya University

• Frederic Blanqui

  INRIA, France

• Frederic Blanqui

  Inria France

関連論文

• Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems
• Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems
• Argument Filterings and Usable Rules in Higher-order Rewrite Systems

スポンサーリンク