A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
This paper proposes a type system for logic programming where types are structured in two .ways. Firstly, functions and predicates may be declared with types containing type parameters which are universally quantified over all types. In this ca~e each instance of the type declaration can be used in the logic program. Secondly, types are related by subset inclusions. In this case a function or predicate can be applied to all subtypes of its declared type. While previous proposals for such typedoi:10.1007/3540539816_67 fatcat:aw64wrabq5bfpmsqs4rijb6zri