A Type System for CHR

  • Emmanuel Coquery
  • François Fages
Conference paper

DOI: 10.1007/11754602_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3978)
Cite this paper as:
Coquery E., Fages F. (2006) A Type System for CHR. In: Hnich B., Carlsson M., Fages F., Rossi F. (eds) Recent Advances in Constraints. CSCLP 2005. Lecture Notes in Computer Science, vol 3978. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Emmanuel Coquery
    • 1
    • 2
  • François Fages
    • 1
  1. 1.INRIA Rocquencourt, Projet ContraintesLe ChesnayFrance
  2. 2.LIRISUniversité Claude Bernard Lyon 1VilleurbanneFrance

Personalised recommendations