A New Method for Proving Termination of AC-Rewrite Systems
暂无分享,去创建一个
[1] Mark E. Stickel,et al. Complete Sets of Reductions for Some Equational Theories , 1981, JACM.
[2] Nachum Dershowitz,et al. Termination of Rewriting , 1987, J. Symb. Comput..
[3] Paliath Narendran,et al. A Path Ordering for Proving Termination of Term Rewriting Systems , 1985, TAPSOFT, Vol.1.
[4] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .
[5] Deepak Kapur,et al. RRL: A Rewrite Rule Laboratory , 1986, CADE.
[6] Isabelle Gnaedig,et al. Proving Termination of Associative Commutative Rewriting Systems by Rewriting , 1986, CADE.
[7] Joachim Steinbach,et al. Extensions and Comparison of Simplification Orderings , 1989, RTA.
[8] Joachim Steinbach,et al. Improving Assoviative Path Orderings , 1990, CADE.
[9] J. Hullot. A Catalogue of Canonical Term Rewriting Systems. , 1980 .
[10] LEO BACHMAIR,et al. Termination Orderings for Associative-Commutative Rewriting Systems , 1985, J. Symb. Comput..
[11] 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 .
[12] Pierre Lescanne,et al. Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation , 1987, Sci. Comput. Program..
[13] Jean-Pierre Jouannaud,et al. Recursive Decomposition Ordering , 1982, Formal Description of Programming Concepts.