Confluence by decreasing diagrams
Theoretical Computer Science
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Operational Equivalence of CHR Programs and Constraints
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Confluence by Decreasing Diagrams
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
The computational power and complexity of constraint handling rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Diagrammatic Confluence and Completion
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Constraint Handling Rules
Observable confluence for constraint handling rules
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Abstract critical pairs and confluence of arbitrary binary relations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
CLP projection for constraint handling rules
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Parallelizing union-find in constraint handling rules using confluence analysis
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Decreasing diagrams and relative termination
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Hi-index | 0.00 |
Confluence is a fundamental property of Constraint Handling Rules (CHR) since, as in other rewriting formalisms, it guarantees that the computations are not dependent on rule application order, and also because it implies the logical consistency of the program declarative view. In this paper we are concerned with proving the confluence of non-terminating CHR programs. For this purpose, we derive from van Oostrom's decreasing diagrams method a novel criterion on CHR critical pairs that generalizes all preexisting criteria. We subsequently improve on a result on the modularity of CHR confluence, which permits modular combinations of possibly non-terminating confluent programs, without loss of confluence.