Constraint handling rules

Abstract. CHR is a highly concurrent language, and yet it is by no means a trivial task to write correct concurrent CHR programs. We pro-pose a new semantics for CHR, which allows specifying and reasoning about transactions. Transactions alleviate the complexity of writing con-current programs by offering entire derivations to run atomically and in isolation. We derive several program transformations based on our semantics that transform particular classes of transitional CHR programs to non-transac-tional ones. These transformations are useful because they obviate a general purpose transaction manager, and may lift unnecessary sequen-tialization present in the transactional semantics.