On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
Main Authors: | SAKAI, Masahiko, KUSAKARI, Keiichirou |
---|---|
Language: | en |
Published: |
IEICE
2005
|
Subjects: | |
Online Access: | http://hdl.handle.net/2237/9579 |
Similar Items
-
An Extension of the Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
by: SAKAI, Masahiko, et al.
Published: (2001) -
Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Technique
by: SAKAI, Masahiko, et al.
Published: (2009) -
On Proving Termination of Higher-Order Rewrite Systems by Dependency Pair Technique
by: Sakai, Masahiko, et al.
Published: (2002) -
Enhancing Dependency Pair Method using Strong Computability in Simply-Typed Term Rewriting
by: 草刈, 圭一朗, et al.
Published: (2007) -
On New Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
by: Sakai, Masahiko, et al.
Published: (2001)