AbstractIn the present paper a uniform description of the algebraic properties of derivations in a rewriting system, and of their syntax and semantics is proposed on the base of a polycategory structure. Similarity relations between derivations are studied on syntax and semantic levels. Several canonical derivation forms are described
. Monads can be used to model term rewriting systems by generalising the well-known equivalence betw...
• ♦ Let k be a commutative unitary ring. An algebra in this talk means an associative k-algebra that...
AbstractThere is a variety of different approaches to the specification of software systems based on...
AbstractIn the present paper a uniform description of the algebraic properties of derivations in a r...
The basic algebraic structures within the categories of derivations determined by rewriting systems ...
We study a class of general rewriting system derivations called canonical derivations. For context-f...
International audienceWhen rewriting is used to generate convergent and complete rewrite systems in ...
This paper defines and presents a method of inheritance for structures that are defined by rewrite r...
The derivation process in rewriting systems, especially in Chomskyan grammars, can be seen as consis...
We show that processes defined by equational identities together with conditional rewrite rules in P...
Many systems are at least partly or implicitly based on term rewriting. Examples are functional lang...
AbstractIn this paper we present a theory of binding structures, and give examples of its applicatio...
Contribution à un ouvrage.This chapter introduces term rewriting and some of its applications from d...
In the last years there has been a growing interest towards categorical models for term rewriting sy...
This thesis is primarily concerned with the algebraic semantics of non-terminating term rewriting sy...
. Monads can be used to model term rewriting systems by generalising the well-known equivalence betw...
• ♦ Let k be a commutative unitary ring. An algebra in this talk means an associative k-algebra that...
AbstractThere is a variety of different approaches to the specification of software systems based on...
AbstractIn the present paper a uniform description of the algebraic properties of derivations in a r...
The basic algebraic structures within the categories of derivations determined by rewriting systems ...
We study a class of general rewriting system derivations called canonical derivations. For context-f...
International audienceWhen rewriting is used to generate convergent and complete rewrite systems in ...
This paper defines and presents a method of inheritance for structures that are defined by rewrite r...
The derivation process in rewriting systems, especially in Chomskyan grammars, can be seen as consis...
We show that processes defined by equational identities together with conditional rewrite rules in P...
Many systems are at least partly or implicitly based on term rewriting. Examples are functional lang...
AbstractIn this paper we present a theory of binding structures, and give examples of its applicatio...
Contribution à un ouvrage.This chapter introduces term rewriting and some of its applications from d...
In the last years there has been a growing interest towards categorical models for term rewriting sy...
This thesis is primarily concerned with the algebraic semantics of non-terminating term rewriting sy...
. Monads can be used to model term rewriting systems by generalising the well-known equivalence betw...
• ♦ Let k be a commutative unitary ring. An algebra in this talk means an associative k-algebra that...
AbstractThere is a variety of different approaches to the specification of software systems based on...
DOI
Add to ORKG