Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems

スポンサーリンク

概要

• 論文の詳細を見る

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

著者

• KUSAKARI Keiichirou

  Graduate School of Information Science, Nagoya Univ.

• ISOGAI Yasuo

  Graduate School of Information Science, Nagoya Univ.

• SAKAI Masahiko

  Graduate School of Information Science, Nagoya Univ.

• BLANQUI Frédéric

  INRIA & LORIA

関連論文

• Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems
• Head-Needed Strategy of Higher-Order Rewrite Systems and Its Decidable Classes
• Recognizability of Redexes for Higher-Order Rewrite Systems
• 高階書換え系における引数切り落とし法と実効規則
• Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs
• Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems
• Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques
• Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting
• Characterizing Inductive Theorems by Extensional Initial Models in a Higher-Order Equational Logic
• A Higher-Order Knuth-Bendix Procedure and Its Applications
• On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
• Higher-Order Path Orders Based on Computability(Foundations of Computer Science)

もっと見る 閉じる

スポンサーリンク