Process algebra
Generation of formatters for context-free languages
ACM Transactions on Software Engineering and Methodology (TOSEM)
Language Prototyping: An Algebraic Specification Approach: Vol. V
Language Prototyping: An Algebraic Specification Approach: Vol. V
Proof Theory for muCRL: A Language for Processes with Data
Proceedings of the International Workshop on Semantics of Specification Languages (SoSL)
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Building program optimizers with rewriting strategies
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
The use of a strategy language for solving search problems
Annals of Mathematics and Artificial Intelligence
Warm fusion in Stratego: A case study in generation of program transformation systems
Annals of Mathematics and Artificial Intelligence
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Program Transformation with Scoped Dynamic Rewrite Rules
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
Stratego/XT 0.17. A language and toolset for program transformation
Science of Computer Programming
A survey of strategies in rule-based program transformation systems
Journal of Symbolic Computation
Automated evaluation of syntax error recovery
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
Program Transformation with Scoped Dynamic Rewrite Rules
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
Programming errors in traversal programs over structured data
Science of Computer Programming
The strategy challenge in SMT solving
Automated Reasoning and Mathematics
| Hi-index | 0.00 |
User-definable strategies for the application of rewrite rules provide a means to construct transformation systems that apply rewrite rules in a controlled way. This paper describes a strategy language and its interpretation. The language is used to control the rewriting of terms using labeled rewrite rules. Rule labels are atomic strategies. Compound strategies are formed by means of sequential composition, nondeterministic choice, left choice, fixed point recursion, and two primitives for expressing term traversal. Several complex strategies such as bottom-up and top-down application and (parallel) innermost and (parallel) outermost reduction can be defined in terms of these primitives. The paper contains two case studies of the application of strategies.