Skip to main content

Universal Unification by Complete Sets of Transformations

  • Chapter
  • First Online:
Foundations of Equational Logic Programming

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 353))

  • 131 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Editor information

Steffen Hölldobler

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(1989). Universal Unification by Complete Sets of Transformations. In: Hölldobler, S. (eds) Foundations of Equational Logic Programming. Lecture Notes in Computer Science, vol 353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015798

Download citation

  • DOI: https://doi.org/10.1007/BFb0015798

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51533-3

  • Online ISBN: 978-3-540-48226-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics