A fully abstract model for concurrent constraint programming
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
A model and proof system for asynchronous networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
To the Gates of HAL: A HAL Tutorial
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
A compositional semantics for CHR
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Constraint handling rules: the story so far
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
The computational power and complexity of constraint handling rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
A compositional semantics for CHR
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
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.