In defence of programming language design
Selected and updated papers from the proceedings of the 1982 European conference on Progress in artificial intelligence
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing in Systems Described by Equations
Computing in Systems Described by Equations
An interpreter generator using tree pattern matching
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Theorem-Proving Approach to the Knuth-Bendix Completion Algorithm
EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
The algorithm description language ALDES (report)
ACM SIGSAM Bulletin
A fine-grained parallel completion procedure
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Synthesizing recurrence relations I: analysis of the problems
ACM SIGSAM Bulletin
Pattern matching algebraic identities
ACM SIGSAM Bulletin
| Hi-index | 0.00 |
A general algorithm for reduction with algebraic term rewriting systems is presented and several aspects of rewriting are discussed.It turns out that the well known strategies of innermost and outermost rewriting, which are special cases of the general algorithm, exhibit good performance under different aspects. The general rewriting algorithm suggests improvements for naive reduction algorithms with specific strategies, which in some cases give them better asymptotic behaviour. Empirical results with an algebraic axiomatization of natural numbers show considerably faster runtimes for the improved algorithms.The algorithms presented here do not impose any restrictions on the rewriting systems. They are currently used both within an implementation of the Knuth-Bendix completion algorithm and in a separate term reduction system, whenever sufficiently large terms are involved.