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
Conference papers

A functional view of rewriting and strategies for a semantics of ELAN

Peter Borovansky 1 Claude Kirchner Hélène Kirchner
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper, 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 define 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 show how this calculus can be defined and we study some of its properties. Its implementation in the ELAN language is used to motivate and exemplify the whole approach.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Monday, September 25, 2006 - 5:04:04 PM
Last modification on : Friday, February 4, 2022 - 3:30:15 AM


  • HAL Id : inria-00098628, version 1



Peter Borovansky, Claude Kirchner, Hélène Kirchner. A functional view of rewriting and strategies for a semantics of ELAN. The Third Fuji International Symposium on Functional and Logic Programming, 1998, Kyoto (Japan), pp.143-167. ⟨inria-00098628⟩



Record views