Blog
About

6
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      A complete proof of correctness of the Knuth-Bendix completion algorithm

      Journal of Computer and System Sciences

      Elsevier BV

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references 2

          • Record: found
          • Abstract: not found
          • Article: not found

          Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

           Gérard Huet (1980)
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Complete Sets of Reductions for Some Equational Theories

              Bookmark

              Author and article information

              Journal
              Journal of Computer and System Sciences
              Journal of Computer and System Sciences
              Elsevier BV
              00220000
              August 1981
              August 1981
              : 23
              : 1
              : 11-21
              Article
              10.1016/0022-0000(81)90002-7
              © 1981

              Comments

              Comment on this article