Chapter PDF
References
Avenhaus, J.: On the Termination of the Knuth-Bendix Completion Algorithm. Int. Report 120/84, Universität Kaiserslautern, 1984.
Avenhaus, J.: On the Descriptive Power of Term Rewriting Systems. To appear in J. Symb. Comp. 2, 1986.
Göbel, R.: A Completion Procedure for Globally Finite Term Rewriting Systems. Proceedings of an NSF Workshop on the Rewrite Rule Laboratory, General Electric, Schenectady, 1983.
Göbel, R.: Rewrite Rules with Conditions for Algebraic Specificiations. Proc. of 2nd Workshop on Theory and Applications of Abstract Data Types (Abstract), Passau, West-Germany, 1983.
Göbel, R.: Completion of Globally Finite TRS for Inductive Proofs. Proc. GWAI 85, Springer Lecture Notes, 1985.
Göbel, R.: A Specialized Knuth-Bendix Algorithm for Inductive Proofs. Proc. Combinatorial Algorithms in Algebraic Structures, Universität Kaiserslautern, 1985.
Huet, G., Hullot, J.: Proofs by Induction in Equational Theories with Constructors. JACM 25(2), pp. 239–266, 1982.
Musser, D.: On Proving Inductive Properties of Abstract Data Types. 7th Annual ACM Symp. POPL, Las Vegas, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avenhaus, J., Benninghofen, B., Göbel, R., Madlener, K. (1986). Trspec: A term rewriting based system for algebraic specifications. 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_129
Download citation
DOI: https://doi.org/10.1007/3-540-16780-3_129
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