Rewriting systems on FP expressions to reduce the number of sequences yielded
Identifieur interne : 000D85 ( PascalFrancis/Checkpoint ); précédent : 000D84; suivant : 000D86Rewriting systems on FP expressions to reduce the number of sequences yielded
Auteurs : F. Bellegarde ; M. SintzoffSource :
- Science of computer programming [ 508896 ] ; 1986.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
Règles de transformation basées sur l'algèbre des programmes fonctionnels
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:86-0392301Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Rewriting systems on FP expressions to reduce the number of sequences yielded</title>
<author><name sortKey="Bellegarde, F" sort="Bellegarde, F" uniqKey="Bellegarde F" first="F." last="Bellegarde">F. Bellegarde</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN</s1>
</inist:fA14>
<wicri:noCountry code="no comma">CRIN</wicri:noCountry>
</affiliation>
</author>
<author><name sortKey="Sintzoff, M" sort="Sintzoff, M" uniqKey="Sintzoff M" first="M." last="Sintzoff">M. Sintzoff</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">86-0392301</idno>
<date when="1986">1986</date>
<idno type="stanalyst">PASCAL 86-0392301 INIST</idno>
<idno type="RBID">Pascal:86-0392301</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000E13</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000A84</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000D85</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000D85</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Rewriting systems on FP expressions to reduce the number of sequences yielded</title>
<author><name sortKey="Bellegarde, F" sort="Bellegarde, F" uniqKey="Bellegarde F" first="F." last="Bellegarde">F. Bellegarde</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN</s1>
</inist:fA14>
<wicri:noCountry code="no comma">CRIN</wicri:noCountry>
</affiliation>
</author>
<author><name sortKey="Sintzoff, M" sort="Sintzoff, M" uniqKey="Sintzoff M" first="M." last="Sintzoff">M. Sintzoff</name>
</author>
</analytic>
<series><title level="j" type="main">Science of computer programming</title>
<title level="j" type="abbreviated">Sci. comput. program.</title>
<idno type="ISSN">508896</idno>
<imprint><date when="1986">1986</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Science of computer programming</title>
<title level="j" type="abbreviated">Sci. comput. program.</title>
<idno type="ISSN">508896</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Iterative program</term>
<term>Language theory</term>
<term>Rewriting</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Programme itératif</term>
<term>Réécriture</term>
<term>Théorie langage</term>
<term>Expression FP</term>
<term>Procédure Knuth-Bendix</term>
<term>Programme fonctionnel</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="fr">Règles de transformation basées sur l'algèbre des programmes fonctionnels</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="2"><s0>508896</s0>
</fA01>
<fA03 i2="1"><s0>Sci. comput. program.</s0>
</fA03>
<fA05><s2>6</s2>
</fA05>
<fA06><s2>1</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Rewriting systems on FP expressions to reduce the number of sequences yielded</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>BELLEGARDE (F.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>SINTZOFF (M.)</s1>
</fA11>
<fA14 i1="01"><s1>CRIN</s1>
</fA14>
<fA20><s1>11-34</s1>
</fA20>
<fA21><s1>1986</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>CNRS</s1>
</fA43>
<fA44><s0>0000</s0>
</fA44>
<fA45><s0>24 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>86-0392301</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i2="1"><s0>Science of computer programming</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="FRE"><s0>Règles de transformation basées sur l'algèbre des programmes fonctionnels</s0>
</fC01>
<fC02 i1="01" i2="2"><s0>001D02A02</s0>
</fC02>
<fC03 i1="01" i2="2" l="FRE"><s0>Programme itératif</s0>
</fC03>
<fC03 i1="02" i2="2" l="FRE"><s0>Réécriture</s0>
</fC03>
<fC03 i1="03" i2="2" l="FRE"><s0>Théorie langage</s0>
</fC03>
<fC03 i1="04" i2="2" l="FRE"><s0>Expression FP</s0>
</fC03>
<fC03 i1="05" i2="2" l="FRE"><s0>Procédure Knuth-Bendix</s0>
</fC03>
<fC03 i1="06" i2="2" l="FRE"><s0>Programme fonctionnel</s0>
</fC03>
<fC03 i1="01" i2="2" l="ENG"><s0>Iterative program</s0>
</fC03>
<fC03 i1="02" i2="2" l="ENG"><s0>Rewriting</s0>
</fC03>
<fC03 i1="03" i2="2" l="ENG"><s0>Language theory</s0>
</fC03>
<fC04 i1="01" i2="2"><s0>PM03!02,56</s0>
</fC04>
<fN21><s1>602</s1>
</fN21>
</pA>
</standard>
</inist>
<affiliations><list></list>
<tree><noCountry><name sortKey="Bellegarde, F" sort="Bellegarde, F" uniqKey="Bellegarde F" first="F." last="Bellegarde">F. Bellegarde</name>
<name sortKey="Sintzoff, M" sort="Sintzoff, M" uniqKey="Sintzoff M" first="M." last="Sintzoff">M. Sintzoff</name>
</noCountry>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000D85 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000D85 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= PascalFrancis |étape= Checkpoint |type= RBID |clé= Pascal:86-0392301 |texte= Rewriting systems on FP expressions to reduce the number of sequences yielded }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |