1st international workshop on Conditional Term Rewriting Systems
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A meta-environment for generating programming environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
Prototyping Completion with Constraints Using Computational Systems
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
A Compiler for Nondeterministic Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Strategies of ELAN: meta-interpretation and partial evaluation
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
We introduce computational systems to formalise the notion of rewriting directed by user defined strategies. This provides a semantics for ELAN, an environment dedicated to prototype, experiment and study the combination of different deduction systems for constraint solving, theorem proving and logic programming paradigms. Formally, a computational system can be represented as a rewrite theory in rewriting logic together with a notion of strategy to select relevant computations. We show how conveniently the strategies can also be specified using again computational systems. Several non-trivial examples of strategy description are described including a search space library and its use for solving problems like game winning strategies.