Termination of rewrite systems by elementary interpretations

This publication has 8 references indexed in Scilit:

• Canonical Equational Proofs
  Published by Springer Nature ,1991
• Termination by completion
  Applicable Algebra in Engineering, Communication and Computing, 1990
• A new method for proving termination of AC-rewrite systems
  Published by Springer Nature ,1990
• Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243.
  Published by Elsevier ,1989
• Completion procedures as transition rules + control
  Published by Springer Nature ,1989
• Termination of rewriting systems by polynomial interpretations and its implementation
  Science of Computer Programming, 1987
• Termination orderings for associative-commutative rewriting systems
  Journal of Symbolic Computation, 1985
• Computer experiments with the REVE term rewriting system generator
  Published by Association for Computing Machinery (ACM) ,1983