Simplification orders for term graph rewriting

This publication has 14 references indexed in Scilit:

• On the adequacy of graph rewriting for simulating term rewriting
  ACM Transactions on Programming Languages and Systems, 1994
• Simple termination revisited
  Published by Springer Nature ,1994
• Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
  Theoretical Computer Science, 1993
• Collapsed tree rewriting: Completeness, confluence, and modularity
  Published by Springer Nature ,1993
• Implementing term rewriting by jungle evaluation
  RAIRO - Theoretical Informatics and Applications, 1991
• Rewrite Systems
  Published by Elsevier ,1990
• Termination of rewriting
  Journal of Symbolic Computation, 1987
• Orderings for term-rewriting systems
  Theoretical Computer Science, 1982
• Proving termination with multiset orderings
  Communications of the ACM, 1979
• On well-quasi-ordering finite trees
  Mathematical Proceedings of the Cambridge Philosophical Society, 1963