On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems

Theoretical Computer Science

Volumn 165, Issue 1, 1996, Pages 97-131

  Gramlich, Bernhard ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; NUMERICAL ANALYSIS; THEOREM PROVING;

CONDITIONAL TERM REWRITING SYSTEMS; CONFLUENCE PROPERTIES; DISJOINT UNION CARE; INNERMOST TERMINATION; MODULARITY OF TERMINATION; SIGNATURE EXTENSIONS;

PROGRAMMING THEORY;

EID: 0030244718     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)00042-4     Document Type: Article

References (37)

1. J.A. Bergstra and J.W. Klop, Conditional rewrite rules: confluence and termination, J. Comput. System Sci. 32 (1986) 323-362.
2. N. Dershowitz, Hierarchical termination, in: N. Dershowitz and N. Lindenstrauss, eds., Proc. 4th Internat. Workshop on Conditional and Typed Rewriting Systems (CTRS'1994), Jerusalem, Israel, Lecture Notes in Computer Science, Vol. 968 (Springer, Berlin, 1995) 89-105
3. N. Dershowitz and J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen, ed., Formal Models and Semantics, Handbook of Theoretical Computer Science, Vol. B: Formal Methods and Semantics, Ch. 6 (North-Holland, Amsterdam, 1990) 243-320.
4. N. Dershowitz, M. Okada and G. Sivakumar. Confluence of conditional rewrite systems, in: S. Kaplan and J.-P. Jouannaud, eds., Proc. 1st Internat. Workshop on Conditional Term Rewriting Systems (CTRS'87), Lecture Notes in Computer Science, Vol. 308 (Springer, Berlin, 1988) 31-44.
5. N. Dershowitz, M. Okada and G. Sivakumar, Canonical conditional rewrite systems, in: E. Lusk and R. Overbeek, eds., Proc. 9th Internat. Conf. on Automated Deduction (CADE'88), Lecture Notes in Computer Science, Vol. 310 (Springer, Berlin, 1988) 538-549.
6. M. Fernández and J.-P. Jouannaud, Modular termination of term rewriting systems revisited, in: E. Astesiano and G. Reggio and A. Tarlecki, eds., Proc. 10th Workshop on Specification of Abstract Data Types (ADT'94), Santa Margherita de Ligura, Italy, Lecture Notes in Computer Science, Vol. 906 (Springer, Berlin, 1995) 255-272.
7. B. Gramlich, Generalized sufficient conditions for modular termination of rewriting, in: H. Kirchner and G. Levi, eds., Proc. 3rd Internat. Conf. on Algebraic and Logic Programming (ALP'92), Volterra, Italy, Lecture Notes in Computer Science, Vol. 632 (Springer, Berlin, 1992) 53-68, revised and extended version in: Appl. Algebra Engng. Commun. Comput. 5 (1994) 131-158.
8. B. Gramlich, Generalized sufficient conditions for modular termination of rewriting, in: H. Kirchner and G. Levi, eds., Proc. 3rd Internat. Conf. on Algebraic and Logic Programming (ALP'92), Volterra, Italy, Lecture Notes in Computer Science, Vol. 632 (Springer, Berlin, 1992) 53-68, revised and extended version in: Appl. Algebra Engng. Commun. Comput. 5 (1994) 131-158.
9. B. Gramlich, Relating innermost, weak, uniform and modular termination of term rewriting systems, in: A. Voronkov, ed., Proc. Internat. Conf. on Logic Programming and Automated Reasoning (LPAR'92), St. Petersburg, Russia, Lecture Notes in Artificial Intelligence, Vol. 624 (Springer, Berlin, 1992) 285-296 (see also SEKI-Report SR-93-09, FB Informatik, Universität Kaiserslautern); revised version "Abstract relations between restricted termination and confluence properties of rewrite systems" in: Fundam. Inform. 24 (1995) 3-23.
10. B. Gramlich, Relating innermost, weak, uniform and modular termination of term rewriting systems, in: A. Voronkov, ed., Proc. Internat. Conf. on Logic Programming and Automated Reasoning (LPAR'92), St. Petersburg, Russia, Lecture Notes in Artificial Intelligence, Vol. 624 (Springer, Berlin, 1992) 285-296 (see also SEKI-Report SR-93-09, FB Informatik, Universität Kaiserslautern); revised version "Abstract relations between restricted termination and confluence properties of rewrite systems" in: Fundam. Inform. 24 (1995) 3-23.
11. B. Gramlich, Sufficient conditions for modular termination of conditional term rewriting systems, in: M. Rusinowitch and J.-L. Rémy, eds., Proc. 3rd Internat. Workshop on Conditional Term Rewriting Systems (CTRS'92), Pont-à-Mousson, France, Lecture Notes in Computer Science, Vol. 656 (Springer, Berlin, 1993) 228-142.
12. B. Gramlich, On termination and confluence of conditional rewrite systems, in: N. Dershowitz and N. Lindenstrauss, eds., Proc. 4th Internat. Workshop on Conditional and Typed Rewriting Systems (CTRS'94), Jerusalem, Israel, Lecture Notes in Computer Science, Vol. 968 (Springer, Berlin, 1995) 166-185.
13. S. Kaplan, Conditional rewrite rules, Theoret. Comput. Sci. 33 (1984) 175-193.
14. J.W. Klop, Term rewriting systems, in S. Abramsky, D.M. Gabbay and T.S.E. Maibaum, eds., Handbook of Logic in Computer Science, Vol. 2, Ch. 1 (Oxford University Press, Oxford, 1992) 1-117.
15. J.W. Klop, A. Middeldorp, Y. Toyama and R. de Vrijer, Modularity of confluence: A simplified proof, Inform. Process. Lett. 49 (2) (1994) 101-109.
16. M. Kurihara and A. Ohuchi, Modularity of simple termination of term rewriting systems, J. Inform. Process. Soc. Japan 34 (1990) 632-642.
17. M. Kurihara and A. Ohuchi, Modularity of simple termination of term rewriting systems with shared constructors, Theoret. Comput. Sci. 103 (1992) 273-282.
18. M. Kurihara and A. Ohuchi, Termination of combination of composable term rewriting systems, IEICE Trans. Inform. Systems E78-D(4) (1995) 314-320.
19. M.R.K. Krishna Rao., Completeness of hierarchical combinations of term rewriting systems, in: R.K. Shyamasundar, ed., Proc. 13th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'93), Lecture Notes in Computer Science, Vol. 761, (Springer, Berlin, 1993) 125-138.
20. M.R.K. Krishna Rao, Simple termination of hierarchical combinations of term rewriting systems, in: Proc. Internat. Symp. on Theoretical Aspects of Computer Software (TACS'94), Lecture Notes in Computer Science, Vol. 789 (Springer, Berlin, 1994) 203-223.
21. A. Middeldorp, A sufficient condition for the termination of the direct sum of term rewriting systems, in: Proc. 4th IEEE Symp. on Logic in Computer Science (IEEE, Pacific Grove, 1989) 396-401.
22. A. Middeldorp, Modular properties of term rewriting systems, Ph.D. Thesis, Vrije Universiteit, Amsterdam, 1990.
23. A. Middeldorp, Completeness of combinations of conditional constructor systems, in: M. Rusinowitch and J.-L. Rémy, eds., Proc. 3rd Internat. Workshop on Conditional Term Rewriting Systems (CTRS'92), Pont-à-Mousson, France, Lecture Notes in Computer Science, Vol. 656 (Springer, Berlin, 1993) 82-96, revised version in J. Symbol. Comput. 17 (1994) 3-21.
24. A. Middeldorp, Completeness of combinations of conditional constructor systems, in: M. Rusinowitch and J.-L. Rémy, eds., Proc. 3rd Internat. Workshop on Conditional Term Rewriting Systems (CTRS'92), Pont-à-Mousson, France, Lecture Notes in Computer Science, Vol. 656 (Springer, Berlin, 1993) 82-96, revised version in J. Symbol. Comput. 17 (1994) 3-21.
25. A. Middeldorp, Modular properties of conditional term rewriting systems, Inform. Computat. 104 (1) (1993) 110-158.
26. A. Middeldorp and Y. Toyama, Completeness of combinations of constructor systems, in: R.V. Book, ed., Proc. 4th Internat. Conf. on Rewriting Techniques and Applications (RTA'91), Como, Italy, Lecture Notes in Computer Science, Vol. 488 (Springer, Berlin, 1991) 174-187; revised version in: J. Symbol. Comput. 15 (1994) 331-348.
27. A. Middeldorp and Y. Toyama, Completeness of combinations of constructor systems, in: R.V. Book, ed., Proc. 4th Internat. Conf. on Rewriting Techniques and Applications (RTA'91), Como, Italy, Lecture Notes in Computer Science, Vol. 488 (Springer, Berlin, 1991) 174-187; revised version in: J. Symbol. Comput. 15 (1994) 331-348.
28. M.J. O'Donnell, Computing in Systems Described by Equations, Lecture Notes in Computer Science, Vol. 58 (Springer, Berlin, 1977).
29. E. Ohlebusch, On the modularity of termination of term rewriting systems, Theoret. Comput. Sci. 136 (1994) 333-360.
30. E. Ohlebusch, On the modularity of confluence of constructor-sharing term rewriting systems, in: S. Tison, ed., Proc. 19th Coll. on Trees in Algebra and Programming (CAAP'94), Lecture Notes in Computer Science, Vol. 787 (Springer, Berlin, 1994) 261-275.
31. E. Ohlebusch, Modular properties of composable term rewriting systems, Ph.D. Thesis, Universität Bielefeld, 1994.
32. E. Ohlebusch, Modular properties of constructor-sharing conditional term rewriting systems, in: N. Dershowitz and N. Lindenstrauss, eds., Proc. 4th Internat. Workshop on Conditional and Typed Rewriting Systems (CTRS'94), Jerusalem, Israel, Lecture Notes in Computer Science, Vol. 968 (Springer, Berlin, 1995) 296-315.
33. B.K. Rosen, Tree-manipulating systems and Church-Rosser theorems, J. ACM 20 (1973) 160-187.
34. M. Rusinowitch, On termination of the direct sum of term rewriting systems, Inform. Process. Lett. 26 (1987) 65-70.
35. Y. Toyama, On the Church-Rosser property for the direct sum of term rewriting systems, J. ACM 34 (1) (1987) 128-143.
36. Y. Toyama, Counterexamples to termination for the direct sum of term rewriting systems, Inform. Process. Lett. 25 (1987) 141-143.
37. Y. Toyama, J.W. Klop and H.P. Barendregt, Termination for the direct sum of left-linear term rewriting systems, in: N. Dershowitz, ed., Proc. 3rd Internat. Conf. on Rewriting Techniques and Applications (RTA'89), Lecture Notes in Computer Science, Vol. 355 (Springer, Berlin, 1989) 477-491.