Presentation	1996/1/26 On the termination of higher order rewrite systems Munehiro Iwami, Masahiko Sakai, Yoshihito Toyama,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Termination orderings, which are syntactically defined, can be implemented so easily that they are widely used as a method to insure the termination property of term rewriting systems(TRS). Many termination orderings such as recursive path ordering, recursive decomposition ordering was proposed and improved until now. On the other hand, there are no researches to prove the termination property of higher order rewrite systems (HRS) except Lysne and Piris work, which extends recursive path ordering with status (RPOS) to HRS. This paper extends improved recursive decomposition ordering with status (IRDS) to HRS. The resulting order, called HRDO, is expected stronger than RPOS.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Higher order rewrite system / termination / recursive decomposition ordering
Paper #	COMP95-85
Date of Issue

Conference Information
Committee	COMP
Conference Date	1996/1/26(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	Theoretical Foundations of Computing (COMP)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	On the termination of higher order rewrite systems
Sub Title (in English)
Keyword(1)	Higher order rewrite system
Keyword(2)	termination
Keyword(3)	recursive decomposition ordering
1st Author's Name	Munehiro Iwami
1st Author's Affiliation	JAIST()
2nd Author's Name	Masahiko Sakai
2nd Author's Affiliation	JAIST
3rd Author's Name	Yoshihito Toyama
3rd Author's Affiliation	JAIST
Date	1996/1/26
Paper #	COMP95-85
Volume (vol)	vol.95
Number (no)	498
Page	pp.pp.-
#Pages	9
Date of Issue