( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Argument Filterings and Usable Rules for Simply Typed Dependency Pairs.

, и . FroCoS, том 5749 из Lecture Notes in Computer Science, стр. 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.

Chisaburo Yamada

Toshiyuki Ichiba

Toshiyuki Ishikawa

Osamu Yamada

Hitoshi Yamada

 

Другие публикации лиц с тем же именем

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