A Type System for CHR - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

A Type System for CHR

Emmanuel Coquery
Francois Fages


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 where the host language is a constraint logic programming language, typed with the prescriptive type system we developed in our 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 12 CHR solvers and programs, including TCLP itself.
Fichier principal
Vignette du fichier
RR-5565.pdf (272.79 Ko) Télécharger le fichier

Dates and versions

inria-00070441 , version 1 (19-05-2006)


  • HAL Id : inria-00070441 , version 1


Emmanuel Coquery, Francois Fages. A Type System for CHR. [Research Report] RR-5565, INRIA. 2005, pp.17. ⟨inria-00070441⟩
57 View
126 Download


Gmail Facebook Twitter LinkedIn More