… Rewriting technology has proved to be an adequate and powerful mechanism … be efficiently implemented using rewriting technology, but it also provides a firmer grip on the source code syntax. However, an important shortcoming of rewriting …
RULE 2000: [doi]… be expressed by means of rewrite rules. Typically, such sets of rewrite rules are highly ambiguous. Therefore, standard rewriting engines based on fixed, exhaustive … programming. In this paper we show how rewriting strategies for instruction selection can …
RTA 2002: 237-251 [doi]… The applicability of term rewriting to program transformation is limited … of rewrite rules. The first problem is addressed by languages supporting user-definable rewriting strate- gies. This paper addresses the second problem by extending …
ENTCS, 59(4):375-396, 2001. [doi]… This paper presents the main results and conclusions of the Third Rewrite Engines Competition (REC III). This edition of the competition took place as part of the 8th Workshop on Rewriting Logic and its Applications (WRLA 2010 …
WRLA 2010: 243-261 [doi]… The 2nd Rewrite Engines Competition (REC) was celebrated as part of the 7th Workshop on Rewriting Logic and its Applications (WRLA 2008). In this edition of the competition participated ve systems, namely ASF+SDF, Maude, Stratego/XT …
ENTCS, 238(3):281-291, 2009. [doi]… System S is a calculus providing the basic abstractions of term rewriting … of rewriting languages, or more generally, languages for specifying tree transformations. In this paper we show how a conventional rewriting language based …
ENTCS, 15:422-441, 1998. [doi]… User-definable strategies for the application of rewrite rules provide a means to construct transformation systems that apply rewrite rules in a controlled … is used to control the rewriting of terms using labeled rewrite rules. Rule …
ASF+SDF 1997:… Term rewriting can only be applied if practical implementations of term rewriting engines exist. New rewriting engines are designed and implemented either … for rapidly implementing the syntax and semantics of term rewriting based formalisms. We …
RTA 2003: 424-435 [doi]… Programming language semantics based on pure rewrite rules suffers from the gap between the rewriting strategy implemented in rewriting engines and the intended evaluation strategy. This paper shows how programmable rewriting strategies …
ENTCS, 65(3):57-76, 2002. [doi]… We present a method of specifying standard imperative pro- gram optimisations as a rewrite system. To achieve this we have extended the idea of matching sub … of these rewrites we add temporal logic side conditions. The combination of these features …
CC 2001: 52-68 [doi]… Term rewriting is an appealing technique for performing program analysis … but is not supported by standard term rewriting. We extend many-sorted, first-order term rewriting with traversal functions that automate tree traversal in a simple and type …
TOSEM, 12(2):152-190, 2003. [doi]… . For example, each basic constant rewrites directly to its type and each lambda expression rewrites to an arrow type whose domain is the type of the lambda’s formal …, rewrites to the range type. …
ESOP 2007: 426-440 [doi]… We describe a language for defining term rewriting strategies, and its … terms can be described by a set of rewrite rules; rewriting strategies are used … a set of labeled unconditional rewrite rules. We also define an extended language …
ICFP 1998: 13-26 [doi]… defined in rewriting logic. KOOL has been designed as an experimental language … of the flexibility provided by rewriting logic, which allows for the rapid … of rewriting logic. This support is illustrated with several examples. …
RTA 2007: 246-256 [doi]… The applicability of term rewriting to program transformation is limited by the lack of control over rule application and by the context-free nature of rewrite … rewriting strategies. The second problem is addressed by the extension …
FUIN, 69(1-2):123-178, 2006. [doi]… to Maude rewrite theories, for executing programs in the defined languages based on the Maude rewriting engine, and for analyzing programs by adapting various Maude …
In International Workshop on Rewriting Logic and Application. 2014: