@inproceedings{Beierle95ICLP,
   AUTHOR = "C. Beierle",
   TITLE = "Type Inferencing for Polymorphic
             Order-Sorted Logic Programs",
    BOOKTITLE = "Proceedings of the Twelfth International Conference
                 on Logic Programming",
    YEAR = 1995,
    EDITOR = "L. Sterling",
    PAGES = "765--780",
    PUBLISHER = {MIT Press},
    ADDRESS = {Cambridge, MA},
    URL       =   "ftp://ftp.fernuni-hagen.de/pub/fachb/inf/pri8/papers/Beierle95ICLP.ps.gz,
ftp://ftp.fernuni-hagen.de/pub/fachb/inf/pri8/papers/Beierle95ICLP.dvi.gz",
    ABSTRACT = {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 \mbox{PROTOS-L}, a logic programming langauge that allows for 
polymorphism as in ML and for hierarchically structured monomorphic types.}}