HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

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 metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:35:59 AM
Last modification on : Friday, February 4, 2022 - 3:25:17 AM
Long-term archiving on: : Friday, November 25, 2016 - 11:43:14 AM




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, 2001, pp.27. ⟨10.1142/S0129054101000412⟩. ⟨inria-00098778⟩



Record views


Files downloads