Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Conditional Term Rewriting Systems

CTRS 1987: Conditional Term Rewriting Systems pp 31–44Cite as

Confluence of conditional rewrite systems

  • Part 1 Research Articles
  • Conference paper
  • First Online:

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

Abstract

Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming. An important issue, in either case, is determining whether a rewrite system has the Church-Rosser, or confluence, property. In this paper, we settle negatively the question whether “joinability of critical pairs” is, in general, sufficient for confluence of terminating conditional systems. We review known sufficient conditions for confluence, and also prove two new positive results for systems having critical pairs and arbitrarily big terms in conditions.

This research was supported in part by the National Science Foundation under Grant DCR 85-13417.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bergstra, J. A., and Klop, J. W. “Conditional rewrite rules: Confluency and termination”, JCSS 32, pp. 323–362, 1986.

    Google Scholar 

  2. Dershowitz, N., Okada, M., and Sivakumar, G. “Canonical conditional rewrite systems”, submitted.

    Google Scholar 

  3. Dershowitz, N., and Plaisted, D. A. “Equational programming”. In Machine Intelligence 11: The logic and acquisition of knowledge (J. E. Hayes, D. Michie, and J. Richards, eds.), Clarendon Press, London, 1987.

    Google Scholar 

  4. Fribourg, L. “Slog: A logic programming language interpreter based on clausal superposition and rewriting”. Proceedings of the 1985 Symposium on Logic Programming, Boston, MA (July 1985), pp. 172–184.

    Google Scholar 

  5. Goguen, J. A., and Meseguer, J. “Eqlog: Equality, types and generic modules for logic programming”. In Logic Programming: Functions, relations and equations (D. DeGroot and G. Lindstrom, eds.), Prentice-Hall, Englewood Cliffs, NJ, pp. 295–363, 1986.

    Google Scholar 

  6. Huet, G. “Confluent reductions: Abstract properties and applications to term rewriting systems”, J. ACM 27, pp. 797–821.

    Google Scholar 

  7. Jouannaud, J.-P., and Waldmann, B. “Reductive conditional term rewriting systems”. Proceedings of the Third IFIP Working Conference on Formal Description of Programming Concepts, Ebberup, Denmark.

    Google Scholar 

  8. Kaplan, S. “Simplifying conditional term rewriting systems: Unification, termination and confluence”, Journal of Symbolic Computation, to appear.

    Google Scholar 

  9. Zhang, H., and Rémy, J. L. “Contextual rewriting”. Proceedings First International Conference on Rewriting Techniques and Applications, Dijon, France (May 1985), pp. 46–62 (available as Vol. 202, Lecture Notes in Computer Science, Springer, Berlin [September 1985]).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois, U.S.A.

    Nachum Dershowitz & G. Sivakumar

  2. Department of Computer Science, Concordia University, H3G 1M8, Montreal, Quebec, Canada

    Mitsuhiro Okada

Authors
  1. Nachum Dershowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mitsuhiro Okada
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. G. Sivakumar
    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

Dershowitz, N., Okada, M., Sivakumar, G. (1988). Confluence of conditional rewrite systems. 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_3

Download citation

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

  • 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