Termination
Identifieur interne : 002467 ( Istex/Corpus ); précédent : 002466; suivant : 002468Termination
Auteurs : Nachum DershowitzSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: This survey describes methods for proving that systems of rewrite rules terminate. Illustrations of the use of path orderings and other simplification orderings in termination proofs are given. The effect of restrictions, such as linearity, on the form of rules is considered. In general, though, termination is an undecidable property of rewrite systems.
Url:
DOI: 10.1007/3-540-15976-2_9
Links to Exploration step
ISTEX:9CC267A80B902C7B3162DA1F201D0FC15C3224DALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Termination</title><author><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name><affiliation><mods:affiliation>Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois, USA</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:9CC267A80B902C7B3162DA1F201D0FC15C3224DA</idno><date when="1985" year="1985">1985</date><idno type="doi">10.1007/3-540-15976-2_9</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-4G4KPSNZ-V/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002467</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002467</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Termination</title><author><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name><affiliation><mods:affiliation>Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois, USA</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This survey describes methods for proving that systems of rewrite rules terminate. Illustrations of the use of path orderings and other simplification orderings in termination proofs are given. The effect of restrictions, such as linearity, on the form of rules is considered. In general, though, termination is an undecidable property of rewrite systems.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Nachum Dershowitz</name><affiliations><json:string>Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois, USA</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-4G4KPSNZ-V</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><abstract>Abstract: This survey describes methods for proving that systems of rewrite rules terminate. Illustrations of the use of path orderings and other simplification orderings in termination proofs are given. The effect of restrictions, such as linearity, on the form of rules is considered. In general, though, termination is an undecidable property of rewrite systems.</abstract><qualityIndicators><score>7.648</score><pdfWordCount>15252</pdfWordCount><pdfCharCount>77927</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>45</pdfPageCount><pdfPageSize>468 x 684 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>54</abstractWordCount><abstractCharCount>365</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Termination</title><chapterId><json:string>9</json:string><json:string>Chap9</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>1985</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>G. Goos</name></json:item><json:item><name>J. Hartmanis</name></json:item><json:item><name>D. Barstow</name></json:item><json:item><name>W. Brauer</name></json:item><json:item><name>P. Brinch Hansen</name></json:item><json:item><name>D. Gries</name></json:item><json:item><name>D. Luckham</name></json:item><json:item><name>C. Moler</name></json:item><json:item><name>A. Pnueli</name></json:item><json:item><name>G. Seegmüller</name></json:item><json:item><name>J. Stoer</name></json:item><json:item><name>N. Wirth</name></json:item></editor></serie><host><title>Rewriting Techniques and Applications</title><language><json:string>unknown</json:string></language><copyrightDate>1985</copyrightDate><doi><json:string>10.1007/3-540-15976-2</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-540-39679-6</json:string></eisbn><bookId><json:string>3540159762</json:string></bookId><isbn><json:string>978-3-540-15976-6</json:string></isbn><volume>202</volume><pages><first>180</first><last>224</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Jean-Pierre Jouannaud</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-4G4KPSNZ-V</json:string></ark><publicationDate>1985</publicationDate><copyrightDate>1985</copyrightDate><doi><json:string>10.1007/3-540-15976-2_9</json:string></doi><id>9CC267A80B902C7B3162DA1F201D0FC15C3224DA</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-4G4KPSNZ-V/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-4G4KPSNZ-V/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-4G4KPSNZ-V/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Termination</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag</licence></availability><date when="1985">1985</date></publicationStmt><notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Termination</title><author><persName><forename type="first">Nachum</forename><surname>Dershowitz</surname></persName><affiliation><orgName type="department">Department of Computer Science</orgName><orgName type="institution">University of Illinois at Urbana-Champaign</orgName><address><postCode>61801</postCode><settlement>Urbana</settlement><region>Illinois</region><country key="US">UNITED STATES</country></address></affiliation></author><idno type="istex">9CC267A80B902C7B3162DA1F201D0FC15C3224DA</idno><idno type="ark">ark:/67375/HCB-4G4KPSNZ-V</idno><idno type="DOI">10.1007/3-540-15976-2_9</idno></analytic><monogr><title level="m" type="main">Rewriting Techniques and Applications</title><title level="m" type="sub">Dijon, France, May 20–22, 1985</title><idno type="DOI">10.1007/3-540-15976-2</idno><idno type="book-id">3540159762</idno><idno type="ISBN">978-3-540-15976-6</idno><idno type="eISBN">978-3-540-39679-6</idno><idno type="chapter-id">Chap9</idno><editor><persName><forename type="first">Jean-Pierre</forename><surname>Jouannaud</surname></persName></editor><imprint><biblScope unit="vol">202</biblScope><biblScope unit="page" from="180">180</biblScope><biblScope unit="page" to="224">224</biblScope><biblScope unit="chapter-count">24</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><editor><persName><forename type="first">G.</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>Hartmanis</surname></persName></editor><editor><persName><forename type="first">D.</forename><surname>Barstow</surname></persName></editor><editor><persName><forename type="first">W.</forename><surname>Brauer</surname></persName></editor><editor><persName><forename type="first">P.</forename><surname>Brinch Hansen</surname></persName></editor><editor><persName><forename type="first">D.</forename><surname>Gries</surname></persName></editor><editor><persName><forename type="first">D.</forename><surname>Luckham</surname></persName></editor><editor><persName><forename type="first">C.</forename><surname>Moler</surname></persName></editor><editor><persName><forename type="first">A.</forename><surname>Pnueli</surname></persName></editor><editor><persName><forename type="first">G.</forename><surname>Seegmüller</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>Stoer</surname></persName></editor><editor><persName><forename type="first">N.</forename><surname>Wirth</surname></persName></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>This survey describes methods for proving that systems of rewrite rules terminate. Illustrations of the use of path orderings and other simplification orderings in termination proofs are given. The effect of restrictions, such as linearity, on the form of rules is considered. In general, though, termination is an undecidable property of rewrite systems.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I16048</label><item><term type="Secondary" subtype="priority-1">Mathematical Logic and Formal Languages</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-4G4KPSNZ-V/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Barstow</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>W.</GivenName><FamilyName>Brauer</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>P.</GivenName><FamilyName>Brinch Hansen</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Gries</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Luckham</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Moler</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>A.</GivenName><FamilyName>Pnueli</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Seegmüller</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Stoer</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>N.</GivenName><FamilyName>Wirth</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540159762</BookID><BookTitle>Rewriting Techniques and Applications</BookTitle><BookSubTitle>Dijon, France, May 20–22, 1985</BookSubTitle><BookVolumeNumber>202</BookVolumeNumber><BookDOI>10.1007/3-540-15976-2</BookDOI><BookTitleID>16176</BookTitleID><BookPrintISBN>978-3-540-15976-6</BookPrintISBN><BookElectronicISBN>978-3-540-39679-6</BookElectronicISBN><BookChapterCount>24</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1985</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16048" Priority="1" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Jean-Pierre</GivenName><FamilyName>Jouannaud</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap9" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>9</ChapterID><ChapterDOI>10.1007/3-540-15976-2_9</ChapterDOI><ChapterSequenceNumber>9</ChapterSequenceNumber><ChapterTitle Language="En">Termination</ChapterTitle><ChapterFirstPage>180</ChapterFirstPage><ChapterLastPage>224</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1985</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>5</Month><Day>29</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3540159762</BookID><BookTitle>Rewriting Techniques and Applications</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Nachum</GivenName><FamilyName>Dershowitz</FamilyName></AuthorName></Author><Affiliation ID="Aff1"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>University of Illinois at Urbana-Champaign</OrgName><OrgAddress><Postcode>61801</Postcode><City>Urbana</City><State>Illinois</State><Country>USA</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>This survey describes methods for proving that systems of rewrite rules terminate. Illustrations of the use of path orderings and other simplification orderings in termination proofs are given. The effect of restrictions, such as linearity, on the form of rules is considered. In general, though, termination is an undecidable property of rewrite systems.</Para></Abstract><ArticleNote Type="Misc"><SimplePara>The preparation of this survey was supported in part by the National Science Foundation under Grant MCS 83-07755.</SimplePara></ArticleNote></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Termination</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Termination</title></titleInfo><name type="personal"><namePart type="given">Nachum</namePart><namePart type="family">Dershowitz</namePart><affiliation>Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois, USA</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="ReviewPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">1985</dateIssued><copyrightDate encoding="w3cdtf">1985</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: This survey describes methods for proving that systems of rewrite rules terminate. Illustrations of the use of path orderings and other simplification orderings in termination proofs are given. The effect of restrictions, such as linearity, on the form of rules is considered. In general, though, termination is an undecidable property of rewrite systems.</abstract><relatedItem type="host"><titleInfo><title>Rewriting Techniques and Applications</title><subTitle>Dijon, France, May 20–22, 1985</subTitle></titleInfo><name type="personal"><namePart type="given">Jean-Pierre</namePart><namePart type="family">Jouannaud</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1985</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic></subject><identifier type="DOI">10.1007/3-540-15976-2</identifier><identifier type="ISBN">978-3-540-15976-6</identifier><identifier type="eISBN">978-3-540-39679-6</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">16176</identifier><identifier type="BookID">3540159762</identifier><identifier type="BookChapterCount">24</identifier><identifier type="BookVolumeNumber">202</identifier><part><date>1985</date><detail type="volume"><number>202</number><caption>vol.</caption></detail><extent unit="pages"><start>180</start><end>224</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1985</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Barstow</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">W.</namePart><namePart type="family">Brauer</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">P.</namePart><namePart type="family">Brinch Hansen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Gries</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Luckham</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Moler</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">A.</namePart><namePart type="family">Pnueli</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Seegmüller</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Stoer</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">N.</namePart><namePart type="family">Wirth</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1985</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag, 1985</recordOrigin></recordInfo></relatedItem><identifier type="istex">9CC267A80B902C7B3162DA1F201D0FC15C3224DA</identifier><identifier type="ark">ark:/67375/HCB-4G4KPSNZ-V</identifier><identifier type="DOI">10.1007/3-540-15976-2_9</identifier><identifier type="ChapterID">9</identifier><identifier type="ChapterID">Chap9</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1985</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag, 1985</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-4G4KPSNZ-V/record.json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002467 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002467 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:9CC267A80B902C7B3162DA1F201D0FC15C3224DA
|texte= Termination
}}
| This area was generated with Dilib version V0.6.33. |  |