Proc. of a conference on Functional programming languages and computer architecture
Refined compilation of pattern-matching for functional languages
Science of Computer Programming
Handbook of theoretical computer science (vol. B)
Software—Practice & Experience
Lazy rewriting on eager machinery
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compiling language definitions: the ASF+SDF compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
JITty: A Rewriter with Strategy Annotations
RTA '02 Proceedings of the 13th 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
Proceedings of the Third International Conference on Algebraic and Logic Programming
The complexity of unification.
The complexity of unification.
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
| Hi-index | 0.01 |
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation of two rewriters of the mCRL2 toolset. These rewriters work on open terms and use nonlinear match trees. A comparison is made with other commonly used efficient rewriters.