InforLorV4, PascalFrancis, Corpus, bibRecord, 000138

Proving weak properties of rewriting

Identifieur interne : 000138 ( PascalFrancis/Corpus ); précédent : 000137; suivant : 000139

Proving weak properties of rewriting

Auteurs : Isabelle Gnaedig ; Hélène Kirchner

Source :

Theoretical computer science [ 0304-3975 ] ; 2011.

RBID : Pascal:11-0441752

Descripteurs français

Pascal (Inist)
- Informatique théorique, Réécriture, Programmation, Borne électrique, Réductibilité, Preuve, Arbre, Evaluation, Entrée ordinateur, Backtracking, Complétude, Induction, 68Q42, Terminaison programme, 05C05, Sous terme.

English descriptors

KwdEn :
- Backtracking, Completeness, Computer theory, Evaluation, Induction, Input, Programming, Proof, Reducibility, Rewriting, Termination, Tree.

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.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0304-3975`
A02	`01`			`@0 TCSCDI`
A03		`1`		`@0 Theor. comput. sci.`
A05				`@2 412`
A06				`@2 34`
A08	`01`	`1`	`ENG`	`@1 Proving weak properties of rewriting`
A11	`01`	`1`		`@1 GNAEDIG (Isabelle)`
A11	`02`	`1`		`@1 KIRCHNER (Hélène)`
A14	`01`			`@1 INRIA & LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy 2-UHP), Campus Scientifique, BP 239 @2 54506 Vandoeuvre-lés-Nancy @3 FRA @Z 1 aut.`
A14	`02`			`@1 INRIA, Centre de Recherche INRIA Bordeaux - Sud-Ouest, Bâilment A29. 351, Cours de la Libération @2 33405 Talence @3 FRA @Z 2 aut.`
A20				`@1 4405-4438`
A21				`@1 2011`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 17243 @5 354000191262920020`
A44				`@0 0000 @1 © 2011 INIST-CNRS. All rights reserved.`
A45				`@0 47 ref.`
A47	`01`	`1`		`@0 11-0441752`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Theoretical computer science`
A66	`01`			`@0 GBR`
C01	`01`		`ENG`	@0 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.
C02	`01`	`X`		`@0 001D02A08`
C02	`02`	`X`		`@0 001D02A05`
C02	`03`	`X`		`@0 001A02B01C`
C03	`01`	`X`	`FRE`	`@0 Informatique théorique @5 01`
C03	`01`	`X`	`ENG`	`@0 Computer theory @5 01`
C03	`01`	`X`	`SPA`	`@0 Informática teórica @5 01`
C03	`02`	`X`	`FRE`	`@0 Réécriture @5 17`
C03	`02`	`X`	`ENG`	`@0 Rewriting @5 17`
C03	`02`	`X`	`SPA`	`@0 Reescritura @5 17`
C03	`03`	`X`	`FRE`	`@0 Programmation @5 18`
C03	`03`	`X`	`ENG`	`@0 Programming @5 18`
C03	`03`	`X`	`SPA`	`@0 Programación @5 18`
C03	`04`	`X`	`FRE`	`@0 Borne électrique @5 19`
C03	`04`	`X`	`ENG`	`@0 Termination @5 19`
C03	`04`	`X`	`SPA`	`@0 Borne eléctrico @5 19`
C03	`05`	`X`	`FRE`	`@0 Réductibilité @5 20`
C03	`05`	`X`	`ENG`	`@0 Reducibility @5 20`
C03	`05`	`X`	`SPA`	`@0 Reductibilidad @5 20`
C03	`06`	`X`	`FRE`	`@0 Preuve @5 21`
C03	`06`	`X`	`ENG`	`@0 Proof @5 21`
C03	`06`	`X`	`SPA`	`@0 Prueba @5 21`
C03	`07`	`X`	`FRE`	`@0 Arbre @5 22`
C03	`07`	`X`	`ENG`	`@0 Tree @5 22`
C03	`07`	`X`	`SPA`	`@0 Arbol @5 22`
C03	`08`	`X`	`FRE`	`@0 Evaluation @5 23`
C03	`08`	`X`	`ENG`	`@0 Evaluation @5 23`
C03	`08`	`X`	`SPA`	`@0 Evaluación @5 23`
C03	`09`	`X`	`FRE`	`@0 Entrée ordinateur @5 24`
C03	`09`	`X`	`ENG`	`@0 Input @5 24`
C03	`09`	`X`	`SPA`	`@0 Entrada ordenador @5 24`
C03	`10`	`X`	`FRE`	`@0 Backtracking @5 25`
C03	`10`	`X`	`ENG`	`@0 Backtracking @5 25`
C03	`10`	`X`	`SPA`	`@0 Backtracking @5 25`
C03	`11`	`X`	`FRE`	`@0 Complétude @5 26`
C03	`11`	`X`	`ENG`	`@0 Completeness @5 26`
C03	`11`	`X`	`SPA`	`@0 Completitud @5 26`
C03	`12`	`X`	`FRE`	`@0 Induction @5 27`
C03	`12`	`X`	`ENG`	`@0 Induction @5 27`
C03	`12`	`X`	`SPA`	`@0 Inducción @5 27`
C03	`13`	`X`	`FRE`	`@0 68Q42 @4 INC @5 70`
C03	`14`	`X`	`FRE`	`@0 Terminaison programme @4 INC @5 71`
C03	`15`	`X`	`FRE`	`@0 05C05 @4 INC @5 72`
C03	`16`	`X`	`FRE`	`@0 Sous terme @4 INC @5 73`
N21				`@1 305`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

Format Inist (serveur)

NO :	PASCAL 11-0441752 INIST
ET :	Proving weak properties of rewriting
AU :	GNAEDIG (Isabelle); KIRCHNER (Hélène)
AF :	INRIA & LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy 2-UHP), Campus Scientifique, BP 239/54506 Vandoeuvre-lés-Nancy/France (1 aut.); INRIA, Centre de Recherche INRIA Bordeaux - Sud-Ouest, Bâilment A29. 351, Cours de la Libération/33405 Talence/France (2 aut.)
DT :	Publication en série; Niveau analytique
SO :	Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Royaume-Uni; Da. 2011; Vol. 412; No. 34; Pp. 4405-4438; Bibl. 47 ref.
LA :	Anglais
EA :	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.
CC :	001D02A08; 001D02A05; 001A02B01C
FD :	Informatique théorique; Réécriture; Programmation; Borne électrique; Réductibilité; Preuve; Arbre; Evaluation; Entrée ordinateur; Backtracking; Complétude; Induction; 68Q42; Terminaison programme; 05C05; Sous terme
ED :	Computer theory; Rewriting; Programming; Termination; Reducibility; Proof; Tree; Evaluation; Input; Backtracking; Completeness; Induction
SD :	Informática teórica; Reescritura; Programación; Borne eléctrico; Reductibilidad; Prueba; Arbol; Evaluación; Entrada ordenador; Backtracking; Completitud; Inducción
LO :	INIST-17243.354000191262920020
ID :	11-0441752

Links to Exploration step

Pascal:11-0441752

Le 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><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>
</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><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>
</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>
</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><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>
</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><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>
</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>
</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>
<server><NO>PASCAL 11-0441752 INIST</NO>
<ET>Proving weak properties of rewriting</ET>
<AU>GNAEDIG (Isabelle); KIRCHNER (Hélène)</AU>
<AF>INRIA & LORIA (UMR 7503 CNRS-INPL-INRIA-Nancy 2-UHP), Campus Scientifique, BP 239/54506 Vandoeuvre-lés-Nancy/France (1 aut.); INRIA, Centre de Recherche INRIA Bordeaux - Sud-Ouest, Bâilment A29. 351, Cours de la Libération/33405 Talence/France (2 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Royaume-Uni; Da. 2011; Vol. 412; No. 34; Pp. 4405-4438; Bibl. 47 ref.</SO>
<LA>Anglais</LA>
<EA>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.</EA>
<CC>001D02A08; 001D02A05; 001A02B01C</CC>
<FD>Informatique théorique; Réécriture; Programmation; Borne électrique; Réductibilité; Preuve; Arbre; Evaluation; Entrée ordinateur; Backtracking; Complétude; Induction; 68Q42; Terminaison programme; 05C05; Sous terme</FD>
<ED>Computer theory; Rewriting; Programming; Termination; Reducibility; Proof; Tree; Evaluation; Input; Backtracking; Completeness; Induction</ED>
<SD>Informática teórica; Reescritura; Programación; Borne eléctrico; Reductibilidad; Prueba; Arbol; Evaluación; Entrada ordenador; Backtracking; Completitud; Inducción</SD>
<LO>INIST-17243.354000191262920020</LO>
<ID>11-0441752</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000138 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000138 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:11-0441752
   |texte=   Proving weak properties of rewriting
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Proving weak properties of rewriting

Proving weak properties of rewriting

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri