Rewrite Strategies in the Rewriting Calculus

Cirstea, Horatiu; Kirchner, Claude; Liquori, Luigi; Wack, Benjamin

doi:10.1016/s1571-0661(05)82613-1

Cited by 21 publications

(24 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, it would be interesting to investigate the possibility of modelling the rewrite strategy not at the meta level, but in the calculus itself. Taking inspiration from analogous work in the ρ-calculus [10], we would like to have rewrite rules as primal strategies and iterate rewritings on a ρ g -term adding a fix-point operator to the calculus. This would also require the definition of an exception handling mechanism in order to detect failures of rewrite rule application at some occurrences.…”

Section: Discussionmentioning

confidence: 99%

Towards a Sharing Strategy for the Graph Rewriting Calculus

Baldan

Bertolissi

Cirstea

et al. 2008

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

The graph rewriting calculus is an extension of the ρ-calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using unification constraints in addition to the standard ρ-calculus matching constraints. The transformations are performed by explicit application of rewrite rules as first class entities. The possibility of expressing sharing and cycles allows one to represent and compute over regular infinite entities. We propose in this paper a reduction strategy for the graph rewriting calculus which aims at maintaining the sharing information as long as possible in the terms. The corresponding reduction relation is shown to be confluent and complete w.r.t. the small-step semantics of the graph rewriting calculus.

show abstract

Section: Discussionmentioning

confidence: 99%

Towards a Sharing Strategy for the Graph Rewriting Calculus

Baldan

Bertolissi

Cirstea

et al. 2008

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…The notion of a "reflective semantics" should be broadly understood as a semantics given in some (meta-)theory. In this sense, the more recent work in [3], giving semantics to strategies, including ELAN strategies, in the ρ-calculus can be understood as another flavor of a reflective semantics.…”

Section: Semantic Foundations Of Maude's Strategy Languagementioning

confidence: 99%

A Rewriting Semantics for Maude Strategies

Martí-Oliet

Meseguer

Verdejo

2009

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Intuitively, a strategy language is a way of taming the nondeterminism of a rewrite theory. We can think of a strategy language S as a rewrite theory transformation R → S(R) such that S(R) provides a way of executing R in a controlled way. One such theory transformation for the Maude strategy language is presented in detail in this paper. Progress in the semantic foundations of Maude's strategy language has led us to study some general requirements for strategy languages. Some of these requirements, like soundness and completeness with respect to the rewrites in R, are absolute requirements that every strategy language should fulfill. Other more optional requirements, that we call monotonicity and persistence, represent the fact that no solution is ever lost. We show that the Maude strategy language satisfies all these four requirements.

show abstract

“…For such definitions, we use an approach similar to the one used in [15] where rewrite strategies are encoded by rewrite rules. Let us consider, for the rewrite strategies given in Sect.…”

Section: Strategies As Abstractionsmentioning

confidence: 99%