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.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00098778
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:35:59 AM
Last modification on : Thursday, January 11, 2018 - 6:25:24 AM
Long-term archiving on : Friday, November 25, 2016 - 11:43:14 AM

Identifiers

  • 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⟩

Share

Metrics

Record views

163

Files downloads

119