Conditional rewrite rules: Confluence and termination
Journal of Computer and System Sciences
Notes on the elimination of conditions
1st international workshop on Conditional Term Rewriting Systems
A rationale for conditional equational programming
Theoretical Computer Science - Special issue on the international conference on fifth generation computer systems. Tokyo, 1988
Essentials of programming languages
Essentials of programming languages
The discoveries of continuations
Lisp and Symbolic Computation - Special issue on continuations—part I
Journal of Symbolic Computation
Advanced topics in term rewriting
Advanced topics in term rewriting
Stratego: A Language for Program Transformation Based on Rewriting Strategies
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
How to Transform Canonical Decreasing CTRSs into Equivalent Canonical TRSs
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
Conditional narrowing without conditions
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Transformation for Refining Unraveled Conditional Term Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Converting between combinatory reduction systems and big step semantics
Semantics and algebraic specification
Computationally equivalent elimination of conditions
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
An automated technique to translate conditional rewrite rules into unconditional ones is presented, which is suitable to implement, or compile, conditional rewriting on top of much simpler and easier to optimize unconditional rewrite systems. An experiment performed on world's fastest conditional rewriting engines shows that speedups for conditional rewriting of an order of magnitude can already be obtained by applying the presented technique as a front-end transformation.