论文信息 - Contextual Rewriting - 字舞流文

Contextual Rewriting

Hantao Zhang | Jean-Luc Rémy | Hantao Zhang | J. Rémy

[1] David R. Musser,et al. On proving inductive properties of abstract data types , 1980, POPL '80.

[2] Joseph A. Goguen,et al. How to Prove Algebraic Inductive Hypotheses Without Induction , 1980, CADE.

[3] Pierre Lescanne,et al. Computer experiments with the REVE term rewriting system generator , 1983, POPL '83.

[4] Jieh Hsiang,et al. Refutational Theorem Proving Using Term-Rewriting Systems , 1985, Artif. Intell..

[5] Donald E. Knuth,et al. Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[6] Stéphane Kaplan. Fair Conditional Term Rewriting Systems: Unification, Termination, and Confluence , 1984, ADT.

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

[8] Gérard P. Huet,et al. A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..

[9] K. Mani Chandy,et al. Current trends in programming methodology , 1977 .