Logicality of conditional rewrite systems. - Toshiyuki Yamada; Jürgen Avenhaus; Carlos Loría-Sáenz; Aart Middeldorp (Theor. Comput. Sci., 2000)

Confluence and Termination of Simply Typed Term Rewriting Systems. - Toshiyuki Yamada (RTA, 2001)

Termination of Simply Typed Term Rewriting by Translation and Labelling. - Takahito Aoto 001; Toshiyuki Yamada (RTA, 2003)

Inductive Theorems for Higher-Order Rewriting. - Takahito Aoto 001; Toshiyuki Yamada; Yoshihito Toyama (RTA, 2004)

The Joinability and Unification Problems for Confluent Semi-constructor TRSs. - Ichiro Mitsuhashi; Michio Oyamaguchi; Yoshikatsu Ohta; Toshiyuki Yamada (RTA, 2004)

Dependency Pairs for Simply Typed Term Rewriting. - Takahito Aoto 001; Toshiyuki Yamada (RTA, 2005)

The Joinability and Related Decision Problems for Semi-constructor TRSs. - Ichiro Mitsuhashi; Michio Oyamaguchi; Yoshikatsu Ohta; Toshiyuki Yamada (Inf. Media Technol., 2006)

The reachability and related decision problems for monadic and semi-constructor TRSs. - Ichiro Mitsuhashi; Michio Oyamaguchi; Toshiyuki Yamada (Inf. Process. Lett., 2006)

Argument Filterings and Usable Rules for Simply Typed Dependency Pairs. - Takahito Aoto 001; Toshiyuki Yamada (FroCoS, 2009)

Natural Inductive Theorems for Higher-Order Rewriting. - Takahito Aoto 001; Toshiyuki Yamada; Yuki Chiba (RTA, 2011)

Developing a New Research Data Infrastructure for Japanese Historical Materials. - Ayako Shibutani; Satoru Nakamura; Kanako Hirasawa; Honami Inukai; Toshiyuki Yamada; Airu Adachi; Ikki Ohmukai; Taizo Yamada (DH, 2023)