Rewriting with strategies in ELAN: a functional semantics - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue International Journal of Foundations of Computer Science Année : 2001

Rewriting with strategies in ELAN: a functional semantics

Résumé

In this work, we consider term rewriting from a functional point of view. A rewrite rule is a function that can be applied to a term using an explicit application function. From this starting point, we show how to build more elaborated functions, describing first rewrite derivations, then sets of derivations. These functions, that we call strategies, can themselves be defined by rewrite rules and the construction can be iterated leading to higher-order strategies. Furthermore, the application function is itself defined using rewriting in the same spirit. We present this calculus and study its properties. Its implementation in the ELAN language is used to motivate and exemplify the whole approach. The expressiveness of ELAN is illustrated by examples of polymorphic functions and strategies.
Fichier principal
Vignette du fichier
99-R-229.pdf (354.84 Ko) Télécharger le fichier

Dates et versions

inria-00098778 , version 1 (26-09-2006)

Identifiants

Citer

Peter Borovansky, Claude Kirchner, Hélène Kirchner, Christophe Ringeissen. Rewriting with strategies in ELAN: a functional semantics. International Journal of Foundations of Computer Science, 2001, pp.27. ⟨10.1142/S0129054101000412⟩. ⟨inria-00098778⟩
193 Consultations
238 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More