TY  - CONF
A1  - Betz, Hariolf
A1  - Raiser, Frank
A1  - Frühwirth, Thom
T1  - Persistent constraints in constraint handling rules
N2  - In the most abstract definition of its operational semantics, the declarative and concurrent programming language CHR is trivially non-terminating for a significant class of programs. Common refinements of this definition, in closing the gap to real-world implementations, compromise on declarativity and/or concurrency. Building on recent work and the notion of persistent constraints, we introduce an operational semantics avoiding trivial non-termination without compromising on its essential features.
Y1  - 2010
UR  - https://publishup.uni-potsdam.de/frontdoor/index/index/docId/3970
UR  - https://nbn-resolving.org/urn:nbn:de:kobv:517-opus-41547
ER  -