POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Term rewriting and all that
Term Rewriting Systems
Incremental Construction of Unification Algorithms in Equational Theories
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Stratego: A Language for Program Transformation Based on Rewriting Strategies
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Journal of Automated Reasoning
Tinycals: Step by Step Tacticals
Electronic Notes in Theoretical Computer Science (ENTCS)
Language and Automata Theory and Applications
A Unified Sequent Calculus for Focused Proofs
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Towards a Strategy Language for Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
ESOP'07 Proceedings of the 16th European conference on Programming
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
A tactic language for the system Coq
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Tom: piggybacking rewriting on java
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Hi-index | 0.00 |
Numerous computational and deductive frameworks use the notion of strategy to guide reduction and search space exploration, making the macro scale control of micro operations an explicit object of interest. In recent works, abstract strategies have been defined in extension but also intensionally. In this paper we complete these views with a new declarative approach based on constraints, which are used to model the different parts of a strategy. This procedure allows us to express elaborate strategies in a declarative and reusable way.