Paper Info
Title
Analysis and optimization of CHR programs
Abstract
Constraint Handling Rules (CHR) [2] is a high-level, powerful, yet relatively simple “no box” CLP language, embedded in a host language, commonly Prolog. It is based on multi-headed committed-choice rules. Recent implementations of CHR consist of a compiler which translates a CHR program to host language code, and a run-time system implementing the constraint store. Originally, CHR was designed for rapid prototyping of user-de.ned constraint solvers. In the early years of CHR limited attention went to optimized compilation. As a consequence, the reference implementation of CHR [4] comprises a general compilation schema, with only a small number of optimizations. Currently, CHR is increasingly used as a general-purpose programming language in a wide range of applications. Therefore, performance becomes more important, and recently, more advanced compilation optimizations have been proposed [3].
Year
DOI
Venue
2005
10.1007/11562931_51
ICLP
Keywords
Field
DocType
clp language,chr program,general compilation schema,general-purpose programming language,advanced compilation optimizations,language code,chr limited attention,constraint store,optimized compilation,host language,compiler optimization,operational semantics,programming language
Program optimization,Dynamic compilation,Programming language,Computer science,Parallel computing,Algorithm,Compiler,Constraint satisfaction problem,Prolog,Logic programming,Constraint Handling Rules,Runtime system
Conference
Volume
ISSN
ISBN
3668
0302-9743
3-540-29208-X
Citations 
PageRank 
References 
1
0.34
7
Authors
1
Name
Order
Citations
PageRank
jon sneyers11179.47