… 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]… Term rewriting is an appealing technique for performing program analysis and program transformation. Tree (term) traversal is frequently used but is not supported by standard term rewriting. We extend many-sorted, first-order term …
TOSEM, 12(2):152-190, 2003. [doi]… Term rewriting is an appealing technique for performing program analysis and program transformation. Tree (term) traversal is frequently used but is not supported by standard term rewriting. In this paper, many-sorted first-order term …
ENTCS, 70(6):100-117, 2002. [doi]… We explore the connection between term rewriting systems (TRS) and aspect-oriented programming (AOP). Term rewriting is a para-digm that is used in fields … are available for only a handful of languages. Term rewriting can offer …
BIRTHDAY 2005: 88-105 [doi]… .
In this paper we propose to apply the paradigm of term rewriting … of a representation of ambiguous derivations. Then we extend term rewriting …
ENTCS, 82(3):575-591, 2003. [doi]… Over the past decade, researchers have found context-sensitive term-rewriting semantics to be powerful and expressive tools for modeling programming languages … interactively create and debug context-sensitive term-rewriting systems. We introduce …
RTA 2004: 301-311 [doi]… is strategic term rewriting in Haskell, as supported by the Strafunski bundle. Due …
FM 2005: 399-414 [doi]