Enhancing dependency pair method using strong computability in simply-typed term rewriting

We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational models of functional programs. The primary advantage of our method is that one can exclude higher-order variables which are difficult to analyze theoretically, from recursive structure analysis. The key idea of our method is to analyze recursive structure from the viewpoint of strong computability. This property was introduced for proving termination in typed λ-calculus, and is a stronger condition than the property of termination. The difficulty in incorporating this concept into recursive structure analysis is that because it is defined inductively over type structure, it is not closed under the subterm relation. This breaks the correspondence between strong computability and recursive structure. In order to guarantee the correspondence, we propose plain function-passing as a restriction, which is satisfied...

• Type: Journal
• Year: 2007
• Where: AAECC
• Authors: Keiichirou Kusakari, Masahiko Sakai
• Keywords: AAECC 2007, Algorithms, Recursive Structure, Recursive Structure Analysis, Term Rewriting System