Simplifying Conditional Term Rewriting Systems: Unification, Termination and Confluence
暂无分享,去创建一个
[1] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .
[2] David R. Musser,et al. On proving inductive properties of abstract data types , 1980, POPL '80.
[3] Nachum Dershowitz,et al. Equational programming , 1988 .
[4] Jan A. Bergstra,et al. On the Power of Algebraic Specifications , 1981, MFCS.
[5] E. Paul. On Solving the Equality Problem in Theories Defined by Horn Clauses , 1986, Theor. Comput. Sci..
[6] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.
[7] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .
[8] Jean-Marie Hullot,et al. Canonical Forms and Unification , 1980, CADE.
[9] Nachum Dershowitz. Orderings for Term-Rewriting Systems , 1979, FOCS.
[10] Jan A. Bergstra,et al. Conditional Rewrite Rules: Confluence and Termination , 1986, J. Comput. Syst. Sci..
[11] Stéphane Kaplan,et al. Conditional Rewrite Rules , 1984, Theor. Comput. Sci..
[12] Claude Kirchner,et al. NARROWER: A New Algorithm for Unification and Its Application to Logic Programming , 1985, RTA.
[13] Michael J. O'Donnell,et al. Computing in systems described by equations , 1977, Lecture Notes in Computer Science.