Abstract:
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. 1
Citations
|
801
|
A theory of type polymorphism in programming
– Milner
- 1978
|
|
258
|
The Gödel Programming Language
– Hill, Lloyd
- 1994
|
|
107
|
de Waal. Fast and Precise Regular Approximations of Logic Programs
– Gallagher, A
- 1994
|
|
76
|
Towards a theory of types in Prolog
– Mishra
- 1984
|
|
74
|
Reasoning about Prolog programs: from modes through types to assertions
– Apt, Marchiori
- 1994
|
|
70
|
A type system for logic programs
– Yardeni, Shapiro
- 1990
|
|
59
|
Typed Prolog: A semantic reconstruction of the Mycroft-O'Keefe type system
– Lakshman, Reddy
- 1991
|
|
46
|
A Semantics for Typed Logic Programs
– Hill, Topor
- 1992
|
|
45
|
A regular type language for logic programs
– Dart, Zobel
- 1992
|
|
22
|
Type Inferencing for Polymorphic Order-Sorted Logic Programs
– Beierle
- 1995
|
|
19
|
A Bottom-up Polymorphic Type Inference in Logic Programming
– Barbuti, Giacobazzi
- 1992
|
|
11
|
Regular approximations of logic programs and their uses
– Gallagher, Waal
- 1992
|
|
8
|
Approximating constraint logic programs using polymorphic types and regular descriptions
– Saglam, Gallagher
- 1995
|
|
5
|
Directional Types in Logic Programming. Linkoping studies in science and technology, dissertation no
– Boye
- 1996
|
|
1
|
A polymorphic type sytem for Prolog
– Mycroft, O'Keefe
- 1984
|