Lazy Rewriting Modulo Associativity and Commutativity
Résumé
We suggest a lazy evaluation semantics for first-order term rewriting with associative and commutative function symbols, known as AC-rewriting. The AC-matching produces a lazy list of solutions: a first substitution besides a non-evaluated object that encodes the remaining computations. We extend lazy rule application to usual traversal strategies.