Ground confluence

  • Richard Göbel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 256)


  1. [DE 85]
    Dershowitz N.: Synthesis by Completion Proc. 9th IJCAI, Los Angeles 1985Google Scholar
  2. [FR 86]
    Fribourg L.: A Strong Restriction of the Inductive Completion Procedure Proc. ICALP 86, 1986Google Scholar
  3. [GO 85]
    Göbel R.: A Specialized Knuth-Bendix Algorithm for Inductive Proofs Proc. Combinatorial Algorithms in Algebraic Structures, Universität Kaiserslautern 1985Google Scholar
  4. [GO 86]
    Göbel R.: Ground Confluence SEKI-Report SR-86-18, Universität Kaiserslautern 1986Google Scholar
  5. [HH 82]
    Huet G., Hullot J.: Proofs by Induction in Equational Theories with Constructors Journal of the Association for Computing Machinery 25(2), p. 239–266, 1982Google Scholar
  6. [HO 80]
    Huet, G:, Oppen D.: Equations and Rewrite Rules: A Survey Technical Report CSL-111, SRI International 1980Google Scholar
  7. [HU 77]
    Huet, G.: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems 18th IEEE Symposium on foundations of Computer Science, p. 30–45, 1977Google Scholar
  8. [JK 85]
    Jouannaud J.-P., Kounalis E.: Proofs by Induction in Equational Theories without Constructors CRIN, University de Nancy, Nancy 1985Google Scholar
  9. [KB 70]
    Knuth D., Bendix P.: Simple Word Problems in Universal Algebras Computational Problems in Abstract Algebra, Ed. Leech I., Pergamon Press, p. 263–297, 1970Google Scholar
  10. [KN 87]
    Kapur D.,Narendran P., Otto F.: On ground confluence of term rewriting systems submitted for publication, 1987Google Scholar
  11. [KM 83]
    Kapur D., Musser D. R.: Proofs by Consistency Proc. of an NSF Workshop on the Rewrite Rule Laboratory Sept. 83 General Electric R & D Center Report GEN84008, Schenectady 1984Google Scholar
  12. [KO 85]
    Kounalis E.: Completeness in Data Type Specifications Proc. EUROCAL 85, Springer Lecture Notes, Linz 1985Google Scholar
  13. [KU 85]
    Künchlin W.: A Confluence Criterion Based on the Generalised Newman Lemma Proc. EUROCAL 85, Springer Lecture Notes, Linz 1985Google Scholar
  14. [MU 80]
    Musser D.: On Proving Inductive Properties of Abstract Data Types 7th Annual ACM Symposium on Principles of Programming Languages, Las Vegas 1980Google Scholar
  15. [WB 83]
    Winkler F., Buchberger B.: A Crterion for Eliminating Unnecessary Reductions in the Knuth-Bendix Algorithm Colloqium on Algebra, Combinatorics and Logic in Computer Science, Györ (Hungary) 1983Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Richard Göbel
    • 1
  1. 1.Fachbereich Informatik, Universität KaiserslauternKaiserslautern

Personalised recommendations