Predicative functional recurrence and poly-space
Identifieur interne : 00C401 ( Main/Merge ); précédent : 00C400; suivant : 00C402Predicative functional recurrence and poly-space
Auteurs : Daniel Leivant [États-Unis] ; Jean-Yves Marion [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We formulate a notion of predicative function types, and define predicative recurrence over functions, both in equational style and as an applicative formalism, pointing out the equivalence between the two approaches. We then show that a function is poly-space iff it is defined using predicative functionals obtained by ramified recurrence over words.
Url:
DOI: 10.1007/BFb0030611
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001872
- to stream Istex, to step Curation: 001853
- to stream Istex, to step Checkpoint: 002756
Links to Exploration step
ISTEX:6A3159D9DEA2267255861D9784131F302B55D193Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Predicative functional recurrence and poly-space</title>
<author><name sortKey="Leivant, Daniel" sort="Leivant, Daniel" uniqKey="Leivant D" first="Daniel" last="Leivant">Daniel Leivant</name>
</author>
<author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:6A3159D9DEA2267255861D9784131F302B55D193</idno>
<date when="1997" year="1997">1997</date>
<idno type="doi">10.1007/BFb0030611</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-4ZBX2BXM-C/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001872</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001872</idno>
<idno type="wicri:Area/Istex/Curation">001853</idno>
<idno type="wicri:Area/Istex/Checkpoint">002756</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002756</idno>
<idno type="wicri:doubleKey">0302-9743:1997:Leivant D:predicative:functional:recurrence</idno>
<idno type="wicri:Area/Main/Merge">00C401</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Predicative functional recurrence and poly-space</title>
<author><name sortKey="Leivant, Daniel" sort="Leivant, Daniel" uniqKey="Leivant D" first="Daniel" last="Leivant">Daniel Leivant</name>
<affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Departments of Computer Science, Indiana University, 47405, Bloomington, IN</wicri:regionArea>
<placeName><region type="state">Indiana</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
<affiliation wicri:level="4"><country xml:lang="fr">France</country>
<wicri:regionArea>CRIN - CNRS & INRIA Lorraine, Université Nancy 2, B.P. 239, 54506, Vand∄uvre-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>
<orgName type="university">Université Nancy 2</orgName>
</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: We formulate a notion of predicative function types, and define predicative recurrence over functions, both in equational style and as an applicative formalism, pointing out the equivalence between the two approaches. We then show that a function is poly-space iff it is defined using predicative functionals obtained by ramified recurrence over words.</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 00C401 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00C401 | 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:6A3159D9DEA2267255861D9784131F302B55D193 |texte= Predicative functional recurrence and poly-space }}
This area was generated with Dilib version V0.6.33. |