Type Inferencing for Polymorphic Order-Sorted Logic Programs

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 language that allows for polymorphism as in ML and for hierarchically structured monomorphic types.

• Type: Conference
• Year: 1995
• Where: ICLP
• Authors: Christoph Beierle
• Keywords: Automated Reasoning, Complete Type, ICLP 1995, Polymorphic Order-sorted Logic, Type Inferencing Algorithm