default search action
Yoshihito Toyama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c31]Takahito Aoto, Yoshihito Toyama:
Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems. FroCos 2019: 330-347 - 2018
- [i1]Takahito Aoto, Yoshihito Toyama:
Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems. CoRR abs/1807.00940 (2018) - 2017
- [c30]Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems. FroCoS 2017: 115-131 - [c29]Takahito Aoto, Yoshihito Toyama, Yuta Kimura:
Improving Rewriting Induction Approach for Proving Ground Confluence. FSCD 2017: 7:1-7:18 - 2016
- [c28]Vincent van Oostrom
, Yoshihito Toyama:
Normalisation by Random Descent. FSCD 2016: 32:1-32:18 - [c27]Takahito Aoto, Yoshihito Toyama:
Ground Confluence Prover based on Rewriting Induction. FSCD 2016: 33:1-33:12 - [c26]Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Critical Pair Analysis in Nominal Rewriting. SCSS 2016: 156-168 - 2015
- [c25]Koichi Sato, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Correctness of Context-Moving Transformations for Term Rewriting Systems. LOPSTR 2015: 331-345 - [c24]Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Confluence of Orthogonal Nominal Rewriting Systems Revisited. RTA 2015: 301-317 - 2014
- [c23]Takahito Aoto, Yoshihito Toyama, Kazumasa Uchida:
Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams. RTA-TLCA 2014: 46-60 - 2012
- [j16]Takahito Aoto, Yoshihito Toyama:
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems. Log. Methods Comput. Sci. 8(1) (2012) - 2011
- [c22]Takahito Aoto, Yoshihito Toyama:
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems. RTA 2011: 91-106 - 2010
- [j15]Yuki Chiba, Takahito Aoto, Yoshihito Toyama:
Program Transformation Templates for Tupling Based on Term Rewriting. IEICE Trans. Inf. Syst. 93-D(5): 963-973 (2010)
2000 – 2009
- 2009
- [c21]Takahito Aoto, Junichi Yoshida, Yoshihito Toyama:
Proving Confluence of Term Rewriting Systems Automatically. RTA 2009: 93-102 - 2008
- [j14]Jean-Pierre Jouannaud, Yoshihito Toyama:
Modular Church-Rosser Modulo: The Complete Picture. Int. J. Softw. Informatics 2(1): 61-75 (2008) - [j13]Yuki Chiba, Takahito Aoto, Yoshihito Toyama:
Automatic Construction of Program Transformation Templates. Inf. Media Technol. 3(2): 211-224 (2008) - [c20]Yoshihito Toyama:
Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations. RTA 2008: 381-391 - 2007
- [j12]Yuki Chiba, Takahito Aoto, Yoshihito Toyama:
Program Transformation by Templates: A Rewriting Framework. Inf. Media Technol. 2(1): 53-67 (2007) - 2006
- [j11]Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama:
Elimination Transformations for Associative-Commutative Rewriting Systems. J. Autom. Reason. 37(3): 205-229 (2006) - 2005
- [c19]Yoshihito Toyama:
Reduction Strategies for Left-Linear Term Rewriting Systems. Processes, Terms and Cycles 2005: 198-223 - [c18]Yuki Chiba, Takahito Aoto, Yoshihito Toyama:
Program transformation by templates based on term rewriting. PPDP 2005: 59-69 - [c17]Yoshihito Toyama:
Confluent Term Rewriting Systems. RTA 2005: 1 - [e2]Sergio Antoy, Yoshihito Toyama:
Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2004, Aachen, Germany, June 2, 2004. Electronic Notes in Theoretical Computer Science 124(2), Elsevier 2005 [contents] - 2004
- [c16]Yoshihito Toyama:
Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms. RTA 2004: 40-54 - [c15]Takahito Aoto, Toshiyuki Yamada, Yoshihito Toyama:
Inductive Theorems for Higher-Order Rewriting. RTA 2004: 269-284 - [c14]Sergio Antoy, Yoshihito Toyama:
Preface. WRS 2004: 1-2 - 2002
- [j10]Takashi Nagaya, Yoshihito Toyama:
Decidability for Left-Linear Growing Term Rewriting Systems. Inf. Comput. 178(2): 499-514 (2002) - 2000
- [c13]Yoshihito Toyama:
New Challenges for Compuational Models. IFIP TCS 2000: 612-613
1990 – 1999
- 1999
- [c12]Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama:
Argument Filtering Transformation. PPDP 1999: 47-61 - [c11]Takashi Nagaya, Yoshihito Toyama:
Decidability for Left-Linaer Growing Term Rewriting Systems. RTA 1999: 256-270 - 1998
- [j9]Masahiko Sakai
Semantics and Strong Sequentiality of Priority Term Rewriting Systems. Theor. Comput. Sci. 208(1-2): 87-110 (1998) - [c10]Takahito Aoto, Yoshihito Toyama:
Termination Transformation by Tree Lifting Ordering. RTA 1998: 256-270 - [e1]Masahiko Sato, Yoshihito Toyama:
Third Fuji International Symposium on Functional and Logic Programming, FLOPS 1998, Kyoto, Japan, Apil 2-4, 1998. World Scientific, Singapore 1998, ISBN 981-02-3384-1 [contents] - 1997
- [j8]Takahito Aoto, Yoshihito Toyama:
Persistency of Confluence. J. Univers. Comput. Sci. 3(11): 1134-1147 (1997) - [c9]Takahito Aoto, Yoshihito Toyama:
On Composable Properties of Term Rewriting Systems. ALP/HOA 1997: 114-128 - 1996
- [c8]Masahiko Sakai
Semantics and Strong Sequentiality of Priority Term Rewriting Systems. RTA 1996: 377-391 - 1995
- [j7]Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt:
Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems. J. ACM 42(6): 1275-1304 (1995) - 1994
- [j6]Jan Willem Klop, Aart Middeldorp
Modularity of Confluence: A Simplified Proof. Inf. Process. Lett. 49(2): 101-109 (1994) - [c7]Yoshihito Toyama, Michio Oyamaguchi:
Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems. CTRS 1994: 316-331 - 1993
- [j5]Aart Middeldorp
Completeness of Combinations of Constructor Systems. J. Symb. Comput. 15(3): 331-348 (1993) - 1992
- [c6]Yoshihito Toyama:
Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems. LICS 1992: 274-284 - 1991
- [j4]Yoshihito Toyama:
How to Prove Equivalence of Term Rewriting Systems Without Induction. Theor. Comput. Sci. 90(2): 369-390 (1991) - [c5]Aart Middeldorp
Completeness of Combinations of Constructor Systems. RTA 1991: 188-199
1980 – 1989
- 1989
- [j3]Yoshihito Toyama:
Fast Knuth-Bendix Completion with a Term Rewriting System Compiler. Inf. Process. Lett. 32(6): 325-328 (1989) - [c4]Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt:
Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-. RTA 1989: 477-491 - 1987
- [j2]Yoshihito Toyama:
Counterexamples to Termination for the Direct Sum of Term Rewriting Systems. Inf. Process. Lett. 25(3): 141-143 (1987) - [j1]Yoshihito Toyama:
On the Church-Rosser property for the direct sum of term rewriting systems. J. ACM 34(1): 128-143 (1987) - [c3]Yoshihito Toyama:
Confluent Term Rewriting Systems with Membership Conditions. CTRS 1987: 228-241 - 1986
- [c2]Yoshihito Toyama:
How to Prove Equivalence of Term Rewriting Systems without Induction. CADE 1986: 118-127 - 1984
- [c1]Yoshihito Toyama:
On Equivalence Transformations for Term Rewriting Systems. RIMS Symposia on Software Science and Engineering 1984: 44-61
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-29 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: