A simplified proof of Toyama's theorem
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."
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1991
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,56 |
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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." |
|---|---|
| Beschreibung: | 9 S. |