IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Regular Section
Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems
Keiichirou KUSAKARIYasuo ISOGAIMasahiko SAKAIFrédéric BLANQUI
Author information
JOURNALS FREE ACCESS

2009 Volume E92.D Issue 10 Pages 2007-2015

Details
Abstract

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.

Information related to the author
© 2009 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top