A Partial List of References
Dershowitz, N., “Termination,” Proc. of the First Intl. Conf. on Rewriting Techniques and Applications, Dijon, France, May 1985, LNCS 202, Springer Verlag, pp. 180–224.
Kapur, D., and Sivakumar, G., “Architecture of and Experiments with RRL, a Rewrite Rule Laboratory,” Proc. of a NSF Workshop on the Rewrite Rule Laboratory, Sept. 6–9, 1983, General Electric CRD Report 84GEN004, April 1984, pp.33–56.
Kapur, D., and Narendran, P., “An Equational Approach to Theorem Proving in First-order Predicate Calculus,” Proc. of the 9th IJCAI, Los Angeles, August 1985, pp. 1146–1153.
Kapur, D., Narendran, P., and Zhang, H., “Proof by Induction using Test Sets,” to appear in the Proc. of 8th Intl. Conf. on Automated Deduction (CADE-8), Oxford, England, July 1986.
Kapur, D., and Zhang, H., RRL: A Rewrite Rule Laboratory — User's Manual. Unpublished Manuscript, General Electric Corporate Research and Development, Schenectady, NY, March 1986.
Knuth, D.E., and Bendix, P.B., “Simple Word Problems in Universal Algebras,” Computational Problems in Abstract Algebras (ed. Leech), Pergamon Press, 1970, pp. 263–297.
Musser, D.R., “Proving Inductive Properties of Abstract Data Types,” Proc. of 7th ACM Symposium on Principles of Programming Languages, Las Vegas, Nevada, Jan. 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kapur, D., Sivakumar, G., Zhang, H. (1986). RRL: A rewrite rule laboratory. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_140
Download citation
DOI: https://doi.org/10.1007/3-540-16780-3_140
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16780-8
Online ISBN: 978-3-540-39861-5
eBook Packages: Springer Book Archive