Keiichirou KUSAKARI


Static Dependency Pair Method in Rewriting Systems for Functional Programs with Product, Algebraic Data, and ML-Polymorphic Types
Keiichirou KUSAKARI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2013/03/01
Vol. E96-D  No. 3  pp. 472-480
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —)
Category: 
Keyword: 
rewriting systems for functional programsterminationstatic dependency pair method
 Summary | Full Text:PDF(225.1KB)

Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems
Keiichirou KUSAKARI Yasuo ISOGAI Masahiko SAKAI Frederic BLANQUI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2009/10/01
Vol. E92-D  No. 10  pp. 2007-2015
Type of Manuscript:  PAPER
Category: Computation and Computational Models
Keyword: 
higher-order rewrite systemterminationstatic dependency pairplain function-passingstrong computabilitysubterm criterion
 Summary | Full Text:PDF(274.3KB)

Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques
Keiichirou KUSAKARI Masahiko SAKAI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2009/02/01
Vol. E92-D  No. 2  pp. 235-247
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: 
Keyword: 
simply-typed term rewritingterminationstatic dependency pair methodargument filteringusable rule
 Summary | Full Text:PDF(292.3KB)

A Higher-Order Knuth-Bendix Procedure and Its Applications
Keiichirou KUSAKARI Yuki CHIBA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2007/04/01
Vol. E90-D  No. 4  pp. 707-715
Type of Manuscript:  PAPER
Category: Computation and Computational Models
Keyword: 
simply-typed term rewriting systemhigher-order KB procedureinductive theoreminductionless inductionfusion transformation
 Summary | Full Text:PDF(192.5KB)

Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting
Keiichirou KUSAKARI Masahiko SAKAI Toshiki SAKABE 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2005/12/01
Vol. E88-D  No. 12  pp. 2715-2726
Type of Manuscript:  PAPER
Category: Computation and Computational Models
Keyword: 
algebraic specificationsimply-typed term rewriting systemprimitive inductive theoreminductive theoremimplicit induction method
 Summary | Full Text:PDF(261.8KB)

On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
Masahiko SAKAI Keiichirou KUSAKARI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2005/03/01
Vol. E88-D  No. 3  pp. 583-593
Type of Manuscript:  PAPER
Category: Computation and Computational Models
Keyword: 
terminationdependency pairhigher-order rewrite systemdependency forest
 Summary | Full Text:PDF(643.2KB)

Higher-Order Path Orders Based on Computability
Keiichirou KUSAKARI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2004/02/01
Vol. E87-D  No. 2  pp. 352-359
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: 
Keyword: 
simply-typed term rewriting systemterminationpath ordercomputabilitydependency pairargument filtering method
 Summary | Full Text:PDF(204.4KB)

On Proving AC-Termination by AC-Dependency Pairs
Keiichirou KUSAKARI Yoshihito TOYAMA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2001/05/01
Vol. E84-D  No. 5  pp. 604-612
Type of Manuscript:  PAPER
Category: Theory/Models of Computation
Keyword: 
AC-term rewriting systemAC-terminationAC-dependency pairAC-dependency graph
 Summary | Full Text:PDF(455.1KB)