Skip Navigation

IEICE Transactions on Information and Systems 2007 E90-D(4):707-715; doi:10.1093/ietisy/e90-d.4.707
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by KUSAKARI, K.
Right arrow Articles by CHIBA, Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2007 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Papers -- Computation and Computational Models

A Higher-Order Knuth-Bendix Procedure and Its Applications

Keiichirou KUSAKARI1 and Yuki CHIBA2

1 The author is with the Graduate School of Information Science, Nagoya University, Nagoya-shi, 464–8603 Japan. E-mail: kusakari{at}is.nagoya-u.ac.jp, 2 The author is with Research Institute of Electrical Communication, Tohoku University, Sendai-shi, 980–8577 Japan. E-mail: chiba{at}nue.riec.tohoku.ac.jp


  Abstract

The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming languages. Knuth and Bendix have proposed a procedure known as the KB procedure for generating a complete TRS. A TRS cannot, however, directly handle higher-order functions that are widely used in functional programming languages. In this paper, we propose a higher-order KB procedure that extends the KB procedure to the framework of a simply-typed term rewriting system (STRS) as an extended TRS that can handle higher-order functions. We discuss the application of this higher-order KB procedure to a certification technique called inductionless induction used in program verification, and its application to fusion transformation, a typical kind of program transformation.

Key Words: simply-typed term rewriting system, higher-order KB procedure, inductive theorem, inductionless induction, fusion transformation

Manuscript received December 17, 2004. Manuscript revised June 19, 2006.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.