The article introduces a novel notion of lazy rewriting. By annotating argument positions as lazy, redundant rewrite steps are avoided, and the termination behavior of a term-rewriting system can be improved. Some transformations of rewrite rules enable an implementation using the same primitives as an implementation of eager rewriting
In this paper we give an introduction to term rewriting and termination. Moreover, we sketch some de...
Strategy annotations have been used in several programming languages to improve termination and eff...
International audienceIn rule-based programming, properties of programs, such as termination, are in...
The article introduces a novel notion of lazy rewriting. By annotating argument positions as lazy, r...
textabstractWe define Lazy Term Rewriting Systems and show that they can be realized by local adapta...
AbstractLazy rewriting is a proper restriction of term rewriting that dynamically restricts the redu...
AbstractLazy rewriting is a proper restriction of term rewriting that dynamically restricts the redu...
AbstractLazy rewriting (LR) is intended to improve the termination behavior of TRSs. This is attempt...
This thesis considers three aspects of the (efficient) implementation of term rewrite systems. For e...
We present a procedure for transforming strongly sequential constructor-based term rewriting systems...
AbstractLazy rewriting (LR) is intended to improve the termination behavior of TRSs. This is attempt...
International audienceWe suggest a lazy evaluation semantics for first-order term rewriting with ass...
International audienceWe suggest a lazy evaluation semantics for first-order term rewriting with ass...
In this paper we give an introduction to term rewriting and termination. Moreover, we sketch some de...
In this paper we give an introduction to term rewriting and termination. Moreover, we sketch some de...
In this paper we give an introduction to term rewriting and termination. Moreover, we sketch some de...
Strategy annotations have been used in several programming languages to improve termination and eff...
International audienceIn rule-based programming, properties of programs, such as termination, are in...
The article introduces a novel notion of lazy rewriting. By annotating argument positions as lazy, r...
textabstractWe define Lazy Term Rewriting Systems and show that they can be realized by local adapta...
AbstractLazy rewriting is a proper restriction of term rewriting that dynamically restricts the redu...
AbstractLazy rewriting is a proper restriction of term rewriting that dynamically restricts the redu...
AbstractLazy rewriting (LR) is intended to improve the termination behavior of TRSs. This is attempt...
This thesis considers three aspects of the (efficient) implementation of term rewrite systems. For e...
We present a procedure for transforming strongly sequential constructor-based term rewriting systems...
AbstractLazy rewriting (LR) is intended to improve the termination behavior of TRSs. This is attempt...
International audienceWe suggest a lazy evaluation semantics for first-order term rewriting with ass...
International audienceWe suggest a lazy evaluation semantics for first-order term rewriting with ass...
In this paper we give an introduction to term rewriting and termination. Moreover, we sketch some de...
In this paper we give an introduction to term rewriting and termination. Moreover, we sketch some de...
In this paper we give an introduction to term rewriting and termination. Moreover, we sketch some de...
Strategy annotations have been used in several programming languages to improve termination and eff...
International audienceIn rule-based programming, properties of programs, such as termination, are in...
DOI
Add to ORKG