CHR(Curry): Interpretation and compilation of constraint handling rules in curry

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Constraint Handling Rules (CHR) is a rule-based language to specify application-oriented constraint solvers. CHR requires a host language that provides the basic constraints used in a CHR program. In this paper, we argue that an integrated functional logic language like Curry is an appropriate host language for CHR since it supports a natural formulation of constraint handling rules and a seamless integration into a typed environment. As a proof of concept, we describe CHR(Curry), an integration of CHR into Curry, together with two implementations. The first is an interpreter of CHR’s refined operational semantics implemented in Curry, and the second compiles CHR rules into Prolog which can be directly used in Prolog-based Curry implementations, such as PAKCS.

Cite

CITATION STYLE

APA

Hanus, M. (2015). CHR(Curry): Interpretation and compilation of constraint handling rules in curry. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9131, pp. 74–89). Springer Verlag. https://doi.org/10.1007/978-3-319-19686-2_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free