Type inferencing for polymorphic order-sorted logic programs.
In L. Sterling, editor, Proceedings of the Twelfth International
Conference on Logic Programming,
pages 765-780, Cambridge, MA, 1995. MIT Press.
The purpose of this paper is to study the problem of complete type inferencing
for polymorphic order-sorted logic programs. We show that previous approaches
are incomplete even if one does not employ the full power of the used type
systems. We present a complete type inferencing algorithm that covers the
polymorphic order-sorted types in PROTOS-L, a logic programming langauge that
allows for polymorphism as in ML and for hierarchically structured monomorphic