Skip to main content
SpringerLink
Log in

TRSPEC: A term rewriting based system for algebraic specifications

  • Part 2 System Presentations
  • Conference paper
  • First Online:
Conditional Term Rewriting Systems (CTRS 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 308))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adler, C.: Vervollständigung von Termersetzungsystemen modulo einer gleichungsdefinierten Theorie, Diplomarbeit, FB Informatik, Universität Kaiserslautern, 1987

    Google Scholar 

  2. Avenhaus, J., Benninghofen, B., Göbel, R., Madlener, K.: TRSPEC: A Term Rewriting Based System for Algebraic Specifications, Proc. 8th CADE, Oxford, England, 1986

    Google Scholar 

  3. Cherifa, A.B., Lescanne, P.: An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations, 8th CADE, Oxford, England, 1986

    Google Scholar 

  4. Fribourg, L.: A strong restriction of the inductive completion procedure, Proc. 13th ICALP, Rennes, France, 1986

    Google Scholar 

  5. Ganzinger, H.: Ground term confluence in parametric conditional equational specifications, Proc. STACS '87, Passau, West Germany, 1987

    Google Scholar 

  6. Gnaedig, I., Lescanne, P.: Proving termination of associative commutative rewriting systems by rewriting, Proc. 8th CADE, Oxford, England, 1986

    Google Scholar 

  7. Göbel, R.: A Completion Procedure for Globally Finite Term Rewriting Systems, Proceedings of a NSF Workshop on the Rewrite Rule Laboratory, General Electric, Schenectady, USA, 1983

    Google Scholar 

  8. Göbel, R.: Rewrite Rules with Conditions for Algebraic Specifications, Proc. of 2nd Workshop on Theory and Applications of Abstract Data Types (Abstract), Passau, West Germany, 1983

    Google Scholar 

  9. Göbel, R.: Completion of Globally Finite TRSs for Inductive Proofs, Proc.of GWAI 85, Springer Lecture Notes, 1985

    Google Scholar 

  10. Göbel, R.: A Specialized Knuth-Bendix Algorithm for Inductive Proofs, Proc. Combinatorial Algorithms in Algebraic Structures, Universität Kaiserslautern, 1985

    Google Scholar 

  11. Göbel, R.: Ground Confluence, Proc. 2nd Int. Conf. on Rewriting Techniques and Applications, Springer LNCS, Bordeaux, France, 1987

    Google Scholar 

  12. Göbel, R.: Completion Methods for Obtaining Ground Confluent Rule Systems and their Applications for Inductive Proofs, Dissertation, FB Informatik, Universität Kaiserslautern, 1987

    Google Scholar 

  13. Huet, G., Hullot, J.: Proofs by Induction in Equational Theories with Constructors, JACM 25(2), 1982

    Google Scholar 

  14. Jouannaud, J.P., Kirchner, H.: Completion of a Set of Rules Modulo a Set of Equations, 11th Symp. on Principles of Programming Languages, Salt Lake City, Utah, USA, 1984

    Google Scholar 

  15. Kaplan, S.: Conditional Rewrite Rules, Theoretical Computer Science 33, pp. 175–193, 1984

    Article  Google Scholar 

  16. Küchlin, W.: Inductive Completion by Ground Proof Transformation, Tech. Rep. 87-08, Dept. of Computer and Information Sciences, Univ. of Delaware, 1987

    Google Scholar 

  17. Musser, D.R.: Proving inductive properties of abstract data types, Proc. of 7th POPL, Las Vegas, Nevada, 1980

    Google Scholar 

  18. Müller, J., Wagner, E.: Effiziente Reduktionsstrategien in Termersetzungssytemen, GWAI 86, Springer IFB 124, 1986

    Google Scholar 

  19. Müller, J.: THEOPOGLES: A Theorem Prover for First Order Logic Based on Rewriting Techniques, Proc. GWAI 87, to appear

    Google Scholar 

  20. Rémy, J.L.: Etude des Systèmes de Réécriture Conditionnelle et des Applications aux Types Abstraits, Thèse de 3ème cycle, France, 1982

    Google Scholar 

  21. Sattler-Klein, A.: Ein benutzerfreundliches Testsystem für Reduktionsstrategien auf Wörtern, Projektarbeit, FB Informatik, Universität Kaiserslautern, 1985

    Google Scholar 

  22. Sattler-Klein, A.: Minimierung der kritischen Paare imVervollständigungssystem COSY, Diplomarbeit, FB Informatik, Universität Kaiserslautern, 1987

    Google Scholar 

  23. Steinbach, J.: Ordnungen für Termersetzungssysteme, Diplomarbeit, FB Informatik, Universität Kaiserslautern, 1986

    Google Scholar 

  24. Wagner, E.: Strategien für den Knuth-Bendix Algorithmus, Diplomarbeit, FB Informatik, Universität Kaiserslautern, 1986

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Kaiserslautern, 6750, Kaiserslautern, West Germany

    J. Avenhaus, R. Göbel, B. Gramlich, K. Madlener & J. Steinbach

Authors
  1. J. Avenhaus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Göbel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. Gramlich
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. K. Madlener
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. J. Steinbach
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Kaplan J. -P. Jouannaud

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Avenhaus, J., Göbel, R., Gramlich, B., Madlener, K., Steinbach, J. (1988). TRSPEC: A term rewriting based system for algebraic specifications. In: Kaplan, S., Jouannaud, J.P. (eds) Conditional Term Rewriting Systems. CTRS 1987. Lecture Notes in Computer Science, vol 308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19242-5_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-19242-5_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19242-8

  • Online ISBN: 978-3-540-39166-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation