Schematization of infinite sets of rewrite rules generated by divergent completion processes

This publication has 11 references indexed in Scilit:

• About the descriptive power of certain classes of finite string-rewriting systems
  Theoretical Computer Science, 1989
• Termination of rewriting systems by polynomial interpretations and its implementation
  Science of Computer Programming, 1987
• Rewriting systems on FP expressions to reduce the number of sequences yielded
  Science of Computer Programming, 1986
• Completion of a Set of Rules Modulo a Set of Equations
  SIAM Journal on Computing, 1986
• Complete sets of unifiers and matchers in equational theories
  Theoretical Computer Science, 1986
• A finite thue system with decidable word problem and without equivalent finite canonical system
  Theoretical Computer Science, 1985
• On understanding types, data abstraction, and polymorphism
  ACM Computing Surveys, 1985
• Orderings for term-rewriting systems
  Theoretical Computer Science, 1982
• Programming with Equations
  ACM Transactions on Programming Languages and Systems, 1982
• A complete proof of correctness of the Knuth-Bendix completion algorithm
  Journal of Computer and System Sciences, 1981