Generalized Sufficient Conditions for Modular Termination of Rewriting (1992)

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

Documents Related by Co-Citation

85 Counterexamples to termination for the direct sum of term rewriting systems – Yoshihito Toyama - 1987
565 Term Rewriting Systems – J. W. Klop - 1992
751 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
453 Rewriting – Nachum Dershowitz, David A. Plaisted - 2001
31 Completeness of Combinations of Constructor Systems – Aart Middeldorp, Yoshihito Toyama - 1993
47 Modularity of simple termination of term rewriting systems – Masahito Kurihara, Azuma Ohuchi - 1990
61 Modular Properties of Term Rewriting Systems – Aart Middeldorp - 1990
30 Termination for the direct sum of left-linear term rewriting systems – Y Toyama, J W Klop, H-P Barendregt - 1989
29 On the Modularity of Termination of Term Rewriting Systems – Enno Ohlebusch - 1993
50 On termination of the direct sum of term rewriting systems – Michaël Rusinowitch - 1987
35 A sufficient condition for the termination of the direct sum of term rewriting systems – A Middeldorp - 1989
83 Natural termination – Nachum Dershowitz, Charles Hoot
73 On the Church-Rosser property for the direct sum of term rewriting systems – Yoshihito Toyama - 1987
210 Termination of Term Rewriting Using Dependency Pairs – Thomas Arts, Jürgen Giesl - 2000
16 Simple termination of hierarchical combinations of term rewriting systems – K Rao - 1994
39 Argument Filtering Transformation – Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama - 1999
50 Modular Properties of Composable Term Rewriting Systems – Enno Ohlebusch - 1995
13 Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems – Bernhard Gramlich - 1993
50 Abstract relations between restricted termination and confluence properties of rewrite systems – Bernhard Gramlich - 1995