Metalevel transformation of strategies

The Maude strategy language

“…For example, srewrite 0 b 0 using right * at the metalevel is: Using its metarepresentation, the strategy language can be extended in different ways. In [51], a general schema for extending the language at the metalevel is presented and applied to some constructs of other languages that are directly available in Maude, as discussed in Section 7. They are the congruence operators from ELAN/Stratego and generic traversals from Stratego.…”

“…The strategy language has already been applied to several examples related to semantics of programming languages [26,11,37], proof systems [3,53,57], the ambient calculus [44], neural networks [55], membrane computing [3,53], games [51], a Sudoku solver [54], etc. In this section we show the features of the strategy language in action with examples from different fields:…”

“…This is also the case for congruence operators that make each symbol f in the signature a strategy combinator such that f (α 1 , ..., α n ) applies the given strategies to the corresponding subterms. In [51], these combinators have been implemented in Maude at the metalevel using matchrew operators, which can be seen as their counterparts in this language. Generic traversals have been addressed in [51] using a similar reflective strategy transformation, but we briefly describe here how they can be written by hand.…”

“…In [51], these combinators have been implemented in Maude at the metalevel using matchrew operators, which can be seen as their counterparts in this language. Generic traversals have been addressed in [51] using a similar reflective strategy transformation, but we briefly describe here how they can be written by hand. Specifically, the three primitives or one-step descent operators of Stratego are all, to apply a strategy to all the direct subterms of the subject term; some, to apply a strategy to all the children in which it does not fail, and as long as it succeeds in at least one; and one, to apply the strategy to the first subterm in which it succeeds from left to right.…”

Strategies, model checking and branching-time properties in Maude

“…Hence, we extended the builtin Maude LTL model checker [33] to support them [71]. It has already been given various applications [4,74,73].…”