Modular aspects of rewrite-based specifications
Identifieur interne : 002A30 ( Istex/Corpus ); précédent : 002A29; suivant : 002A31Modular aspects of rewrite-based specifications
Auteurs : Bernhard GramlichSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We investigate modular properties of term rewriting systems, the basic operational formalism for equational specifications. First we study sufficient conditions for the preservation of the termination property under disjoint (and more general) combinations of term rewriting systems. By means of a refined analysis of existing approaches we show how to prove several new asymmetric preservation results. For this purpose we introduce two interesting new properties of term rewriting systems related to collapsing reductions: uniquely collapsing and collapsing confluent. We discuss these properties w.r.t. well-known confluence, and normal form properties, and show that they are modular consistency for left-linear systems, but not in general.
Url:
DOI: 10.1007/3-540-64299-4_38
Links to Exploration step
ISTEX:B270C2C0FC00DCB4847699C160BC8BDD052B789BLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Modular aspects of rewrite-based specifications</title><author><name sortKey="Gramlich, Bernhard" sort="Gramlich, Bernhard" uniqKey="Gramlich B" first="Bernhard" last="Gramlich">Bernhard Gramlich</name><affiliation><mods:affiliation>INRIA Lorraine & CRIN, BP 101, 54602, Villers-lés-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: gramlich@loria.fr</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B270C2C0FC00DCB4847699C160BC8BDD052B789B</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1007/3-540-64299-4_38</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-VWZZRW10-2/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002A30</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002A30</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Modular aspects of rewrite-based specifications</title><author><name sortKey="Gramlich, Bernhard" sort="Gramlich, Bernhard" uniqKey="Gramlich B" first="Bernhard" last="Gramlich">Bernhard Gramlich</name><affiliation><mods:affiliation>INRIA Lorraine & CRIN, BP 101, 54602, Villers-lés-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: gramlich@loria.fr</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: We investigate modular properties of term rewriting systems, the basic operational formalism for equational specifications. First we study sufficient conditions for the preservation of the termination property under disjoint (and more general) combinations of term rewriting systems. By means of a refined analysis of existing approaches we show how to prove several new asymmetric preservation results. For this purpose we introduce two interesting new properties of term rewriting systems related to collapsing reductions: uniquely collapsing and collapsing confluent. We discuss these properties w.r.t. well-known confluence, and normal form properties, and show that they are modular consistency for left-linear systems, but not in general.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Bernhard Gramlich</name><affiliations><json:string>INRIA Lorraine & CRIN, BP 101, 54602, Villers-lés-Nancy, France</json:string><json:string>E-mail: gramlich@loria.fr</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-VWZZRW10-2</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><abstract>Abstract: We investigate modular properties of term rewriting systems, the basic operational formalism for equational specifications. First we study sufficient conditions for the preservation of the termination property under disjoint (and more general) combinations of term rewriting systems. By means of a refined analysis of existing approaches we show how to prove several new asymmetric preservation results. For this purpose we introduce two interesting new properties of term rewriting systems related to collapsing reductions: uniquely collapsing and collapsing confluent. We discuss these properties w.r.t. well-known confluence, and normal form properties, and show that they are modular consistency for left-linear systems, but not in general.</abstract><qualityIndicators><refBibsNative>false</refBibsNative><abstractWordCount>104</abstractWordCount><abstractCharCount>754</abstractCharCount><keywordCount>0</keywordCount><score>8.248</score><pdfWordCount>7837</pdfWordCount><pdfCharCount>34086</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>16</pdfPageCount><pdfPageSize>440 x 666 pts</pdfPageSize></qualityIndicators><title>Modular aspects of rewrite-based specifications</title><chapterId><json:string>14</json:string><json:string>Chap14</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>1998</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>Gerhard Goos</name></json:item><json:item><name>Juris Hartmanis</name></json:item><json:item><name>Jan van Leeuwen</name></json:item></editor></serie><host><title>Recent Trends in Algebraic Development Techniques</title><language><json:string>unknown</json:string></language><copyrightDate>1998</copyrightDate><doi><json:string>10.1007/3-540-64299-4</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-69719-0</json:string></eisbn><bookId><json:string>3540642994</json:string></bookId><isbn><json:string>978-3-540-64299-2</json:string></isbn><volume>1376</volume><pages><first>253</first><last>268</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Francesco Parisi Presicce</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Software Engineering</value></json:item><json:item><value>Programming Languages, Compilers, Interpreters</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-VWZZRW10-2</json:string></ark><publicationDate>1998</publicationDate><copyrightDate>1998</copyrightDate><doi><json:string>10.1007/3-540-64299-4_38</json:string></doi><id>B270C2C0FC00DCB4847699C160BC8BDD052B789B</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-VWZZRW10-2/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-VWZZRW10-2/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-VWZZRW10-2/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Modular aspects of rewrite-based specifications</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag</licence></availability><date when="1998">1998</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">Modular aspects of rewrite-based specifications</title><author><persName><forename type="first">Bernhard</forename><surname>Gramlich</surname></persName><email>gramlich@loria.fr</email><affiliation><orgName type="institution">INRIA Lorraine & CRIN</orgName><address><postBox>BP 101</postBox><postCode>54602</postCode><settlement>Villers-lés-Nancy</settlement><country key="FR">FRANCE</country></address></affiliation></author><idno type="istex">B270C2C0FC00DCB4847699C160BC8BDD052B789B</idno><idno type="ark">ark:/67375/HCB-VWZZRW10-2</idno><idno type="DOI">10.1007/3-540-64299-4_38</idno></analytic><monogr><title level="m" type="main">Recent Trends in Algebraic Development Techniques</title><title level="m" type="sub">12th International Workshop, WADT'97 Tarquinia, Italy, June 3–7, 1997 Selected Papers</title><idno type="DOI">10.1007/3-540-64299-4</idno><idno type="book-id">3540642994</idno><idno type="ISBN">978-3-540-64299-2</idno><idno type="eISBN">978-3-540-69719-0</idno><idno type="chapter-id">Chap14</idno><editor><persName><forename type="first">Francesco</forename><forename type="first">Parisi</forename><surname>Presicce</surname></persName></editor><imprint><biblScope unit="vol">1376</biblScope><biblScope unit="page" from="253">253</biblScope><biblScope unit="page" to="268">268</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">Gerhard</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName></editor><editor><persName><forename type="first">Jan</forename><nameLink>van</nameLink><surname>Leeuwen</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>We investigate modular properties of term rewriting systems, the basic operational formalism for equational specifications. First we study sufficient conditions for the preservation of the termination property under disjoint (and more general) combinations of term rewriting systems. By means of a refined analysis of existing approaches we show how to prove several new asymmetric preservation results. For this purpose we introduce two interesting new properties of term rewriting systems related to collapsing reductions: <hi rend="italic">uniquely collapsing</hi> and <hi rend="italic">collapsing confluent</hi>. We discuss these properties w.r.t. well-known confluence, and normal form properties, and show that they are modular consistency for left-linear systems, but not in general.</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>I14029</label><item><term type="Secondary" subtype="priority-1">Software Engineering</term></item><label>I14037</label><item><term type="Secondary" subtype="priority-2">Programming Languages, Compilers, Interpreters</term></item><label>I1603X</label><item><term type="Secondary" subtype="priority-3">Logics and Meanings of Programs</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-VWZZRW10-2/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>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540642994</BookID><BookTitle>Recent Trends in Algebraic Development Techniques</BookTitle><BookSubTitle>12th International Workshop, WADT'97 Tarquinia, Italy, June 3–7, 1997 Selected Papers</BookSubTitle><BookVolumeNumber>1376</BookVolumeNumber><BookDOI>10.1007/3-540-64299-4</BookDOI><BookTitleID>55100</BookTitleID><BookPrintISBN>978-3-540-64299-2</BookPrintISBN><BookElectronicISBN>978-3-540-69719-0</BookElectronicISBN><BookChapterCount>24</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1998</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I14029" Priority="1" Type="Secondary">Software Engineering</BookSubject><BookSubject Code="I14037" Priority="2" Type="Secondary">Programming Languages, Compilers, Interpreters</BookSubject><BookSubject Code="I1603X" Priority="3" Type="Secondary">Logics and Meanings of Programs</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Francesco</GivenName><GivenName>Parisi</GivenName><FamilyName>Presicce</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap14" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>14</ChapterID><ChapterDOI>10.1007/3-540-64299-4_38</ChapterDOI><ChapterSequenceNumber>14</ChapterSequenceNumber><ChapterTitle Language="En">Modular aspects of rewrite-based specifications</ChapterTitle><ChapterCategory>Contributed Papers</ChapterCategory><ChapterFirstPage>253</ChapterFirstPage><ChapterLastPage>268</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1998</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>6</Month><Day>8</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>3540642994</BookID><BookTitle>Recent Trends in Algebraic Development Techniques</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Gramlich</FamilyName></AuthorName><Contact><Email>gramlich@loria.fr</Email><URL>http://www.loria.fr/~gramlich</URL></Contact></Author><Affiliation ID="Aff1"><OrgName>INRIA Lorraine & CRIN</OrgName><OrgAddress><Postbox>BP 101</Postbox><Postcode>54602</Postcode><City>Villers-lés-Nancy</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>We investigate modular properties of term rewriting systems, the basic operational formalism for equational specifications. First we study sufficient conditions for the preservation of the termination property under disjoint (and more general) combinations of term rewriting systems. By means of a refined analysis of existing approaches we show how to prove several new asymmetric preservation results. For this purpose we introduce two interesting new properties of term rewriting systems related to collapsing reductions: <Emphasis Type="Italic">uniquely collapsing</Emphasis> and <Emphasis Type="Italic">collapsing confluent</Emphasis>. We discuss these properties w.r.t. well-known confluence, and normal form properties, and show that they are modular consistency for left-linear systems, but not in general.</Para></Abstract><ArticleNote Type="Misc"><SimplePara>This work was supported by a <Emphasis Type="Italic">Marie Curie Research Fellowship</Emphasis> of the European Community under contract No ERBFMBICT961235.</SimplePara></ArticleNote></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Modular aspects of rewrite-based specifications</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Modular aspects of rewrite-based specifications</title></titleInfo><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Gramlich</namePart><affiliation>INRIA Lorraine & CRIN, BP 101, 54602, Villers-lés-Nancy, France</affiliation><affiliation>E-mail: gramlich@loria.fr</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">1998</dateIssued><copyrightDate encoding="w3cdtf">1998</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: We investigate modular properties of term rewriting systems, the basic operational formalism for equational specifications. First we study sufficient conditions for the preservation of the termination property under disjoint (and more general) combinations of term rewriting systems. By means of a refined analysis of existing approaches we show how to prove several new asymmetric preservation results. For this purpose we introduce two interesting new properties of term rewriting systems related to collapsing reductions: uniquely collapsing and collapsing confluent. We discuss these properties w.r.t. well-known confluence, and normal form properties, and show that they are modular consistency for left-linear systems, but not in general.</abstract><relatedItem type="host"><titleInfo><title>Recent Trends in Algebraic Development Techniques</title><subTitle>12th International Workshop, WADT'97 Tarquinia, Italy, June 3–7, 1997 Selected Papers</subTitle></titleInfo><name type="personal"><namePart type="given">Francesco</namePart><namePart type="given">Parisi</namePart><namePart type="family">Presicce</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">1998</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="I14029">Software Engineering</topic><topic authority="SpringerSubjectCodes" authorityURI="I14037">Programming Languages, Compilers, Interpreters</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic></subject><identifier type="DOI">10.1007/3-540-64299-4</identifier><identifier type="ISBN">978-3-540-64299-2</identifier><identifier type="eISBN">978-3-540-69719-0</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">55100</identifier><identifier type="BookID">3540642994</identifier><identifier type="BookChapterCount">24</identifier><identifier type="BookVolumeNumber">1376</identifier><part><date>1998</date><detail type="volume"><number>1376</number><caption>vol.</caption></detail><extent unit="pages"><start>253</start><end>268</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1998</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1998</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, 1998</recordOrigin></recordInfo></relatedItem><identifier type="istex">B270C2C0FC00DCB4847699C160BC8BDD052B789B</identifier><identifier type="ark">ark:/67375/HCB-VWZZRW10-2</identifier><identifier type="DOI">10.1007/3-540-64299-4_38</identifier><identifier type="ChapterID">14</identifier><identifier type="ChapterID">Chap14</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1998</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, 1998</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-VWZZRW10-2/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 002A30 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002A30 | 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:B270C2C0FC00DCB4847699C160BC8BDD052B789B
|texte= Modular aspects of rewrite-based specifications
}}
| This area was generated with Dilib version V0.6.33. |  |