Generalized Sufficient Conditions for Modular Termination of Rewriting (1992)

by Bernhard Gramlich
Venue:IN ENGINEERING, COMMUNICATION AND COMPUTING
Citations:49 - 7 self

Active Bibliography

9 A structural analysis of modular termination of term rewriting systems – Bernhard Gramlich - 1991
27 Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems – Bernhard Gramlich - 1993
13 Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems – Bernhard Gramlich - 1993
31 Completeness of Combinations of Constructor Systems – Aart Middeldorp, Yoshihito Toyama - 1993
29 On the Modularity of Termination of Term Rewriting Systems – Enno Ohlebusch - 1993
4 Combinations of Simplifying Conditional Term Rewriting Systems – Enno Ohlebusch - 1992
5 On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems – Bernhard Gramlich - 1994
11 On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems – Bernhard Gramlich - 1996
49 Modular Properties of Composable Term Rewriting Systems – Enno Ohlebusch - 1995
3 Modular termination of r-consistent and left-linear term rewriting systems – Manfred Schmidt-schauß, Massimo Marchiori, Sven Eric Panitz - 1995
11 Rewrite Proofs and Computations – Jean-pierre Jouannaud - 1995
4 A Note on Simple Termination of Infinite Term Rewriting Systems – Enno Ohlebusch - 1992
15 Simple Termination of Rewrite Systems – Aart Middeldorp, Hans Zantema - 1997
25 Unravelings and Ultra-properties – Massimo Marchiori - 1996
12 Completeness of Combinations of Conditional Constructor Systems – Aart Middeldorp - 1994
10 Simple Termination Revisited – Aart Middeldorp, Hans Zantema - 1994
1 Proving Termination of Sequential Reduction Relation using Tree Automata – Thomas Genet - 1997
5 Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems – Keiichirou Kusakari - 2000
5 Simple Termination is Difficult – Aart Middeldorp, Bernhard Gramlich - 1993