InforLorV4, PascalFrancis, Corpus, bibRecord, 000434

Abstract canonical presentations

Identifieur interne : 000434 ( PascalFrancis/Corpus ); précédent : 000433; suivant : 000435

Abstract canonical presentations

Auteurs : Nachum Dershowitz ; Claude Kirchner

Source :

Theoretical computer science [ 0304-3975 ] ; 2006.

RBID : Pascal:06-0371738

Descripteurs français

Pascal (Inist)
- Complétion, Forme normale, Saturation, Redondance, Réécriture, Informatique théorique, Problème mot, Logique équationnelle, Réécriture canonique, Canonicité, Relation ordre preuve.

English descriptors

KwdEn :
- Canonical rewriting, Canonicity, Completion, Computer theory, Equational logic, Normal form, Proof ordering, Redundancy, Rewriting, Saturation.

Abstract

Solving goals-like proving properties, deciding word problems or resolving constraints-is much easier with some presentations of the underlying theory than with others. Typically, what have been called "completion processes", in particular in the study of equational logic, involve finding appropriate presentations of a given theory to more easily solve a given class of problems. We provide a general proof-theoretic setting that relies directly on the fundamental concept of "good", that is, normal-form, proofs, itself defined using well-founded orderings on proof objects. This foundational framework allows for abstract definitions of canonical presentations and very general characterizations of saturation and redundancy criteria.

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 357`
A06				`@2 1-3`
A08	`01`	`1`	`ENG`	`@1 Abstract canonical presentations`
A09	`01`	`1`	`ENG`	`@1 Clifford lectures and the mathematical foundations of programmming semantics, New Orleans, March 20-26, 2002`
A11	`01`	`1`		`@1 DERSHOWITZ (Nachum)`
A11	`02`	`1`		`@1 KIRCHNER (Claude)`
A12	`01`	`1`		`@1 ARTEMOV (Sergei) @9 ed.`
A12	`02`	`1`		`@1 MISLOVE (Michael) @9 ed.`
A14	`01`			`@1 School of Computer Science, Tel Aviv University, P.O. Box 39040, RamatAviv @2 Tel Aviv 69978 @3 ISR @Z 1 aut.`
A14	`02`			`@1 JNRJA & LORIA, 615, rue du Jardin Botanique, B.P 101 @2 54602 WIers-les-Nancy @3 FRA @Z 2 aut.`
A15	`01`			`@1 Computer Science, CUNY Graduate Center, 365 Fifth Avenue @2 New York, NY 10016 @3 USA @Z 1 aut.`
A15	`02`			`@1 Department of Mathematics, Tulane University @2 New Orleans, LA 70118 @3 USA @Z 2 aut.`
A20				`@1 53-69`
A21				`@1 2006`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 17243 @5 354000138873780040`
A44				`@0 0000 @1 © 2006 INIST-CNRS. All rights reserved.`
A45				`@0 46 ref.`
A47	`01`	`1`		`@0 06-0371738`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Theoretical computer science`
A66	`01`			`@0 NLD`
C01	`01`		`ENG`	@0 Solving goals-like proving properties, deciding word problems or resolving constraints-is much easier with some presentations of the underlying theory than with others. Typically, what have been called "completion processes", in particular in the study of equational logic, involve finding appropriate presentations of a given theory to more easily solve a given class of problems. We provide a general proof-theoretic setting that relies directly on the fundamental concept of "good", that is, normal-form, proofs, itself defined using well-founded orderings on proof objects. This foundational framework allows for abstract definitions of canonical presentations and very general characterizations of saturation and redundancy criteria.
C02	`01`	`X`		`@0 001D02B07B`
C02	`02`	`X`		`@0 001A02A01B`
C02	`03`	`X`		`@0 001A02A01F`
C03	`01`	`X`	`FRE`	`@0 Complétion @5 20`
C03	`01`	`X`	`ENG`	`@0 Completion @5 20`
C03	`01`	`X`	`SPA`	`@0 Compleción @5 20`
C03	`02`	`X`	`FRE`	`@0 Forme normale @5 22`
C03	`02`	`X`	`ENG`	`@0 Normal form @5 22`
C03	`02`	`X`	`SPA`	`@0 Forma normal @5 22`
C03	`03`	`X`	`FRE`	`@0 Saturation @5 27`
C03	`03`	`X`	`ENG`	`@0 Saturation @5 27`
C03	`03`	`X`	`SPA`	`@0 Saturación @5 27`
C03	`04`	`X`	`FRE`	`@0 Redondance @5 28`
C03	`04`	`X`	`ENG`	`@0 Redundancy @5 28`
C03	`04`	`X`	`SPA`	`@0 Redundancia @5 28`
C03	`05`	`X`	`FRE`	`@0 Réécriture @5 29`
C03	`05`	`X`	`ENG`	`@0 Rewriting @5 29`
C03	`05`	`X`	`SPA`	`@0 Reescritura @5 29`
C03	`06`	`X`	`FRE`	`@0 Informatique théorique @5 30`
C03	`06`	`X`	`ENG`	`@0 Computer theory @5 30`
C03	`06`	`X`	`SPA`	`@0 Informática teórica @5 30`
C03	`07`	`X`	`FRE`	`@0 Problème mot @4 INC @5 70`
C03	`08`	`X`	`FRE`	`@0 Logique équationnelle @4 CD @5 96`
C03	`08`	`X`	`ENG`	`@0 Equational logic @4 CD @5 96`
C03	`09`	`X`	`FRE`	`@0 Réécriture canonique @4 CD @5 97`
C03	`09`	`X`	`ENG`	`@0 Canonical rewriting @4 CD @5 97`
C03	`10`	`X`	`FRE`	`@0 Canonicité @4 CD @5 98`
C03	`10`	`X`	`ENG`	`@0 Canonicity @4 CD @5 98`
C03	`11`	`X`	`FRE`	`@0 Relation ordre preuve @4 CD @5 99`
C03	`11`	`X`	`ENG`	`@0 Proof ordering @4 CD @5 99`
N21				`@1 247`

A30	`01`	`1`	`ENG`	`@1 2002 Clifford Lectures @3 New Orleans, LA USA @4 2002-03-20`
A30	`02`	`1`	`ENG`	`@1 Workshop on the Mathematical Foundations of Programming Semantics @2 18 @3 New Orleans, LA USA @4 2002-03-20`

Format Inist (serveur)

NO :	PASCAL 06-0371738 INIST
ET :	Abstract canonical presentations
AU :	DERSHOWITZ (Nachum); KIRCHNER (Claude); ARTEMOV (Sergei); MISLOVE (Michael)
AF :	School of Computer Science, Tel Aviv University, P.O. Box 39040, RamatAviv/Tel Aviv 69978/Israël (1 aut.); JNRJA & LORIA, 615, rue du Jardin Botanique, B.P 101/54602 WIers-les-Nancy/France (2 aut.); Computer Science, CUNY Graduate Center, 365 Fifth Avenue/New York, NY 10016/Etats-Unis (1 aut.); Department of Mathematics, Tulane University/New Orleans, LA 70118/Etats-Unis (2 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 2006; Vol. 357; No. 1-3; Pp. 53-69; Bibl. 46 ref.
LA :	Anglais
EA :	Solving goals-like proving properties, deciding word problems or resolving constraints-is much easier with some presentations of the underlying theory than with others. Typically, what have been called "completion processes", in particular in the study of equational logic, involve finding appropriate presentations of a given theory to more easily solve a given class of problems. We provide a general proof-theoretic setting that relies directly on the fundamental concept of "good", that is, normal-form, proofs, itself defined using well-founded orderings on proof objects. This foundational framework allows for abstract definitions of canonical presentations and very general characterizations of saturation and redundancy criteria.
CC :	001D02B07B; 001A02A01B; 001A02A01F
FD :	Complétion; Forme normale; Saturation; Redondance; Réécriture; Informatique théorique; Problème mot; Logique équationnelle; Réécriture canonique; Canonicité; Relation ordre preuve
ED :	Completion; Normal form; Saturation; Redundancy; Rewriting; Computer theory; Equational logic; Canonical rewriting; Canonicity; Proof ordering
SD :	Compleción; Forma normal; Saturación; Redundancia; Reescritura; Informática teórica
LO :	INIST-17243.354000138873780040
ID :	06-0371738

Links to Exploration step

Pascal:06-0371738

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Abstract canonical presentations</title>
<author><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name>
<affiliation><inist:fA14 i1="01"><s1>School of Computer Science, Tel Aviv University, P.O. Box 39040, RamatAviv</s1>
<s2>Tel Aviv 69978</s2>
<s3>ISR</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<affiliation><inist:fA14 i1="02"><s1>JNRJA & LORIA, 615, rue du Jardin Botanique, B.P 101</s1>
<s2>54602 WIers-les-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">06-0371738</idno>
<date when="2006">2006</date>
<idno type="stanalyst">PASCAL 06-0371738 INIST</idno>
<idno type="RBID">Pascal:06-0371738</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000434</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Abstract canonical presentations</title>
<author><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name>
<affiliation><inist:fA14 i1="01"><s1>School of Computer Science, Tel Aviv University, P.O. Box 39040, RamatAviv</s1>
<s2>Tel Aviv 69978</s2>
<s3>ISR</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<affiliation><inist:fA14 i1="02"><s1>JNRJA & LORIA, 615, rue du Jardin Botanique, B.P 101</s1>
<s2>54602 WIers-les-Nancy</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="2006">2006</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>Canonical rewriting</term>
<term>Canonicity</term>
<term>Completion</term>
<term>Computer theory</term>
<term>Equational logic</term>
<term>Normal form</term>
<term>Proof ordering</term>
<term>Redundancy</term>
<term>Rewriting</term>
<term>Saturation</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Complétion</term>
<term>Forme normale</term>
<term>Saturation</term>
<term>Redondance</term>
<term>Réécriture</term>
<term>Informatique théorique</term>
<term>Problème mot</term>
<term>Logique équationnelle</term>
<term>Réécriture canonique</term>
<term>Canonicité</term>
<term>Relation ordre preuve</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Solving goals-like proving properties, deciding word problems or resolving constraints-is much easier with some presentations of the underlying theory than with others. Typically, what have been called "completion processes", in particular in the study of equational logic, involve finding appropriate presentations of a given theory to more easily solve a given class of problems. We provide a general proof-theoretic setting that relies directly on the fundamental concept of "good", that is, normal-form, proofs, itself defined using well-founded orderings on proof objects. This foundational framework allows for abstract definitions of canonical presentations and very general characterizations of saturation and redundancy criteria.</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>357</s2>
</fA05>
<fA06><s2>1-3</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Abstract canonical presentations</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Clifford lectures and the mathematical foundations of programmming semantics, New Orleans, March 20-26, 2002</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>DERSHOWITZ (Nachum)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>KIRCHNER (Claude)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>ARTEMOV (Sergei)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>MISLOVE (Michael)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>School of Computer Science, Tel Aviv University, P.O. Box 39040, RamatAviv</s1>
<s2>Tel Aviv 69978</s2>
<s3>ISR</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>JNRJA & LORIA, 615, rue du Jardin Botanique, B.P 101</s1>
<s2>54602 WIers-les-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>Computer Science, CUNY Graduate Center, 365 Fifth Avenue</s1>
<s2>New York, NY 10016</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA15 i1="02"><s1>Department of Mathematics, Tulane University</s1>
<s2>New Orleans, LA 70118</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</fA15>
<fA20><s1>53-69</s1>
</fA20>
<fA21><s1>2006</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>17243</s2>
<s5>354000138873780040</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2006 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>46 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>06-0371738</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Theoretical computer science</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Solving goals-like proving properties, deciding word problems or resolving constraints-is much easier with some presentations of the underlying theory than with others. Typically, what have been called "completion processes", in particular in the study of equational logic, involve finding appropriate presentations of a given theory to more easily solve a given class of problems. We provide a general proof-theoretic setting that relies directly on the fundamental concept of "good", that is, normal-form, proofs, itself defined using well-founded orderings on proof objects. This foundational framework allows for abstract definitions of canonical presentations and very general characterizations of saturation and redundancy criteria.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B07B</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001A02A01B</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001A02A01F</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Complétion</s0>
<s5>20</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Completion</s0>
<s5>20</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Compleción</s0>
<s5>20</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Forme normale</s0>
<s5>22</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Normal form</s0>
<s5>22</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Forma normal</s0>
<s5>22</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Saturation</s0>
<s5>27</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Saturation</s0>
<s5>27</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Saturación</s0>
<s5>27</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Redondance</s0>
<s5>28</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Redundancy</s0>
<s5>28</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Redundancia</s0>
<s5>28</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Réécriture</s0>
<s5>29</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Rewriting</s0>
<s5>29</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Reescritura</s0>
<s5>29</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>30</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>30</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>30</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Problème mot</s0>
<s4>INC</s4>
<s5>70</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Logique équationnelle</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Equational logic</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Réécriture canonique</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Canonical rewriting</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Canonicité</s0>
<s4>CD</s4>
<s5>98</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Canonicity</s0>
<s4>CD</s4>
<s5>98</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Relation ordre preuve</s0>
<s4>CD</s4>
<s5>99</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Proof ordering</s0>
<s4>CD</s4>
<s5>99</s5>
</fC03>
<fN21><s1>247</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>2002 Clifford Lectures</s1>
<s3>New Orleans, LA USA</s3>
<s4>2002-03-20</s4>
</fA30>
<fA30 i1="02" i2="1" l="ENG"><s1>Workshop on the Mathematical Foundations of Programming Semantics</s1>
<s2>18</s2>
<s3>New Orleans, LA USA</s3>
<s4>2002-03-20</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 06-0371738 INIST</NO>
<ET>Abstract canonical presentations</ET>
<AU>DERSHOWITZ (Nachum); KIRCHNER (Claude); ARTEMOV (Sergei); MISLOVE (Michael)</AU>
<AF>School of Computer Science, Tel Aviv University, P.O. Box 39040, RamatAviv/Tel Aviv 69978/Israël (1 aut.); JNRJA & LORIA, 615, rue du Jardin Botanique, B.P 101/54602 WIers-les-Nancy/France (2 aut.); Computer Science, CUNY Graduate Center, 365 Fifth Avenue/New York, NY 10016/Etats-Unis (1 aut.); Department of Mathematics, Tulane University/New Orleans, LA 70118/Etats-Unis (2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 2006; Vol. 357; No. 1-3; Pp. 53-69; Bibl. 46 ref.</SO>
<LA>Anglais</LA>
<EA>Solving goals-like proving properties, deciding word problems or resolving constraints-is much easier with some presentations of the underlying theory than with others. Typically, what have been called "completion processes", in particular in the study of equational logic, involve finding appropriate presentations of a given theory to more easily solve a given class of problems. We provide a general proof-theoretic setting that relies directly on the fundamental concept of "good", that is, normal-form, proofs, itself defined using well-founded orderings on proof objects. This foundational framework allows for abstract definitions of canonical presentations and very general characterizations of saturation and redundancy criteria.</EA>
<CC>001D02B07B; 001A02A01B; 001A02A01F</CC>
<FD>Complétion; Forme normale; Saturation; Redondance; Réécriture; Informatique théorique; Problème mot; Logique équationnelle; Réécriture canonique; Canonicité; Relation ordre preuve</FD>
<ED>Completion; Normal form; Saturation; Redundancy; Rewriting; Computer theory; Equational logic; Canonical rewriting; Canonicity; Proof ordering</ED>
<SD>Compleción; Forma normal; Saturación; Redundancia; Reescritura; Informática teórica</SD>
<LO>INIST-17243.354000138873780040</LO>
<ID>06-0371738</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 000434 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000434 | 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:06-0371738
   |texte=   Abstract canonical presentations
}}

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

Abstract canonical presentations

Abstract canonical presentations

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