Lazy rewriting and eager machinery

Applications and extensions of context-sensitive rewriting

“…In [83] the lazy graph rewriting of [43,73] is formalized as term rewriting over labeled terms which carry information about the reducibility state of the positions in the term: eager, if they can be freely reduced, or lazy if they block reductions (on, and also below them) until some activation condition is raised. The intended labeling starts from the root of a term t, which is always labeled as eager (e); then, for each subterm f (t 1 , .…”

Infinitary rewriting: meta-theory and convergence

“…-A "lazy signature" (Σ ,Λ ) [19,18] has a predicate Λ ⊂ F × N such that Λ (F, i) signifies that F is "lazy" in its i-th argument position. Given this, the simple term metric g is defined through its components:…”