IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2006-04-20 16:10
Proving Termination of Higher-Order Rewrite Systems based on Strongly Computable Dependency Pair Method
Yasuo Isogai, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, Naoki Nishida (Nagoya Univ.)
Abstract (in Japanese) (See Japanese page) 
(in English) The higher-order rewrite systems (HRS for short) are a computation model of functional programming languages, and hence the termination is one of the most important properties of them. While the dependency pair method is very useful for proving termination of term rewriting systems, previous methods to apply it for HRSs do not have enough power. In this paper, we extend the strongly computable dependency-pairs method for HRSs. There are some HRSs of which termination can be proved by our method but by no known methods.
Keyword (in Japanese) (See Japanese page) 
(in English) Functional Program / Higher-order Rewrite System / Strongly Computability / Dependency pair Method / Anonymous Function / / /  
Reference Info. IEICE Tech. Rep., vol. 106, no. 15, SS2006-6, pp. 31-36, April 2006.
Paper # SS2006-6 
Date of Issue 2006-04-13 (SS) 
ISSN Print edition: ISSN 0913-5685
Download PDF

Conference Information
Committee SS  
Conference Date 2006-04-20 - 2006-04-21 
Place (in Japanese) (See Japanese page) 
Place (in English) Niigata Univ., Igarashi Campus 
Topics (in Japanese) (See Japanese page) 
Topics (in English) general 
Paper Information
Registration To SS 
Conference Code 2006-04-SS 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Proving Termination of Higher-Order Rewrite Systems based on Strongly Computable Dependency Pair Method 
Sub Title (in English)  
Keyword(1) Functional Program  
Keyword(2) Higher-order Rewrite System  
Keyword(3) Strongly Computability  
Keyword(4) Dependency pair Method  
Keyword(5) Anonymous Function  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Yasuo Isogai  
1st Author's Affiliation Nagoya University (Nagoya Univ.)
2nd Author's Name Keiichirou Kusakari  
2nd Author's Affiliation Nagoya University (Nagoya Univ.)
3rd Author's Name Masahiko Sakai  
3rd Author's Affiliation Nagoya University (Nagoya Univ.)
4th Author's Name Toshiki Sakabe  
4th Author's Affiliation Nagoya University (Nagoya Univ.)
5th Author's Name Naoki Nishida  
5th Author's Affiliation Nagoya University (Nagoya Univ.)
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2006-04-20 16:10:00 
Presentation Time 30 minutes 
Registration for SS 
Paper # SS2006-6 
Volume (vol) vol.106 
Number (no) no.15 
Page pp.31-36 
#Pages
Date of Issue 2006-04-13 (SS) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan