AbstractInfinitary rewriting allows infinitely large terms and infinitely long reduction sequences. There are two computational motivations for studying these: the infinite data structures implicit in lazy functional programming, and the use of rewriting of possibly cyclic graphs as an implementation technique for functional languages.We survey the fundamental properties of infinitary rewriting in orthogonal term rewrite systems, and its relation to cyclic graph rewriting
AbstractIn this paper, we investigate the idea of controlling rewriting by strategies and we develop...
International audienceTerm rewriting has been used as a formal model to reason about the complexity ...
AbstractAlgebraic graph transformations visually support intuition, have a strong theoretical basis,...
In a previous paper we have established the theory of transfinite reduction for orthogonal term rewr...
AbstractIn this paper the concurrent semantics of double-pushout (DPO) graph rewriting, which is cla...
Introduced at the end of the nineties, the Rewriting Calculus (rho-calculus, for short) fully integr...
AbstractWe tackle the problem of cyclic term-graph rewriting. We first revisit the classical algorit...
AbstractInfinitary rewriting allows infinitely large terms and infinitely long reduction sequences. ...
AbstractTerm graph rewriting is a model for computing with graphs representing functional expression...
Several authors have investigated the correspondence between graph rewriting and term rewrit-ing. Al...
AbstractWe continue here the development of our description of the pullback approach to graph rewrit...
We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a ...
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is t...
Proof terms in term rewriting are a representation means for reduction sequences, and more in genera...
AbstractIn the first part of this talk, I will review the thought that led to the G-machine. In the ...
AbstractIn this paper, we investigate the idea of controlling rewriting by strategies and we develop...
International audienceTerm rewriting has been used as a formal model to reason about the complexity ...
AbstractAlgebraic graph transformations visually support intuition, have a strong theoretical basis,...
In a previous paper we have established the theory of transfinite reduction for orthogonal term rewr...
AbstractIn this paper the concurrent semantics of double-pushout (DPO) graph rewriting, which is cla...
Introduced at the end of the nineties, the Rewriting Calculus (rho-calculus, for short) fully integr...
AbstractWe tackle the problem of cyclic term-graph rewriting. We first revisit the classical algorit...
AbstractInfinitary rewriting allows infinitely large terms and infinitely long reduction sequences. ...
AbstractTerm graph rewriting is a model for computing with graphs representing functional expression...
Several authors have investigated the correspondence between graph rewriting and term rewrit-ing. Al...
AbstractWe continue here the development of our description of the pullback approach to graph rewrit...
We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a ...
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is t...
Proof terms in term rewriting are a representation means for reduction sequences, and more in genera...
AbstractIn the first part of this talk, I will review the thought that led to the G-machine. In the ...
AbstractIn this paper, we investigate the idea of controlling rewriting by strategies and we develop...
International audienceTerm rewriting has been used as a formal model to reason about the complexity ...
AbstractAlgebraic graph transformations visually support intuition, have a strong theoretical basis,...
DOI
Add to ORKG