Title: Guard and continuation optimization for occurrence representations of CHR
Authors: Sneyers, Jon ×
Schrijvers, Tom
Demoen, Bart #
Issue Date: 2005
Publisher: Springer-verlag berlin
Series Title: Logic Programming, ICLP 2005, Proceedings vol:3668 pages:83-97
Conference: 21st International Conference on Logic Programming location:Sitges, Spain date:October 2-5, 2005
Abstract: 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.
ISBN: 3-540-29208-X
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
41783.pdf Published 189KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science