Rewriting with strategies in ELAN: a functional semantics

Abstract : 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.
Type de document :
Article dans une revue
International Journal of Foundations of Computer Science, World Scientific Publishing, 1999, 27 p
Liste complète des métadonnées

https://hal.inria.fr/inria-00098778
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:35:59
Dernière modification le : jeudi 11 janvier 2018 - 06:25:24
Document(s) archivé(s) le : vendredi 25 novembre 2016 - 11:43:14

Fichiers

Identifiants

  • HAL Id : inria-00098778, version 1

Collections

Citation

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, World Scientific Publishing, 1999, 27 p. 〈inria-00098778〉

Partager

Métriques

Consultations de la notice

134

Téléchargements de fichiers

95