Rewriting with strategies in ELAN : a functional semantics
Identifieur interne : 009506 ( Main/Merge ); précédent : 009505; suivant : 009507Rewriting with strategies in ELAN : a functional semantics
Auteurs : Peter Borovansky ; Claude Kirchner ; Hélène Kirchner ; Christophe RingeissenSource :
- International Journal of Foundations of Computer Science ; 2001.
English descriptors
- KwdEn :
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.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 003099
- to stream Crin, to step Curation: 003099
- to stream Crin, to step Checkpoint: 001601
Links to Exploration step
CRIN:borovansky01aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="351">Rewriting with strategies in ELAN : a functional semantics</title></titleStmt><publicationStmt><idno type="RBID">CRIN:borovansky01a</idno><date when="2001" year="2001">2001</date><idno type="wicri:Area/Crin/Corpus">003099</idno><idno type="wicri:Area/Crin/Curation">003099</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003099</idno><idno type="wicri:Area/Crin/Checkpoint">001601</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001601</idno><idno type="wicri:Area/Main/Merge">009506</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Rewriting with strategies in ELAN : a functional semantics</title><author><name sortKey="Borovansky, Peter" sort="Borovansky, Peter" uniqKey="Borovansky P" first="Peter" last="Borovansky">Peter Borovansky</name></author><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name></author><author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name></author><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name></author></analytic><series><title level="j">International Journal of Foundations of Computer Science</title><imprint><date when="2001" type="published">2001</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>ewriting calculus</term><term>matching</term><term>rewrite based language</term><term>rewriting logic</term><term>strategy</term><term>term rewriting</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2227">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.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 009506 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 009506 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= CRIN:borovansky01a
|texte= Rewriting with strategies in ELAN : a functional semantics
}}
| This area was generated with Dilib version V0.6.33. |  |