2013
DOI: 10.1017/s1471068413000288
|View full text |Cite
|
Sign up to set email alerts
|

Unfolding for CHR programs

Abstract: 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 transformatio… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…Bounded transactions. A bounded transaction is one that performs a finite, statically known number of transitions.atomic(G) <=> G. Then we unfold the rule (Frühwirth and Holzbaur, 2003;Frühwirth, 2005b;Gabbrielli et al, 2013) until no more operation constraints appear in its body. Since the transaction is bounded, unfolding will eventually stop.…”
Section: Encoding Transactions In Standard Chrmentioning
confidence: 99%
“…Bounded transactions. A bounded transaction is one that performs a finite, statically known number of transitions.atomic(G) <=> G. Then we unfold the rule (Frühwirth and Holzbaur, 2003;Frühwirth, 2005b;Gabbrielli et al, 2013) until no more operation constraints appear in its body. Since the transaction is bounded, unfolding will eventually stop.…”
Section: Encoding Transactions In Standard Chrmentioning
confidence: 99%
“…A bounded transaction is one that performs a finite, statically known number of transitions. We eliminate a bounded transaction atomic(G) from a program by adding a rule to the program of the form atomic(G) <=> G. Then we unfold the rule [Frü05b, GMTW13,FH03] until no more operation constraints appear in its body. Since the transaction is bounded, unfolding will eventually stop.…”
Section: Encoding Transactions In Standard Chrmentioning
confidence: 99%
“…As far as we know, there exist no papers using the nondeterministic pattern matching as such a language and none considered the class of the equations characterized in Theorem 1, namely the variables separated by the two equation sides such that at least one of the sides has at most one occurrence of each word variable. 7 Remark 4.1.6. Of interest to us are the s-variables: they allow us to compare unknown characters and to work with an unknown alphabet.…”
Section: Nondeterministic Casementioning
confidence: 99%
“…Even though algorithms unfolding programs were being intensively studied for a long time (see for examples: [18,19,10,14,7]), as far as we know, the associative concatenation was stood by the wayside of the stream and mainly was considered only in the context of the Refal language mentioned above [18,19,21].…”
Section: Introductionmentioning
confidence: 99%