Lazy Rewriting Modulo Associativity and Commutativity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Lazy Rewriting Modulo Associativity and Commutativity

Abstract

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.
No file

Dates and versions

hal-00642515 , version 1 (18-11-2011)

Identifiers

  • HAL Id : hal-00642515 , version 1

Cite

Walid Belkhir, Alain Giorgetti. Lazy Rewriting Modulo Associativity and Commutativity. WRS 2011, 10-th Int. workshop on Reduction Strategies in Rewriting and Programming, May 2011, Novi Sad, Serbia. pp.17--21. ⟨hal-00642515⟩
170 View
0 Download

Share

Gmail Facebook X LinkedIn More