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

Authors:
Thierry Martinez
Affiliations:
INRIA, Paris-Rocquencourt, France
Venue:
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Year:
2010

Citing 11
Cited 1

Lambda lifting: transforming programs to recursive equations

Proc. of a conference on Functional programming languages and computer architecture
Linear logic

Theoretical Computer Science
Concurrent constraint programming

Concurrent constraint programming
Linear concurrent constraint programming: operational and phase semantics

Information and Computation
Confluence and Semantics of Constraint Simplification Rules

Constraints
On the bisimulation proof method

Mathematical Structures in Computer Science
Abstract interpretation for constraint handling rules

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
A theory of overloading

ACM Transactions on Programming Languages and Systems (TOPLAS)
The computational power and complexity of constraint handling rules

ACM Transactions on Programming Languages and Systems (TOPLAS)
Logical algorithms meets chr: A meta-complexity result for constraint handling rules with rule priorities

Theory and Practice of Logic Programming
Closures and modules within linear logic concurrent constraint programming

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science

Models and emerging trends of concurrent constraint programming

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 the 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.