We present an algorithm for automatic type checking of logic programs with respect to directional types that describe both the structure of terms and the directionality of predicates. The type checking problem is reduced to a decidable problem on systems of inclusion constraints over set expressions. We discuss some properties of the reduction algorithm, complexity, and present a proof of correctness.
REF present an algorithm for automatic checking directional types of logic programs.
Directional Type Checking of Logic Programs
SAS
Computer Science