Travelled to:1 × Germany
1 × Japan
1 × Serbia
1 × Spain
1 × The Netherlands
Collaborated with:T.Aoto ∅ Y.Chiba Y.Toyama I.Mitsuhashi M.Oyamaguchi Y.Ohta J.Avenhaus C.Loría-Sáenz A.Middeldorp
Talks about:rewrit (6) simpli (3) type (3) term (3) theorem (2) termin (2) system (2) induct (2) higher (2) order (2)
Person: Toshiyuki Yamada
DBLP: Yamada:Toshiyuki
Contributed to:
20112005200420032001
1997Wrote 7 papers:
- RTA-2011-AotoYC #higher-order #induction #theorem
- Natural Inductive Theorems for Higher-Order Rewriting (TA, TY, YC), pp. 107–121.
- RTA-2005-AotoY #dependence #term rewriting
- Dependency Pairs for Simply Typed Term Rewriting (TA, TY), pp. 120–134.
- RTA-2004-AotoYT #higher-order #induction #theorem
- Inductive Theorems for Higher-Order Rewriting (TA, TY, YT), pp. 269–284.
- RTA-2004-MitsuhashiOOY #confluence #problem #unification
- The Joinability and Unification Problems for Confluent Semi-constructor TRSs (IM, MO, YO, TY), pp. 285–300.
- RTA-2003-AotoY #term rewriting #termination
- Termination of Simply Typed Term Rewriting by Translation and Labelling (TA, TY), pp. 380–394.
- RTA-2001-Yamada #confluence #term rewriting #termination
- Confluence and Termination of Simply Typed Term Rewriting Systems (TY), pp. 338–352.
- TAPSOFT-1997-YamadaALM #term rewriting
- Logicality of Conditional Rewrite Systems (TY, JA, CLS, AM), pp. 141–152.