A polymorphic, hierarchical type system for Prolog

This thesis develops a polymorphic, hierarchical type system for Prolog that can be checked statically. Type issues unique to Prolog, such as moding and treatment of logical variables, are considered. A type checking specification is defined and an algorithm fulfilling that specification is presented. Finally, the thesis describes the results of adding an implementation of this algorithm to an existing Prolog interpreter.