Skip to main content
SpringerLink
Log in

A survey of rewrite systems

  • Conference paper
  • First Online:
CSL '87 (CSL 1987)

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

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. Avenhaus, Jürgen, On the Termination of the Knuth-Bendix Completion Algorithm Technical Report 120/84, Universität Kaiserslautern, Fachbereich Informatik, 1984.

    Google Scholar 

  2. The Lambda Calculus, Studies in Logic, Vol. 103, North-Holland Publ. Co. 1984.

    Google Scholar 

  3. Bauer, G. Zur Darstellung von Monoiden durch konfluente Regelsysteme. Dissertation, Universität Kaiserslautern, Fachbereich Informatik, 1981.

    Google Scholar 

  4. Bieri, R. Homological Dimension of Discrete Groups Queen Mary College Mathematics Notes, London, 1976.

    Google Scholar 

  5. Book, R.V. Thue Systems as Rewriting Systems J. of Symbolic Computation, Vol. 1 & 2, 1987, pp.39–68.

    Google Scholar 

  6. Bose, N.K. (ed.) Recent Trends in Multidimensional systems Theory Reidel Publ. Co., 1985

    Google Scholar 

  7. Book, Ronald, V. Formal Language Theory, Academic Press, 1980.

    Google Scholar 

  8. Buchberger, B., Loos, R. Algebraic Simplification, in (Buchberger et al. 1982) pp. 11–43.

    Google Scholar 

  9. Buchberger, B., Collins, G. Loos, R. (eds.), Computer Algebra — Symbolic and Algebraic Computation, Springer Verlag, 1982.

    Google Scholar 

  10. Buchberger, B. Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory in (Bose 1985) pp.

    Google Scholar 

  11. Buchberger, Bruno History and Basic Features of the Critical-Pair/Completion Procedure J. Symbolic Computation, vol. 3, 1987, pp. 3–38

    Google Scholar 

  12. Dershowitz, Nachum. Orderings for Term-Rewriting Systems, Theoretical Computer Science, vol. 17, 1982, pp. 279–301.

    Google Scholar 

  13. Dershowitz, Nachum. Termination of Rewriting J. Symbolic Computation, vol. 3, 1987, pp. 69–116. (revised version of the contribution in (Jouannaud 1985))

    Google Scholar 

  14. Dietrich, Roland. Eine Programmierumgebung für Termersetzungssysteme, Arbeitspapiere der GMD, Nr. 130, Gesellschaft für Mathematik und Datenverarbeitung mbH, Schloß Birlinghofen, Postfach 1240, 5205 Sankt Augustin 1.

    Google Scholar 

  15. Herman, G. Strong computability and variants of the uniform halting problem Zeitschrift f. Math. Logik Grundl. Math. vol. 17, 1971, pp. 115–131.

    Google Scholar 

  16. Huet, Gérard, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, 18 th. IEEE Symposium on Foundations of Compoter Science, 1977, pp. 30–45.

    Google Scholar 

  17. Huet, Gérard and Lankford, Dallas, On the Uniform Halting Problem for Term Rewriting Systems Rapport de Recherche No 283, 1978, IRIA (Institute de Recherche d'Informatique et d'Automatique), Rocquencourt, BP 105 78150 Le Chesnay, France.

    Google Scholar 

  18. Huet, Gérard and Oppen, Derek, C. Equations and Rewrite Rules, in (Book 1980), pp. 349–405.

    Google Scholar 

  19. Huet, Gérard, A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm J. of Computer and Systems Science, vol. 23, 1981, pp. 11–21.

    Google Scholar 

  20. Jouannaud, M. A note on a special one-rule semi-Thue system Conference in Dijon, May 1985 Inf. Proc. Letters 21 (1985), 135–140.

    Google Scholar 

  21. Jouannaud, Jean-Pierre (ed.) Rewriting Techniques and Applications, Proceedings of the Conference in Dijon, May 1985 Springer Lecture Notes in Computer Science, Vol. 202, 1985

    Google Scholar 

  22. Kapur, D., Narendran, P. A finite Thue system with decidable word problem and without equivalent finite canonical system Theoret. Comput. Science 35 (1985) 337–344.

    Google Scholar 

  23. Knuth, D. E. and Bendix, P. B., Simple Word Problems in Universal algebra, in: (Leech 1967), pp. 263–297.

    Google Scholar 

  24. Kruskal, J. B. Well-quasi-orderings, the Tree Theorem, and Vazsonyis's Conjecture Trans. Amer. Math. Soc. Vol. 95, 1960, pp. 210–225.

    Google Scholar 

  25. Leech, J. (ed.) Computational Problems in Abstract, Pergamon Press, Cambridge, 1967.

    Google Scholar 

  26. Lescanne, Pierre (ed.) Rewriting Techniques and Applications, Proceedings of the Conference in Bordeaux, May 1987 Springer Lecture Notes in Computer Science, Vol. 256, 1987

    Google Scholar 

  27. Nash-Williams, C. St. J.A. On well-quasi-ordering finite trees. Proc. Cambridge Philos. Soc. vol. 59, 1963, pp. 833–835.

    Google Scholar 

  28. Newman, M.H.A. On Theories with a Combinatorial Definition of “Equivalence”, Annals of Math., vol. 43, 1942, pp. 223–243.

    Google Scholar 

  29. Otto, Fr. and Squier, C. The Word Problem for Finitely Presented Monoids and Finite Canonical Rewrite Systems in: (Lescanne 1987) pp. 74–82.

    Google Scholar 

  30. Ruckert, Martin Church-Rosser Theorem 12nd Normalisierung für Termkalküle mit unendlichen Termen unter Einschluß permutativer Reduktionen Dissertation, Fakultät für Mathematik, Ludwig-Maximilian-Universität München, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Deutschland GmbH, Wissenschaftliches Zentrum Heidelberg, Wilckensstraße 1a, 6900, Heidelberg

    P. H. Schmitt

Authors
  1. P. H. Schmitt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag

About this paper

Cite this paper

Schmitt, P.H. (1988). A survey of rewrite systems. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '87. CSL 1987. Lecture Notes in Computer Science, vol 329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50241-6_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-50241-6_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45960-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation