Add to ORKGInternational audienceWe 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
The article introduces a novel notion of lazy rewriting. By annotating argument positions as lazy, r...
Abstract. We present an on-going work that aims at providing tactics for rewriting modulo associativ...
AbstractLazy rewriting is a proper restriction of term rewriting that dynamically restricts the redu...
International audienceWe suggest a lazy evaluation semantics for first-order term rewriting with ass...
We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of...
We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solu-tions o...
Extended version of hal-00642515 written in 2012International audienceWe define a lazy pattern-match...
Extended version of hal-00642515 written in 2012International audienceWe define a lazy pattern-match...
textabstractWe define Lazy Term Rewriting Systems and show that they can be realized by local adapta...
Article dans revue scientifique avec comité de lecture.First-order languages based on rewrite rules ...
Colloque avec actes et comité de lecture.We address the problem of term normalisation modulo Associa...
. We address the problem of term normalisation modulo associativecommutative (AC) theories, and desc...
Contribution à un ouvrage.This chapter introduces term rewriting and some of its applications from d...
A new criterion for termination of rewriting has been described by Arts and Giesl in 1997. We show h...
We present an associative-commutative paramodulation calculus that generalizes the associative-commu...
The article introduces a novel notion of lazy rewriting. By annotating argument positions as lazy, r...
Abstract. We present an on-going work that aims at providing tactics for rewriting modulo associativ...
AbstractLazy rewriting is a proper restriction of term rewriting that dynamically restricts the redu...
International audienceWe suggest a lazy evaluation semantics for first-order term rewriting with ass...
We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of...
We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solu-tions o...
Extended version of hal-00642515 written in 2012International audienceWe define a lazy pattern-match...
Extended version of hal-00642515 written in 2012International audienceWe define a lazy pattern-match...
textabstractWe define Lazy Term Rewriting Systems and show that they can be realized by local adapta...
Article dans revue scientifique avec comité de lecture.First-order languages based on rewrite rules ...
Colloque avec actes et comité de lecture.We address the problem of term normalisation modulo Associa...
. We address the problem of term normalisation modulo associativecommutative (AC) theories, and desc...
Contribution à un ouvrage.This chapter introduces term rewriting and some of its applications from d...
A new criterion for termination of rewriting has been described by Arts and Giesl in 1997. We show h...
We present an associative-commutative paramodulation calculus that generalizes the associative-commu...
The article introduces a novel notion of lazy rewriting. By annotating argument positions as lazy, r...
Abstract. We present an on-going work that aims at providing tactics for rewriting modulo associativ...
AbstractLazy rewriting is a proper restriction of term rewriting that dynamically restricts the redu...