Typing constraint logic programs

Details Typing constraint logic programs Typing constraint logic programs

2004-05-27

arxiv.org/abs/cs/0405100v1

Theory and Practice of Logic Programming, vol. 1, no. 6, 2001

Computer Science

Programming Languages

Appeared in Theory and Practice of Logic Programming, vol. 1, no. 6, 2001

Scientific paper

We present a prescriptive type system with parametric polymorphism and subtyping for constraint logic programs. The aim of this type system is to detect programming errors statically. It introduces a type discipline for constraint logic programs and modules, while maintaining the capabilities of performing the usual coercions between constraint domains, and of typing meta-programming predicates, thanks to the flexibility of subtyping. The property of subject reduction expresses the consistency of a prescriptive type system w.r.t. the execution model: if a program is "well-typed", then all derivations starting from a "well-typed" goal are again "well-typed". That property is proved w.r.t. the abstract execution model of constraint programming which proceeds by accumulation of constraints only, and w.r.t. an enriched execution model with type constraints for substitutions. We describe our implementation of the system for type checking and type inference. We report our experimental results on type checking ISO-Prolog, the (constraint) libraries of Sicstus Prolog and other Prolog programs.

Affiliated with

Also associated with

No associations

Rating

Typing constraint logic programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Typing constraint logic programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Typing constraint logic programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-270035