Defining λ-typed λ-calculi by axiomatizing the typing relation
Identifieur interne : 002B27 ( Istex/Corpus ); précédent : 002B26; suivant : 002B28Defining λ-typed λ-calculi by axiomatizing the typing relation
Auteurs : Philippe De GrooteSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We present a uniform framework for defining different gl-typed λ-calculi in terms of systems to derive typing judgements, akin to Barendregt's Pure Type Systems [3]. We first introduce a calculus called λλ and study its abstract properties. These are, among others, the property of Church-Rosser, the property of subject reduction, and the one of strong normalization. Then we show how to extend λλ to obtain an inferential definition. of Nederpelt's Λ [20]. One may also extend λλ to get inferential definitions of van Daalen Λ β [24], and de Bruijn's ΛΔ [9] and we argue that these new inferential definitions are well suited for language-theoretic investigations.
Url:
DOI: 10.1007/3-540-56503-5_73
Links to Exploration step
ISTEX:B6B8EB490F8D0635111C082E34EF2121FDA240DELe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Defining λ-typed λ-calculi by axiomatizing the typing relation</title><author><name sortKey="De Groote, Philippe" sort="De Groote, Philippe" uniqKey="De Groote P" first="Philippe" last="De Groote">Philippe De Groote</name><affiliation><mods:affiliation>INRIA-Lorraine-CRIN-CNRS, Campus Scientifique, 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:B6B8EB490F8D0635111C082E34EF2121FDA240DE</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1007/3-540-56503-5_73</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-770NS46L-8/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002B27</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002B27</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Defining λ-typed λ-calculi by axiomatizing the typing relation</title><author><name sortKey="De Groote, Philippe" sort="De Groote, Philippe" uniqKey="De Groote P" first="Philippe" last="De Groote">Philippe De Groote</name><affiliation><mods:affiliation>INRIA-Lorraine-CRIN-CNRS, Campus Scientifique, 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 present a uniform framework for defining different gl-typed λ-calculi in terms of systems to derive typing judgements, akin to Barendregt's Pure Type Systems [3]. We first introduce a calculus called λλ and study its abstract properties. These are, among others, the property of Church-Rosser, the property of subject reduction, and the one of strong normalization. Then we show how to extend λλ to obtain an inferential definition. of Nederpelt's Λ [20]. One may also extend λλ to get inferential definitions of van Daalen Λ β [24], and de Bruijn's ΛΔ [9] and we argue that these new inferential definitions are well suited for language-theoretic investigations.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Philippe de Groote</name><affiliations><json:string>INRIA-Lorraine-CRIN-CNRS, Campus Scientifique, B.P. 239, 54506, Vandœuvre-lès-Nancy Cedex, France</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-770NS46L-8</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><abstract>Abstract: We present a uniform framework for defining different gl-typed λ-calculi in terms of systems to derive typing judgements, akin to Barendregt's Pure Type Systems [3]. We first introduce a calculus called λλ and study its abstract properties. These are, among others, the property of Church-Rosser, the property of subject reduction, and the one of strong normalization. Then we show how to extend λλ to obtain an inferential definition. of Nederpelt's Λ [20]. One may also extend λλ to get inferential definitions of van Daalen Λ β [24], and de Bruijn's ΛΔ [9] and we argue that these new inferential definitions are well suited for language-theoretic investigations.</abstract><qualityIndicators><score>8.109</score><pdfWordCount>4825</pdfWordCount><pdfCharCount>24304</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>12</pdfPageCount><pdfPageSize>439.28 x 666 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>107</abstractWordCount><abstractCharCount>676</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Defining λ-typed λ-calculi by axiomatizing the typing relation</title><chapterId><json:string>73</json:string><json:string>Chap73</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>STACS 93</title><language><json:string>unknown</json:string></language><copyrightDate>1993</copyrightDate><doi><json:string>10.1007/3-540-56503-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-47574-3</json:string></eisbn><bookId><json:string>3540565035</json:string></bookId><isbn><json:string>978-3-540-56503-1</json:string></isbn><volume>665</volume><pages><first>712</first><last>723</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>P. Enjalbert</name></json:item><json:item><name>A. Finkel</name></json:item><json:item><name>K. W. Wagner</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>Arithmetic and Logic Structures</value></json:item><json:item><value>Logic Design</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-770NS46L-8</json:string></ark><publicationDate>1993</publicationDate><copyrightDate>1993</copyrightDate><doi><json:string>10.1007/3-540-56503-5_73</json:string></doi><id>B6B8EB490F8D0635111C082E34EF2121FDA240DE</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-770NS46L-8/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-770NS46L-8/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-770NS46L-8/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Defining λ-typed λ-calculi by axiomatizing the typing relation</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">Defining λ-typed λ-calculi by axiomatizing the typing relation</title><author><persName><forename type="first">Philippe</forename><nameLink>de</nameLink><surname>Groote</surname></persName><affiliation><orgName type="institution">INRIA-Lorraine-CRIN-CNRS</orgName><address><street>Campus Scientifique</street><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">B6B8EB490F8D0635111C082E34EF2121FDA240DE</idno><idno type="ark">ark:/67375/HCB-770NS46L-8</idno><idno type="DOI">10.1007/3-540-56503-5_73</idno></analytic><monogr><title level="m" type="main">STACS 93</title><title level="m" type="sub">10th Annual Symposium on Theoretical Ascpects of Computer Science Würzburg, Germany, February 25–27, 1993 Proceedings</title><idno type="DOI">10.1007/3-540-56503-5</idno><idno type="book-id">3540565035</idno><idno type="ISBN">978-3-540-56503-1</idno><idno type="eISBN">978-3-540-47574-3</idno><idno type="chapter-id">Chap73</idno><editor><persName><forename type="first">P.</forename><surname>Enjalbert</surname></persName></editor><editor><persName><forename type="first">A.</forename><surname>Finkel</surname></persName></editor><editor><persName><forename type="first">K.</forename><forename type="first">W.</forename><surname>Wagner</surname></persName></editor><imprint><biblScope unit="vol">665</biblScope><biblScope unit="page" from="712">712</biblScope><biblScope unit="page" to="723">723</biblScope><biblScope unit="chapter-count">73</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 present a uniform framework for defining different <hi rend="italic">gl</hi>-typed <hi rend="italic">λ</hi>-calculi in terms of systems to derive typing judgements, akin to Barendregt's Pure Type Systems [3]. We first introduce a calculus called λ<hi rend="superscript">λ</hi> and study its abstract properties. These are, among others, the property of Church-Rosser, the property of subject reduction, and the one of strong normalization. Then we show how to extend λ<hi rend="superscript">λ</hi> to obtain an inferential definition. of Nederpelt's Λ [20]. One may also extend λ<hi rend="superscript">λ</hi> to get inferential definitions of van Daalen Λ<hi rend="subscript"><hi rend="italic">β</hi></hi> [24], and de Bruijn's ΛΔ [9] and we argue that these new inferential definitions are well suited for language-theoretic investigations.</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>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>I12026</label><item><term type="Secondary" subtype="priority-5">Arithmetic and Logic Structures</term></item><label>I12050</label><item><term type="Secondary" subtype="priority-6">Logic Design</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-770NS46L-8/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>3540565035</BookID><BookTitle>STACS 93</BookTitle><BookSubTitle>10th Annual Symposium on Theoretical Ascpects of Computer Science Würzburg, Germany, February 25–27, 1993 Proceedings</BookSubTitle><BookVolumeNumber>665</BookVolumeNumber><BookDOI>10.1007/3-540-56503-5</BookDOI><BookTitleID>33749</BookTitleID><BookPrintISBN>978-3-540-56503-1</BookPrintISBN><BookElectronicISBN>978-3-540-47574-3</BookElectronicISBN><BookChapterCount>73</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="I12026" Priority="5" Type="Secondary">Arithmetic and Logic Structures</BookSubject><BookSubject Code="I12050" Priority="6" Type="Secondary">Logic Design</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>P.</GivenName><FamilyName>Enjalbert</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>A.</GivenName><FamilyName>Finkel</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>K.</GivenName><GivenName>W.</GivenName><FamilyName>Wagner</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap73" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>73</ChapterID><ChapterDOI>10.1007/3-540-56503-5_73</ChapterDOI><ChapterSequenceNumber>73</ChapterSequenceNumber><ChapterTitle Language="En">Defining λ-typed λ-calculi by axiomatizing the typing relation</ChapterTitle><ChapterFirstPage>712</ChapterFirstPage><ChapterLastPage>723</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1993</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>5</Month><Day>27</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>3540565035</BookID><BookTitle>STACS 93</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Philippe</GivenName><Particle>de</Particle><FamilyName>Groote</FamilyName></AuthorName></Author><Affiliation ID="Aff1"><OrgName>INRIA-Lorraine-CRIN-CNRS</OrgName><OrgAddress><Street>Campus Scientifique</Street><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 present a uniform framework for defining different <Emphasis Type="Italic">gl</Emphasis>-typed <Emphasis Type="Italic">λ</Emphasis>-calculi in terms of systems to derive typing judgements, akin to Barendregt's Pure Type Systems [3]. We first introduce a calculus called λ<Superscript>λ</Superscript> and study its abstract properties. These are, among others, the property of Church-Rosser, the property of subject reduction, and the one of strong normalization. Then we show how to extend λ<Superscript>λ</Superscript> to obtain an inferential definition. of Nederpelt's Λ [20]. One may also extend λ<Superscript>λ</Superscript> to get inferential definitions of van Daalen Λ<Subscript><Emphasis Type="Italic">β</Emphasis></Subscript> [24], and de Bruijn's ΛΔ [9] and we argue that these new inferential definitions are well suited for language-theoretic investigations.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Defining λ-typed λ-calculi by axiomatizing the typing relation</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Defining λ-typed λ-calculi by axiomatizing the typing relation</title></titleInfo><name type="personal"><namePart type="given">Philippe</namePart><namePart type="family">de Groote</namePart><affiliation>INRIA-Lorraine-CRIN-CNRS, Campus Scientifique, 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">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 present a uniform framework for defining different gl-typed λ-calculi in terms of systems to derive typing judgements, akin to Barendregt's Pure Type Systems [3]. We first introduce a calculus called λλ and study its abstract properties. These are, among others, the property of Church-Rosser, the property of subject reduction, and the one of strong normalization. Then we show how to extend λλ to obtain an inferential definition. of Nederpelt's Λ [20]. One may also extend λλ to get inferential definitions of van Daalen Λ β [24], and de Bruijn's ΛΔ [9] and we argue that these new inferential definitions are well suited for language-theoretic investigations.</abstract><relatedItem type="host"><titleInfo><title>STACS 93</title><subTitle>10th Annual Symposium on Theoretical Ascpects of Computer Science Würzburg, Germany, February 25–27, 1993 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">P.</namePart><namePart type="family">Enjalbert</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">A.</namePart><namePart type="family">Finkel</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">K.</namePart><namePart type="given">W.</namePart><namePart type="family">Wagner</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="I12026">Arithmetic and Logic Structures</topic><topic authority="SpringerSubjectCodes" authorityURI="I12050">Logic Design</topic></subject><identifier type="DOI">10.1007/3-540-56503-5</identifier><identifier type="ISBN">978-3-540-56503-1</identifier><identifier type="eISBN">978-3-540-47574-3</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">33749</identifier><identifier type="BookID">3540565035</identifier><identifier type="BookChapterCount">73</identifier><identifier type="BookVolumeNumber">665</identifier><part><date>1993</date><detail type="volume"><number>665</number><caption>vol.</caption></detail><extent unit="pages"><start>712</start><end>723</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">B6B8EB490F8D0635111C082E34EF2121FDA240DE</identifier><identifier type="ark">ark:/67375/HCB-770NS46L-8</identifier><identifier type="DOI">10.1007/3-540-56503-5_73</identifier><identifier type="ChapterID">73</identifier><identifier type="ChapterID">Chap73</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-770NS46L-8/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 002B27 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002B27 | 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:B6B8EB490F8D0635111C082E34EF2121FDA240DE
|texte= Defining λ-typed λ-calculi by axiomatizing the typing relation
}}
| This area was generated with Dilib version V0.6.33. |  |