dblp.uni-trier.dewww.uni-trier.de

Yoshihito Toyama Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Sergio Antoy [26]
2Takahito Aoto [16] [17] [19] [25] [29] [32]
3Hendrik Pieter Barendregt (Henk Barendregt) [7] [14]
4Yuki Chiba [29]
5Jan Willem Klop [7] [12] [14]
6Keiichirou Kusakari [21] [30]
7Aart Middeldorp [9] [11] [12]
8Takashi Nagaya [20] [23]
9Masaki Nakamura [21] [30]
10Michio Oyamaguchi [13]
11Masahiko Sakai [15] [18]
12Roel C. de Vrijer [12]
13Toshiyuki Yamada [25]
14Junichi Yoshida [32]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)