#### Filter Results:

#### Publication Year

1992

1994

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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,… (More)

We present a simple and powerful type inference method for dynamically typed languages where no type information is supplied by the user. Type inference is reduced to the problem of solvability of a system of type inclusion constraints over a type language that includes function types, constructor types, union, intersection, and recursive types, and… (More)

In this paper we propose a rich notion of directionality of predicates that combines modes and regular tree types. We provide a semantic soundness result for this notion and give inference systems to decide well-modedness of logic programs and goals. We show how this rich notion of directionality can be used to prove the universal termination of… (More)

- ‹
- 1
- ›