Rewriting system on FP expressions that reduces the number of sequences yielded
Identifieur interne : 000250 ( Crin/Curation ); précédent : 000249; suivant : 000251Rewriting system on FP expressions that reduces the number of sequences yielded
Auteurs : F. BellegardeSource :
- Science of Computer Programming ; 1986.
English descriptors
- KwdEn :
Abstract
Ce papier est la version développée de l'article présenté à la conférence "LISP and Functional Programming" en 1984. We are concerned in transforming FP programs so as to minimize the number of intermediate sequences appearing in FP expressions that express iterative programs. Because FP expressions are often required to run on a Von Neumann machine, it would be useful to eliminate unecessary intermediate sequences. We propose transformation rules based on the algebra of functional programs. In contrast with many other systems of rules for program transformation, the sets of rules presented here are convergent (i.e. finitely terminating and confluent). These rewriting systems are produced by the Knuth-Bendix procedure applied to an initial set of equations and correspond to equations that are valid in the algebra of functional programs. Essentially, the paper relates our experience in using REVE to process a large set of equations and shows the actual limitations. Finally an outline of future research is proposed.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000250
Links to Exploration step
CRIN:bellegarde85aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="fr" wicri:score="-94">Rewriting system on FP expressions that reduces the number of sequences yielded</title></titleStmt><publicationStmt><idno type="RBID">CRIN:bellegarde85a</idno><date when="1986" year="1986">1986</date><idno type="wicri:Area/Crin/Corpus">000250</idno><idno type="wicri:Area/Crin/Curation">000250</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">000250</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="fr">Rewriting system on FP expressions that reduces the number of sequences yielded</title><author><name sortKey="Bellegarde, F" sort="Bellegarde, F" uniqKey="Bellegarde F" first="F." last="Bellegarde">F. Bellegarde</name></author></analytic><series><title level="j">Science of Computer Programming</title><imprint><date when="1986" type="published">1986</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>rewriting</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1844">Ce papier est la version développée de l'article présenté à la conférence "LISP and Functional Programming" en 1984. We are concerned in transforming FP programs so as to minimize the number of intermediate sequences appearing in FP expressions that express iterative programs. Because FP expressions are often required to run on a Von Neumann machine, it would be useful to eliminate unecessary intermediate sequences. We propose transformation rules based on the algebra of functional programs. In contrast with many other systems of rules for program transformation, the sets of rules presented here are convergent (i.e. finitely terminating and confluent). These rewriting systems are produced by the Knuth-Bendix procedure applied to an initial set of equations and correspond to equations that are valid in the algebra of functional programs. Essentially, the paper relates our experience in using REVE to process a large set of equations and shows the actual limitations. Finally an outline of future research is proposed.</div></front></TEI><BibTex type="article"><ref>bellegarde85a</ref><crinnumber>85-R-026</crinnumber><category>1</category><equipe>INCONNUE</equipe><author><e>Bellegarde, F.</e></author><title>Rewriting system on FP expressions that reduces the number of sequences yielded</title><journal>Science of Computer Programming</journal><year>1986</year><volume>6</volume><number>1</number><pages>11-34</pages><month>Jan</month><keywords><e>rewriting</e></keywords><abstract>Ce papier est la version développée de l'article présenté à la conférence "LISP and Functional Programming" en 1984. We are concerned in transforming FP programs so as to minimize the number of intermediate sequences appearing in FP expressions that express iterative programs. Because FP expressions are often required to run on a Von Neumann machine, it would be useful to eliminate unecessary intermediate sequences. We propose transformation rules based on the algebra of functional programs. In contrast with many other systems of rules for program transformation, the sets of rules presented here are convergent (i.e. finitely terminating and confluent). These rewriting systems are produced by the Knuth-Bendix procedure applied to an initial set of equations and correspond to equations that are valid in the algebra of functional programs. Essentially, the paper relates our experience in using REVE to process a large set of equations and shows the actual limitations. Finally an outline of future research is proposed.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000250 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 000250 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Curation
|type= RBID
|clé= CRIN:bellegarde85a
|texte= Rewriting system on FP expressions that reduces the number of sequences yielded
}}
| This area was generated with Dilib version V0.6.33. |  |