A type system for CHR

Authors:
Emmanuel Coquery;François Fages
Affiliations:
INRIA Rocquencourt, Projet Contraintes, Le Chesnay, France;INRIA Rocquencourt, Projet Contraintes, Le Chesnay, France
Venue:
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Year:
2005

Citing 6
Cited 0

A polymorphic type system for PROLOG.

Artificial Intelligence
Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A theory of overloading

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
A versatile constraint-based type inference system

Nordic Journal of Computing
Typing constraint logic programs

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

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.