Guard and Continuation Optimization for Occurrence Representations of CHR | Zendy

Jon Sneyers | Zendy; Tom Schrijvers | Zendy; Bart Demoen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Guard and Continuation Optimization for Occurrence Representations of CHR

Author(s) -

Jon Sneyers,

Tom Schrijvers,

Bart Demoen

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-29208-X

DOI - 10.1007/11562931_9

Subject(s) - computer science , continuation , programming language , correctness , compiler , intermediate language , guard (computer science) , prolog , speedup , optimizing compiler , semantics (computer science) , theoretical computer science , parallel computing

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.status: publishe

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research