RRL: A Rewrite Rule Laboratory
暂无分享,去创建一个
The RRL (Rewrite Rule Laboratory) is a theorem proving environment based on equational logic and rewriting techniques. It currently provides facilities for (i) automatically proving theorems in first-order predicate calculus with equality, (ii) generating decision procedures for first-order (equational) theories, (iii) different approaches for proving formulae by induction methods based on the inductionless-induction approach as well as the explicit induction approach, (iv) checking the consistency and completeness of equational specifications, (v) an interpreter for an equational functional language, (vi) solving equations modulo a (equational) theory (a la logic programming) using narrowing methods.
[1] Paliath Narendran,et al. Proof by Induction Using Test Sets , 1986, CADE.
[2] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .
[3] 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 .
[4] David R. Musser,et al. On proving inductive properties of abstract data types , 1980, POPL '80.