A General Inductive Completion Algorithm and Application to Abstract Data Types
Identifieur interne : 002982 ( Istex/Corpus ); précédent : 002981; suivant : 002983A General Inductive Completion Algorithm and Application to Abstract Data Types
Auteurs : Helene KirchnerSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: This paper states the connection between hierarchical construction of equational specifications and completion of equational term rewriting systems. A general inductive completion algorithm is given, which turns out to be a well-suited tool to build up specifications by successive enrichments. Moreover, the same algorithm allows verifying consistency of a specification or proving theorems in its initial algebra without using explicit induction.
Url:
DOI: 10.1007/978-0-387-34768-4_17
Links to Exploration step
ISTEX:B07CA8C9CAB87B18FD120FF8AE2940CF8BB19D37Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A General Inductive Completion Algorithm and Application to Abstract Data Types</title><author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Helene" last="Kirchner">Helene Kirchner</name><affiliation><mods:affiliation>Centre de Recherche en Informatique de Nancy, Campus Scientifique, BP 239, 54506, Vandoeuvre-les-Nancy Cedex, FRANCE</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B07CA8C9CAB87B18FD120FF8AE2940CF8BB19D37</idno><date when="1984" year="1984">1984</date><idno type="doi">10.1007/978-0-387-34768-4_17</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-S7228JDR-7/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002982</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002982</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A General Inductive Completion Algorithm and Application to Abstract Data Types</title><author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Helene" last="Kirchner">Helene Kirchner</name><affiliation><mods:affiliation>Centre de Recherche en Informatique de Nancy, Campus Scientifique, BP 239, 54506, Vandoeuvre-les-Nancy Cedex, FRANCE</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</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 paper states the connection between hierarchical construction of equational specifications and completion of equational term rewriting systems. A general inductive completion algorithm is given, which turns out to be a well-suited tool to build up specifications by successive enrichments. Moreover, the same algorithm allows verifying consistency of a specification or proving theorems in its initial algebra without using explicit induction.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Helene Kirchner</name><affiliations><json:string>Centre de Recherche en Informatique de Nancy, Campus Scientifique, BP 239, 54506, Vandoeuvre-les-Nancy Cedex, FRANCE</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-S7228JDR-7</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: This paper states the connection between hierarchical construction of equational specifications and completion of equational term rewriting systems. A general inductive completion algorithm is given, which turns out to be a well-suited tool to build up specifications by successive enrichments. Moreover, the same algorithm allows verifying consistency of a specification or proving theorems in its initial algebra without using explicit induction.</abstract><qualityIndicators><refBibsNative>false</refBibsNative><abstractWordCount>62</abstractWordCount><abstractCharCount>458</abstractCharCount><keywordCount>0</keywordCount><score>7.744</score><pdfWordCount>6598</pdfWordCount><pdfCharCount>32609</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>21</pdfPageCount><pdfPageSize>439 x 666 pts</pdfPageSize></qualityIndicators><title>A General Inductive Completion Algorithm and Application to Abstract Data Types</title><chapterId><json:string>17</json:string><json:string>Chap17</json:string></chapterId><genre><json:string>research-article</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>1984</copyrightDate><issn><json:string>0302-9743</json:string></issn><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>7th International Conference on Automated Deduction</title><language><json:string>unknown</json:string></language><copyrightDate>1984</copyrightDate><doi><json:string>10.1007/978-0-387-34768-4</json:string></doi><issn><json:string>0302-9743</json:string></issn><eisbn><json:string>978-0-387-34768-4</json:string></eisbn><bookId><json:string>978-0-387-34768-4</json:string></bookId><isbn><json:string>978-0-387-96022-7</json:string></isbn><volume>170</volume><pages><first>282</first><last>302</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>R. E. Shostak</name><affiliations><json:string>SRI International, 333 Ravenswood Avenue, 94025, Menlo Park, CA, USA</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Mathematics</value></json:item><json:item><value>Mathematical Logic and Foundations</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-S7228JDR-7</json:string></ark><publicationDate>1984</publicationDate><copyrightDate>1984</copyrightDate><doi><json:string>10.1007/978-0-387-34768-4_17</json:string></doi><id>B07CA8C9CAB87B18FD120FF8AE2940CF8BB19D37</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-S7228JDR-7/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-S7228JDR-7/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-S7228JDR-7/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">A General Inductive Completion Algorithm and Application to Abstract Data Types</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag New York, Inc.</licence></availability><date when="1984">1984</date></publicationStmt><notesStmt><note type="content-type" subtype="research-article" source="OriginalPaper" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</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">A General Inductive Completion Algorithm and Application to Abstract Data Types</title><author><persName><forename type="first">Helene</forename><surname>Kirchner</surname></persName><affiliation><orgName type="institution">Centre de Recherche en Informatique de Nancy</orgName><address><street>Campus Scientifique</street><postBox>BP 239</postBox><postCode>54506</postCode><settlement>Vandoeuvre-les-Nancy Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></author><idno type="istex">B07CA8C9CAB87B18FD120FF8AE2940CF8BB19D37</idno><idno type="ark">ark:/67375/HCB-S7228JDR-7</idno><idno type="DOI">10.1007/978-0-387-34768-4_17</idno></analytic><monogr><title level="m" type="main">7th International Conference on Automated Deduction</title><title level="m" type="sub">Napa, California, USA May 14–16, 1984 Proceedings</title><idno type="DOI">10.1007/978-0-387-34768-4</idno><idno type="book-id">978-0-387-34768-4</idno><idno type="ISBN">978-0-387-96022-7</idno><idno type="eISBN">978-0-387-34768-4</idno><idno type="chapter-id">Chap17</idno><editor><persName><forename type="first">R.</forename><forename type="first">E.</forename><surname>Shostak</surname></persName><affiliation><orgName type="institution">SRI International</orgName><address><street>333 Ravenswood Avenue</street><settlement>Menlo Park</settlement><region>CA</region><postCode>94025</postCode><country key="US">UNITED STATES</country></address></affiliation></editor><imprint><biblScope unit="vol">170</biblScope><biblScope unit="page" from="282">282</biblScope><biblScope unit="page" to="302">302</biblScope><biblScope unit="chapter-count">29</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</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><forename type="first">Brinch</forename><surname>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="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>This paper states the connection between hierarchical construction of equational specifications and completion of equational term rewriting systems. A general inductive completion algorithm is given, which turns out to be a well-suited tool to build up specifications by successive enrichments. Moreover, the same algorithm allows verifying consistency of a specification or proving theorems in its initial algebra without using explicit induction.</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>M</label><item><term type="Primary">Mathematics</term></item><label>M24005</label><item><term type="Secondary" subtype="priority-1">Mathematical Logic and Foundations</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-S7228JDR-7/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 New York</PublisherName><PublisherLocation>New York, NY</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></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><GivenName>Brinch</GivenName><FamilyName>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 BookProductType="Monograph" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" OutputMedium="All" TocLevels="0"><BookID>978-0-387-34768-4</BookID><BookTitle>7th International Conference on Automated Deduction</BookTitle><BookSubTitle>Napa, California, USA May 14–16, 1984 Proceedings</BookSubTitle><BookVolumeNumber>170</BookVolumeNumber><BookSequenceNumber>171</BookSequenceNumber><BookDOI>10.1007/978-0-387-34768-4</BookDOI><BookTitleID>8602</BookTitleID><BookPrintISBN>978-0-387-96022-7</BookPrintISBN><BookElectronicISBN>978-0-387-34768-4</BookElectronicISBN><BookChapterCount>29</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag New York</CopyrightHolderName><CopyrightYear>1984</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="M" Type="Primary">Mathematics</BookSubject><BookSubject Code="M24005" Priority="1" Type="Secondary">Mathematical Logic and Foundations</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>R.</GivenName><GivenName>E.</GivenName><FamilyName>Shostak</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>SRI International</OrgName><OrgAddress><Street>333 Ravenswood Avenue</Street><City>Menlo Park</City><State>CA</State><Postcode>94025</Postcode><Country>USA</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Chapter ID="Chap17" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>17</ChapterID><ChapterDOI>10.1007/978-0-387-34768-4_17</ChapterDOI><ChapterSequenceNumber>17</ChapterSequenceNumber><ChapterTitle Language="En">A General Inductive Completion Algorithm and Application to Abstract Data Types</ChapterTitle><ChapterFirstPage>282</ChapterFirstPage><ChapterLastPage>302</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag New York, Inc.</CopyrightHolderName><CopyrightYear>1984</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2011</Year><Month>5</Month><Day>7</Day></RegistrationDate></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>978-0-387-34768-4</BookID><BookTitle>7th International Conference on Automated Deduction</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Helene</GivenName><FamilyName>Kirchner</FamilyName></AuthorName></Author><Affiliation ID="Aff2"><OrgName>Centre de Recherche en Informatique de Nancy</OrgName><OrgAddress><Street>Campus Scientifique</Street><Postbox>BP 239</Postbox><Postcode>54506</Postcode><City>Vandoeuvre-les-Nancy Cedex</City><Country>FRANCE</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En" OutputMedium="All"><Heading>Abstract</Heading><Para>This paper states the connection between hierarchical construction of equational specifications and completion of equational term rewriting systems. A general inductive completion algorithm is given, which turns out to be a well-suited tool to build up specifications by successive enrichments. Moreover, the same algorithm allows verifying consistency of a specification or proving theorems in its initial algebra without using explicit induction.</Para></Abstract><ArticleNote Type="Misc"><SimplePara>This research has been supported by GRECO de Progrsmmation and by Agence pour le Developpement de l’Informatique, under contract no 82/767</SimplePara></ArticleNote></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>A General Inductive Completion Algorithm and Application to Abstract Data Types</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>A General Inductive Completion Algorithm and Application to Abstract Data Types</title></titleInfo><name type="personal"><namePart type="given">Helene</namePart><namePart type="family">Kirchner</namePart><affiliation>Centre de Recherche en Informatique de Nancy, Campus Scientifique, BP 239, 54506, Vandoeuvre-les-Nancy Cedex, FRANCE</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="research-article" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</genre><originInfo><publisher>Springer New York</publisher><place><placeTerm type="text">New York, NY</placeTerm></place><dateIssued encoding="w3cdtf">1984</dateIssued><copyrightDate encoding="w3cdtf">1984</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: This paper states the connection between hierarchical construction of equational specifications and completion of equational term rewriting systems. A general inductive completion algorithm is given, which turns out to be a well-suited tool to build up specifications by successive enrichments. Moreover, the same algorithm allows verifying consistency of a specification or proving theorems in its initial algebra without using explicit induction.</abstract><relatedItem type="host"><titleInfo><title>7th International Conference on Automated Deduction</title><subTitle>Napa, California, USA May 14–16, 1984 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">R.</namePart><namePart type="given">E.</namePart><namePart type="family">Shostak</namePart><affiliation>SRI International, 333 Ravenswood Avenue, 94025, Menlo Park, CA, USA</affiliation><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">1984</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="M">Mathematics</topic><topic authority="SpringerSubjectCodes" authorityURI="M24005">Mathematical Logic and Foundations</topic></subject><identifier type="DOI">10.1007/978-0-387-34768-4</identifier><identifier type="ISBN">978-0-387-96022-7</identifier><identifier type="eISBN">978-0-387-34768-4</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="BookTitleID">8602</identifier><identifier type="BookID">978-0-387-34768-4</identifier><identifier type="BookChapterCount">29</identifier><identifier type="BookVolumeNumber">170</identifier><identifier type="BookSequenceNumber">171</identifier><part><date>1984</date><detail type="volume"><number>170</number><caption>vol.</caption></detail><extent unit="pages"><start>282</start><end>302</end></extent></part><recordInfo><recordOrigin>Springer-Verlag New York, 1984</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="given">Brinch</namePart><namePart type="family">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">1984</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag New York, 1984</recordOrigin></recordInfo></relatedItem><identifier type="istex">B07CA8C9CAB87B18FD120FF8AE2940CF8BB19D37</identifier><identifier type="ark">ark:/67375/HCB-S7228JDR-7</identifier><identifier type="DOI">10.1007/978-0-387-34768-4_17</identifier><identifier type="ChapterID">17</identifier><identifier type="ChapterID">Chap17</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag New York, 1984</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 New York, Inc., 1984</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-S7228JDR-7/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 002982 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002982 | 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:B07CA8C9CAB87B18FD120FF8AE2940CF8BB19D37
|texte= A General Inductive Completion Algorithm and Application to Abstract Data Types
}}
| This area was generated with Dilib version V0.6.33. |  |