Encoding the hydra battle as a rewrite system
Identifieur interne : 00BA94 ( Main/Merge ); précédent : 00BA93; suivant : 00BA95Encoding the hydra battle as a rewrite system
Auteurs : Hélène Touzet [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In rewriting theory, termination of a rewrite system by Kruskal's theorem implies a theoretical upper bound on the complexity of the system. This bound is, however, far from having been reached by known examples of rewrite systems. All known orderings used to establish termination by Kruskal's theorem yield a multiply recursive bound. Furthermore, the study of the order types of such orderings suggests that the class of multiple recursive functions constitutes the least upper bound. Contradicting this intuition, we construct here a rewrite system which reduces by Kruskal's theorem and whose complexity is not multiply recursive. This system is even totally terminating. This leads to a new lower bound for the complexity of totally terminating rewrite systems and rewrite systems which reduce by Kruskal's theorem. Our construction relies on the Hydra battle using classical tools from ordinal theory and subrecursive functions.
Url:
DOI: 10.1007/BFb0055776
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000829
- to stream Istex, to step Curation: 000824
- to stream Istex, to step Checkpoint: 002604
Links to Exploration step
ISTEX:24AD226425D7E55D935201681F0FDA4FAF697F06Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Encoding the hydra battle as a rewrite system</title><author><name sortKey="Touzet, Helene" sort="Touzet, Helene" uniqKey="Touzet H" first="Hélène" last="Touzet">Hélène Touzet</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:24AD226425D7E55D935201681F0FDA4FAF697F06</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1007/BFb0055776</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-S4JVX9G7-T/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000829</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000829</idno><idno type="wicri:Area/Istex/Curation">000824</idno><idno type="wicri:Area/Istex/Checkpoint">002604</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002604</idno><idno type="wicri:doubleKey">0302-9743:1998:Touzet H:encoding:the:hydra</idno><idno type="wicri:Area/Main/Merge">00BA94</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Encoding the hydra battle as a rewrite system</title><author><name sortKey="Touzet, Helene" sort="Touzet, Helene" uniqKey="Touzet H" first="Hélène" last="Touzet">Hélène Touzet</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>Loria - Université Nancy 2, BP 239, 54506, Vandœuvre-lès-Nancy</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><orgName type="university">Université Nancy 2</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></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: In rewriting theory, termination of a rewrite system by Kruskal's theorem implies a theoretical upper bound on the complexity of the system. This bound is, however, far from having been reached by known examples of rewrite systems. All known orderings used to establish termination by Kruskal's theorem yield a multiply recursive bound. Furthermore, the study of the order types of such orderings suggests that the class of multiple recursive functions constitutes the least upper bound. Contradicting this intuition, we construct here a rewrite system which reduces by Kruskal's theorem and whose complexity is not multiply recursive. This system is even totally terminating. This leads to a new lower bound for the complexity of totally terminating rewrite systems and rewrite systems which reduce by Kruskal's theorem. Our construction relies on the Hydra battle using classical tools from ordinal theory and subrecursive functions.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00BA94 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00BA94 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:24AD226425D7E55D935201681F0FDA4FAF697F06
|texte= Encoding the hydra battle as a rewrite system
}}
| This area was generated with Dilib version V0.6.33. |  |