Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules

The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first contribution of this paper is to provide translations between CSR and flat-LCC. The second contribution is a transformation from the full LCC language to flat-LCC which preserves semantics. This transformation is similar to -lifting in functional languages. In conjunction with the equivalence between CHR and CSR with respect to original operational semantics, these results lead to semantics-preserving translations from full LCC to CHR and conversely. Immediate consequences of this work include new proofs for CHR linear logic and phase semantics, relying on corresponding results for LCC, plus an encoding of the -calculus in CHR.

• Type: Journal
• Year: 2010
• Where: PPDP
• Authors: Thierry Martinez
• Keywords: CHR Linear Logic, Constraint Simplification Rules, PPDP 2010, Programming Languages, Semantics