Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Conditional Term Rewriting Systems

CTRS 1987: Conditional Term Rewriting Systems pp 212–227Cite as

A logic for conditional term rewriting systems

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

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

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.

6. References

  • Brand, D., Darringer, J., and Joyner, W., Completeness of conditional reductions, IBM Research Center, York-town Heights, 1978.

    Google Scholar 

  • Bergstra, J. and Klop, J., Conditional rewrite rules: confluency and termination, Department of Computer Science preprint, Mathematische Centrum, Amsterdam, 1982.

    Google Scholar 

  • Dershowitz, N. and Plaisted, D., Equational programming, 1987, to appear in Machine Intelligence 11.

    Google Scholar 

  • Kaplan, S., Conditional rewrite rules, Report No. 150, LRI-Orsay, France, 1983. Revised version in: Theoretical Computer Science 33 (1984).

    Google Scholar 

  • Kaplan, S., Fair conditional term rewriting systems: unification, termination, and confluence, Report No. 194, LRI-Orsay, France, 1984.

    Google Scholar 

  • Kapur, D. and Otto, F., On ground-confluence of term rewriting systems, 1987, unpublished.

    Google Scholar 

  • Knuth, D. and Bendix, P., Simple word problems in universal algebras, Computational Problems in Abstract Algebra (J. Leech, ed.), Pergamon Press, Oxford, 1970, pp. 263–297.

    Google Scholar 

  • O'Donnell, M., Computing in Systems Described by Equations, Lecture Notes in Computer Science 58, Springer-Verlag, 1977.

    Google Scholar 

  • Remy, J., Proving conditional identities by equational case reasoning, rewriting, and normalization, unpublished manuscript, C.R.I.N., Nancy, 1983.

    Google Scholar 

  • Zhang, H. and Remy, J., Contextual rewriting, Rewriting Techniques and Applications, J.-P. Jouannaud, ed. (Springer-Verlag, New York, 1985), pp. 46–62.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of North Carolina, 27514, Chapel Hill, North Carolina

    David A. Plaisted

Authors
  1. David A. Plaisted
    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

Plaisted, D.A. (1988). A logic for conditional term rewriting 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_16

Download citation

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

  • 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