Name
Abstract | ||
|---|---|---|
In this note we present a simple proof of a result of Toyama which states that the disjoint union of confluent term rewriting systems is confluent. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0020-0190(94)90034-5 | Inf. Process. Lett. |
Keywords | Field | DocType |
theory of computation,modularity,confluence,term rewriting systems | Discrete mathematics,Computability,Rewriting,Confluence,Disjoint union,Knuth–Bendix completion algorithm,Mathematics,Modularity,Theory of computation | Journal |
Volume | Issue | ISSN |
49 | 2 | 0020-0190 |
Citations | PageRank | References |
20 | 1.06 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan Willem Klop | 1 | 1498 | 161.90 |
| Aart Middeldorp | 2 | 1287 | 86.00 |
| Yoshihito Toyama | 3 | 533 | 49.60 |
| Roel Vrijer | 4 | 61 | 6.20 |