A taste of rewrite systems
Identifieur interne : 000913 ( Istex/Corpus ); précédent : 000912; suivant : 000914A taste of rewrite systems
Auteurs : Nachum DershowitzSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the KnuthBendix completion procedure and its variations, as well as rewriting-based (functional and logic) programming and (equational, first-order, and inductive) theorem proving. Ordinary, associative-commutative, and conditional rewriting are covered. Current areas of research are summarized and an extensive bibliography is provided.
Url:
DOI: 10.1007/3-540-56883-2_11
Links to Exploration step
ISTEX:27D6875496F6F0B8981E58A5B03488B568C70E48Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A taste of rewrite systems</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, 61801, Urbana, IL, USA</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:27D6875496F6F0B8981E58A5B03488B568C70E48</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1007/3-540-56883-2_11</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-DL9L1GSN-P/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000913</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000913</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A taste of rewrite systems</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, 61801, Urbana, IL, 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 of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the KnuthBendix completion procedure and its variations, as well as rewriting-based (functional and logic) programming and (equational, first-order, and inductive) theorem proving. Ordinary, associative-commutative, and conditional rewriting are covered. Current areas of research are summarized and an extensive bibliography is provided.</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, 61801, Urbana, IL, USA</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-DL9L1GSN-P</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><abstract>Abstract: This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the KnuthBendix completion procedure and its variations, as well as rewriting-based (functional and logic) programming and (equational, first-order, and inductive) theorem proving. Ordinary, associative-commutative, and conditional rewriting are covered. Current areas of research are summarized and an extensive bibliography is provided.</abstract><qualityIndicators><refBibsNative>false</refBibsNative><abstractWordCount>61</abstractWordCount><abstractCharCount>475</abstractCharCount><keywordCount>0</keywordCount><score>7.732</score><pdfWordCount>11720</pdfWordCount><pdfCharCount>60376</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>30</pdfPageCount><pdfPageSize>439.28 x 666 pts</pdfPageSize></qualityIndicators><title>A taste of rewrite systems</title><chapterId><json:string>11</json:string><json:string>Chap11</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>1993</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></editor></serie><host><title>Functional Programming, Concurrency, Simulation and Automated Reasoning</title><language><json:string>unknown</json:string></language><copyrightDate>1993</copyrightDate><doi><json:string>10.1007/3-540-56883-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-47776-1</json:string></eisbn><bookId><json:string>3540568832</json:string></bookId><isbn><json:string>978-3-540-56883-4</json:string></isbn><volume>693</volume><pages><first>199</first><last>228</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Peter E. Lauer</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Programming Techniques</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-DL9L1GSN-P</json:string></ark><publicationDate>1993</publicationDate><copyrightDate>1993</copyrightDate><doi><json:string>10.1007/3-540-56883-2_11</json:string></doi><id>27D6875496F6F0B8981E58A5B03488B568C70E48</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-DL9L1GSN-P/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-DL9L1GSN-P/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-DL9L1GSN-P/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">A taste of rewrite systems</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag</licence></availability><date when="1993">1993</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">A taste of rewrite systems</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</orgName><address><postCode>61801</postCode><settlement>Urbana</settlement><region>IL</region><country key="US">UNITED STATES</country></address></affiliation></author><idno type="istex">27D6875496F6F0B8981E58A5B03488B568C70E48</idno><idno type="ark">ark:/67375/HCB-DL9L1GSN-P</idno><idno type="DOI">10.1007/3-540-56883-2_11</idno></analytic><monogr><title level="m" type="main">Functional Programming, Concurrency, Simulation and Automated Reasoning</title><title level="m" type="sub">International Lecture Series 1991–1992 McMaster University, Hamilton, Ontario, Canada</title><idno type="DOI">10.1007/3-540-56883-2</idno><idno type="book-id">3540568832</idno><idno type="ISBN">978-3-540-56883-4</idno><idno type="eISBN">978-3-540-47776-1</idno><idno type="chapter-id">Chap11</idno><editor><persName><forename type="first">Peter</forename><forename type="first">E.</forename><surname>Lauer</surname></persName></editor><imprint><biblScope unit="vol">693</biblScope><biblScope unit="page" from="199">199</biblScope><biblScope unit="page" to="228">228</biblScope><biblScope unit="chapter-count">17</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><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 of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the KnuthBendix completion procedure and its variations, as well as rewriting-based (functional and logic) programming and (equational, first-order, and inductive) theorem proving. Ordinary, associative-commutative, and conditional rewriting are covered. Current areas of research are summarized and an extensive bibliography is provided.</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>I14010</label><item><term type="Secondary" subtype="priority-1">Programming Techniques</term></item><label>I14029</label><item><term type="Secondary" subtype="priority-2">Software Engineering</term></item><label>I14037</label><item><term type="Secondary" subtype="priority-3">Programming Languages, Compilers, Interpreters</term></item><label>I1603X</label><item><term type="Secondary" subtype="priority-4">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-DL9L1GSN-P/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></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540568832</BookID><BookTitle>Functional Programming, Concurrency, Simulation and Automated Reasoning</BookTitle><BookSubTitle>International Lecture Series 1991–1992 McMaster University, Hamilton, Ontario, Canada</BookSubTitle><BookVolumeNumber>693</BookVolumeNumber><BookDOI>10.1007/3-540-56883-2</BookDOI><BookTitleID>33776</BookTitleID><BookPrintISBN>978-3-540-56883-4</BookPrintISBN><BookElectronicISBN>978-3-540-47776-1</BookElectronicISBN><BookChapterCount>17</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1993</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I14010" Priority="1" Type="Secondary">Programming Techniques</BookSubject><BookSubject Code="I14029" Priority="2" Type="Secondary">Software Engineering</BookSubject><BookSubject Code="I14037" Priority="3" Type="Secondary">Programming Languages, Compilers, Interpreters</BookSubject><BookSubject Code="I1603X" Priority="4" Type="Secondary">Logics and Meanings of Programs</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Peter</GivenName><GivenName>E.</GivenName><FamilyName>Lauer</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap11" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>11</ChapterID><ChapterDOI>10.1007/3-540-56883-2_11</ChapterDOI><ChapterSequenceNumber>11</ChapterSequenceNumber><ChapterTitle Language="En">A taste of rewrite systems</ChapterTitle><ChapterFirstPage>199</ChapterFirstPage><ChapterLastPage>228</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1993</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>3540568832</BookID><BookTitle>Functional Programming, Concurrency, Simulation and Automated Reasoning</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</OrgName><OrgAddress><Postcode>61801</Postcode><City>Urbana</City><State>IL</State><Country>USA</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the KnuthBendix completion procedure and its variations, as well as rewriting-based (functional and logic) programming and (equational, first-order, and inductive) theorem proving. Ordinary, associative-commutative, and conditional rewriting are covered. Current areas of research are summarized and an extensive bibliography is provided.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>A taste of rewrite systems</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>A taste of rewrite systems</title></titleInfo><name type="personal"><namePart type="given">Nachum</namePart><namePart type="family">Dershowitz</namePart><affiliation>Department of Computer Science, University of Illinois, 61801, Urbana, IL, 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">1993</dateIssued><copyrightDate encoding="w3cdtf">1993</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 of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the KnuthBendix completion procedure and its variations, as well as rewriting-based (functional and logic) programming and (equational, first-order, and inductive) theorem proving. Ordinary, associative-commutative, and conditional rewriting are covered. Current areas of research are summarized and an extensive bibliography is provided.</abstract><relatedItem type="host"><titleInfo><title>Functional Programming, Concurrency, Simulation and Automated Reasoning</title><subTitle>International Lecture Series 1991–1992 McMaster University, Hamilton, Ontario, Canada</subTitle></titleInfo><name type="personal"><namePart type="given">Peter</namePart><namePart type="given">E.</namePart><namePart type="family">Lauer</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">1993</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="I14010">Programming Techniques</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-56883-2</identifier><identifier type="ISBN">978-3-540-56883-4</identifier><identifier type="eISBN">978-3-540-47776-1</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">33776</identifier><identifier type="BookID">3540568832</identifier><identifier type="BookChapterCount">17</identifier><identifier type="BookVolumeNumber">693</identifier><part><date>1993</date><detail type="volume"><number>693</number><caption>vol.</caption></detail><extent unit="pages"><start>199</start><end>228</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1993</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><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1993</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, 1993</recordOrigin></recordInfo></relatedItem><identifier type="istex">27D6875496F6F0B8981E58A5B03488B568C70E48</identifier><identifier type="ark">ark:/67375/HCB-DL9L1GSN-P</identifier><identifier type="DOI">10.1007/3-540-56883-2_11</identifier><identifier type="ChapterID">11</identifier><identifier type="ChapterID">Chap11</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1993</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, 1993</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-DL9L1GSN-P/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 000913 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000913 | 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:27D6875496F6F0B8981E58A5B03488B568C70E48
|texte= A taste of rewrite systems
}}
| This area was generated with Dilib version V0.6.33. |  |