InforLorV4, PascalFrancis, Corpus, bibRecord, 000718

Strong normalization of the typed λws-calculus

Identifieur interne : 000718 ( PascalFrancis/Corpus ); précédent : 000717; suivant : 000719

Strong normalization of the typed λws-calculus

Auteurs : René David ; Bruno Guillaume

Source :

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

RBID : Pascal:04-0157711

Descripteurs français

Pascal (Inist)
- Logique linéaire, Lambda calcul, Confluence.

English descriptors

KwdEn :
- Confluence, Lambda calculus, Linear logic.

Abstract

The λ_ws-calculus is a A-calculus with explicit substitutions introduced in [4]. It satisfies the desired properties of such a calculus: step by step simulation of β, confluence on terms with meta-variables and preservation of the strong normalization. It was conjectured in [4] that simply typed terms of λ_ws are strongly normalizable. This was proved in [7] by Di Cosmo & al. by using a translation of λ_ws into the proof nets of linear logic. We give here a direct and elementary proof of this result. The strong normalization is also proved for terms typable with second order types (the extension of Girard's system F). This is a new result.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2803`
A08	`01`	`1`	`ENG`	`@1 Strong normalization of the typed λ_ws-calculus`
A09	`01`	`1`	`ENG`	`@1 Computer science logic : Vienna, 25-30 August 2003`
A11	`01`	`1`		`@1 DAVID (René)`
A11	`02`	`1`		`@1 GUILLAUME (Bruno)`
A12	`01`	`1`		`@1 BAAZ (Matthias) @9 ed.`
A12	`02`	`1`		`@1 MAKOWSKY (Johann A.) @9 ed.`
A14	`01`			`@1 Université de Savoie, Campus Scientifique @2 73376 Le Bourget du Lac @3 FRA @Z 1 aut.`
A14	`02`			`@1 LORIA / INRIA Lorraine, Campus Scientifique @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 2 aut.`
A20				`@1 155-168`
A21				`@1 2003`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-40801-0`
A43	`01`			`@1 INIST @2 16343 @5 354000117780820150`
A44				`@0 0000 @1 © 2004 INIST-CNRS. All rights reserved.`
A45				`@0 7 ref.`
A47	`01`	`1`		`@0 04-0157711`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
C01	`01`		`ENG`	@0 The λ_ws-calculus is a A-calculus with explicit substitutions introduced in [4]. It satisfies the desired properties of such a calculus: step by step simulation of β, confluence on terms with meta-variables and preservation of the strong normalization. It was conjectured in [4] that simply typed terms of λ_ws are strongly normalizable. This was proved in [7] by Di Cosmo & al. by using a translation of λ_ws into the proof nets of linear logic. We give here a direct and elementary proof of this result. The strong normalization is also proved for terms typable with second order types (the extension of Girard's system F). This is a new result.
C02	`01`	`X`		`@0 001D02A04`
C03	`01`	`X`	`FRE`	`@0 Logique linéaire @5 01`
C03	`01`	`X`	`ENG`	`@0 Linear logic @5 01`
C03	`01`	`X`	`SPA`	`@0 Lógica lineal @5 01`
C03	`02`	`X`	`FRE`	`@0 Lambda calcul @5 03`
C03	`02`	`X`	`ENG`	`@0 Lambda calculus @5 03`
C03	`02`	`X`	`SPA`	`@0 Lambda cálculo @5 03`
C03	`03`	`X`	`FRE`	`@0 Confluence @5 11`
C03	`03`	`X`	`ENG`	`@0 Confluence @5 11`
C03	`03`	`X`	`SPA`	`@0 Confluencia @5 11`
N21				`@1 103`
N82				`@1 PSI`

A30	`01`	`1`	`ENG`	`@1 International workshop CSL 2003 @2 17 @3 Vienna AUT @4 2003-08-25`
A30	`02`	`1`	`ENG`	`@1 EACSL. Annual conference @2 12 @3 Vienna AUT @4 2003-08-25`
A30	`03`	`1`	`ENG`	`@1 KGC 2003 : Kurt Gödel colloquium @2 8 @3 Vienna AUT @4 2003-08-25`

Format Inist (serveur)

NO :	PASCAL 04-0157711 INIST
ET :	Strong normalization of the typed λ_ws-calculus
AU :	DAVID (René); GUILLAUME (Bruno); BAAZ (Matthias); MAKOWSKY (Johann A.)
AF :	Université de Savoie, Campus Scientifique/73376 Le Bourget du Lac/France (1 aut.); LORIA / INRIA Lorraine, Campus Scientifique/54506 Vandœuvre-lès-Nancy /France (2 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2803; Pp. 155-168; Bibl. 7 ref.
LA :	Anglais
EA :	The λ_ws-calculus is a A-calculus with explicit substitutions introduced in [4]. It satisfies the desired properties of such a calculus: step by step simulation of β, confluence on terms with meta-variables and preservation of the strong normalization. It was conjectured in [4] that simply typed terms of λ_ws are strongly normalizable. This was proved in [7] by Di Cosmo & al. by using a translation of λ_ws into the proof nets of linear logic. We give here a direct and elementary proof of this result. The strong normalization is also proved for terms typable with second order types (the extension of Girard's system F). This is a new result.
CC :	001D02A04
FD :	Logique linéaire; Lambda calcul; Confluence
ED :	Linear logic; Lambda calculus; Confluence
SD :	Lógica lineal; Lambda cálculo; Confluencia
LO :	INIST-16343.354000117780820150
ID :	04-0157711

Links to Exploration step

Pascal:04-0157711

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Strong normalization of the typed λ<sub>ws</sub>
-calculus</title>
<author><name sortKey="David, Rene" sort="David, Rene" uniqKey="David R" first="René" last="David">René David</name>
<affiliation><inist:fA14 i1="01"><s1>Université de Savoie, Campus Scientifique</s1>
<s2>73376 Le Bourget du Lac</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Guillaume, Bruno" sort="Guillaume, Bruno" uniqKey="Guillaume B" first="Bruno" last="Guillaume">Bruno Guillaume</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA / INRIA Lorraine, Campus Scientifique</s1>
<s2>54506 Vandœuvre-lès-Nancy </s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0157711</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0157711 INIST</idno>
<idno type="RBID">Pascal:04-0157711</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000718</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Strong normalization of the typed λ<sub>ws</sub>
-calculus</title>
<author><name sortKey="David, Rene" sort="David, Rene" uniqKey="David R" first="René" last="David">René David</name>
<affiliation><inist:fA14 i1="01"><s1>Université de Savoie, Campus Scientifique</s1>
<s2>73376 Le Bourget du Lac</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Guillaume, Bruno" sort="Guillaume, Bruno" uniqKey="Guillaume B" first="Bruno" last="Guillaume">Bruno Guillaume</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA / INRIA Lorraine, Campus Scientifique</s1>
<s2>54506 Vandœuvre-lès-Nancy </s2>
<s3>FRA</s3>
<sZ>2 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="2003">2003</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>Confluence</term>
<term>Lambda calculus</term>
<term>Linear logic</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Logique linéaire</term>
<term>Lambda calcul</term>
<term>Confluence</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The λ<sub>ws</sub>
-calculus is a A-calculus with explicit substitutions introduced in [4]. It satisfies the desired properties of such a calculus: step by step simulation of β, confluence on terms with meta-variables and preservation of the strong normalization. It was conjectured in [4] that simply typed terms of λ<sub>ws</sub>
 are strongly normalizable. This was proved in [7] by Di Cosmo & al. by using a translation of λ<sub>ws</sub>
 into the proof nets of linear logic. We give here a direct and elementary proof of this result. The strong normalization is also proved for terms typable with second order types (the extension of Girard's system F). This is a new result.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2803</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Strong normalization of the typed λ<sub>ws</sub>
-calculus</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Computer science logic : Vienna, 25-30 August 2003</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>DAVID (René)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>GUILLAUME (Bruno)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>BAAZ (Matthias)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>MAKOWSKY (Johann A.)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Université de Savoie, Campus Scientifique</s1>
<s2>73376 Le Bourget du Lac</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LORIA / INRIA Lorraine, Campus Scientifique</s1>
<s2>54506 Vandœuvre-lès-Nancy </s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>155-168</s1>
</fA20>
<fA21><s1>2003</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-40801-0</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000117780820150</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>7 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>04-0157711</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>
<fC01 i1="01" l="ENG"><s0>The λ<sub>ws</sub>
-calculus is a A-calculus with explicit substitutions introduced in [4]. It satisfies the desired properties of such a calculus: step by step simulation of β, confluence on terms with meta-variables and preservation of the strong normalization. It was conjectured in [4] that simply typed terms of λ<sub>ws</sub>
 are strongly normalizable. This was proved in [7] by Di Cosmo & al. by using a translation of λ<sub>ws</sub>
 into the proof nets of linear logic. We give here a direct and elementary proof of this result. The strong normalization is also proved for terms typable with second order types (the extension of Girard's system F). This is a new result.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A04</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Logique linéaire</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Linear logic</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Lógica lineal</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Lambda calcul</s0>
<s5>03</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Lambda calculus</s0>
<s5>03</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Lambda cálculo</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Confluence</s0>
<s5>11</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Confluence</s0>
<s5>11</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Confluencia</s0>
<s5>11</s5>
</fC03>
<fN21><s1>103</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International workshop CSL 2003</s1>
<s2>17</s2>
<s3>Vienna AUT</s3>
<s4>2003-08-25</s4>
</fA30>
<fA30 i1="02" i2="1" l="ENG"><s1>EACSL. Annual conference</s1>
<s2>12</s2>
<s3>Vienna AUT</s3>
<s4>2003-08-25</s4>
</fA30>
<fA30 i1="03" i2="1" l="ENG"><s1>KGC 2003 : Kurt Gödel colloquium</s1>
<s2>8</s2>
<s3>Vienna AUT</s3>
<s4>2003-08-25</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 04-0157711 INIST</NO>
<ET>Strong normalization of the typed λ<sub>ws</sub>
-calculus</ET>
<AU>DAVID (René); GUILLAUME (Bruno); BAAZ (Matthias); MAKOWSKY (Johann A.)</AU>
<AF>Université de Savoie, Campus Scientifique/73376 Le Bourget du Lac/France (1 aut.); LORIA / INRIA Lorraine, Campus Scientifique/54506 Vandœuvre-lès-Nancy /France (2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2803; Pp. 155-168; Bibl. 7 ref.</SO>
<LA>Anglais</LA>
<EA>The λ<sub>ws</sub>
-calculus is a A-calculus with explicit substitutions introduced in [4]. It satisfies the desired properties of such a calculus: step by step simulation of β, confluence on terms with meta-variables and preservation of the strong normalization. It was conjectured in [4] that simply typed terms of λ<sub>ws</sub>
 are strongly normalizable. This was proved in [7] by Di Cosmo & al. by using a translation of λ<sub>ws</sub>
 into the proof nets of linear logic. We give here a direct and elementary proof of this result. The strong normalization is also proved for terms typable with second order types (the extension of Girard's system F). This is a new result.</EA>
<CC>001D02A04</CC>
<FD>Logique linéaire; Lambda calcul; Confluence</FD>
<ED>Linear logic; Lambda calculus; Confluence</ED>
<SD>Lógica lineal; Lambda cálculo; Confluencia</SD>
<LO>INIST-16343.354000117780820150</LO>
<ID>04-0157711</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 000718 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000718 | 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:04-0157711
   |texte=   Strong normalization of the typed λws-calculus
}}

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 the typed λws-calculus

Strong normalization of the typed λws-calculus

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