On the adequacy of per models
Identifieur interne : 003112 ( Istex/Corpus ); précédent : 003111; suivant : 003113On the adequacy of per models
Auteurs : Roberto M. AmadioSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We consider a fixed point extension of the second order lambda calculus equipped with a call by value evaluation mechanism. We interpret the language in a partial cartesian closed category of “directed complete” partial equivalence relations (pers) over a domain theoretic model of a type-free, call-by-value, lambda calculus. Our main result is that the notions of “syntactic” and “semantic” convergence coincide.
Url:
DOI: 10.1007/3-540-57182-5_14
Links to Exploration step
ISTEX:CF035835E1A696416479A35EEC1155C2AB8D5832Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On the adequacy of per models</title><author><name sortKey="Amadio, Roberto M" sort="Amadio, Roberto M" uniqKey="Amadio R" first="Roberto M." last="Amadio">Roberto M. Amadio</name><affiliation><mods:affiliation>CRIN-CNRS & Inria-Lorraine, B.P. 239, 54506, Vandœuvre-lès-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: amadio@loria.loria.fr</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:CF035835E1A696416479A35EEC1155C2AB8D5832</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1007/3-540-57182-5_14</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-RL6FH5JJ-M/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003112</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003112</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On the adequacy of per models</title><author><name sortKey="Amadio, Roberto M" sort="Amadio, Roberto M" uniqKey="Amadio R" first="Roberto M." last="Amadio">Roberto M. Amadio</name><affiliation><mods:affiliation>CRIN-CNRS & Inria-Lorraine, B.P. 239, 54506, Vandœuvre-lès-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: amadio@loria.loria.fr</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 consider a fixed point extension of the second order lambda calculus equipped with a call by value evaluation mechanism. We interpret the language in a partial cartesian closed category of “directed complete” partial equivalence relations (pers) over a domain theoretic model of a type-free, call-by-value, lambda calculus. Our main result is that the notions of “syntactic” and “semantic” convergence coincide.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Roberto M. Amadio</name><affiliations><json:string>CRIN-CNRS & Inria-Lorraine, B.P. 239, 54506, Vandœuvre-lès-Nancy, France</json:string><json:string>E-mail: amadio@loria.loria.fr</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>Second order lambda-calculus</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Per models</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Denotational vs. Operational Semantics</value></json:item></subject><arkIstex>ark:/67375/HCB-RL6FH5JJ-M</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><abstract>Abstract: We consider a fixed point extension of the second order lambda calculus equipped with a call by value evaluation mechanism. We interpret the language in a partial cartesian closed category of “directed complete” partial equivalence relations (pers) over a domain theoretic model of a type-free, call-by-value, lambda calculus. Our main result is that the notions of “syntactic” and “semantic” convergence coincide.</abstract><qualityIndicators><score>7.713</score><pdfWordCount>4969</pdfWordCount><pdfCharCount>25267</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>10</pdfPageCount><pdfPageSize>439.28 x 666 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>62</abstractWordCount><abstractCharCount>424</abstractCharCount><keywordCount>3</keywordCount></qualityIndicators><title>On the adequacy of per models</title><chapterId><json:string>14</json:string><json:string>Chap14</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>1993</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>G. Goos</name></json:item><json:item><name>J. Hartmanis</name></json:item></editor></serie><host><title>Mathematical Foundations of Computer Science 1993</title><language><json:string>unknown</json:string></language><copyrightDate>1993</copyrightDate><doi><json:string>10.1007/3-540-57182-5</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-47927-7</json:string></eisbn><bookId><json:string>3540571825</json:string></bookId><isbn><json:string>978-3-540-57182-7</json:string></isbn><volume>711</volume><pages><first>222</first><last>231</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Andrzej M. Borzyszkowski</name></json:item><json:item><name>Stefan Sokołowski</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Combinatorics</value></json:item><json:item><value>Data Structures</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-RL6FH5JJ-M</json:string></ark><publicationDate>1993</publicationDate><copyrightDate>1993</copyrightDate><doi><json:string>10.1007/3-540-57182-5_14</json:string></doi><id>CF035835E1A696416479A35EEC1155C2AB8D5832</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-RL6FH5JJ-M/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-RL6FH5JJ-M/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-RL6FH5JJ-M/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">On the adequacy of per models</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag</licence></availability><date when="1993">1993</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">On the adequacy of per models</title><author><persName><forename type="first">Roberto</forename><forename type="first">M.</forename><surname>Amadio</surname></persName><email>amadio@loria.loria.fr</email><affiliation><orgName type="institution">CRIN-CNRS & Inria-Lorraine</orgName><address><postBox>B.P. 239</postBox><postCode>54506</postCode><settlement>Vandœuvre-lès-Nancy</settlement><country key="FR">FRANCE</country></address></affiliation></author><idno type="istex">CF035835E1A696416479A35EEC1155C2AB8D5832</idno><idno type="ark">ark:/67375/HCB-RL6FH5JJ-M</idno><idno type="DOI">10.1007/3-540-57182-5_14</idno></analytic><monogr><title level="m" type="main">Mathematical Foundations of Computer Science 1993</title><title level="m" type="sub">18th International Symposium, MFCS'93 Gdańsk, Poland, August 30–September 3, 1993 Proceedings</title><idno type="DOI">10.1007/3-540-57182-5</idno><idno type="book-id">3540571825</idno><idno type="ISBN">978-3-540-57182-7</idno><idno type="eISBN">978-3-540-47927-7</idno><idno type="chapter-id">Chap14</idno><editor><persName><forename type="first">Andrzej</forename><forename type="first">M.</forename><surname>Borzyszkowski</surname></persName></editor><editor><persName><forename type="first">Stefan</forename><surname>Sokołowski</surname></persName></editor><imprint><biblScope unit="vol">711</biblScope><biblScope unit="page" from="222">222</biblScope><biblScope unit="page" to="231">231</biblScope><biblScope unit="chapter-count">68</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">G.</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>Hartmanis</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 consider a fixed point extension of the second order lambda calculus equipped with a call by value evaluation mechanism. We interpret the language in a partial cartesian closed category of “directed complete” partial equivalence relations (pers) over a domain theoretic model of a type-free, call-by-value, lambda calculus. Our main result is that the notions of “syntactic” and “semantic” convergence coincide.</p></abstract><textClass ana="keyword"><keywords xml:lang="en"><term>Second order lambda-calculus</term><term>Per models</term><term>Denotational vs. Operational Semantics</term></keywords></textClass><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>I16013</label><item><term type="Secondary" subtype="priority-1">Computation by Abstract Devices</term></item><label>I16021</label><item><term type="Secondary" subtype="priority-2">Algorithm Analysis and Problem Complexity</term></item><label>I1603X</label><item><term type="Secondary" subtype="priority-3">Logics and Meanings of Programs</term></item><label>I16048</label><item><term type="Secondary" subtype="priority-4">Mathematical Logic and Formal Languages</term></item><label>M17009</label><item><term type="Secondary" subtype="priority-5">Combinatorics</term></item><label>I15017</label><item><term type="Secondary" subtype="priority-6">Data Structures</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-RL6FH5JJ-M/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>G.</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540571825</BookID><BookTitle>Mathematical Foundations of Computer Science 1993</BookTitle><BookSubTitle>18th International Symposium, MFCS'93 Gdańsk, Poland, August 30–September 3, 1993 Proceedings</BookSubTitle><BookVolumeNumber>711</BookVolumeNumber><BookDOI>10.1007/3-540-57182-5</BookDOI><BookTitleID>33794</BookTitleID><BookPrintISBN>978-3-540-57182-7</BookPrintISBN><BookElectronicISBN>978-3-540-47927-7</BookElectronicISBN><BookChapterCount>68</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1993</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16013" Priority="1" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I16021" Priority="2" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I1603X" Priority="3" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I16048" Priority="4" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="M17009" Priority="5" Type="Secondary">Combinatorics</BookSubject><BookSubject Code="I15017" Priority="6" Type="Secondary">Data Structures</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Andrzej</GivenName><GivenName>M.</GivenName><FamilyName>Borzyszkowski</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Stefan</GivenName><FamilyName>Sokołowski</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap14" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>14</ChapterID><ChapterDOI>10.1007/3-540-57182-5_14</ChapterDOI><ChapterSequenceNumber>14</ChapterSequenceNumber><ChapterTitle Language="En">On the adequacy of per models</ChapterTitle><ChapterFirstPage>222</ChapterFirstPage><ChapterLastPage>231</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1993</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>5</Month><Day>30</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>3540571825</BookID><BookTitle>Mathematical Foundations of Computer Science 1993</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Roberto</GivenName><GivenName>M.</GivenName><FamilyName>Amadio</FamilyName></AuthorName><Contact><Email>amadio@loria.loria.fr</Email></Contact></Author><Affiliation ID="Aff1"><OrgName>CRIN-CNRS & Inria-Lorraine</OrgName><OrgAddress><Postbox>B.P. 239</Postbox><Postcode>54506</Postcode><City>Vandœuvre-lès-Nancy</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>We consider a fixed point extension of the second order lambda calculus equipped with a call by value evaluation mechanism. We interpret the language in a partial cartesian closed category of “directed complete” partial equivalence relations (pers) over a domain theoretic model of a type-free, call-by-value, lambda calculus. Our main result is that the notions of “syntactic” and “semantic” convergence coincide.</Para></Abstract><KeywordGroup Language="En"><Heading>Keywords</Heading><Keyword>Second order lambda-calculus</Keyword><Keyword>Per models</Keyword><Keyword>Denotational vs. Operational Semantics</Keyword></KeywordGroup><ArticleNote Type="PresentedAt"><SimplePara>This paper is a short version of [3] and was first presented at a CLICS meeting in Aarhus (April 92).</SimplePara></ArticleNote></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>On the adequacy of per models</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>On the adequacy of per models</title></titleInfo><name type="personal"><namePart type="given">Roberto</namePart><namePart type="given">M.</namePart><namePart type="family">Amadio</namePart><affiliation>CRIN-CNRS & Inria-Lorraine, B.P. 239, 54506, Vandœuvre-lès-Nancy, France</affiliation><affiliation>E-mail: amadio@loria.loria.fr</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">1993</dateIssued><copyrightDate encoding="w3cdtf">1993</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: We consider a fixed point extension of the second order lambda calculus equipped with a call by value evaluation mechanism. We interpret the language in a partial cartesian closed category of “directed complete” partial equivalence relations (pers) over a domain theoretic model of a type-free, call-by-value, lambda calculus. Our main result is that the notions of “syntactic” and “semantic” convergence coincide.</abstract><subject lang="en"><genre>Keywords</genre><topic>Second order lambda-calculus</topic><topic>Per models</topic><topic>Denotational vs. Operational Semantics</topic></subject><relatedItem type="host"><titleInfo><title>Mathematical Foundations of Computer Science 1993</title><subTitle>18th International Symposium, MFCS'93 Gdańsk, Poland, August 30–September 3, 1993 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Andrzej</namePart><namePart type="given">M.</namePart><namePart type="family">Borzyszkowski</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Stefan</namePart><namePart type="family">Sokołowski</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">1993</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="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="M17009">Combinatorics</topic><topic authority="SpringerSubjectCodes" authorityURI="I15017">Data Structures</topic></subject><identifier type="DOI">10.1007/3-540-57182-5</identifier><identifier type="ISBN">978-3-540-57182-7</identifier><identifier type="eISBN">978-3-540-47927-7</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">33794</identifier><identifier type="BookID">3540571825</identifier><identifier type="BookChapterCount">68</identifier><identifier type="BookVolumeNumber">711</identifier><part><date>1993</date><detail type="volume"><number>711</number><caption>vol.</caption></detail><extent unit="pages"><start>222</start><end>231</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1993</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1993</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, 1993</recordOrigin></recordInfo></relatedItem><identifier type="istex">CF035835E1A696416479A35EEC1155C2AB8D5832</identifier><identifier type="ark">ark:/67375/HCB-RL6FH5JJ-M</identifier><identifier type="DOI">10.1007/3-540-57182-5_14</identifier><identifier type="ChapterID">14</identifier><identifier type="ChapterID">Chap14</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1993</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, 1993</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-RL6FH5JJ-M/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 003112 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 003112 | 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:CF035835E1A696416479A35EEC1155C2AB8D5832
|texte= On the adequacy of per models
}}
| This area was generated with Dilib version V0.6.33. |  |