Results 1 -
4 of
4
The Stratego Library
- Institute of Information and Computing Sciences, Universiteit
, 2000
"... This document documents all modules in the library. For a tutorial on the usage of Stratego see [2]. The Stratego reference manual [1] explains the constructs of the language. Other publications on Stratego can be found on the Stratego web page: http://www.cs.uu.nl/~visser/stratego/ ..."
Abstract
-
Cited by 7 (5 self)
- Add to MetaCart
This document documents all modules in the library. For a tutorial on the usage of Stratego see [2]. The Stratego reference manual [1] explains the constructs of the language. Other publications on Stratego can be found on the Stratego web page: http://www.cs.uu.nl/~visser/stratego/
The Stratego Reference Manual
- Utrecht University
, 2000
"... ING FROM PATTERNS WITH OVERLAYS 37 Section: Rules module Stratego-Overlays exports %%sorts Overlay context-free syntax Identifier ("(" {Identifier ","}* ")")? "=" Term -> Overlay {cons("Overlay")} Figure 21: Syntax of overlays 38 Section: Connecting CONNECTING TO THE WORLD THROUGH PRIMITIVES 39 S ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
ING FROM PATTERNS WITH OVERLAYS 37 Section: Rules module Stratego-Overlays exports %%sorts Overlay context-free syntax Identifier ("(" {Identifier ","}* ")")? "=" Term -> Overlay {cons("Overlay")} Figure 21: Syntax of overlays 38 Section: Connecting CONNECTING TO THE WORLD THROUGH PRIMITIVES 39 Section: Connecting module Stratego-Primitives.sdf exports context-free syntax "prim" "(" String ")" -> Strat Figure 22: Syntax of primitives 40 Section: Related Work REFERENCES TO RELATED WORK The application of Stratego is described in several publications. 41 Section: Related Work BIBLIOGRAPHY ...
Evaluation Strategies for Term Rewriting Systems
, 2002
"... Term rewriting systems are widely used in computer science as a model of computation to relate syntax and semantics. In order to implement term rewriting system we need to use a strategy since there are many reduction sequences from a term in general. A strategy chooses one from such sequences. It i ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Term rewriting systems are widely used in computer science as a model of computation to relate syntax and semantics. In order to implement term rewriting system we need to use a strategy since there are many reduction sequences from a term in general. A strategy chooses one from such sequences. It is a function that takes a term to be rewritten and returns a term obtained by rewriting from the input term. There are two wellknown strategies: innermost strategies (or eager evaluation) and outermost strategies (or lazy evaluation). Innermost strategies can be implemented much more efficiently than outermost ones, while outermost strategies often have a better termination behavior than innermost ones. The evaluation strategy (the E-strategy), which is adopted by the family of OBJ algebraic specification languages, is one of the compromises between them. The E-strategy is more flexible than other fixed order of evaluation because each function symbol can have its own local strategy...

