Memory reuse for CHR

Authors:
Jon Sneyers;Tom Schrijvers;Bart Demoen
Affiliations:
Dept. of Computer Science, K.U. Leuven, Belgium;Dept. of Computer Science, K.U. Leuven, Belgium;Dept. of Computer Science, K.U. Leuven, Belgium
Venue:
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Year:
2006

Citing 3
Cited 4

Practical Aspects for a Working Compile Time Garbage Collection System for Mercury

Proceedings of the 17th International Conference on Logic Programming
Compiling Constraint Handling Rules into Prolog with Attributed Variables

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Abstract interpretation for constraint handling rules

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming

The computational power and complexity of constraint handling rules

ACM Transactions on Programming Languages and Systems (TOPLAS)
Logical algorithms meets chr: A meta-complexity result for constraint handling rules with rule priorities

Theory and Practice of Logic Programming
CHR for Imperative Host Languages

Constraint Handling Rules
Compiling constraint handling rules for efficient tabled evaluation

PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two Constraint Handling Rules compiler optimizations that drastically reduce the memory footprint of CHR programs are introduced. The reduction is the result of reusing suspension terms, the internal CHR constraint representation, and avoiding the overhead of constraint removal followed by insertion. The optimizations are defined formally and their correctness is proved. Both optimizations were implemented in the K.U.Leuven CHR system. Significant memory savings and speedups were measured on classical and well-known benchmarks.