Strong Normalization of Classical Natural Deduction with Disjunction
Identifieur interne : 000194 ( Istex/Corpus ); précédent : 000193; suivant : 000195Strong Normalization of Classical Natural Deduction with Disjunction
Auteurs : Philippe De GrooteSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We introduce λμ →∧∨⊥ an extension of Parigot’s λμ-calculus where disjunction is taken as a primitive. The associated reduction rela- tion, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal de- ductions satisfy the subformula property. From a computer science point of view, λμ →∧∨⊥ may be seen as the core of a typed cbn functional language featuring product, coproduct, and control operators.
Url:
DOI: 10.1007/3-540-45413-6_17
Links to Exploration step
ISTEX:0903F7C71808D6C42127185BF5D5FC97A202603DLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Strong Normalization of Classical Natural Deduction with Disjunction</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>LORIA UMR no 7503 - INRIA, Campus Scientifique, B.P. 239, 54506, Vandœvre lès Nancy Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Philippe.de.Groote@loria.fr</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:0903F7C71808D6C42127185BF5D5FC97A202603D</idno>
<date when="2001" year="2001">2001</date>
<idno type="doi">10.1007/3-540-45413-6_17</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-3DBL5T97-S/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000194</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000194</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Strong Normalization of Classical Natural Deduction with Disjunction</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>LORIA UMR no 7503 - INRIA, Campus Scientifique, B.P. 239, 54506, Vandœvre lès Nancy Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Philippe.de.Groote@loria.fr</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</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 introduce λμ →∧∨⊥ an extension of Parigot’s λμ-calculus where disjunction is taken as a primitive. The associated reduction rela- tion, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal de- ductions satisfy the subformula property. From a computer science point of view, λμ →∧∨⊥ may be seen as the core of a typed cbn functional language featuring product, coproduct, and control operators.</div>
</front>
</TEI>
<istex><corpusName>springer-ebooks</corpusName>
<author><json:item><name>Philippe de Groote</name>
<affiliations><json:string>LORIA UMR no 7503 - INRIA, Campus Scientifique, B.P. 239, 54506, Vandœvre lès Nancy Cedex, France</json:string>
<json:string>E-mail: Philippe.de.Groote@loria.fr</json:string>
</affiliations>
</json:item>
</author>
<arkIstex>ark:/67375/HCB-3DBL5T97-S</arkIstex>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>OriginalPaper</json:string>
</originalGenre>
<abstract>Abstract: We introduce λμ →∧∨⊥ an extension of Parigot’s λμ-calculus where disjunction is taken as a primitive. The associated reduction rela- tion, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal de- ductions satisfy the subformula property. From a computer science point of view, λμ →∧∨⊥ may be seen as the core of a typed cbn functional language featuring product, coproduct, and control operators.</abstract>
<qualityIndicators><refBibsNative>false</refBibsNative>
<abstractWordCount>72</abstractWordCount>
<abstractCharCount>485</abstractCharCount>
<keywordCount>0</keywordCount>
<score>7.864</score>
<pdfWordCount>5166</pdfWordCount>
<pdfCharCount>24303</pdfCharCount>
<pdfVersion>1.3</pdfVersion>
<pdfPageCount>15</pdfPageCount>
<pdfPageSize>430 x 650 pts</pdfPageSize>
</qualityIndicators>
<title>Strong Normalization of Classical Natural Deduction with Disjunction</title>
<chapterId><json:string>17</json:string>
<json:string>Chap17</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>2001</copyrightDate>
<issn><json:string>0302-9743</json:string>
</issn>
<editor><json:item><name>Gerhard Goos</name>
<affiliations><json:string>Karlsruhe University, Germany</json:string>
</affiliations>
</json:item>
<json:item><name>Juris Hartmanis</name>
<affiliations><json:string>Cornell University, NY, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Jan van Leeuwen</name>
<affiliations><json:string>Utrecht University, The Netherlands</json:string>
</affiliations>
</json:item>
</editor>
</serie>
<host><title>Typed Lambda Calculi and Applications</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>2001</copyrightDate>
<doi><json:string>10.1007/3-540-45413-6</json:string>
</doi>
<issn><json:string>0302-9743</json:string>
</issn>
<eisbn><json:string>978-3-540-45413-7</json:string>
</eisbn>
<bookId><json:string>3-540-45413-6</json:string>
</bookId>
<isbn><json:string>978-3-540-41960-0</json:string>
</isbn>
<volume>2044</volume>
<pages><first>182</first>
<last>196</last>
</pages>
<genre><json:string>book-series</json:string>
</genre>
<editor><json:item><name>Samson Abramsky</name>
<affiliations><json:string>Oxford University Computing Laboratory, Wolfson Building, Parks Road, OX1 3QD, Oxford, USA</json:string>
<json:string>E-mail: Samson.Abramsky@comlab.ox.ac.uk</json:string>
</affiliations>
</json:item>
</editor>
<subject><json:item><value>Computer Science</value>
</json:item>
<json:item><value>Computer Science</value>
</json:item>
<json:item><value>Mathematical Logic and Formal Languages</value>
</json:item>
<json:item><value>Logics and Meanings of Programs</value>
</json:item>
<json:item><value>Programming Techniques</value>
</json:item>
<json:item><value>Programming Languages, Compilers, Interpreters</value>
</json:item>
<json:item><value>Mathematical Logic and Foundations</value>
</json:item>
</subject>
</host>
<ark><json:string>ark:/67375/HCB-3DBL5T97-S</json:string>
</ark>
<publicationDate>2001</publicationDate>
<copyrightDate>2001</copyrightDate>
<doi><json:string>10.1007/3-540-45413-6_17</json:string>
</doi>
<id>0903F7C71808D6C42127185BF5D5FC97A202603D</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-3DBL5T97-S/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-3DBL5T97-S/bundle.zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-3DBL5T97-S/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Strong Normalization of Classical Natural Deduction with Disjunction</title>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<availability><licence>Springer-Verlag Berlin Heidelberg</licence>
</availability>
<date when="2001">2001</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">Strong Normalization of Classical Natural Deduction with Disjunction</title>
<author><persName><forename type="first">Philippe</forename>
<nameLink>de</nameLink>
<surname>Groote</surname>
</persName>
<email>Philippe.de.Groote@loria.fr</email>
<affiliation><orgName type="department">LORIA UMR no 7503 - INRIA</orgName>
<orgName type="institution">Campus Scientifique</orgName>
<address><postBox>B.P. 239</postBox>
<postCode>54506</postCode>
<settlement>Vandœvre lès Nancy Cedex</settlement>
<country key="FR">FRANCE</country>
</address>
</affiliation>
</author>
<idno type="istex">0903F7C71808D6C42127185BF5D5FC97A202603D</idno>
<idno type="ark">ark:/67375/HCB-3DBL5T97-S</idno>
<idno type="DOI">10.1007/3-540-45413-6_17</idno>
</analytic>
<monogr><title level="m" type="main">Typed Lambda Calculi and Applications</title>
<title level="m" type="sub">5th International Conference, TLCA 2001 Kraków, Poland, May 2–5, 2001 Proceedings</title>
<title level="m" type="part">Contributed Papers</title>
<idno type="DOI">10.1007/3-540-45413-6</idno>
<idno type="book-id">3-540-45413-6</idno>
<idno type="ISBN">978-3-540-41960-0</idno>
<idno type="eISBN">978-3-540-45413-7</idno>
<idno type="chapter-id">Chap17</idno>
<idno type="part-id">Part2</idno>
<editor><persName><forename type="first">Samson</forename>
<surname>Abramsky</surname>
</persName>
<email>Samson.Abramsky@comlab.ox.ac.uk</email>
<affiliation><orgName type="institution">Oxford University Computing Laboratory</orgName>
<address><street>Wolfson Building, Parks Road</street>
<settlement>Oxford</settlement>
<postCode>OX1 3QD</postCode>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<imprint><biblScope unit="vol">2044</biblScope>
<biblScope unit="page" from="182">182</biblScope>
<biblScope unit="page" to="196">196</biblScope>
<biblScope unit="chapter-count">32</biblScope>
<biblScope unit="part-chapter-count">28</biblScope>
</imprint>
</monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<editor><persName><forename type="first">Gerhard</forename>
<surname>Goos</surname>
</persName>
<affiliation><orgName type="institution">Karlsruhe University</orgName>
<address><country key="DE">GERMANY</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Juris</forename>
<surname>Hartmanis</surname>
</persName>
<affiliation><orgName type="institution">Cornell University</orgName>
<address><settlement>NY</settlement>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Jan</forename>
<nameLink>van</nameLink>
<surname>Leeuwen</surname>
</persName>
<affiliation><orgName type="institution">Utrecht University</orgName>
<address><country key=""></country>
</address>
</affiliation>
</editor>
<idno type="pISSN">0302-9743</idno>
<idno type="seriesID">558</idno>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><abstract xml:lang="en"><head>Abstract</head>
<p>We introduce λ<hi rend="BoldItalic">μ</hi>
<hi rend="superscript">→∧∨⊥</hi>
an extension of Parigot’s λμ-calculus where disjunction is taken as a primitive. The associated reduction rela- tion, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal de- ductions satisfy the subformula property. From a computer science point of view, λ<hi rend="BoldItalic">μ</hi>
<hi rend="superscript">→∧∨⊥</hi>
may be seen as the core of a typed cbn functional language featuring product, coproduct, and control operators.</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>I16048</label>
<item><term type="Secondary" subtype="priority-1">Mathematical Logic and Formal Languages</term>
</item>
<label>I1603X</label>
<item><term type="Secondary" subtype="priority-2">Logics and Meanings of Programs</term>
</item>
<label>I14010</label>
<item><term type="Secondary" subtype="priority-3">Programming Techniques</term>
</item>
<label>I14037</label>
<item><term type="Secondary" subtype="priority-4">Programming Languages, Compilers, Interpreters</term>
</item>
<label>M24005</label>
<item><term type="Secondary" subtype="priority-5">Mathematical Logic and Foundations</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-3DBL5T97-S/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 SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID>
<SeriesPrintISSN>0302-9743</SeriesPrintISSN>
<SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle>
</SeriesInfo>
<SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName>
<FamilyName>Goos</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName>
<FamilyName>Hartmanis</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName>
<Particle>van</Particle>
<FamilyName>Leeuwen</FamilyName>
</EditorName>
</Editor>
<Affiliation ID="Aff1"><OrgName>Karlsruhe University</OrgName>
<OrgAddress><Country>Germany</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff2"><OrgName>Cornell University</OrgName>
<OrgAddress><City>NY</City>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff3"><OrgName>Utrecht University</OrgName>
<OrgAddress><Country>The Netherlands</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</SeriesHeader>
<Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-45413-6</BookID>
<BookTitle>Typed Lambda Calculi and Applications</BookTitle>
<BookSubTitle>5th International Conference, TLCA 2001 Kraków, Poland, May 2–5, 2001 Proceedings</BookSubTitle>
<BookVolumeNumber>2044</BookVolumeNumber>
<BookSequenceNumber>2044</BookSequenceNumber>
<BookDOI>10.1007/3-540-45413-6</BookDOI>
<BookTitleID>67015</BookTitleID>
<BookPrintISBN>978-3-540-41960-0</BookPrintISBN>
<BookElectronicISBN>978-3-540-45413-7</BookElectronicISBN>
<BookChapterCount>32</BookChapterCount>
<BookHistory><OnlineDate><Year>2001</Year>
<Month>4</Month>
<Day>25</Day>
</OnlineDate>
</BookHistory>
<BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2001</CopyrightYear>
</BookCopyright>
<BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject>
<BookSubject Code="I16048" Priority="1" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject>
<BookSubject Code="I1603X" Priority="2" Type="Secondary">Logics and Meanings of Programs</BookSubject>
<BookSubject Code="I14010" Priority="3" Type="Secondary">Programming Techniques</BookSubject>
<BookSubject Code="I14037" Priority="4" Type="Secondary">Programming Languages, Compilers, Interpreters</BookSubject>
<BookSubject Code="M24005" Priority="5" Type="Secondary">Mathematical Logic and Foundations</BookSubject>
<SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection>
</BookSubjectGroup>
<BookContext><SeriesID>558</SeriesID>
</BookContext>
</BookInfo>
<BookHeader><EditorGroup><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Samson</GivenName>
<FamilyName>Abramsky</FamilyName>
</EditorName>
<Contact><Email>Samson.Abramsky@comlab.ox.ac.uk</Email>
</Contact>
</Editor>
<Affiliation ID="Aff4"><OrgName>Oxford University Computing Laboratory</OrgName>
<OrgAddress><Street>Wolfson Building, Parks Road</Street>
<City>Oxford</City>
<Postcode>OX1 3QD</Postcode>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</BookHeader>
<Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID>
<PartSequenceNumber>2</PartSequenceNumber>
<PartTitle>Contributed Papers</PartTitle>
<PartChapterCount>28</PartChapterCount>
<PartContext><SeriesID>558</SeriesID>
<BookID>3-540-45413-6</BookID>
<BookTitle>Typed Lambda Calculi and Applications</BookTitle>
</PartContext>
</PartInfo>
<Chapter ID="Chap17" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>17</ChapterID>
<ChapterDOI>10.1007/3-540-45413-6_17</ChapterDOI>
<ChapterSequenceNumber>17</ChapterSequenceNumber>
<ChapterTitle Language="En">Strong Normalization of Classical Natural Deduction with Disjunction</ChapterTitle>
<ChapterFirstPage>182</ChapterFirstPage>
<ChapterLastPage>196</ChapterLastPage>
<ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2001</CopyrightYear>
</ChapterCopyright>
<ChapterHistory><RegistrationDate><Year>2001</Year>
<Month>4</Month>
<Day>24</Day>
</RegistrationDate>
<OnlineDate><Year>2001</Year>
<Month>4</Month>
<Day>25</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>
<PartID>2</PartID>
<BookID>3-540-45413-6</BookID>
<BookTitle>Typed Lambda Calculi and Applications</BookTitle>
</ChapterContext>
</ChapterInfo>
<ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff5"><AuthorName DisplayOrder="Western"><GivenName>Philippe</GivenName>
<Particle>de</Particle>
<FamilyName>Groote</FamilyName>
</AuthorName>
<Contact><Phone>+33 3 83 59 30 32</Phone>
<Fax>+33 3 83 27 83 19</Fax>
<Email>Philippe.de.Groote@loria.fr</Email>
</Contact>
</Author>
<Affiliation ID="Aff5"><OrgDivision>LORIA UMR no 7503 - INRIA</OrgDivision>
<OrgName>Campus Scientifique</OrgName>
<OrgAddress><Postbox>B.P. 239</Postbox>
<Postcode>54506</Postcode>
<City>Vandœvre lès Nancy Cedex</City>
<Country>France</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>We introduce λ<Emphasis Type="BoldItalic">μ</Emphasis>
<Superscript>→∧∨⊥</Superscript>
an extension of Parigot’s λμ-calculus where disjunction is taken as a primitive. The associated reduction rela- tion, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal de- ductions satisfy the subformula property. From a computer science point of view, λ<Emphasis Type="BoldItalic">μ</Emphasis>
<Superscript>→∧∨⊥</Superscript>
may be seen as the core of a typed cbn functional language featuring product, coproduct, and control operators.</Para>
</Abstract>
</ChapterHeader>
<NoBody></NoBody>
</Chapter>
</Part>
</Book>
</Series>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Strong Normalization of Classical Natural Deduction with Disjunction</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA"><title>Strong Normalization of Classical Natural Deduction with Disjunction</title>
</titleInfo>
<name type="personal"><namePart type="given">Philippe</namePart>
<namePart type="family">de Groote</namePart>
<affiliation>LORIA UMR no 7503 - INRIA, Campus Scientifique, B.P. 239, 54506, Vandœvre lès Nancy Cedex, France</affiliation>
<affiliation>E-mail: Philippe.de.Groote@loria.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre displayLabel="OriginalPaper" 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">2001</dateIssued>
<copyrightDate encoding="w3cdtf">2001</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<abstract lang="en">Abstract: We introduce λμ →∧∨⊥ an extension of Parigot’s λμ-calculus where disjunction is taken as a primitive. The associated reduction rela- tion, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal de- ductions satisfy the subformula property. From a computer science point of view, λμ →∧∨⊥ may be seen as the core of a typed cbn functional language featuring product, coproduct, and control operators.</abstract>
<relatedItem type="host"><titleInfo><title>Typed Lambda Calculi and Applications</title>
<subTitle>5th International Conference, TLCA 2001 Kraków, Poland, May 2–5, 2001 Proceedings</subTitle>
</titleInfo>
<name type="personal"><namePart type="given">Samson</namePart>
<namePart type="family">Abramsky</namePart>
<affiliation>Oxford University Computing Laboratory, Wolfson Building, Parks Road, OX1 3QD, Oxford, USA</affiliation>
<affiliation>E-mail: Samson.Abramsky@comlab.ox.ac.uk</affiliation>
<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">2001</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="I16048">Mathematical Logic and Formal Languages</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I14010">Programming Techniques</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I14037">Programming Languages, Compilers, Interpreters</topic>
<topic authority="SpringerSubjectCodes" authorityURI="M24005">Mathematical Logic and Foundations</topic>
</subject>
<identifier type="DOI">10.1007/3-540-45413-6</identifier>
<identifier type="ISBN">978-3-540-41960-0</identifier>
<identifier type="eISBN">978-3-540-45413-7</identifier>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="BookTitleID">67015</identifier>
<identifier type="BookID">3-540-45413-6</identifier>
<identifier type="BookChapterCount">32</identifier>
<identifier type="BookVolumeNumber">2044</identifier>
<identifier type="BookSequenceNumber">2044</identifier>
<identifier type="PartChapterCount">28</identifier>
<part><date>2001</date>
<detail type="part"><title>Contributed Papers</title>
</detail>
<detail type="volume"><number>2044</number>
<caption>vol.</caption>
</detail>
<extent unit="pages"><start>182</start>
<end>196</end>
</extent>
</part>
<recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</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>
<affiliation>Karlsruhe University, Germany</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Juris</namePart>
<namePart type="family">Hartmanis</namePart>
<affiliation>Cornell University, NY, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jan</namePart>
<namePart type="family">van Leeuwen</namePart>
<affiliation>Utrecht University, The Netherlands</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">2001</copyrightDate>
<issuance>serial</issuance>
</originInfo>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="SeriesID">558</identifier>
<recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">0903F7C71808D6C42127185BF5D5FC97A202603D</identifier>
<identifier type="ark">ark:/67375/HCB-3DBL5T97-S</identifier>
<identifier type="DOI">10.1007/3-540-45413-6_17</identifier>
<identifier type="ChapterID">17</identifier>
<identifier type="ChapterID">Chap17</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2001</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 Berlin Heidelberg, 2001</recordOrigin>
</recordInfo>
</mods>
<json:item><extension>json</extension>
<original>false</original>
<mimetype>application/json</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-3DBL5T97-S/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 000194 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000194 | 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:0903F7C71808D6C42127185BF5D5FC97A202603D |texte= Strong Normalization of Classical Natural Deduction with Disjunction }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |