Search the dblp DataBase

Publications of Author

1. Takahito Aoto, Toshiyuki Yamada
   Termination of Simply Typed Term Rewriting by Translation and Labelling. [Citation Graph (0, 0)][DBLP]
   RTA, 2003, pp:380-394 [Conf]
   
2. Takahito Aoto, Toshiyuki Yamada
   Dependency Pairs for Simply Typed Term Rewriting. [Citation Graph (0, 0)][DBLP]
   RTA, 2005, pp:120-134 [Conf]
   
3. Takahito Aoto, Toshiyuki Yamada, Yoshihito Toyama
   Inductive Theorems for Higher-Order Rewriting. [Citation Graph (0, 0)][DBLP]
   RTA, 2004, pp:269-284 [Conf]
   
4. Ichiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada
   The Joinability and Unification Problems for Confluent Semi-constructor TRSs. [Citation Graph (0, 0)][DBLP]
   RTA, 2004, pp:285-300 [Conf]
   
5. Toshiyuki Yamada
   Confluence and Termination of Simply Typed Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
   RTA, 2001, pp:338-352 [Conf]
   
6. Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp
   Logicality of Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP]
   TAPSOFT, 1997, pp:141-152 [Conf]
   
7. Ichiro Mitsuhashi, Michio Oyamaguchi, Toshiyuki Yamada
   The reachability and related decision problems for monadic and semi-constructor TRSs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:98, n:6, pp:219-224 [Journal]
   
8. Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp
   Logicality of conditional rewrite systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:236, n:1-2, pp:209-232 [Journal]
   
9. 
   Argument Filterings and Usable Rules for Simply Typed Dependency Pairs. [Citation Graph (, )][DBLP]