Constraint Handling Rules (CHR) is a committed-choice declarative language which has originally been designed for writing constraint solvers and which is nowadays a general purpose language. In [7,11] a trace based, compositional semantics for CHR has been defined. Such a compositional model uses as reference operational semantics the original “naive” one [9] which, due to the propagation rule, admits trivial non-termination. In this paper we extend the work of [7,11] by considering a more refined operational semantics which avoids trivial non-termination.
M. Gabbrielli, M.C. Meo, P. Tacchella (2008). A compositional Semantics for CHR with propagation rules. BERLIN : Springer-Verlag.
A compositional Semantics for CHR with propagation rules
GABBRIELLI, MAURIZIO;TACCHELLA, PAOLO
2008
Abstract
Constraint Handling Rules (CHR) is a committed-choice declarative language which has originally been designed for writing constraint solvers and which is nowadays a general purpose language. In [7,11] a trace based, compositional semantics for CHR has been defined. Such a compositional model uses as reference operational semantics the original “naive” one [9] which, due to the propagation rule, admits trivial non-termination. In this paper we extend the work of [7,11] by considering a more refined operational semantics which avoids trivial non-termination.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
