Generalized CHR Machines
Jon Sneyers, Thom Frühwirth · Lirias · 2008
Abstract. Constraint Handling Rules (CHR) is a high-level rule-based programming language. In [11], a model of computation based on the operational semantics of CHR is introduced, called the CHR machine. The CHR machine was used to prove a complexity-wise completeness result for the CHR language and its implementations. In this paper, we investigate three generalizations of CHR machines: CHR machines with an instantiated operational semantics, non-deterministic CHR machines, and self-modifying CHR machines. 1