Abstract
We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension of a host language, such as Prolog or Java, this type system is parameterized by the type system of the host language. We show the consistency of the type system for CHR w.r.t. its operational semantics. We also study the case when the host language is a constraint logic programming language, typed with the prescriptive type system we developed in previous work. In particular, we show the consistency of the resulting type system w.r.t. the extended execution model CLP+CHR. This system is implemented through an extension of our type checker TCLP for constraint logic languages. We report on experimental results about the type-checking of twelve CHR solvers and programs, including TCLP itself.

URL:
http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2006-110

BibTeX:

@article{REWERSE-RP-2006-110,
	author = {Emmanuel Coquery and Fran\c{c}ois Fages},
	title = {A type system for CHR},
	journal = {},
	year = {2006},
	volume = {3978},
	pages = {100--117},
	url = {http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2006-110}
}