( en | de | ru )

 

Disambiguation of "Yamada, Toshiyuki"

Author of the publication

copydeleteadd this publication to your clipboard
Argument Filterings and Usable Rules for Simply Typed Dependency Pairs.

, and . FroCoS, volume 5749 of Lecture Notes in Computer Science, page 117-132. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Chisaburo Yamada

Toshiyuki Ichiba

Toshiyuki Ishikawa

Osamu Yamada

Hitoshi Yamada

 

Other publications of authors with the same name

Argument Filterings and Usable Rules for Simply Typed Dependency Pairs., and . FroCoS, volume 5749 of Lecture Notes in Computer Science, page 117-132. Springer, (2009)Inductive Theorems for Higher-Order Rewriting., , and . RTA, volume 3091 of Lecture Notes in Computer Science, page 269-284. Springer, (2004)The Joinability and Unification Problems for Confluent Semi-constructor TRSs., , , and . RTA, volume 3091 of Lecture Notes in Computer Science, page 285-300. Springer, (2004)Dependency Pairs for Simply Typed Term Rewriting., and . RTA, volume 3467 of Lecture Notes in Computer Science, page 120-134. Springer, (2005)Natural Inductive Theorems for Higher-Order Rewriting., , and . RTA, volume 10 of LIPIcs, page 107-121. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Developing a New Research Data Infrastructure for Japanese Historical Materials., , , , , , , and . DH, (2023)Confluence and Termination of Simply Typed Term Rewriting Systems.. RTA, volume 2051 of Lecture Notes in Computer Science, page 338-352. Springer, (2001)Termination of Simply Typed Term Rewriting by Translation and Labelling., and . RTA, volume 2706 of Lecture Notes in Computer Science, page 380-394. Springer, (2003)