Abstract:
Abstract. We investigate modular properties of term rewriting systems, the basic operational formalism for equational specifications. First we study sufficient conditions for the preservation of the termination property under disjoint (and more general) combinations of term rewriting systems. By means of a refined analysis of existing approaches we show how to prove several new asymmetric preservation results. For this purpose we introduce two interesting new properties of term rewriting systems related to collapsing reductions: uniquely collapsing and collapsing confluent. We discuss these properties w.r.t. well-known confluence, consistency and normal form properties, and show that they are modular for left-linear systems, but not in general. 1
Citations
|
722
|
Rewrite systems
– Dershowitz, Jouannaud
- 1990
|
|
579
|
Term rewriting systems
– Klop
- 1992
|
|
91
|
Natural termination
– Dershowitz, Hoot
- 1995
|
|
87
|
Termination of term rewriting: interpretation and type elimination
– Zantema
- 1994
|
|
75
|
Counterexamples to termination for the direct sum of term rewriting systems
– Toyama
- 1987
|
|
68
|
On the Church–Rosser property for the direct sum of term rewriting systems
– Toyama
- 1987
|
|
59
|
Modular Properties of Term Rewriting Systems
– Middeldorp
- 1990
|
|
57
|
Commutation, transformation, and ter-mination
– Bachmair, Dershowitz
- 1986
|
|
50
|
Generalized Sufficient Conditions for Modular Termination of Rewriting
– Gramlich
- 1994
|
|
45
|
Abstract relations between restricted termination and confluence properties of rewrite systems
– Gramlich
- 1995
|
|
44
|
Modular properties of composable term rewriting systems
– Ohlebusch
- 1995
|
|
33
|
Completeness of combinations of constructor systems
– Middeldorp, Toyama
- 1991
|
|
31
|
On the modularity of termination of term rewriting systems
– Ohlebusch
- 1994
|
|
28
|
Termination and Confluence Properties of Structured Rewrite Systems
– Gramlich
- 1996
|
|
27
|
Modular termination of term rewriting systems revisited
– Fern'andez, Jouannaud
- 1995
|
|
26
|
Unification in a combination of arbitrary disjoint equational theories
– Schmidt-Schau
- 1989
|
|
24
|
Termination for direct sums of left-linear complete term rewriting systems
– Toyama, Klop, et al.
- 1995
|
|
23
|
Modular proofs for completeness of hierarchical term rewriting systems
– Rao
- 1995
|
|
16
|
Transforming termination by selflabelling
– Middeldorp, Ohsaki, et al.
- 1996
|
|
14
|
Modularity of completeness revisited
– Marchiori
- 1995
|
|
13
|
Informatik-Fachberichte 210
– Termersetzungssysteme
- 1989
|
|
12
|
Modular termination of r-consistent and left-linear term rewriting systems
– Schmidt-Schau, Marchiori, et al.
- 1995
|
|
9
|
Vrijer. Modularity of confluence: A simplified proof
– Klop, Middeldorp, et al.
- 1994
|
|
4
|
Modularity of UN ! for left-linear term rewriting systems
– Marchiori
- 1994
|
|
3
|
Innocuous constructor-sharing combinations
– Dershowitz
- 1997
|
