An Abstract View of Sorted Unification

Alan M. Frisch, Anthony G. Cohn, Deepak Kapur

Research output: Contribution to conferencePaperpeer-review


The study of sorted unification has progressed by developing algorithms for more and more general languages. This paper addresses the question of what can be said about sorted unification independent of the sorted language being used. This is done by abstracting away from the particulars of sorted languages and formulating a set of transformation rules for solving sorted unification problems in general. Strategies for controlling these transformation rules are examined to see which prevent a certain kind of infinite execution.
Original languageUndefined/Unknown
Publication statusPublished - 1992

Cite this