Specialization of concurrent guarded multi-set transformation rules

Authors:
Thom Frühwirth
Affiliations:
Faculty of Computer Science, University of Ulm, Germany
Venue:
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Year:
2004

Citing 9
Cited 1

Concurrent constraint programming

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Rules and strategies for transforming functional and logic programs

ACM Computing Surveys (CSUR)
Transformations of CCP programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Confluence and Semantics of Constraint Simplification Rules

Constraints
Model Checking in CLP

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Operational Equivalence of CHR Programs and Constraints

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Essentials of Constraint Programming

Essentials of Constraint Programming
Essentials of Constraint Programming

Essentials of Constraint Programming
An unfold/fold transformation framework for definite logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)

On Partial Deduction and Conversational Agents

Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Program transformation and in particular partial evaluation are appealing techniques for declarative programs to improve not only their performance. This paper presents the first step towards developing program transformation techniques for a concurrent constraint programming language where guarded rules rewrite and augment multi-sets of atomic formulae, called Constraint Handling Rules (CHR). We study the specialization of rules with regard to a given goal (query). We show the correctness of this program transformation: Adding and removing specialized rules in a program does not change the program's operational semantics. Furthermore termination and confluence of the program are shown to be preserved.