Sciweavers

ICLP
2005
Springer

Guard and Continuation Optimization for Occurrence Representations of CHR

13 years 9 months ago
Guard and Continuation Optimization for Occurrence Representations of CHR
Constraint Handling Rules (CHR) is a high-level rule-based language extension, commonly embedded in Prolog. We introduce a new occurrence representation of CHR programs, and a new operational semantics for occurrence representations, equivalent to the widely implemented refined operational semantics. The occurrence representation allows in a natural way to express guard and continuation optimizations, which remove redundant guards and eliminate redundant code for subsumed occurrences. These optimizations allow CHR programmers to write self-documented rules with a clear logical reading. We show correctness of both optimizations, present an implementation in the K.U.Leuven CHR compiler, and discuss speedup measurements.
Jon Sneyers, Tom Schrijvers, Bart Demoen
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where ICLP
Authors Jon Sneyers, Tom Schrijvers, Bart Demoen
Comments (0)