Oyamaguchi, Michio The Church-Rosser property for ground term-rewriting systems is decidable. (English) Zbl 0641.68044 Theor. Comput. Sci. 49, 43-79 (1987). Reviewer: J.Zlatuska MSC: 68Q65 20M05 68Q45 68T15 08A50 20M35 PDFBibTeX XMLCite \textit{M. Oyamaguchi}, Theor. Comput. Sci. 49, 43--79 (1987; Zbl 0641.68044) Full Text: DOI
Benninghofen, B.; Kemmerich, S.; Richter, M. M. [Otto, F.] Systems of reductions. (English) Zbl 0636.68027 Lecture Notes in Computer Science, 277. Berlin etc.: Springer-Verlag. X, 265 p.; DM 40.50 (1987). Reviewer: J.Zlatuska MSC: 68Q65 08A50 20F10 20M35 03D60 68Q25 68Q45 68T15 68-02 03B25 PDFBibTeX XML
Toyama, Yoshihito How to prove equivalence of term rewriting systems without induction. (English) Zbl 0642.68033 Automated deduction, Proc. 8th Int. Conf., Oxford/Engl. 1986, Lect. Notes Comput. Sci. 230, 118-127 (1986). MSC: 68Q65 68T15 08B05 PDFBibTeX XML
Winkler, F.; Buchberger, B. A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm. (English) Zbl 0607.03003 Algebra, combinatorics and logic in computer science, Colloq. Györ/Hung. 1983, Vol. 2, Colloq. Math. Soc. János Bolyai 42, 849-869 (1986). MSC: 03B35 68T15 08B05 PDFBibTeX XML
Jouannaud, Jean-Pierre Confluent and coherent equational term rewriting systems application to proofs in abstract data types. (English) Zbl 0522.68013 Trees in algebra and programming, CAAP ’83, Proc. 8th Colloq., L’Aquila/Italy 1983, Lect. Notes Comput. Sci. 159, 269-283 (1983). MSC: 68Q60 68W30 68P05 68T15 08A50 03F05 PDFBibTeX XML