Advertisement

Trspec: A term rewriting based system for algebraic specifications

  • J. Avenhaus
  • B. Benninghofen
  • R. Göbel
  • K. Madlener
Extended Abstracts Of Current Deduction Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 230)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [A 84]
    Avenhaus, J.: On the Termination of the Knuth-Bendix Completion Algorithm. Int. Report 120/84, Universität Kaiserslautern, 1984.Google Scholar
  2. [A 86]
    Avenhaus, J.: On the Descriptive Power of Term Rewriting Systems. To appear in J. Symb. Comp. 2, 1986.Google Scholar
  3. [GO 83a]
    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.Google Scholar
  4. [GO 83b]
    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.Google Scholar
  5. [GO 85a]
    Göbel, R.: Completion of Globally Finite TRS for Inductive Proofs. Proc. GWAI 85, Springer Lecture Notes, 1985.Google Scholar
  6. [GO 85b]
    Göbel, R.: A Specialized Knuth-Bendix Algorithm for Inductive Proofs. Proc. Combinatorial Algorithms in Algebraic Structures, Universität Kaiserslautern, 1985.Google Scholar
  7. [HH 82]
    Huet, G., Hullot, J.: Proofs by Induction in Equational Theories with Constructors. JACM 25(2), pp. 239–266, 1982.Google Scholar
  8. [MU 80]
    Musser, D.: On Proving Inductive Properties of Abstract Data Types. 7th Annual ACM Symp. POPL, Las Vegas, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • J. Avenhaus
    • 1
  • B. Benninghofen
    • 1
  • R. Göbel
    • 1
  • K. Madlener
    • 1
  1. 1.Fachbereich InformatikUniversität KaiserstauternKaiserslauternWest-Germany

Personalised recommendations