On Equivalence Transformations for Term Rewriting Systems. - Yoshihito Toyama (RIMS Symposia on Software Science and Engineering, 1984)

Confluent Term Rewriting Systems with Membership Conditions. - Yoshihito Toyama (CTRS, 1987)

Counterexamples to Termination for the Direct Sum of Term Rewriting Systems. - Yoshihito Toyama (Inf. Process. Lett., 1987)

On the Church-Rosser property for the direct sum of term rewriting systems. - Yoshihito Toyama (J. ACM, 1987)

Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-. - Yoshihito Toyama; Jan Willem Klop; Hendrik Pieter Barendregt (RTA, 1989)

Fast Knuth-Bendix Completion with a Term Rewriting System Compiler. - Yoshihito Toyama (Inf. Process. Lett., 1989)

How to Prove Equivalence of Term Rewriting Systems Without Induction. - Yoshihito Toyama (Theor. Comput. Sci., 1991)

Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems - Yoshihito Toyama (LICS, 1992)

Completeness of Combinations of Constructor Systems. - Aart Middeldorp; Yoshihito Toyama (J. Symb. Comput., 1993)

Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems. - Yoshihito Toyama; Michio Oyamaguchi (CTRS, 1994)

Modularity of Confluence: A Simplified Proof. - Jan Willem Klop; Aart Middeldorp; Yoshihito Toyama; Roel C. de Vrijer (Inf. Process. Lett., 1994)

Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems. - Yoshihito Toyama; Jan Willem Klop; Hendrik Pieter Barendregt (J. ACM, 1995)

On Composable Properties of Term Rewriting Systems. - Takahito Aoto 001; Yoshihito Toyama (ALP/HOA, 1997)

Persistency of Confluence. - Takahito Aoto 001; Yoshihito Toyama (J. Univers. Comput. Sci., 1997)

Termination Transformation by Tree Lifting Ordering. - Takahito Aoto 001; Yoshihito Toyama (RTA, 1998)

Semantics and Strong Sequentiality of Priority Term Rewriting Systems. - Masahiko Sakai; Yoshihito Toyama (Theor. Comput. Sci., 1998)

Argument Filtering Transformation. - Keiichirou Kusakari; Masaki Nakamura 001; Yoshihito Toyama (PPDP, 1999)

Decidability for Left-Linaer Growing Term Rewriting Systems. - Takashi Nagaya; Yoshihito Toyama (RTA, 1999)

New Challenges for Compuational Models. - Yoshihito Toyama (IFIP TCS, 2000)

Decidability for Left-Linear Growing Term Rewriting Systems. - Takashi Nagaya; Yoshihito Toyama (Inf. Comput., 2002)

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

Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms. - Yoshihito Toyama (RTA, 2004)

Preface. - Sergio Antoy; Yoshihito Toyama (WRS, 2004)

Reduction Strategies for Left-Linear Term Rewriting Systems. - Yoshihito Toyama (Processes, Terms and Cycles, 2005)

Program transformation by templates based on term rewriting. - Yuki Chiba; Takahito Aoto 001; Yoshihito Toyama (PPDP, 2005)

Confluent Term Rewriting Systems. - Yoshihito Toyama (RTA, 2005)

Elimination Transformations for Associative-Commutative Rewriting Systems. - Keiichirou Kusakari; Masaki Nakamura 001; Yoshihito Toyama (J. Autom. Reason., 2006)

Program Transformation by Templates: A Rewriting Framework. - Yuki Chiba; Takahito Aoto 001; Yoshihito Toyama (Inf. Media Technol., 2007)

Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations. - Yoshihito Toyama (RTA, 2008)

Modular Church-Rosser Modulo: The Complete Picture. - Jean-Pierre Jouannaud; Yoshihito Toyama (Int. J. Softw. Informatics, 2008)

Automatic Construction of Program Transformation Templates. - Yuki Chiba; Takahito Aoto 001; Yoshihito Toyama (Inf. Media Technol., 2008)

Proving Confluence of Term Rewriting Systems Automatically. - Takahito Aoto 001; Junichi Yoshida; Yoshihito Toyama (RTA, 2009)

Program Transformation Templates for Tupling Based on Term Rewriting. - Yuki Chiba; Takahito Aoto 001; Yoshihito Toyama (IEICE Trans. Inf. Syst., 2010)

A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems - Takahito Aoto 001; Yoshihito Toyama (Log. Methods Comput. Sci., 2012)

Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams. - Takahito Aoto 001; Yoshihito Toyama; Kazumasa Uchida (RTA-TLCA, 2014)

Correctness of Context-Moving Transformations for Term Rewriting Systems. - Koichi Sato; Kentaro Kikuchi; Takahito Aoto 001; Yoshihito Toyama (LOPSTR, 2015)

Confluence of Orthogonal Nominal Rewriting Systems Revisited. - Takaki Suzuki; Kentaro Kikuchi; Takahito Aoto 001; Yoshihito Toyama (RTA, 2015)

Ground Confluence Prover based on Rewriting Induction. - Takahito Aoto 001; Yoshihito Toyama (FSCD, 2016)

Normalisation by Random Descent. - Vincent van Oostrom; Yoshihito Toyama (FSCD, 2016)

Critical Pair Analysis in Nominal Rewriting. - Takaki Suzuki; Kentaro Kikuchi; Takahito Aoto 001; Yoshihito Toyama (SCSS, 2016)

Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems. - Kentaro Kikuchi; Takahito Aoto 001; Yoshihito Toyama (FroCoS, 2017)

Improving Rewriting Induction Approach for Proving Ground Confluence. - Takahito Aoto 001; Yoshihito Toyama; Yuta Kimura (FSCD, 2017)

Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems. - Takahito Aoto 001; Yoshihito Toyama (FroCos, 2019)