A Type System for CHR

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 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.
Document type :
Reports
Complete list of metadatas

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00070441
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 8:29:36 PM
Last modification on : Thursday, February 7, 2019 - 4:33:25 PM
Long-term archiving on : Sunday, April 4, 2010 - 9:13:51 PM

Identifiers

  • HAL Id : inria-00070441, version 1

Collections

Citation

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

Share

Metrics

Record views

208

Files downloads

262