Unification of equationally interpreted sorted terms

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


We give different methods for the unification of sorted terms provided some axioms for an equational theory are given. First we describe unification algorithms as a set of transformation rules for equational systems. Second we give an algorithm that solves unification problems by first ignoring the sort information using an unsorted algorithm and as a second step computes well-sorted instantiations.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Personalised recommendations