Computability Closure: Ten Years Later
Identifieur interne : 004C86 ( Main/Exploration ); précédent : 004C85; suivant : 004C87Computability Closure: Ten Years Later
Auteurs : Frédéric Blanqui [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: The notion of computability closure has been introduced for proving the termination of higher-order rewriting with first-order matching by Jean-Pierre Jouannaud and Mitsuhiro Okada in a 1997 draft which later served as a basis for the author’s PhD. In this paper, we show how this notion can also be used for dealing with β-normalized rewriting with matching modulo βη (on patterns à la Miller), rewriting with matching modulo some equational theory, and higher-order data types (types with constructors having functional recursive arguments). Finally, we show how the computability closure can easily be turned into a reduction ordering which, in the higher-order case, contains Jean-Pierre Jouannaud and Albert Rubio’s higher-order recursive path ordering and, in the first-order case, is equal to the usual first-order recursive path ordering.
Url:
DOI: 10.1007/978-3-540-73147-4_4
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003670
- to stream Istex, to step Curation: 003628
- to stream Istex, to step Checkpoint: 001071
- to stream Hal, to step Corpus: 001729
- to stream Hal, to step Curation: 001729
- to stream Hal, to step Checkpoint: 003A09
- to stream Main, to step Merge: 004E20
- to stream Main, to step Curation: 004C86
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Computability Closure: Ten Years Later</title>
<author><name sortKey="Blanqui, Frederic" sort="Blanqui, Frederic" uniqKey="Blanqui F" first="Frédéric" last="Blanqui">Frédéric Blanqui</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:E3FE0CBBE9BD0193242727EE89D28A71D80DD836</idno>
<date when="2007" year="2007">2007</date>
<idno type="doi">10.1007/978-3-540-73147-4_4</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-GVJ8N83Z-8/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">003670</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003670</idno>
<idno type="wicri:Area/Istex/Curation">003628</idno>
<idno type="wicri:Area/Istex/Checkpoint">001071</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001071</idno>
<idno type="wicri:doubleKey">0302-9743:2007:Blanqui F:computability:closure:ten</idno>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00161092</idno>
<idno type="url">https://hal.inria.fr/inria-00161092</idno>
<idno type="wicri:Area/Hal/Corpus">001729</idno>
<idno type="wicri:Area/Hal/Curation">001729</idno>
<idno type="wicri:Area/Hal/Checkpoint">003A09</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">003A09</idno>
<idno type="wicri:Area/Main/Merge">004E20</idno>
<idno type="wicri:Area/Main/Curation">004C86</idno>
<idno type="wicri:Area/Main/Exploration">004C86</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Computability Closure: Ten Years Later</title>
<author><name sortKey="Blanqui, Frederic" sort="Blanqui, Frederic" uniqKey="Blanqui F" first="Frédéric" last="Blanqui">Frédéric Blanqui</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>INRIA, LORIA, Campus Scientifique, BP 239, 54506 Vandoeuvre-lès-Nancy Cedex</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</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><keywords scheme="mix" xml:lang="ro"><term>lambda-calculus</term>
<term>rewriting</term>
<term>termination</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: The notion of computability closure has been introduced for proving the termination of higher-order rewriting with first-order matching by Jean-Pierre Jouannaud and Mitsuhiro Okada in a 1997 draft which later served as a basis for the author’s PhD. In this paper, we show how this notion can also be used for dealing with β-normalized rewriting with matching modulo βη (on patterns à la Miller), rewriting with matching modulo some equational theory, and higher-order data types (types with constructors having functional recursive arguments). Finally, we show how the computability closure can easily be turned into a reduction ordering which, in the higher-order case, contains Jean-Pierre Jouannaud and Albert Rubio’s higher-order recursive path ordering and, in the first-order case, is equal to the usual first-order recursive path ordering.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Vandœuvre-lès-Nancy</li>
</settlement>
</list>
<tree><country name="France"><region name="Grand Est"><name sortKey="Blanqui, Frederic" sort="Blanqui, Frederic" uniqKey="Blanqui F" first="Frédéric" last="Blanqui">Frédéric Blanqui</name>
</region>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004C86 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 004C86 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:E3FE0CBBE9BD0193242727EE89D28A71D80DD836 |texte= Computability Closure: Ten Years Later }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |