Specialization of Concurrent Guarded Multi-set Transformation Rules | Zendy

Thom Frühwirth | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Specialization of Concurrent Guarded Multi-set Transformation Rules

Author(s) -

Thom Frühwirth

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-26655-0

DOI - 10.1007/11506676_9

Subject(s) - computer science , program transformation , correctness , programming language , transformation (genetics) , semantics (computer science) , constraint (computer aided design) , set (abstract data type) , operational semantics , theoretical computer science , program analysis , constraint programming , model transformation , mathematical optimization , artificial intelligence , mathematics , biochemistry , chemistry , geometry , consistency (knowledge bases) , gene , stochastic programming

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research