The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yoshihito Toyama: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Takahito Aoto, Yoshihito Toyama
    On Composable Properties of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    ALP/HOA, 1997, pp:114-128 [Conf]
  2. Yoshihito Toyama
    Reduction Strategies for Left-Linear Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Processes, Terms and Cycles, 2005, pp:198-223 [Conf]
  3. Yoshihito Toyama
    How to Prove Equivalence of Term Rewriting Systems without Induction. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:118-127 [Conf]
  4. Yoshihito Toyama
    Confluent Term Rewriting Systems with Membership Conditions. [Citation Graph (0, 0)][DBLP]
    CTRS, 1987, pp:228-241 [Conf]
  5. Yoshihito Toyama, Michio Oyamaguchi
    Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1994, pp:316-331 [Conf]
  6. Yoshihito Toyama
    New Challenges for Compuational Models. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:612-613 [Conf]
  7. Yoshihito Toyama
    Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:274-284 [Conf]
  8. Yuki Chiba, Takahito Aoto, Yoshihito Toyama
    Program transformation by templates based on term rewriting. [Citation Graph (0, 0)][DBLP]
    PPDP, 2005, pp:59-69 [Conf]
  9. Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama
    Argument Filtering Transformation. [Citation Graph (0, 0)][DBLP]
    PPDP, 1999, pp:47-61 [Conf]
  10. Yoshihito Toyama
    On Equivalence Transformations for Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RIMS Symposia on Software Science and Engineering, 1984, pp:44-61 [Conf]
  11. Takahito Aoto, Yoshihito Toyama
    Termination Transformation by Tree Lifting Ordering. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:256-270 [Conf]
  12. Takahito Aoto, Toshiyuki Yamada, Yoshihito Toyama
    Inductive Theorems for Higher-Order Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:269-284 [Conf]
  13. Aart Middeldorp, Yoshihito Toyama
    Completeness of Combinations of Constructor Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:188-199 [Conf]
  14. Takashi Nagaya, Yoshihito Toyama
    Decidability for Left-Linaer Growing Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1999, pp:256-270 [Conf]
  15. Masahiko Sakai, Yoshihito Toyama
    Semantics and Strong Sequentiality of Priority Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:377-391 [Conf]
  16. Yoshihito Toyama
    Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:40-54 [Conf]
  17. Yoshihito Toyama
    Confluent Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:1- [Conf]
  18. Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt
    Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-. [Citation Graph (0, 0)][DBLP]
    RTA, 1989, pp:477-491 [Conf]
  19. Sergio Antoy, Yoshihito Toyama
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:124, n:2, pp:1-2 [Journal]
  20. Takashi Nagaya, Yoshihito Toyama
    Decidability for Left-Linear Growing Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:2, pp:499-514 [Journal]
  21. Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, Roel C. de Vrijer
    Modularity of Confluence: A Simplified Proof. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:2, pp:101-109 [Journal]
  22. Yoshihito Toyama
    Counterexamples to Termination for the Direct Sum of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:3, pp:141-143 [Journal]
  23. Yoshihito Toyama
    Fast Knuth-Bendix Completion with a Term Rewriting System Compiler. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:6, pp:325-328 [Journal]
  24. Yoshihito Toyama
    On the Church-Rosser property for the direct sum of term rewriting systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:1, pp:128-143 [Journal]
  25. Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt
    Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:6, pp:1275-1304 [Journal]
  26. Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama
    Elimination Transformations for Associative-Commutative Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2006, v:37, n:3, pp:205-229 [Journal]
  27. Aart Middeldorp, Yoshihito Toyama
    Completeness of Combinations of Constructor Systems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1993, v:15, n:3, pp:331-348 [Journal]
  28. Takahito Aoto, Yoshihito Toyama
    Persistency of Confluence. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1997, v:3, n:11, pp:1134-1147 [Journal]
  29. Masahiko Sakai, Yoshihito Toyama
    Semantics and Strong Sequentiality of Priority Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:208, n:1-2, pp:87-110 [Journal]
  30. Yoshihito Toyama
    How to Prove Equivalence of Term Rewriting Systems Without Induction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:90, n:2, pp:369-390 [Journal]

  31. Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations. [Citation Graph (, )][DBLP]


  32. Proving Confluence of Term Rewriting Systems Automatically. [Citation Graph (, )][DBLP]


Search in 0.089secs, Finished in 0.091secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002