Type Inferencing for Polymorphic Order-Sorted Logic Programs
Christoph Beierle · The MIT Press eBooks · 1995
The purpose of this paper is to study the problem of complete type infer-encing 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 program-ming language that allows for polymorphism as in ML and for hierarchically structured monomorphic types. 1