… is strategic term rewriting in Haskell, as supported by the Strafunski bundle. Due …
FM 2005: 399-414 [doi]… -free program calculation, and strategic term rewriting. We formalize the coupled … steps are modeled by so-called two-level rewrite rules on type expressions that synthesize conversion functions between redex and reduct while rewriting …
ENTCS, 200(3):3-23, 2008. [doi]… we discuss three examples of strategic pattern matching: (1) Contextual rules … and building instantiations of first-order term patterns. The language supports concise formulation of generic and data type-specific term traversals. One …
RTA 1999: 30-44 [doi]… strategies. We capture strategic polymorphism by just two primitive combinators … and type-specific behaviour. Functional strategies transpose the notion of term rewriting strategies (with coverage of traversal) to the functional programming …
corr, cs.PL/0212048, 2002. [doi]… and implementing an aspect extension for and in a rule-based term rewriting system. … these concerns. In this paper we describe an extension to the Stratego term rewriting language for capturing such properties. We show our aspect language offers …
ENTCS, 147(1):5-30, 2006. [doi]… and implementing an aspect extension for and in a rule-based term rewriting system. … for separating these concerns. In this paper we describe an extension to the Stratego term rewriting language for capturing such properties. We show our aspect language …
Technical Report UU-CS-2005-030, 2005.