1 citations · 1 across the 4 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.LO2011★ 1 cited
Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems
Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai +1
Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are computational models of functional programs. We recently proposed an extremely powerful meth…
cs.LO2011
Argument filterings and usable rules in higher-order rewrite systems
Sho Suzuki, Keiichirou Kusakari, Frédéric Blanqui
The static dependency pair method is a method for proving the termination of higher-order rewrite systems a la Nipkow. It combines the dependency pair method introduced for first-o…