Confluence without termination via parallel critical pairs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1059, Issue , 1996, Pages 211-225

  Gramlich, Bernhard ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

JOINABILITY; LINEAR TERMS;

FORESTRY;

EID: 84947943078     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61064-2_39     Document Type: Conference Paper

References (15)

1. F. Bander and J. Siekmann. Unification theory. In D. Gabbay, C. Hogger, and J. Robinson, eds., Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 2 of Handbooks of Logic in Computer Science and of Logic in Artificial Intelligence and Logic Programming, pp. 41-126. Clarendon Press, Oxford, 1994.
2. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, ed., Formal models and semantics, Handbook of Theoretical Computer Science, vol. B, ch. 6, pp. 243-320. Elsevier - The MIT Press, 1990.
3. G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797-821, Oct 1980.
4. J.-P. Jouannaud, H. IKirchner, and J.-L. R6my. Church-Rosser properties of weakly terminating term rewriting systems. In Proc. 8th IJCAI, vol. 2, pp. 909-915, Aug. 1983.
5. J.W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, eds., Handbook of Logic in Computer Science, vol. 2, ch. 1, pp. 2-117. Clarendon Press, Oxford, 1992.
6. D. E. Knuth and P. Bendix. Simple word problems in universal algebra. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263-297. Pergamon Press, Oxford, U. K., 1970. Reprinted 1983 in "Automation of Reasoning 2", Springer-Verlag, Berlin, pp. 342-376.
7. R. Mayr and T. Nipkow. Higher-order rewrite systems and their confluence. Technical Report TUM-I9433, TU Mfinchen, Aug. 1994.
8. V. Oostrom. Confluence by decreasing diagrams. Theoretical Computer Science, 121:259-280, May 1994.
9. V. Oostrom. Developing developments. Technical Report ISRL-94-4, Basic Research Laboratories, NTT, Japan, Dec. 1994.
10. M. Oyamaguchi and Y. Toyama. On the Church-Rosser property of E-overlapping and simple-right-linear TRS's. Tech. Rep. COMP94-29 (1994-07), IEICE, 1994.
11. P. Padawitz. Correctness, Completeness and Consistency of EquationalData Type Specifications. PhD thesis, FB 20 (Informatik), TU Berlin, 1983. Report No. 83-15.
12. B. Rosen. Tree-manipulating systems and Church-Rosser theorems. Journal of the ACM, 20:160-187, 1973.
13. Y. Toyama. Commutativity of term rewriting systems. In K. Fuchi and L. Kott, eds., Programming of Future Generation Computer, vol. 2, pp. 393-407. North- Holland, 1988.
14. Y. Toyama. Personal e-mail communication, August 31, 1995.
15. Y Toyama and M. Oyamaguchi. Church-Rosser property and unique normal form property of non-duplicating term rewriting systems. In N. Dershowitz et al., eds., Proc. 4th CTRS (1994), LNCS 968, pp. 316-331. Springer-Verlag, 1995.