Sciweavers

AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
14 years 18 days ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai