Predicative functional recurrence and poly-space
Identifieur interne : 001872 ( Istex/Corpus ); précédent : 001871; suivant : 001873Predicative functional recurrence and poly-space
Auteurs : Daniel Leivant ; Jean-Yves MarionSource :
- 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 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><affiliation><mods:affiliation>Departments of Computer Science, Indiana University, 47405, Bloomington, IN, USA</mods:affiliation></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><mods:affiliation>CRIN - CNRS & INRIA Lorraine, Université Nancy 2, B.P. 239, 54506, Vand∄uvre-lès-Nancy Cedex, France</mods:affiliation></affiliation></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></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><mods:affiliation>Departments of Computer Science, Indiana University, 47405, Bloomington, IN, USA</mods:affiliation></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><mods:affiliation>CRIN - CNRS & INRIA Lorraine, Université Nancy 2, B.P. 239, 54506, Vand∄uvre-lès-Nancy Cedex, France</mods:affiliation></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><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Daniel Leivant</name><affiliations><json:string>Departments of Computer Science, Indiana University, 47405, Bloomington, IN, USA</json:string></affiliations></json:item><json:item><name>Jean-Yves Marion</name><affiliations><json:string>CRIN - CNRS & INRIA Lorraine, Université Nancy 2, B.P. 239, 54506, Vand∄uvre-lès-Nancy Cedex, France</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-4ZBX2BXM-C</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><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.</abstract><qualityIndicators><score>7.636</score><pdfWordCount>5395</pdfWordCount><pdfCharCount>25209</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>12</pdfPageCount><pdfPageSize>439.28 x 666 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>53</abstractWordCount><abstractCharCount>362</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Predicative functional recurrence and poly-space</title><chapterId><json:string>30</json:string><json:string>Chap30</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>1997</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>Gerhard Goos</name></json:item><json:item><name>Juris Hartmanis</name></json:item><json:item><name>Jan van Leeuwen</name></json:item></editor></serie><host><title>TAPSOFT '97: Theory and Practice of Software Development</title><language><json:string>unknown</json:string></language><copyrightDate>1997</copyrightDate><doi><json:string>10.1007/BFb0030581</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-68517-3</json:string></eisbn><bookId><json:string>3540627812</json:string></bookId><isbn><json:string>978-3-540-62781-4</json:string></isbn><volume>1214</volume><pages><first>369</first><last>380</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Michel Bidoit</name></json:item><json:item><name>Max Dauchet</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Software Engineering/Programming and Operating Systems</value></json:item><json:item><value>Theory of Computation</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-4ZBX2BXM-C</json:string></ark><publicationDate>1997</publicationDate><copyrightDate>1997</copyrightDate><doi><json:string>10.1007/BFb0030611</json:string></doi><id>6A3159D9DEA2267255861D9784131F302B55D193</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-4ZBX2BXM-C/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-4ZBX2BXM-C/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-4ZBX2BXM-C/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Predicative functional recurrence and poly-space</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag</licence></availability><date when="1997">1997</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">Predicative functional recurrence and poly-space</title><author><persName><forename type="first">Daniel</forename><surname>Leivant</surname></persName><affiliation><orgName type="department">Departments of Computer Science</orgName><orgName type="institution">Indiana University</orgName><address><postCode>47405</postCode><settlement>Bloomington</settlement><region>IN</region><country key="US">UNITED STATES</country></address></affiliation></author><author><persName><forename type="first">Jean-Yves</forename><surname>Marion</surname></persName><affiliation><orgName type="department">CRIN - CNRS & INRIA Lorraine</orgName><orgName type="institution">Université Nancy 2</orgName><address><postBox>B.P. 239</postBox><postCode>54506</postCode><settlement>Vand∄uvre-lès-Nancy Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></author><idno type="istex">6A3159D9DEA2267255861D9784131F302B55D193</idno><idno type="ark">ark:/67375/HCB-4ZBX2BXM-C</idno><idno type="DOI">10.1007/BFb0030611</idno></analytic><monogr><title level="m" type="main">TAPSOFT '97: Theory and Practice of Software Development</title><title level="m" type="sub">7th International Joint Conference CAAP/FASE Lille, France, April 14–18, 1997 Proceedings</title><idno type="DOI">10.1007/BFb0030581</idno><idno type="book-id">3540627812</idno><idno type="ISBN">978-3-540-62781-4</idno><idno type="eISBN">978-3-540-68517-3</idno><idno type="chapter-id">Chap30</idno><editor><persName><forename type="first">Michel</forename><surname>Bidoit</surname></persName></editor><editor><persName><forename type="first">Max</forename><surname>Dauchet</surname></persName></editor><imprint><biblScope unit="vol">1214</biblScope><biblScope unit="page" from="369">369</biblScope><biblScope unit="page" to="380">380</biblScope><biblScope unit="chapter-count">71</biblScope></imprint></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><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName></editor><editor><persName><forename type="first">Jan</forename><nameLink>van</nameLink><surname>Leeuwen</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>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.</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>I14002</label><item><term type="Secondary" subtype="priority-1">Software Engineering/Programming and Operating Systems</term></item><label>I16005</label><item><term type="Secondary" subtype="priority-2">Theory of Computation</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-4ZBX2BXM-C/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 TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540627812</BookID><BookTitle>TAPSOFT '97: Theory and Practice of Software Development</BookTitle><BookSubTitle>7th International Joint Conference CAAP/FASE Lille, France, April 14–18, 1997 Proceedings</BookSubTitle><BookVolumeNumber>1214</BookVolumeNumber><BookDOI>10.1007/BFb0030581</BookDOI><BookTitleID>46752</BookTitleID><BookPrintISBN>978-3-540-62781-4</BookPrintISBN><BookElectronicISBN>978-3-540-68517-3</BookElectronicISBN><BookChapterCount>71</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1997</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I14002" Priority="1" Type="Secondary">Software Engineering/Programming and Operating Systems</BookSubject><BookSubject Code="I16005" Priority="2" Type="Secondary">Theory of Computation</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Michel</GivenName><FamilyName>Bidoit</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Max</GivenName><FamilyName>Dauchet</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap30" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>30</ChapterID><ChapterDOI>10.1007/BFb0030611</ChapterDOI><ChapterSequenceNumber>30</ChapterSequenceNumber><ChapterTitle Language="En">Predicative functional recurrence and poly-space</ChapterTitle><ChapterCategory>II CAAP</ChapterCategory><ChapterSubCategory>CAAP-6: Complexity</ChapterSubCategory><ChapterFirstPage>369</ChapterFirstPage><ChapterLastPage>380</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1997</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>6</Month><Day>20</Day></OnlineDate></ChapterHistory><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><BookID>3540627812</BookID><BookTitle>TAPSOFT '97: Theory and Practice of Software Development</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Daniel</GivenName><FamilyName>Leivant</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Jean-Yves</GivenName><FamilyName>Marion</FamilyName></AuthorName></Author><Affiliation ID="Aff1"><OrgDivision>Departments of Computer Science</OrgDivision><OrgName>Indiana University</OrgName><OrgAddress><Postcode>47405</Postcode><City>Bloomington</City><State>IN</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgDivision>CRIN - CNRS & INRIA Lorraine</OrgDivision><OrgName>Université Nancy 2</OrgName><OrgAddress><Postbox>B.P. 239</Postbox><Postcode>54506</Postcode><City>Vand∄uvre-lès-Nancy Cedex</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>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.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Predicative functional recurrence and poly-space</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Predicative functional recurrence and poly-space</title></titleInfo><name type="personal"><namePart type="given">Daniel</namePart><namePart type="family">Leivant</namePart><affiliation>Departments of Computer Science, Indiana University, 47405, Bloomington, IN, USA</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Jean-Yves</namePart><namePart type="family">Marion</namePart><affiliation>CRIN - CNRS & INRIA Lorraine, Université Nancy 2, B.P. 239, 54506, Vand∄uvre-lès-Nancy Cedex, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="ReviewPaper" 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">1997</dateIssued><copyrightDate encoding="w3cdtf">1997</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract 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.</abstract><relatedItem type="host"><titleInfo><title>TAPSOFT '97: Theory and Practice of Software Development</title><subTitle>7th International Joint Conference CAAP/FASE Lille, France, April 14–18, 1997 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Michel</namePart><namePart type="family">Bidoit</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Max</namePart><namePart type="family">Dauchet</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">1997</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="I14002">Software Engineering/Programming and Operating Systems</topic><topic authority="SpringerSubjectCodes" authorityURI="I16005">Theory of Computation</topic></subject><identifier type="DOI">10.1007/BFb0030581</identifier><identifier type="ISBN">978-3-540-62781-4</identifier><identifier type="eISBN">978-3-540-68517-3</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">46752</identifier><identifier type="BookID">3540627812</identifier><identifier type="BookChapterCount">71</identifier><identifier type="BookVolumeNumber">1214</identifier><part><date>1997</date><detail type="volume"><number>1214</number><caption>vol.</caption></detail><extent unit="pages"><start>369</start><end>380</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1997</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1997</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, 1997</recordOrigin></recordInfo></relatedItem><identifier type="istex">6A3159D9DEA2267255861D9784131F302B55D193</identifier><identifier type="ark">ark:/67375/HCB-4ZBX2BXM-C</identifier><identifier type="DOI">10.1007/BFb0030611</identifier><identifier type="ChapterID">30</identifier><identifier type="ChapterID">Chap30</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1997</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, 1997</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-4ZBX2BXM-C/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 001872 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001872 | 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:6A3159D9DEA2267255861D9784131F302B55D193
|texte= Predicative functional recurrence and poly-space
}}
| This area was generated with Dilib version V0.6.33. |  |