Type Inference for CLP(FD)

This paper describes a type system for CLP(FD) where the CHIP language is considered. The proposed type system is an extension of regular types known in LP. We propose an approach where a type for a finite domain variable is a its domain, i.e. a set of all values it can take. These finite domain types can occur as leaves of terms denoting regular types. Then type inference is discussed. We propose to adopt and modify some techniques developed originally in the context of LP. The described system performs compile-time constraint propagation what allows to deduce about possible domains of some variables