The Computability Path Ordering: The End of a Quest
Identifieur interne : 001A83 ( Istex/Corpus ); précédent : 001A82; suivant : 001A84The Computability Path Ordering: The End of a Quest
Auteurs : Frédéric Blanqui ; Jean-Pierre Jouannaud ; Albert RubioSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path Ordering. This new definition appears indeed to capture the essence of computability arguments à la Tait and Girard, therefore explaining the name of the improved ordering.
Url:
DOI: 10.1007/978-3-540-87531-4_1
Links to Exploration step
ISTEX:74A381911D5DF79F58B8566DCC5B0685679B7F7DLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The Computability Path Ordering: The End of a Quest</title><author><name sortKey="Blanqui, Frederic" sort="Blanqui, Frederic" uniqKey="Blanqui F" first="Frédéric" last="Blanqui">Frédéric Blanqui</name><affiliation><mods:affiliation>INRIA, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy Cedex, France</mods:affiliation></affiliation></author><author><name sortKey="Jouannaud, Jean Pierre" sort="Jouannaud, Jean Pierre" uniqKey="Jouannaud J" first="Jean-Pierre" last="Jouannaud">Jean-Pierre Jouannaud</name><affiliation><mods:affiliation>LIX, Projet INRIA TypiCal, École Polytechnique and CNRS, 91400, Palaiseau, France</mods:affiliation></affiliation></author><author><name sortKey="Rubio, Albert" sort="Rubio, Albert" uniqKey="Rubio A" first="Albert" last="Rubio">Albert Rubio</name><affiliation><mods:affiliation>Technical University of Catalonia, Pau Gargallo 5, 08028, Barcelona, Spain</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:74A381911D5DF79F58B8566DCC5B0685679B7F7D</idno><date when="2008" year="2008">2008</date><idno type="doi">10.1007/978-3-540-87531-4_1</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-DKW046KQ-W/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001A83</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001A83</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The Computability Path Ordering: The End of a Quest</title><author><name sortKey="Blanqui, Frederic" sort="Blanqui, Frederic" uniqKey="Blanqui F" first="Frédéric" last="Blanqui">Frédéric Blanqui</name><affiliation><mods:affiliation>INRIA, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy Cedex, France</mods:affiliation></affiliation></author><author><name sortKey="Jouannaud, Jean Pierre" sort="Jouannaud, Jean Pierre" uniqKey="Jouannaud J" first="Jean-Pierre" last="Jouannaud">Jean-Pierre Jouannaud</name><affiliation><mods:affiliation>LIX, Projet INRIA TypiCal, École Polytechnique and CNRS, 91400, Palaiseau, France</mods:affiliation></affiliation></author><author><name sortKey="Rubio, Albert" sort="Rubio, Albert" uniqKey="Rubio A" first="Albert" last="Rubio">Albert Rubio</name><affiliation><mods:affiliation>Technical University of Catalonia, Pau Gargallo 5, 08028, Barcelona, Spain</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="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: In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path Ordering. This new definition appears indeed to capture the essence of computability arguments à la Tait and Girard, therefore explaining the name of the improved ordering.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Frédéric Blanqui</name><affiliations><json:string>INRIA, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy Cedex, France</json:string></affiliations></json:item><json:item><name>Jean-Pierre Jouannaud</name><affiliations><json:string>LIX, Projet INRIA TypiCal, École Polytechnique and CNRS, 91400, Palaiseau, France</json:string></affiliations></json:item><json:item><name>Albert Rubio</name><affiliations><json:string>Technical University of Catalonia, Pau Gargallo 5, 08028, Barcelona, Spain</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-DKW046KQ-W</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path Ordering. This new definition appears indeed to capture the essence of computability arguments à la Tait and Girard, therefore explaining the name of the improved ordering.</abstract><qualityIndicators><score>7.72</score><pdfWordCount>6356</pdfWordCount><pdfCharCount>31613</pdfCharCount><pdfVersion>1.6</pdfVersion><pdfPageCount>14</pdfPageCount><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>60</abstractWordCount><abstractCharCount>416</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>The Computability Path Ordering: The End of a Quest</title><chapterId><json:string>1</json:string><json:string>Chap1</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>2008</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>David Hutchison</name></json:item><json:item><name>Takeo Kanade</name></json:item><json:item><name>Josef Kittler</name></json:item><json:item><name>Jon M. Kleinberg</name></json:item><json:item><name>Friedemann Mattern</name></json:item><json:item><name>John C. Mitchell</name></json:item><json:item><name>Moni Naor</name></json:item><json:item><name>Oscar Nierstrasz</name></json:item><json:item><name>C. Pandu Rangan</name></json:item><json:item><name>Bernhard Steffen</name></json:item><json:item><name>Madhu Sudan</name></json:item><json:item><name>Demetri Terzopoulos</name></json:item><json:item><name>Doug Tygar</name></json:item><json:item><name>Moshe Y. Vardi</name></json:item><json:item><name>Gerhard Weikum</name></json:item></editor></serie><host><title>Computer Science Logic</title><language><json:string>unknown</json:string></language><copyrightDate>2008</copyrightDate><doi><json:string>10.1007/978-3-540-87531-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-87531-4</json:string></eisbn><bookId><json:string>978-3-540-87531-4</json:string></bookId><isbn><json:string>978-3-540-87530-7</json:string></isbn><volume>5213</volume><pages><first>1</first><last>14</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Michael Kaminski</name></json:item><json:item><name>Simone Martini</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Mathematical Logic and Foundations</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-DKW046KQ-W</json:string></ark><publicationDate>2008</publicationDate><copyrightDate>2008</copyrightDate><doi><json:string>10.1007/978-3-540-87531-4_1</json:string></doi><id>74A381911D5DF79F58B8566DCC5B0685679B7F7D</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-DKW046KQ-W/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-DKW046KQ-W/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-DKW046KQ-W/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">The Computability Path Ordering: The End of a Quest</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag Berlin Heidelberg</licence></availability><date when="2008">2008</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">The Computability Path Ordering: The End of a Quest</title><author><persName><forename type="first">Frédéric</forename><surname>Blanqui</surname></persName><affiliation><orgName type="institution">INRIA, Campus Scientifique</orgName><address><postBox>BP 239</postBox><postCode>54506</postCode><settlement>Vandœuvre-lès-Nancy Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></author><author><persName><forename type="first">Jean-Pierre</forename><surname>Jouannaud</surname></persName><affiliation><orgName type="institution">LIX, Projet INRIA TypiCal, École Polytechnique and CNRS</orgName><address><postCode>91400</postCode><settlement>Palaiseau</settlement><country key="FR">FRANCE</country></address></affiliation></author><author><persName><forename type="first">Albert</forename><surname>Rubio</surname></persName><affiliation><orgName type="institution">Technical University of Catalonia</orgName><address><street>Pau Gargallo 5</street><postCode>08028</postCode><settlement>Barcelona</settlement><country key="ES">SPAIN</country></address></affiliation></author><idno type="istex">74A381911D5DF79F58B8566DCC5B0685679B7F7D</idno><idno type="ark">ark:/67375/HCB-DKW046KQ-W</idno><idno type="DOI">10.1007/978-3-540-87531-4_1</idno></analytic><monogr><title level="m" type="main">Computer Science Logic</title><title level="m" type="sub">22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings</title><title level="m" type="part">Invited Talks</title><idno type="DOI">10.1007/978-3-540-87531-4</idno><idno type="book-id">978-3-540-87531-4</idno><idno type="ISBN">978-3-540-87530-7</idno><idno type="eISBN">978-3-540-87531-4</idno><idno type="chapter-id">Chap1</idno><idno type="part-id">Part1</idno><editor><persName><forename type="first">Michael</forename><surname>Kaminski</surname></persName><email>kaminski@cs.technion.ac.il</email></editor><editor><persName><forename type="first">Simone</forename><surname>Martini</surname></persName><email>martini@cs.unibo.it</email></editor><imprint><biblScope unit="vol">5213</biblScope><biblScope unit="page" from="1">1</biblScope><biblScope unit="page" to="14">14</biblScope><biblScope unit="chapter-count">36</biblScope><biblScope unit="part-chapter-count">4</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</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>In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path Ordering. This new definition appears indeed to capture the essence of computability arguments <hi rend="italic">à la Tait and Girard</hi>, therefore explaining the name of the improved ordering.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I16048</label><item><term type="Secondary" subtype="priority-1">Mathematical Logic and Formal Languages</term></item><label>I21017</label><item><term type="Secondary" subtype="priority-2">Artificial Intelligence (incl. Robotics)</term></item><label>I1603X</label><item><term type="Secondary" subtype="priority-3">Logics and Meanings of Programs</term></item><label>M24005</label><item><term type="Secondary" subtype="priority-4">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-DKW046KQ-W/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 SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" OutputMedium="All" TocLevels="0"><BookID>978-3-540-87531-4</BookID><BookTitle>Computer Science Logic</BookTitle><BookSubTitle>22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings</BookSubTitle><BookVolumeNumber>5213</BookVolumeNumber><BookSequenceNumber>5213</BookSequenceNumber><BookDOI>10.1007/978-3-540-87531-4</BookDOI><BookTitleID>182303</BookTitleID><BookPrintISBN>978-3-540-87530-7</BookPrintISBN><BookElectronicISBN>978-3-540-87531-4</BookElectronicISBN><BookChapterCount>36</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2008</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16048" Priority="1" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I21017" Priority="2" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I1603X" Priority="3" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="M24005" Priority="4" Type="Secondary">Mathematical Logic and Foundations</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Michael</GivenName><FamilyName>Kaminski</FamilyName></EditorName><Contact><Email>kaminski@cs.technion.ac.il</Email></Contact></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Simone</GivenName><FamilyName>Martini</FamilyName></EditorName><Contact><Email>martini@cs.unibo.it</Email></Contact></Editor></EditorGroup></BookHeader><Part ID="Part1"><PartInfo TocLevels="0"><PartID>1</PartID><PartSequenceNumber>1</PartSequenceNumber><PartTitle>Invited Talks</PartTitle><PartChapterCount>4</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Computer Science Logic</BookTitle></PartContext></PartInfo><Chapter ID="Chap1" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>1</ChapterID><ChapterDOI>10.1007/978-3-540-87531-4_1</ChapterDOI><ChapterSequenceNumber>1</ChapterSequenceNumber><ChapterTitle Language="En">The Computability Path Ordering: The End of a Quest</ChapterTitle><ChapterFirstPage>1</ChapterFirstPage><ChapterLastPage>14</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2008</CopyrightYear></ChapterCopyright><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><PartID>1</PartID><BookID>978-3-540-87531-4</BookID><BookTitle>Computer Science Logic</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Frédéric</GivenName><FamilyName>Blanqui</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Jean-Pierre</GivenName><FamilyName>Jouannaud</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff3"><AuthorName DisplayOrder="Western"><GivenName>Albert</GivenName><FamilyName>Rubio</FamilyName></AuthorName></Author><Affiliation ID="Aff1"><OrgName>INRIA, Campus Scientifique</OrgName><OrgAddress><Postbox>BP 239</Postbox><Postcode>54506</Postcode><City>Vandœuvre-lès-Nancy Cedex</City><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>LIX, Projet INRIA TypiCal, École Polytechnique and CNRS</OrgName><OrgAddress><Postcode>91400</Postcode><City>Palaiseau</City><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>Technical University of Catalonia</OrgName><OrgAddress><Street>Pau Gargallo 5</Street><Postcode>08028</Postcode><City>Barcelona</City><Country>Spain</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path Ordering. This new definition appears indeed to capture the essence of computability arguments <Emphasis Type="Italic">à la Tait and Girard</Emphasis>, therefore explaining the name of the improved ordering.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>The Computability Path Ordering: The End of a Quest</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>The Computability Path Ordering: The End of a Quest</title></titleInfo><name type="personal"><namePart type="given">Frédéric</namePart><namePart type="family">Blanqui</namePart><affiliation>INRIA, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy Cedex, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Jean-Pierre</namePart><namePart type="family">Jouannaud</namePart><affiliation>LIX, Projet INRIA TypiCal, École Polytechnique and CNRS, 91400, Palaiseau, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Albert</namePart><namePart type="family">Rubio</namePart><affiliation>Technical University of Catalonia, Pau Gargallo 5, 08028, Barcelona, Spain</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="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">2008</dateIssued><copyrightDate encoding="w3cdtf">2008</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path Ordering. This new definition appears indeed to capture the essence of computability arguments à la Tait and Girard, therefore explaining the name of the improved ordering.</abstract><relatedItem type="host"><titleInfo><title>Computer Science Logic</title><subTitle>22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Michael</namePart><namePart type="family">Kaminski</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Simone</namePart><namePart type="family">Martini</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">2008</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="M24005">Mathematical Logic and Foundations</topic></subject><identifier type="DOI">10.1007/978-3-540-87531-4</identifier><identifier type="ISBN">978-3-540-87530-7</identifier><identifier type="eISBN">978-3-540-87531-4</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">182303</identifier><identifier type="BookID">978-3-540-87531-4</identifier><identifier type="BookChapterCount">36</identifier><identifier type="BookVolumeNumber">5213</identifier><identifier type="BookSequenceNumber">5213</identifier><identifier type="PartChapterCount">4</identifier><part><date>2008</date><detail type="part"><title>Invited Talks</title></detail><detail type="volume"><number>5213</number><caption>vol.</caption></detail><extent unit="pages"><start>1</start><end>14</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2008</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2008</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 Berlin Heidelberg, 2008</recordOrigin></recordInfo></relatedItem><identifier type="istex">74A381911D5DF79F58B8566DCC5B0685679B7F7D</identifier><identifier type="ark">ark:/67375/HCB-DKW046KQ-W</identifier><identifier type="DOI">10.1007/978-3-540-87531-4_1</identifier><identifier type="ChapterID">1</identifier><identifier type="ChapterID">Chap1</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2008</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 Berlin Heidelberg, 2008</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-DKW046KQ-W/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 001A83 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001A83 | 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:74A381911D5DF79F58B8566DCC5B0685679B7F7D
|texte= The Computability Path Ordering: The End of a Quest
}}
| This area was generated with Dilib version V0.6.33. |  |