A type-based termination criterion for dependently-typed higher-order rewrite systems
Identifieur interne : 000633 ( PascalFrancis/Checkpoint ); précédent : 000632; suivant : 000634A type-based termination criterion for dependently-typed higher-order rewrite systems
Auteurs : Frédéric Blanqui [France]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 2004.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent types, hence providing a powerful termination criterion for the combination of rewriting and β-reduction in the Calculus of Constructions.
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:04-0300055Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A type-based termination criterion for dependently-typed higher-order rewrite systems</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"><inist:fA14 i1="01"><s1>LORIA & INRIA, 615 rue du Jardin Botanique, BP 101</s1><s2>54602 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy</settlement></placeName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">04-0300055</idno><date when="2004">2004</date><idno type="stanalyst">PASCAL 04-0300055 INIST</idno><idno type="RBID">Pascal:04-0300055</idno><idno type="wicri:Area/PascalFrancis/Corpus">000670</idno><idno type="wicri:Area/PascalFrancis/Curation">000371</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000633</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000633</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A type-based termination criterion for dependently-typed higher-order rewrite systems</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"><inist:fA14 i1="01"><s1>LORIA & INRIA, 615 rue du Jardin Botanique, BP 101</s1><s2>54602 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy</settlement></placeName></affiliation></author></analytic><series><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno><imprint><date when="2004">2004</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>ML language</term><term>Rewriting</term><term>Rewriting systems</term><term>Termination problem</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Système réécriture</term><term>Langage ML</term><term>Réécriture</term><term>Problème terminaison</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent types, hence providing a powerful termination criterion for the combination of rewriting and β-reduction in the Calculus of Constructions.</div></front></TEI><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0></fA01><fA05><s2>3091</s2></fA05><fA08 i1="01" i2="1" l="ENG"><s1>A type-based termination criterion for dependently-typed higher-order rewrite systems</s1></fA08><fA09 i1="01" i2="1" l="ENG"><s1>RTA 2004 : rewriting techniques and applications : Aachen, 3-5 June 2004</s1></fA09><fA11 i1="01" i2="1"><s1>BLANQUI (Frédéric)</s1></fA11><fA12 i1="01" i2="1"><s1>VAN OOSTROM (Vincent)</s1><s9>ed.</s9></fA12><fA14 i1="01"><s1>LORIA & INRIA, 615 rue du Jardin Botanique, BP 101</s1><s2>54602 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></fA14><fA20><s1>24-39</s1></fA20><fA21><s1>2004</s1></fA21><fA23 i1="01"><s0>ENG</s0></fA23><fA26 i1="01"><s0>3-540-22153-0</s0></fA26><fA43 i1="01"><s1>INIST</s1><s2>16343</s2><s5>354000117890550020</s5></fA43><fA44><s0>0000</s0><s1>© 2004 INIST-CNRS. All rights reserved.</s1></fA44><fA45><s0>26 ref.</s0></fA45><fA47 i1="01" i2="1"><s0>04-0300055</s0></fA47><fA60><s1>P</s1><s2>C</s2></fA60><fA61><s0>A</s0></fA61><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0></fA64><fA66 i1="01"><s0>DEU</s0></fA66><fC01 i1="01" l="ENG"><s0>Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent types, hence providing a powerful termination criterion for the combination of rewriting and β-reduction in the Calculus of Constructions.</s0></fC01><fC02 i1="01" i2="X"><s0>001D02A07</s0></fC02><fC03 i1="01" i2="3" l="FRE"><s0>Système réécriture</s0><s5>09</s5></fC03><fC03 i1="01" i2="3" l="ENG"><s0>Rewriting systems</s0><s5>09</s5></fC03><fC03 i1="02" i2="3" l="FRE"><s0>Langage ML</s0><s5>10</s5></fC03><fC03 i1="02" i2="3" l="ENG"><s0>ML language</s0><s5>10</s5></fC03><fC03 i1="03" i2="X" l="FRE"><s0>Réécriture</s0><s5>18</s5></fC03><fC03 i1="03" i2="X" l="ENG"><s0>Rewriting</s0><s5>18</s5></fC03><fC03 i1="03" i2="X" l="SPA"><s0>Reescritura</s0><s5>18</s5></fC03><fC03 i1="04" i2="X" l="FRE"><s0>Problème terminaison</s0><s5>23</s5></fC03><fC03 i1="04" i2="X" l="ENG"><s0>Termination problem</s0><s5>23</s5></fC03><fC03 i1="04" i2="X" l="SPA"><s0>Problema terminación</s0><s5>23</s5></fC03><fN21><s1>180</s1></fN21><fN44 i1="01"><s1>OTO</s1></fN44><fN82><s1>OTO</s1></fN82></pA><pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference on rewriting techniques and applications</s1><s2>15</s2><s3>Aachen DEU</s3><s4>2004-06-03</s4></fA30></pR></standard></inist><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Villers-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/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000633 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000633 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Checkpoint
|type= RBID
|clé= Pascal:04-0300055
|texte= A type-based termination criterion for dependently-typed higher-order rewrite systems
}}
| This area was generated with Dilib version V0.6.33. |  |