Compilation of pattern matching with associative-commutative functions
Identifieur interne : 001444 ( Istex/Corpus ); précédent : 001443; suivant : 001445Compilation of pattern matching with associative-commutative functions
Auteurs : E. Kounalis ; D. LugiezSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: This paper deals with the problem of compiling pattern-matching of associative-commutative function definitions in a functional-like language where the evaluation is performed by head-rewriting. We propose an effective algorithm (i.e which does not rely on some -unknown- procedure for computing complements of terms modulo AC-axioms) to compile the pattern-matching process. For this purpose, we introduce the concept of pattern trees. We also get for free a test of the completeness of such definitions (with respect to head-rewriting), provided some linearity condition is met. Our method will ensure an efficient pattern-matching process at evaluation time.
Url:
DOI: 10.1007/3-540-53982-4_4
Links to Exploration step
ISTEX:5797855E4DEFFC65B5E8345D4790580140B3A58FLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Compilation of pattern matching with associative-commutative functions</title><author><name sortKey="Kounalis, E" sort="Kounalis, E" uniqKey="Kounalis E" first="E." last="Kounalis">E. Kounalis</name><affiliation><mods:affiliation>Cria-Inria, Nancy, France</mods:affiliation></affiliation></author><author><name sortKey="Lugiez, D" sort="Lugiez, D" uniqKey="Lugiez D" first="D." last="Lugiez">D. Lugiez</name><affiliation><mods:affiliation>Cria-Inria, Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: kounalis,lugiez@loria.crin.fr</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:5797855E4DEFFC65B5E8345D4790580140B3A58F</idno><date when="1991" year="1991">1991</date><idno type="doi">10.1007/3-540-53982-4_4</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-7C7P5SP5-7/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001444</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001444</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Compilation of pattern matching with associative-commutative functions</title><author><name sortKey="Kounalis, E" sort="Kounalis, E" uniqKey="Kounalis E" first="E." last="Kounalis">E. Kounalis</name><affiliation><mods:affiliation>Cria-Inria, Nancy, France</mods:affiliation></affiliation></author><author><name sortKey="Lugiez, D" sort="Lugiez, D" uniqKey="Lugiez D" first="D." last="Lugiez">D. Lugiez</name><affiliation><mods:affiliation>Cria-Inria, Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: kounalis,lugiez@loria.crin.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: This paper deals with the problem of compiling pattern-matching of associative-commutative function definitions in a functional-like language where the evaluation is performed by head-rewriting. We propose an effective algorithm (i.e which does not rely on some -unknown- procedure for computing complements of terms modulo AC-axioms) to compile the pattern-matching process. For this purpose, we introduce the concept of pattern trees. We also get for free a test of the completeness of such definitions (with respect to head-rewriting), provided some linearity condition is met. Our method will ensure an efficient pattern-matching process at evaluation time.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>E. Kounalis</name><affiliations><json:string>Cria-Inria, Nancy, France</json:string></affiliations></json:item><json:item><name>D. Lugiez</name><affiliations><json:string>Cria-Inria, Nancy, France</json:string><json:string>E-mail: kounalis,lugiez@loria.crin.fr</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-7C7P5SP5-7</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><abstract>Abstract: This paper deals with the problem of compiling pattern-matching of associative-commutative function definitions in a functional-like language where the evaluation is performed by head-rewriting. We propose an effective algorithm (i.e which does not rely on some -unknown- procedure for computing complements of terms modulo AC-axioms) to compile the pattern-matching process. For this purpose, we introduce the concept of pattern trees. We also get for free a test of the completeness of such definitions (with respect to head-rewriting), provided some linearity condition is met. Our method will ensure an efficient pattern-matching process at evaluation time.</abstract><qualityIndicators><score>8.14</score><pdfWordCount>7246</pdfWordCount><pdfCharCount>33832</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>17</pdfPageCount><pdfPageSize>468 x 684 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>95</abstractWordCount><abstractCharCount>671</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Compilation of pattern matching with associative-commutative functions</title><chapterId><json:string>4</json:string><json:string>Chap4</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>1991</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üuller</name></json:item><json:item><name>J. Stoer</name></json:item><json:item><name>N. Wirth</name></json:item></editor></serie><host><title>TAPSOFT '91</title><language><json:string>unknown</json:string></language><copyrightDate>1991</copyrightDate><doi><json:string>10.1007/3-540-53982-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-46563-8</json:string></eisbn><bookId><json:string>3540539824</json:string></bookId><isbn><json:string>978-3-540-53982-7</json:string></isbn><volume>493</volume><pages><first>57</first><last>73</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>S. Abramsky</name></json:item><json:item><name>T. S. E. Maibaum</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><json:item><value>Mathematical Logic and Formal Languages</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-7C7P5SP5-7</json:string></ark><publicationDate>1991</publicationDate><copyrightDate>1991</copyrightDate><doi><json:string>10.1007/3-540-53982-4_4</json:string></doi><id>5797855E4DEFFC65B5E8345D4790580140B3A58F</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-7C7P5SP5-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-7C7P5SP5-7/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-7C7P5SP5-7/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Compilation of pattern matching with associative-commutative functions</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag</licence></availability><date when="1991">1991</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">Compilation of pattern matching with associative-commutative functions</title><author><persName><forename type="first">E.</forename><surname>Kounalis</surname></persName><affiliation><orgName type="institution">Cria-Inria</orgName><address><settlement>Nancy</settlement><country key="FR">FRANCE</country></address></affiliation></author><author><persName><forename type="first">D.</forename><surname>Lugiez</surname></persName><email>kounalis,lugiez@loria.crin.fr</email><affiliation><orgName type="institution">Cria-Inria</orgName><address><settlement>Nancy</settlement><country key="FR">FRANCE</country></address></affiliation></author><idno type="istex">5797855E4DEFFC65B5E8345D4790580140B3A58F</idno><idno type="ark">ark:/67375/HCB-7C7P5SP5-7</idno><idno type="DOI">10.1007/3-540-53982-4_4</idno></analytic><monogr><title level="m" type="main">TAPSOFT '91</title><title level="m" type="sub">Proceedings of the International Joint Conference on Theory and Practice of Software Development Brighton, UK, April 8–12, 1991</title><idno type="DOI">10.1007/3-540-53982-4</idno><idno type="book-id">3540539824</idno><idno type="ISBN">978-3-540-53982-7</idno><idno type="eISBN">978-3-540-46563-8</idno><idno type="chapter-id">Chap4</idno><editor><persName><forename type="first">S.</forename><surname>Abramsky</surname></persName></editor><editor><persName><forename type="first">T.</forename><forename type="first">S.</forename><forename type="first">E.</forename><surname>Maibaum</surname></persName></editor><imprint><biblScope unit="vol">493</biblScope><biblScope unit="page" from="57">57</biblScope><biblScope unit="page" to="73">73</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üuller</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 paper deals with the problem of compiling pattern-matching of associative-commutative function definitions in a functional-like language where the evaluation is performed by head-rewriting. We propose an effective algorithm (i.e which does not rely on some -unknown- procedure for computing complements of terms modulo AC-axioms) to compile the pattern-matching process. For this purpose, we introduce the concept of <hi rend="italic">pattern trees</hi>. We also get for free a test of the completeness of such definitions (with respect to head-rewriting), provided some linearity condition is met. Our method will ensure an efficient pattern-matching process at evaluation time.</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><label>I16048</label><item><term type="Secondary" subtype="priority-4">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-7C7P5SP5-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 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üuller</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>3540539824</BookID><BookTitle>TAPSOFT '91</BookTitle><BookSubTitle>Proceedings of the International Joint Conference on Theory and Practice of Software Development Brighton, UK, April 8–12, 1991</BookSubTitle><BookVolumeNumber>493</BookVolumeNumber><BookDOI>10.1007/3-540-53982-4</BookDOI><BookTitleID>27812</BookTitleID><BookPrintISBN>978-3-540-53982-7</BookPrintISBN><BookElectronicISBN>978-3-540-46563-8</BookElectronicISBN><BookChapterCount>24</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1991</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><BookSubject Code="I16048" Priority="4" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>S.</GivenName><FamilyName>Abramsky</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>T.</GivenName><GivenName>S.</GivenName><GivenName>E.</GivenName><FamilyName>Maibaum</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap4" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>4</ChapterID><ChapterDOI>10.1007/3-540-53982-4_4</ChapterDOI><ChapterSequenceNumber>4</ChapterSequenceNumber><ChapterTitle Language="En">Compilation of pattern matching with associative-commutative functions</ChapterTitle><ChapterCategory>CAAP Colloquium On Trees In Algebra And Programming</ChapterCategory><ChapterFirstPage>57</ChapterFirstPage><ChapterLastPage>73</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1991</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>6</Month><Day>7</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>3540539824</BookID><BookTitle>TAPSOFT '91</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>E.</GivenName><FamilyName>Kounalis</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Lugiez</FamilyName></AuthorName><Contact><Email>kounalis,lugiez@loria.crin.fr</Email></Contact></Author><Affiliation ID="Aff1"><OrgName>Cria-Inria</OrgName><OrgAddress><City>Nancy</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>This paper deals with the problem of compiling pattern-matching of associative-commutative function definitions in a functional-like language where the evaluation is performed by head-rewriting. We propose an effective algorithm (i.e which does not rely on some -unknown- procedure for computing complements of terms modulo AC-axioms) to compile the pattern-matching process. For this purpose, we introduce the concept of <Emphasis Type="Italic">pattern trees</Emphasis>. We also get for free a test of the completeness of such definitions (with respect to head-rewriting), provided some linearity condition is met. Our method will ensure an efficient pattern-matching process at evaluation time.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Compilation of pattern matching with associative-commutative functions</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Compilation of pattern matching with associative-commutative functions</title></titleInfo><name type="personal"><namePart type="given">E.</namePart><namePart type="family">Kounalis</namePart><affiliation>Cria-Inria, Nancy, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Lugiez</namePart><affiliation>Cria-Inria, Nancy, France</affiliation><affiliation>E-mail: kounalis,lugiez@loria.crin.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">1991</dateIssued><copyrightDate encoding="w3cdtf">1991</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 deals with the problem of compiling pattern-matching of associative-commutative function definitions in a functional-like language where the evaluation is performed by head-rewriting. We propose an effective algorithm (i.e which does not rely on some -unknown- procedure for computing complements of terms modulo AC-axioms) to compile the pattern-matching process. For this purpose, we introduce the concept of pattern trees. We also get for free a test of the completeness of such definitions (with respect to head-rewriting), provided some linearity condition is met. Our method will ensure an efficient pattern-matching process at evaluation time.</abstract><relatedItem type="host"><titleInfo><title>TAPSOFT '91</title><subTitle>Proceedings of the International Joint Conference on Theory and Practice of Software Development Brighton, UK, April 8–12, 1991</subTitle></titleInfo><name type="personal"><namePart type="given">S.</namePart><namePart type="family">Abramsky</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">T.</namePart><namePart type="given">S.</namePart><namePart type="given">E.</namePart><namePart type="family">Maibaum</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">1991</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><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic></subject><identifier type="DOI">10.1007/3-540-53982-4</identifier><identifier type="ISBN">978-3-540-53982-7</identifier><identifier type="eISBN">978-3-540-46563-8</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">27812</identifier><identifier type="BookID">3540539824</identifier><identifier type="BookChapterCount">24</identifier><identifier type="BookVolumeNumber">493</identifier><part><date>1991</date><detail type="volume"><number>493</number><caption>vol.</caption></detail><extent unit="pages"><start>57</start><end>73</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1991</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üuller</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">1991</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, 1991</recordOrigin></recordInfo></relatedItem><identifier type="istex">5797855E4DEFFC65B5E8345D4790580140B3A58F</identifier><identifier type="ark">ark:/67375/HCB-7C7P5SP5-7</identifier><identifier type="DOI">10.1007/3-540-53982-4_4</identifier><identifier type="ChapterID">4</identifier><identifier type="ChapterID">Chap4</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1991</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, 1991</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-7C7P5SP5-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 001444 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001444 | 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:5797855E4DEFFC65B5E8345D4790580140B3A58F
|texte= Compilation of pattern matching with associative-commutative functions
}}
| This area was generated with Dilib version V0.6.33. |  |