An Abstract View of Sorted Unification

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

An Abstract View of Sorted Unification

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

Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

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 language	Undefined/Unknown
Pages	178-192
Publication status	Published - 1992

Access to Document

http://dx.doi.org/10.1007/3-540-55602-8_164

Cite this

@conference{4e89ee49f83b4d7883b1e2b3c3269373,

title = "An Abstract View of Sorted Unification",

abstract = "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.",

author = "Frisch, {Alan M.} and Cohn, {Anthony G.} and Deepak Kapur",

year = "1992",

language = "Undefined/Unknown",

pages = "178--192",

}

TY - CONF

T1 - An Abstract View of Sorted Unification

AU - Frisch, Alan M.

AU - Cohn, Anthony G.

AU - Kapur, Deepak

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

M3 - Paper

SP - 178

EP - 192

ER -