Proving weak properties of rewriting
Identifieur interne : 000875 ( PascalFrancis/Curation ); précédent : 000874; suivant : 000876Proving weak properties of rewriting
Auteurs : Isabelle Gnaedig [France] ; Hélène Kirchner [France]Source :
- Theoretical computer science [ 0304-3975 ] ; 2011.
Descripteurs français
- Pascal (Inist)
- Wicri :
English descriptors
- KwdEn :
Abstract
In rule-based programming, properties of programs, such as termination, are in general considered in their strong acceptance, i.e., on every computation branch. But in practice, they may hold in their weak acceptance only, i.e., on at least one computation branch. Moreover, weak properties are often enough to ensure that programs give the expected result. There are very few results to handle weak properties of rewriting. We address here two of them: termination and reducibility to a constructor form, in a unified framework allowing us to prove them inductively. Proof trees are developed, which simulate rewriting trees by narrowing and abstracting subterms. Our technique is constructive in the sense that proof trees can be used to infer an evaluation strategy for any given input: the right computation branch is developed without using a costly breadth-first strategy nor backtracking.
pA |
|
---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000138
Links to Exploration step
Pascal:11-0441752Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Proving weak properties of rewriting</title>
<author><name sortKey="Gnaedig, Isabelle" sort="Gnaedig, Isabelle" uniqKey="Gnaedig I" first="Isabelle" last="Gnaedig">Isabelle Gnaedig</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>INRIA & LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy 2-UHP), Campus Scientifique, BP 239</s1>
<s2>54506 Vandoeuvre-lés-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>INRIA, Centre de Recherche INRIA Bordeaux - Sud-Ouest, Bâilment A29. 351, Cours de la Libération</s1>
<s2>33405 Talence</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">11-0441752</idno>
<date when="2011">2011</date>
<idno type="stanalyst">PASCAL 11-0441752 INIST</idno>
<idno type="RBID">Pascal:11-0441752</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000138</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000875</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Proving weak properties of rewriting</title>
<author><name sortKey="Gnaedig, Isabelle" sort="Gnaedig, Isabelle" uniqKey="Gnaedig I" first="Isabelle" last="Gnaedig">Isabelle Gnaedig</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>INRIA & LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy 2-UHP), Campus Scientifique, BP 239</s1>
<s2>54506 Vandoeuvre-lés-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>INRIA, Centre de Recherche INRIA Bordeaux - Sud-Ouest, Bâilment A29. 351, Cours de la Libération</s1>
<s2>33405 Talence</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
<imprint><date when="2011">2011</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Backtracking</term>
<term>Completeness</term>
<term>Computer theory</term>
<term>Evaluation</term>
<term>Induction</term>
<term>Input</term>
<term>Programming</term>
<term>Proof</term>
<term>Reducibility</term>
<term>Rewriting</term>
<term>Termination</term>
<term>Tree</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Réécriture</term>
<term>Programmation</term>
<term>Borne électrique</term>
<term>Réductibilité</term>
<term>Preuve</term>
<term>Arbre</term>
<term>Evaluation</term>
<term>Entrée ordinateur</term>
<term>Backtracking</term>
<term>Complétude</term>
<term>Induction</term>
<term>68Q42</term>
<term>Terminaison programme</term>
<term>05C05</term>
<term>Sous terme</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Preuve</term>
<term>Arbre</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In rule-based programming, properties of programs, such as termination, are in general considered in their strong acceptance, i.e., on every computation branch. But in practice, they may hold in their weak acceptance only, i.e., on at least one computation branch. Moreover, weak properties are often enough to ensure that programs give the expected result. There are very few results to handle weak properties of rewriting. We address here two of them: termination and reducibility to a constructor form, in a unified framework allowing us to prove them inductively. Proof trees are developed, which simulate rewriting trees by narrowing and abstracting subterms. Our technique is constructive in the sense that proof trees can be used to infer an evaluation strategy for any given input: the right computation branch is developed without using a costly breadth-first strategy nor backtracking.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0304-3975</s0>
</fA01>
<fA02 i1="01"><s0>TCSCDI</s0>
</fA02>
<fA03 i2="1"><s0>Theor. comput. sci.</s0>
</fA03>
<fA05><s2>412</s2>
</fA05>
<fA06><s2>34</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Proving weak properties of rewriting</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>GNAEDIG (Isabelle)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>KIRCHNER (Hélène)</s1>
</fA11>
<fA14 i1="01"><s1>INRIA & LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy 2-UHP), Campus Scientifique, BP 239</s1>
<s2>54506 Vandoeuvre-lés-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>INRIA, Centre de Recherche INRIA Bordeaux - Sud-Ouest, Bâilment A29. 351, Cours de la Libération</s1>
<s2>33405 Talence</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>4405-4438</s1>
</fA20>
<fA21><s1>2011</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>17243</s2>
<s5>354000191262920020</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2011 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>47 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>11-0441752</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Theoretical computer science</s0>
</fA64>
<fA66 i1="01"><s0>GBR</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>In rule-based programming, properties of programs, such as termination, are in general considered in their strong acceptance, i.e., on every computation branch. But in practice, they may hold in their weak acceptance only, i.e., on at least one computation branch. Moreover, weak properties are often enough to ensure that programs give the expected result. There are very few results to handle weak properties of rewriting. We address here two of them: termination and reducibility to a constructor form, in a unified framework allowing us to prove them inductively. Proof trees are developed, which simulate rewriting trees by narrowing and abstracting subterms. Our technique is constructive in the sense that proof trees can be used to infer an evaluation strategy for any given input: the right computation branch is developed without using a costly breadth-first strategy nor backtracking.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A08</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A05</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001A02B01C</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Réécriture</s0>
<s5>17</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Rewriting</s0>
<s5>17</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Reescritura</s0>
<s5>17</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Programmation</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Programming</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Programación</s0>
<s5>18</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Borne électrique</s0>
<s5>19</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Termination</s0>
<s5>19</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Borne eléctrico</s0>
<s5>19</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Réductibilité</s0>
<s5>20</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Reducibility</s0>
<s5>20</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Reductibilidad</s0>
<s5>20</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Preuve</s0>
<s5>21</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Proof</s0>
<s5>21</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Prueba</s0>
<s5>21</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Arbre</s0>
<s5>22</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Tree</s0>
<s5>22</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Arbol</s0>
<s5>22</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Evaluation</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Evaluation</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Evaluación</s0>
<s5>23</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Entrée ordinateur</s0>
<s5>24</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Input</s0>
<s5>24</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Entrada ordenador</s0>
<s5>24</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Backtracking</s0>
<s5>25</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Backtracking</s0>
<s5>25</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Backtracking</s0>
<s5>25</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Complétude</s0>
<s5>26</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Completeness</s0>
<s5>26</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Completitud</s0>
<s5>26</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Induction</s0>
<s5>27</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Induction</s0>
<s5>27</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA"><s0>Inducción</s0>
<s5>27</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>68Q42</s0>
<s4>INC</s4>
<s5>70</s5>
</fC03>
<fC03 i1="14" i2="X" l="FRE"><s0>Terminaison programme</s0>
<s4>INC</s4>
<s5>71</s5>
</fC03>
<fC03 i1="15" i2="X" l="FRE"><s0>05C05</s0>
<s4>INC</s4>
<s5>72</s5>
</fC03>
<fC03 i1="16" i2="X" l="FRE"><s0>Sous terme</s0>
<s4>INC</s4>
<s5>73</s5>
</fC03>
<fN21><s1>305</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
</inist>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000875 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000875 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= PascalFrancis |étape= Curation |type= RBID |clé= Pascal:11-0441752 |texte= Proving weak properties of rewriting }}
This area was generated with Dilib version V0.6.33. |