Computer experiments with the REVE term rewriting system generator
暂无分享,去创建一个
[1] T. Evans. On multiplicative systems defined by generators and relations , 1951, Mathematical Proceedings of the Cambridge Philosophical Society.
[2] Gérard Huet,et al. On the Uniform Halting Problem for Term Rewriting Systems , 1978 .
[3] Jean-Pierre Jouannaud,et al. Recursive Decomposition Ordering , 1982, Formal Description of Programming Concepts.
[4] Gérard P. Huet,et al. A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..
[5] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .
[6] Joseph A. Goguen,et al. How to Prove Algebraic Inductive Hypotheses Without Induction , 1980, CADE.
[7] Nachum Dershowitz. Orderings for Term-Rewriting Systems , 1979, FOCS.
[8] David R. Musser,et al. On proving inductive properties of abstract data types , 1980, POPL '80.
[9] Gérard P. Huet,et al. Proofs by induction in equational theories with constructors , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[10] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .
[11] Emil L. Post. Recursive Unsolvability of a problem of Thue , 1947, Journal of Symbolic Logic.