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