Warren's abstract machine: a tutorial reconstruction
Warren's abstract machine: a tutorial reconstruction
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
Optimizing compilation of constraint handling rules in HAL
Theory and Practice of Logic Programming
Optimal union-find in Constraint Handling Rules
Theory and Practice of Logic Programming
The computational power and complexity of constraint handling rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Adding constraint solving to mercury
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
| Hi-index | 0.00 |
The overhead of matching CHR rules is alleviated by constraint store indexing. Attributed variables provide an efficient means of indexing on logical variables. Existing indexing strategies for ground terms, based on hash tables, incur considerable performance overhead, especially when frequently computing hash values for large terms. In this paper we (1) propose attributed data , a new data representation for ground terms inspired by attributed variables, that avoids the overhead of hash-table indexing, (2) describe program analysis and transformation techniques that make attributed data more effective, and (3) provide experimental results that establish the usefulness of our approach.