Rewriting is the repeated transformation of a structured object according to a set of rules. This simple concept has turned out to have a rich variety of elaborations, giving rise to many different theoretical frameworks for reasoning about computation. Aside from its theoretical importance, rewriting has also been a significant influence on the design and implementation of real programming languages, most notably the functional and logic programming families of languages. For a theoretical perspective on the place of rewriting in Computer Science, see for example [14]. For a programming language perspective, see for example [16]
AbstractThe Rewriting Calculus has been proposed as a language for defining term rewriting strategie...
AbstractThis paper presents an abstract treatment of the foundations of rewriting logic, generalisin...
K is an algebraic framework for defining programming languages. It consists of a technique and of a ...
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational s...
Many systems are at least partly or implicitly based on term rewriting. Examples are functional lang...
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
AbstractWe present a formalism called Addressed Term Rewriting Systems, which can be used to define ...
Contribution à un ouvrage.This chapter introduces term rewriting and some of its applications from d...
We show how programming language semantics and definitions of their corresponding type systems can b...
Abstract. Object-oriented language concepts have been highly success-ful, resulting in a large numbe...
Abstract. Rewriting logic is an executable logical framework well suited for the semantic definition...
In this paper, we present an overview of our method of specifying the semantics of programming langu...
Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics a...
Article dans revue scientifique avec comité de lecture.First-order languages based on rewrite rules ...
Rewriting logic [Mes92] is a logic of action, whose models are concurrent systems and whose deductio...
AbstractThe Rewriting Calculus has been proposed as a language for defining term rewriting strategie...
AbstractThis paper presents an abstract treatment of the foundations of rewriting logic, generalisin...
K is an algebraic framework for defining programming languages. It consists of a technique and of a ...
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational s...
Many systems are at least partly or implicitly based on term rewriting. Examples are functional lang...
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
AbstractWe present a formalism called Addressed Term Rewriting Systems, which can be used to define ...
Contribution à un ouvrage.This chapter introduces term rewriting and some of its applications from d...
We show how programming language semantics and definitions of their corresponding type systems can b...
Abstract. Object-oriented language concepts have been highly success-ful, resulting in a large numbe...
Abstract. Rewriting logic is an executable logical framework well suited for the semantic definition...
In this paper, we present an overview of our method of specifying the semantics of programming langu...
Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics a...
Article dans revue scientifique avec comité de lecture.First-order languages based on rewrite rules ...
Rewriting logic [Mes92] is a logic of action, whose models are concurrent systems and whose deductio...
AbstractThe Rewriting Calculus has been proposed as a language for defining term rewriting strategie...
AbstractThis paper presents an abstract treatment of the foundations of rewriting logic, generalisin...
K is an algebraic framework for defining programming languages. It consists of a technique and of a ...