Presentation 2006-04-20
Proving Termination of Higher-Order Rewrite Systems based on Strongly Computable Dependency Pair Method
Yasuo ISOGAI, Keiichirou KUSAKARI, Masahiko SAKAI, Toshiki SAKABE, Naoki NISHIDA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The higher-order rewrite systems (HRS for short) [14] 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)
Keyword(in English) Functional Program / Higher-order Rewrite System / Strongly Computabilty / Dependecy pair Method / Anonymous Function
Paper # SS2006-6
Date of Issue

Conference Information
Committee SS
Conference Date 2006/4/13(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Software Science (SS)
Language JPN
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 Computabilty
Keyword(4) Dependecy pair Method
Keyword(5) Anonymous Function
1st Author's Name Yasuo ISOGAI
1st Author's Affiliation Graduate School of Information Science, Nagoya University()
2nd Author's Name Keiichirou KUSAKARI
2nd Author's Affiliation Graduate School of Information Science, Nagoya University
3rd Author's Name Masahiko SAKAI
3rd Author's Affiliation Graduate School of Information Science, Nagoya University
4th Author's Name Toshiki SAKABE
4th Author's Affiliation Graduate School of Information Science, Nagoya University
5th Author's Name Naoki NISHIDA
5th Author's Affiliation Graduate School of Information Science, Nagoya University
Date 2006-04-20
Paper # SS2006-6
Volume (vol) vol.106
Number (no) 15
Page pp.pp.-
#Pages 6
Date of Issue