InforLorV4, PascalFrancis, Corpus, bibRecord, 000954

Strong normalization of classical natural deduction with disjunction

Identifieur interne : 000954 ( PascalFrancis/Corpus ); précédent : 000953; suivant : 000955

Strong normalization of classical natural deduction with disjunction

Auteurs : Philippe De Groote

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2001.

RBID : Pascal:01-0289370

Descripteurs français

Pascal (Inist)
- Lambda calcul, Normalisation, Logique propositionnelle, Disjonction.

English descriptors

KwdEn :
- Disjunction, Lambda calculus, Propositional logic, Standardization.

Abstract

We introduce λμ^→========and;========or;⊥, an extension of Parigot's λμ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal deductions satisfy the subformula property. From a computer science point of view, λμ^→========and;========or;⊥ may be seen as the core of a typed CBN functional language featuring product, coproduct, and control operators.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2044`
A08	`01`	`1`	`ENG`	`@1 Strong normalization of classical natural deduction with disjunction`
A09	`01`	`1`	`ENG`	`@1 TLCA 2001 : typed lambda calculi and applications : Krakow, 2-5 May 2001`
A11	`01`	`1`		`@1 DE GROOTE (Philippe)`
A12	`01`	`1`		`@1 ABRAMSKY (Samson) @9 ed.`
A14	`01`			`@1 LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239 @2 54506 Vandoeuvre lès Nancy @3 FRA @Z 1 aut.`
A20				`@1 182-196`
A21				`@1 2001`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-41960-8`
A43	`01`			`@1 INIST @2 16343 @5 354000092404180160`
A44				`@0 0000 @1 © 2001 INIST-CNRS. All rights reserved.`
A45				`@0 31 ref.`
A47	`01`	`1`		`@0 01-0289370`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
A66	`02`			`@0 USA`
C01	`01`		`ENG`	@0 We introduce λμ^→========and;========or;⊥, an extension of Parigot's λμ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal deductions satisfy the subformula property. From a computer science point of view, λμ^→========and;========or;⊥ may be seen as the core of a typed CBN functional language featuring product, coproduct, and control operators.
C02	`01`	`X`		`@0 001D02A05`
C03	`01`	`X`	`FRE`	`@0 Lambda calcul @5 08`
C03	`01`	`X`	`ENG`	`@0 Lambda calculus @5 08`
C03	`01`	`X`	`SPA`	`@0 Lambda cálculo @5 08`
C03	`02`	`X`	`FRE`	`@0 Normalisation @5 10`
C03	`02`	`X`	`ENG`	`@0 Standardization @5 10`
C03	`02`	`X`	`SPA`	`@0 Normalización @5 10`
C03	`03`	`X`	`FRE`	`@0 Logique propositionnelle @5 11`
C03	`03`	`X`	`ENG`	`@0 Propositional logic @5 11`
C03	`03`	`X`	`SPA`	`@0 Lógica proposicional @5 11`
C03	`04`	`X`	`FRE`	`@0 Disjonction @5 13`
C03	`04`	`X`	`ENG`	`@0 Disjunction @5 13`
C03	`04`	`X`	`SPA`	`@0 Disyunción @5 13`
N21				`@1 197`

A30	`01`	`1`	`ENG`	`@1 Typed lambda calculi and applications. International conference @2 5 @3 Kraków POL @4 2001-05-02`

Format Inist (serveur)

NO :	PASCAL 01-0289370 INIST
ET :	Strong normalization of classical natural deduction with disjunction
AU :	DE GROOTE (Philippe); ABRAMSKY (Samson)
AF :	LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239/54506 Vandoeuvre lès Nancy/France (1 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2001; Vol. 2044; Pp. 182-196; Bibl. 31 ref.
LA :	Anglais
EA :	We introduce λμ^→========and;========or;⊥, an extension of Parigot's λμ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal deductions satisfy the subformula property. From a computer science point of view, λμ^→========and;========or;⊥ may be seen as the core of a typed CBN functional language featuring product, coproduct, and control operators.
CC :	001D02A05
FD :	Lambda calcul; Normalisation; Logique propositionnelle; Disjonction
ED :	Lambda calculus; Standardization; Propositional logic; Disjunction
SD :	Lambda cálculo; Normalización; Lógica proposicional; Disyunción
LO :	INIST-16343.354000092404180160
ID :	01-0289370

Links to Exploration step

Pascal:01-0289370

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">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><inist:fA14 i1="01"><s1>LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre lès Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">01-0289370</idno>
<date when="2001">2001</date>
<idno type="stanalyst">PASCAL 01-0289370 INIST</idno>
<idno type="RBID">Pascal:01-0289370</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000954</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">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><inist:fA14 i1="01"><s1>LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre lès Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2001">2001</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Disjunction</term>
<term>Lambda calculus</term>
<term>Propositional logic</term>
<term>Standardization</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Lambda calcul</term>
<term>Normalisation</term>
<term>Logique propositionnelle</term>
<term>Disjonction</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We introduce λμ<sup>→</sup>
========and;========or;⊥, an extension of Parigot's λμ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal deductions satisfy the subformula property. From a computer science point of view, λμ<sup>→</sup>
========and;========or;⊥ may be seen as the core of a typed CBN functional language featuring product, coproduct, and control operators.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2044</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Strong normalization of classical natural deduction with disjunction</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>TLCA 2001 : typed lambda calculi and applications : Krakow, 2-5 May 2001</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>DE GROOTE (Philippe)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>ABRAMSKY (Samson)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre lès Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA20><s1>182-196</s1>
</fA20>
<fA21><s1>2001</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-41960-8</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000092404180160</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2001 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>31 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>01-0289370</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fA66 i1="02"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We introduce λμ<sup>→</sup>
========and;========or;⊥, an extension of Parigot's λμ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal deductions satisfy the subformula property. From a computer science point of view, λμ<sup>→</sup>
========and;========or;⊥ may be seen as the core of a typed CBN functional language featuring product, coproduct, and control operators.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Lambda calcul</s0>
<s5>08</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Lambda calculus</s0>
<s5>08</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Lambda cálculo</s0>
<s5>08</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Normalisation</s0>
<s5>10</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Standardization</s0>
<s5>10</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Normalización</s0>
<s5>10</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Logique propositionnelle</s0>
<s5>11</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Propositional logic</s0>
<s5>11</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Lógica proposicional</s0>
<s5>11</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Disjonction</s0>
<s5>13</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Disjunction</s0>
<s5>13</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Disyunción</s0>
<s5>13</s5>
</fC03>
<fN21><s1>197</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Typed lambda calculi and applications. International conference</s1>
<s2>5</s2>
<s3>Kraków POL</s3>
<s4>2001-05-02</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 01-0289370 INIST</NO>
<ET>Strong normalization of classical natural deduction with disjunction</ET>
<AU>DE GROOTE (Philippe); ABRAMSKY (Samson)</AU>
<AF>LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239/54506 Vandoeuvre lès Nancy/France (1 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2001; Vol. 2044; Pp. 182-196; Bibl. 31 ref.</SO>
<LA>Anglais</LA>
<EA>We introduce λμ<sup>→</sup>
========and;========or;⊥, an extension of Parigot's λμ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal deductions satisfy the subformula property. From a computer science point of view, λμ<sup>→</sup>
========and;========or;⊥ may be seen as the core of a typed CBN functional language featuring product, coproduct, and control operators.</EA>
<CC>001D02A05</CC>
<FD>Lambda calcul; Normalisation; Logique propositionnelle; Disjonction</FD>
<ED>Lambda calculus; Standardization; Propositional logic; Disjunction</ED>
<SD>Lambda cálculo; Normalización; Lógica proposicional; Disyunción</SD>
<LO>INIST-16343.354000092404180160</LO>
<ID>01-0289370</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000954 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000954 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:01-0289370
   |texte=   Strong normalization of classical natural deduction with disjunction
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Strong normalization of classical natural deduction with disjunction

Strong normalization of classical natural deduction with disjunction

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri