Specialization of Concurrent Guarded Multi-set Transformation Rules

Frühwirth, Thom

doi:10.1007/11506676_9

Cited by 11 publications

(18 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(Frühwirth 2005), rather than considering a generic transformation system focuses on the specialization of rules w.r.t. a specific goal, analogously to what happens in partial evaluation.…”

Section: Discussionmentioning

confidence: 99%

“…The next property that we consider is confluence. This property guarantees that any computation for a goal results in the same final state, no matter which of the applicable rules are applied (Abdennadher and Frühwirth 2004;Frühwirth 2005).…”

Section: Example 12mentioning

confidence: 99%

“…There exists a very large body of literature on CHR, ranging from theoretical aspects to implementations and applications. However, only few papers, notably Frühwirth and Holzbaur (2003), Frühwirth (2005), Sneyers et al (2005), Tacchella et al (2007), Tacchella (2008), and Sarna-Starosta and Schrijvers (2009), consider source to source transformation of CHR programs. This is not surprising, since program transformation is in general very difficult for (logic) concurrent languages, and in the case of CHR it is even more complicated, as we discuss later.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Unfolding for CHR programs

Gabbrielli

Meo

Tacchella

et al. 2013

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption, and more generally to optimize a given program. Essentially, it consists of a sequence of syntactic program manipulations which preserves some kind of semantic equivalence. Unfolding is one of the basic operations which is used by most program transformation systems and which consists in the replacement of a procedure call by its definition. While there is a large body of literature on transformation and unfolding of sequential programs, very few papers have addressed this issue for concurrent languages.This paper defines an unfolding system for CHR programs. We define an unfolding rule, show its correctness and discuss some conditions which can be used to delete an unfolded rule while preserving the program meaning. We also prove that, under some suitable conditions, confluence and termination are preserved by the above transformation.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Example 12mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Unfolding for CHR programs

Gabbrielli

Meo

Tacchella

et al. 2013

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

show abstract

“…Like compiler optimization, program transformation can also be used to improve performance. The first proposal for CHR source-to-source transformation, by Frühwirth (2005c), adds redundant, specialized rules to a CHR program; these rules capture the effect of the original program for a particular goal. In more recent work, Tacchella, Gabbrielli et al (2007) adapt the conventional notion of unfolding to CHR.…”

Section: Code Specialization and Transformationmentioning

confidence: 99%

“…• Partial evaluation. Section 4.2.3 mentions recent work in this area (Frühwirth 2005c;Sarna-Starosta and Schrijvers 2007;Tacchella et al 2007). For now, it is clear that the multiheadedness of CHR makes a straightforward application of partial evaluation techniques for conventional languages to CHR programs nearly impossible.…”

Section: Retrospectionmentioning

confidence: 99%

As time goes by: Constraint Handling Rules

Sneyers¹,

Weert²,

Schrijvers³

et al. 2009

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers, it is now recognized as an elegant general purpose language.CHR-related research has surged during the decade following the previous survey by Frühwirth (1998). Covering more than 180 publications, this new survey provides an overview of recent results in a wide range of research areas, from semantics and analysis to systems, extensions and applications.

show abstract

Constraint Handling Rules - What Else?

Frühwirth

2015

Rule Technologies: Foundations, Tools, and Applications

Self Cite

View full text Add to dashboard Cite

Abstract. Constraint Handling Rules (CHR) is both an effective concurrent declarative constraint-based programming language and a versatile computational formalism. While conceptually simple, CHR is distinguished by a remarkable combination of desirable features:-a semantic foundation in classical and linear logic, -an effective and efficient sequential and parallel execution model -guaranteed properties like the anytime online algorithm properties -powerful analysis methods for deciding essential program properties. This overview of some CHR-related research and applications is by no means meant to be complete. Essential introductory reading for CHR provide the survey article [125] and the books [56,63]. Up-to-date information on CHR can be found online at the CHR web-page www. constraint-handling-rules.org, including the slides of the keynote talk associated with this article. In addition, the CHR website dtai. cs.kuleuven.be/CHR/ offers everything you want to know about CHR, including online demo versions and free downloads of the language. Executive SummaryConstraint Handling Rules (CHR) [56] tries to bridge the gap between theory and practice, between logical specification and executable program by abstraction through constraints and the concepts of computational logic. CHR has its roots in constraint logic programming and concurrent constraint programming, but also integrates ideas from multiset transformation and rewriting systems as well as automated reasoning and theorem proving. It seamlessly blends multi-headed rewriting and concurrent constraint logic programming into a compact userfriendly rule-based programming language. CHR consists of guarded reactive rules that transform multisets of relations called constraints until no more change occurs. By the notion of constraint, CHR does not need to distinguish between data and operations, and its rules are both descriptive and executable.In CHR, one distinguishes two main kinds of rules: Simplification rules replace constraints by simpler constraints while preserving logical equivalence, e.g., X≤Y∧Y≤X ⇔ X=Y. Propagation rules add new constraints that are logically redundant but may cause further simplification, e.g., X≤Y∧Y≤Z ⇒ X≤Z. Together with X≤X ⇔ true, these rules encode the axioms of a partial order relation. The rules compute its transitive closure and replace inequalities ≤ by equalities = whenever possible. For example, A≤B∧B≤C∧C≤A becomes A=B∧B=C. More program examples can be found in Section 2. Semantics of CHR are discussed in Section 3.

show abstract

Specialization of Concurrent Guarded Multi-set Transformation Rules

Cited by 11 publications

References 15 publications

Unfolding for CHR programs

Unfolding for CHR programs

As time goes by: Constraint Handling Rules

Constraint Handling Rules - What Else?

Contact Info

Product

Resources

About