Stratified coherence spaces: a denotational semantics for light linear logic
Identifieur interne :
000665 ( PascalFrancis/Corpus );
précédent :
000664;
suivant :
000666
Stratified coherence spaces: a denotational semantics for light linear logic
Auteurs : Patrick BaillotSource :
-
Theoretical computer science [ 0304-3975 ] ; 2004.
RBID : Pascal:04-0318308
Descripteurs français
English descriptors
Abstract
Light linear logic (LLL) was introduced by Girard as a logical system capturing the class of polytime functions within the proofs-as-programs approach. In the present paper, we undertake a semantical analysis of LLL: a variant of coherence spaces is introduced and we prove that it is a sound model for this system, but not for usual linear logic. A simpler version of the model yields a sound semantics of Elementary linear logic, which is the analog of LLL for the class of Kalmar elementary functions. We illustrate our semantical method by showing how various principles fail in these models.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
pA |
A01 | 01 | 1 | | @0 0304-3975 |
---|
A02 | 01 | | | @0 TCSCDI |
---|
A03 | | 1 | | @0 Theor. comput. sci. |
---|
A05 | | | | @2 318 |
---|
A06 | | | | @2 1-2 |
---|
A08 | 01 | 1 | ENG | @1 Stratified coherence spaces: a denotational semantics for light linear logic |
---|
A09 | 01 | 1 | ENG | @1 Implicit computational complexity |
---|
A11 | 01 | 1 | | @1 BAILLOT (Patrick) |
---|
A12 | 01 | 1 | | @1 MARION (Jean-Yves) @9 ed. |
---|
A14 | 01 | | | @1 Laboratoire d'Informatique de Paris-Nord (UMR 7030 CNRS), Institut Galilée, Université Paris XIII, 99 av. J.-B. Clément @2 Villetaneuse 93430 @3 FRA @Z 1 aut. |
---|
A15 | 01 | | | @1 LORIA-INPL, Ecole Nationale Superieure des Mines de Nancy, BP 239 @2 Vandoeuvre-les-Nancy 54506 @3 FRA @Z 1 aut. |
---|
A20 | | | | @1 29-55 |
---|
A21 | | | | @1 2004 |
---|
A23 | 01 | | | @0 ENG |
---|
A43 | 01 | | | @1 INIST @2 17243 @5 354000110408220020 |
---|
A44 | | | | @0 0000 @1 © 2004 INIST-CNRS. All rights reserved. |
---|
A45 | | | | @0 17 ref. |
---|
A47 | 01 | 1 | | @0 04-0318308 |
---|
A60 | | | | @1 P @2 C |
---|
A61 | | | | @0 A |
---|
A64 | 01 | 1 | | @0 Theoretical computer science |
---|
A66 | 01 | | | @0 NLD |
---|
C01 | 01 | | ENG | @0 Light linear logic (LLL) was introduced by Girard as a logical system capturing the class of polytime functions within the proofs-as-programs approach. In the present paper, we undertake a semantical analysis of LLL: a variant of coherence spaces is introduced and we prove that it is a sound model for this system, but not for usual linear logic. A simpler version of the model yields a sound semantics of Elementary linear logic, which is the analog of LLL for the class of Kalmar elementary functions. We illustrate our semantical method by showing how various principles fail in these models. |
---|
C02 | 01 | X | | @0 001A02A01B |
---|
C03 | 01 | X | FRE | @0 Sémantique dénotationnelle @5 18 |
---|
C03 | 01 | X | ENG | @0 Denotational semantics @5 18 |
---|
C03 | 01 | X | SPA | @0 Semántica denotacional @5 18 |
---|
C03 | 02 | X | FRE | @0 Logique linéaire @5 19 |
---|
C03 | 02 | X | ENG | @0 Linear logic @5 19 |
---|
C03 | 02 | X | SPA | @0 Lógica lineal @5 19 |
---|
C03 | 03 | X | FRE | @0 Preuve programme @5 20 |
---|
C03 | 03 | X | ENG | @0 Program proof @5 20 |
---|
C03 | 03 | X | SPA | @0 Prueba programa @5 20 |
---|
C03 | 04 | X | FRE | @0 Informatique théorique @5 21 |
---|
C03 | 04 | X | ENG | @0 Computer theory @5 21 |
---|
C03 | 04 | X | SPA | @0 Informática teórica @5 21 |
---|
C03 | 05 | X | FRE | @0 Fonction Kalmer @4 CD @5 96 |
---|
C03 | 05 | X | ENG | @0 Kalmer function @4 CD @5 96 |
---|
N21 | | | | @1 187 |
---|
N44 | 01 | | | @1 OTO |
---|
N82 | | | | @1 OTO |
---|
|
pR |
A30 | 01 | 1 | ENG | @1 ICC Workshop @3 Santa Barbara, CA USA @4 2000 |
---|
|
Format Inist (serveur)
NO : | PASCAL 04-0318308 INIST |
ET : | Stratified coherence spaces: a denotational semantics for light linear logic |
AU : | BAILLOT (Patrick); MARION (Jean-Yves) |
AF : | Laboratoire d'Informatique de Paris-Nord (UMR 7030 CNRS), Institut Galilée, Université Paris XIII, 99 av. J.-B. Clément/Villetaneuse 93430/France (1 aut.); LORIA-INPL, Ecole Nationale Superieure des Mines de Nancy, BP 239/Vandoeuvre-les-Nancy 54506/France (1 aut.) |
DT : | Publication en série; Congrès; Niveau analytique |
SO : | Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 2004; Vol. 318; No. 1-2; Pp. 29-55; Bibl. 17 ref. |
LA : | Anglais |
EA : | Light linear logic (LLL) was introduced by Girard as a logical system capturing the class of polytime functions within the proofs-as-programs approach. In the present paper, we undertake a semantical analysis of LLL: a variant of coherence spaces is introduced and we prove that it is a sound model for this system, but not for usual linear logic. A simpler version of the model yields a sound semantics of Elementary linear logic, which is the analog of LLL for the class of Kalmar elementary functions. We illustrate our semantical method by showing how various principles fail in these models. |
CC : | 001A02A01B |
FD : | Sémantique dénotationnelle; Logique linéaire; Preuve programme; Informatique théorique; Fonction Kalmer |
ED : | Denotational semantics; Linear logic; Program proof; Computer theory; Kalmer function |
SD : | Semántica denotacional; Lógica lineal; Prueba programa; Informática teórica |
LO : | INIST-17243.354000110408220020 |
ID : | 04-0318308 |
Links to Exploration step
Pascal:04-0318308
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Stratified coherence spaces: a denotational semantics for light linear logic</title>
<author><name sortKey="Baillot, Patrick" sort="Baillot, Patrick" uniqKey="Baillot P" first="Patrick" last="Baillot">Patrick Baillot</name>
<affiliation><inist:fA14 i1="01"><s1>Laboratoire d'Informatique de Paris-Nord (UMR 7030 CNRS), Institut Galilée, Université Paris XIII, 99 av. J.-B. Clément</s1>
<s2>Villetaneuse 93430</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0318308</idno>
<date when="2004">2004</date>
<idno type="stanalyst">PASCAL 04-0318308 INIST</idno>
<idno type="RBID">Pascal:04-0318308</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000665</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Stratified coherence spaces: a denotational semantics for light linear logic</title>
<author><name sortKey="Baillot, Patrick" sort="Baillot, Patrick" uniqKey="Baillot P" first="Patrick" last="Baillot">Patrick Baillot</name>
<affiliation><inist:fA14 i1="01"><s1>Laboratoire d'Informatique de Paris-Nord (UMR 7030 CNRS), Institut Galilée, Université Paris XIII, 99 av. J.-B. Clément</s1>
<s2>Villetaneuse 93430</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
<imprint><date when="2004">2004</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer theory</term>
<term>Denotational semantics</term>
<term>Kalmer function</term>
<term>Linear logic</term>
<term>Program proof</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Sémantique dénotationnelle</term>
<term>Logique linéaire</term>
<term>Preuve programme</term>
<term>Informatique théorique</term>
<term>Fonction Kalmer</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Light linear logic (LLL) was introduced by Girard as a logical system capturing the class of polytime functions within the proofs-as-programs approach. In the present paper, we undertake a semantical analysis of LLL: a variant of coherence spaces is introduced and we prove that it is a sound model for this system, but not for usual linear logic. A simpler version of the model yields a sound semantics of Elementary linear logic, which is the analog of LLL for the class of Kalmar elementary functions. We illustrate our semantical method by showing how various principles fail in these models.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0304-3975</s0>
</fA01>
<fA02 i1="01"><s0>TCSCDI</s0>
</fA02>
<fA03 i2="1"><s0>Theor. comput. sci.</s0>
</fA03>
<fA05><s2>318</s2>
</fA05>
<fA06><s2>1-2</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Stratified coherence spaces: a denotational semantics for light linear logic</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Implicit computational complexity</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>BAILLOT (Patrick)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>MARION (Jean-Yves)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Laboratoire d'Informatique de Paris-Nord (UMR 7030 CNRS), Institut Galilée, Université Paris XIII, 99 av. J.-B. Clément</s1>
<s2>Villetaneuse 93430</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>LORIA-INPL, Ecole Nationale Superieure des Mines de Nancy, BP 239</s1>
<s2>Vandoeuvre-les-Nancy 54506</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA20><s1>29-55</s1>
</fA20>
<fA21><s1>2004</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>17243</s2>
<s5>354000110408220020</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>17 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>04-0318308</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA64 i1="01" i2="1"><s0>Theoretical computer science</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Light linear logic (LLL) was introduced by Girard as a logical system capturing the class of polytime functions within the proofs-as-programs approach. In the present paper, we undertake a semantical analysis of LLL: a variant of coherence spaces is introduced and we prove that it is a sound model for this system, but not for usual linear logic. A simpler version of the model yields a sound semantics of Elementary linear logic, which is the analog of LLL for the class of Kalmar elementary functions. We illustrate our semantical method by showing how various principles fail in these models.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001A02A01B</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Sémantique dénotationnelle</s0>
<s5>18</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Denotational semantics</s0>
<s5>18</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Semántica denotacional</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Logique linéaire</s0>
<s5>19</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Linear logic</s0>
<s5>19</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Lógica lineal</s0>
<s5>19</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Preuve programme</s0>
<s5>20</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Program proof</s0>
<s5>20</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Prueba programa</s0>
<s5>20</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>21</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>21</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>21</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Fonction Kalmer</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Kalmer function</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>187</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>ICC Workshop</s1>
<s3>Santa Barbara, CA USA</s3>
<s4>2000</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 04-0318308 INIST</NO>
<ET>Stratified coherence spaces: a denotational semantics for light linear logic</ET>
<AU>BAILLOT (Patrick); MARION (Jean-Yves)</AU>
<AF>Laboratoire d'Informatique de Paris-Nord (UMR 7030 CNRS), Institut Galilée, Université Paris XIII, 99 av. J.-B. Clément/Villetaneuse 93430/France (1 aut.); LORIA-INPL, Ecole Nationale Superieure des Mines de Nancy, BP 239/Vandoeuvre-les-Nancy 54506/France (1 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 2004; Vol. 318; No. 1-2; Pp. 29-55; Bibl. 17 ref.</SO>
<LA>Anglais</LA>
<EA>Light linear logic (LLL) was introduced by Girard as a logical system capturing the class of polytime functions within the proofs-as-programs approach. In the present paper, we undertake a semantical analysis of LLL: a variant of coherence spaces is introduced and we prove that it is a sound model for this system, but not for usual linear logic. A simpler version of the model yields a sound semantics of Elementary linear logic, which is the analog of LLL for the class of Kalmar elementary functions. We illustrate our semantical method by showing how various principles fail in these models.</EA>
<CC>001A02A01B</CC>
<FD>Sémantique dénotationnelle; Logique linéaire; Preuve programme; Informatique théorique; Fonction Kalmer</FD>
<ED>Denotational semantics; Linear logic; Program proof; Computer theory; Kalmer function</ED>
<SD>Semántica denotacional; Lógica lineal; Prueba programa; Informática teórica</SD>
<LO>INIST-17243.354000110408220020</LO>
<ID>04-0318308</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 000665 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000665 | 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-0318308
|texte= Stratified coherence spaces: a denotational semantics for light linear logic
}}
| 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 | |