Yoshihito Toyama

50 papers A* 1A 1B 3C 3Journal 17Unranked 23
YearRankTypeTitle / Venue / Authors
2019 — conf
Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems.
FroCos
Takahito Aoto, Yoshihito Toyama
2018 J jnl
Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems.
CoRR
Takahito Aoto, Yoshihito Toyama
2017 B conf
Improving Rewriting Induction Approach for Proving Ground Confluence.
FSCD
Takahito Aoto, Yoshihito Toyama, Yuta Kimura
2017 — conf
Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems.
FroCoS
Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama
2016 — conf
Critical Pair Analysis in Nominal Rewriting.
SCSS
Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama
2016 B conf
Ground Confluence Prover based on Rewriting Induction.
FSCD
Takahito Aoto, Yoshihito Toyama
2016 B conf
Normalisation by Random Descent.
FSCD
Vincent van Oostrom, Yoshihito Toyama
2015 — conf
Confluence of Orthogonal Nominal Rewriting Systems Revisited.
RTA
Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama
2015 C conf
Correctness of Context-Moving Transformations for Term Rewriting Systems.
LOPSTR
Koichi Sato, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama
2014 — conf
Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams.
RTA-TLCA
Takahito Aoto, Yoshihito Toyama, Kazumasa Uchida
2012 J jnl
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
Log. Methods Comput. Sci.
Takahito Aoto, Yoshihito Toyama
2011 — conf
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems.
RTA
Takahito Aoto, Yoshihito Toyama
2010 J jnl
Program Transformation Templates for Tupling Based on Term Rewriting.
IEICE Trans. Inf. Syst.
Yuki Chiba, Takahito Aoto, Yoshihito Toyama
2009 — conf
Proving Confluence of Term Rewriting Systems Automatically.
RTA
Takahito Aoto, Junichi Yoshida, Yoshihito Toyama
2008 J jnl
Automatic Construction of Program Transformation Templates.
Inf. Media Technol.
Yuki Chiba, Takahito Aoto, Yoshihito Toyama
2008 J jnl
Modular Church-Rosser Modulo: The Complete Picture.
Int. J. Softw. Informatics
Jean-Pierre Jouannaud, Yoshihito Toyama
2008 — conf
Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations.
RTA
Yoshihito Toyama
2007 J jnl
Program Transformation by Templates: A Rewriting Framework.
Inf. Media Technol.
Yuki Chiba, Takahito Aoto, Yoshihito Toyama
2006 J jnl
Elimination Transformations for Associative-Commutative Rewriting Systems.
J. Autom. Reason.
Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama
2005 — conf
Confluent Term Rewriting Systems.
RTA
Yoshihito Toyama
2005 — ed.
Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2004, Aachen, Germany, June 2, 2004
WRS
Sergio Antoy, Yoshihito Toyama
2005 C conf
Program transformation by templates based on term rewriting.
PPDP
Yuki Chiba, Takahito Aoto, Yoshihito Toyama
2005 — conf
Reduction Strategies for Left-Linear Term Rewriting Systems.
Processes, Terms and Cycles
Yoshihito Toyama
2004 — conf
Inductive Theorems for Higher-Order Rewriting.
RTA
Takahito Aoto, Toshiyuki Yamada, Yoshihito Toyama
2004 — conf
Preface.
WRS
Sergio Antoy, Yoshihito Toyama
2004 — conf
Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms.
RTA
Yoshihito Toyama
2002 J jnl
Decidability for Left-Linear Growing Term Rewriting Systems.
Inf. Comput.
Takashi Nagaya, Yoshihito Toyama
2000 — conf
New Challenges for Compuational Models.
IFIP TCS
Yoshihito Toyama
1999 C conf
Argument Filtering Transformation.
PPDP
Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama
1999 — conf
Decidability for Left-Linaer Growing Term Rewriting Systems.
RTA
Takashi Nagaya, Yoshihito Toyama
1998 J jnl
Semantics and Strong Sequentiality of Priority Term Rewriting Systems.
Theor. Comput. Sci.
Masahiko Sakai, Yoshihito Toyama
1998 — conf
Termination Transformation by Tree Lifting Ordering.
RTA
Takahito Aoto, Yoshihito Toyama
1998 — ed.
Third Fuji International Symposium on Functional and Logic Programming, FLOPS 1998, Kyoto, Japan, Apil 2-4, 1998.
FLOPS
Masahiko Sato, Yoshihito Toyama
1997 — conf
On Composable Properties of Term Rewriting Systems.
ALP/HOA
Takahito Aoto, Yoshihito Toyama
1997 J jnl
Persistency of Confluence.
J. Univers. Comput. Sci.
Takahito Aoto, Yoshihito Toyama
1996 — conf
Semantics and Strong Sequentiality of Priority Term Rewriting Systems.
RTA
Masahiko Sakai, Yoshihito Toyama
1995 J jnl
Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems.
J. ACM
Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt
1994 — conf
Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems.
CTRS
Yoshihito Toyama, Michio Oyamaguchi
1994 J jnl
Modularity of Confluence: A Simplified Proof.
Inf. Process. Lett.
Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, Roel C. de Vrijer
1993 J jnl
Completeness of Combinations of Constructor Systems.
J. Symb. Comput.
Aart Middeldorp, Yoshihito Toyama
1992 A* conf
Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems
LICS
Yoshihito Toyama
1991 — conf
Completeness of Combinations of Constructor Systems.
RTA
Aart Middeldorp, Yoshihito Toyama
1991 J jnl
How to Prove Equivalence of Term Rewriting Systems Without Induction.
Theor. Comput. Sci.
Yoshihito Toyama
1989 J jnl
Fast Knuth-Bendix Completion with a Term Rewriting System Compiler.
Inf. Process. Lett.
Yoshihito Toyama
1989 — conf
Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-.
RTA
Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt
1987 — conf
Confluent Term Rewriting Systems with Membership Conditions.
CTRS
Yoshihito Toyama
1987 J jnl
Counterexamples to Termination for the Direct Sum of Term Rewriting Systems.
Inf. Process. Lett.
Yoshihito Toyama
1987 J jnl
On the Church-Rosser property for the direct sum of term rewriting systems.
J. ACM
Yoshihito Toyama
1986 A conf
How to Prove Equivalence of Term Rewriting Systems without Induction.
CADE
Yoshihito Toyama
1984 — conf
On Equivalence Transformations for Term Rewriting Systems.
RIMS Symposia on Software Science and Engineering
Yoshihito Toyama