1. Lecture Notes in Computer Science;T. Aoto,2003
2. Aoto, T., Yamada, T.: Termination of simply-typed applicative term rewriting systems. In: Proc. of HOR 2004, pp. 61–65 (2004)
3. Lecture Notes in Computer Science;T. Aoto,2005
4. Aoto, T., Yamada, T.: Argument filterings and usable rules for simply typed dependency pairs (extended abstract). In: Proc. of HOR 2007, pp. 21–27 (2007)
5. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1-2), 133–178 (2000)