Unification revisited

  • J -L. Lassez
  • M. J. Maher
  • K. Marriott
Part 1: Invited Contributions

DOI: 10.1007/3-540-19129-1_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 306)
Cite this paper as:
Lassez J.L., Maher M.J., Marriott K. (1988) Unification revisited. In: Boscarol M., Carlucci Aiello L., Levi G. (eds) Foundations of Logic and Functional Programming. Lecture Notes in Computer Science, vol 306. Springer, Berlin, Heidelberg

Abstract

In the literature unification is often treated as a simple and straightforward matter, even though it is recognized as a deep and fundamental concept. However when a thorough presentation is attempted, it is then realized that the matter is fairly subtle and treacherous. For instance the notion of most general unifier and its property of being unique up to renaming are open to different interpretations. In fact there are several approaches to unification, based on different mathematical concepts, which are not equivalent. We present here the alternatives and clarify their relationships. In the process new results are obtained related to the notions of equation solving, most specific generalization and constraint solving. This leads to a comprehensive presentation of an elementary theory of unification.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • J -L. Lassez
    • 1
  • M. J. Maher
    • 1
  • K. Marriott
    • 1
    • 2
  1. 1.IBM Thomas J. Watson Research CenterYorktown HeightsUSA
  2. 2.Department of Computer ScienceUniversity of MelbourneParkvilleAustralia

Personalised recommendations