论文信息 - Adding Dynamic Paramodulation to Rewrite Algorithms - 字舞流文

Adding Dynamic Paramodulation to Rewrite Algorithms

A practical and effective solution to a problem resulting from the existence of critical pairs in a set of rewrite rules is presented.

Jean-Pierre H. Laurent | Paul Y. Gloess

[1] Gerard Huet,et al. Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[2] H. Brown,et al. Computational Problems in Abstract Algebra , 1971 .

[3] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .

[4] Paul Y Gloess. A Proof of the Correctness of a Simple Parser of Expressions by the Boyer-Moore System. , 1978 .

[5] Robert S. Boyer,et al. A Theorem-Prover for Recursive Functions: A User's Manual. , 1979 .