An improved FreeCHR execution algorithm with iterator-based matching and manual indexing is presented and benchmarked, but correctness is unproven and the measured gains are mixed.
Implementing Constraint Handling Rules as a Domain-Specific Language Embedded in Java
1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.
abstract
Programming languages and techniques based on logic and constraints, such as the Constraint Handling Rules (CHR), can support many common programming tasks that can be expressed in the form of a search for feasible or optimal solutions. Developing new constraint solvers using CHR is especially interesting in configuration management for large scale, distributed and dynamic cloud applications, where dynamic configuration and component selection is an integral part of the programming environment. Writing CHR-style constraint solvers in a domain-specific language which is a subset of Java -- instead of using a separate language layer -- solves many integration, development cycle disruption, testing and debugging problems that discourage or make difficult the adoption of the CHR-based approach in the mainstream programming environments. Besides, the prototype implementation exposes a well-defined API that supports transactional store behavior, safe termination, and debugging via event notifications.
citation-role summary
citation-polarity summary
fields
cs.PL 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Optimized Execution of FreeCHR
An improved FreeCHR execution algorithm with iterator-based matching and manual indexing is presented and benchmarked, but correctness is unproven and the measured gains are mixed.