An instance of FreeCHR with refined operational semantics
Abstract
Constraint Handling Rules (CHR) is a rule-based programming language which is typically embedded into a general-purpose language. There exists a plethora of implementations of CHR for numerous host languages. However, the existing implementations often reinvent the way to embed CHR, which impedes maintenance and weakens assertions of correctness. To formalize and thereby unify the embedding of CHR into arbitrary host languages, we introduced the framework FreeCHR and proved it to be a valid representation of classical CHR. Until now, this framework only includes a translation of the very abstract operational semantics of CHR which, due to its abstract nature, introduces several practical issues. In this paper, we introduce an execution algorithm for FreeCHR. We derive it from the refined operational semantics of CHR, which resolve the issues introduced by the very abstract semantics. We also prove soundness of the algorithm with respect to the very abstract semantics of FreeCHR. Hereby we provide a unified and an easy to implement guideline for new CHR implementations, as well as an algorithmic definition of the refined operational semantics.
Cite
@article{arxiv.2505.22155,
title = {An instance of FreeCHR with refined operational semantics},
author = {Sascha Rechenberger and Thom Frühwirth},
journal= {arXiv preprint arXiv:2505.22155},
year = {2025}
}
Comments
This is a preprint of a paper submitted to the 27th International Symposium on Principles and Practice of Declarative Programming (PPDP '25). arXiv admin note: text overlap with arXiv:2504.04962