InforLorV4, PascalFrancis, Corpus, bibRecord, 000D27

Proofs, concurrent objects and computations in a FILL framework

Identifieur interne : 000D27 ( PascalFrancis/Corpus ); précédent : 000D26; suivant : 000D28

Proofs, concurrent objects and computations in a FILL framework

Auteurs : D. Galmiche ; E. Boudinet

Source :

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

RBID : Pascal:96-0465941

Descripteurs français

Pascal (Inist)
- Logique intuitionniste, Programme concurrent, Orienté objet, Non déterminisme.

English descriptors

KwdEn :
- Concurrent program, Intuitionistic logic, Non determinism, Object oriented.

Abstract

There are several major approaches to model concurrent computations using logic. In this context, one aim can be to achieve different forms of programming as logic, object-oriented or concurrent ones in a same logical language. Linear logic seems to be well-suited to describe computations that are concurrent and based on state transitions. In this paper, we propose and analyse a framework based on Full Intuitionistic Linear Logic (FILL), logical fragment with potentialities for non-determinisms management, as foundation of concurrent object-oriented programming, following the two paradigms proof-search as computation and proofs as computations.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 1107`
A08	`01`	`1`	`ENG`	`@1 Proofs, concurrent objects and computations in a FILL framework`
A09	`01`	`1`	`ENG`	`@1 OBPDC '95 : object-based parallel and distributed computation : Tokyo, June 21-23, 1995`
A11	`01`	`1`		`@1 GALMICHE (D.)`
A11	`02`	`1`		`@1 BOUDINET (E.)`
A12	`01`	`1`		`@1 BRIOT (Jean-Pierre) @9 ed.`
A12	`02`	`1`		`@1 GEIB (Jean-Marc) @9 ed.`
A12	`03`	`1`		`@1 YONEZAWA (Akinori) @9 ed.`
A14	`01`			`@1 CRIN-CNRS & INRIA Lorraine, Campus Scientifique - B.P. 239 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut.`
A20				`@1 148-167`
A21				`@1 1996`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 16343 @5 354000060641420080`
A44				`@0 0000 @1 © 1996 INIST-CNRS. All rights reserved.`
A45				`@0 36 ref.`
A47	`01`	`1`		`@0 96-0465941`
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 There are several major approaches to model concurrent computations using logic. In this context, one aim can be to achieve different forms of programming as logic, object-oriented or concurrent ones in a same logical language. Linear logic seems to be well-suited to describe computations that are concurrent and based on state transitions. In this paper, we propose and analyse a framework based on Full Intuitionistic Linear Logic (FILL), logical fragment with potentialities for non-determinisms management, as foundation of concurrent object-oriented programming, following the two paradigms proof-search as computation and proofs as computations.
C02	`01`	`X`		`@0 001D02A07`
C02	`02`	`X`		`@0 001D02C02`
C02	`03`	`X`		`@0 001D02B09`
C03	`01`	`X`	`FRE`	`@0 Logique intuitionniste @5 01`
C03	`01`	`X`	`ENG`	`@0 Intuitionistic logic @5 01`
C03	`01`	`X`	`SPA`	`@0 Lógica intuicionista @5 01`
C03	`02`	`X`	`FRE`	`@0 Programme concurrent @5 02`
C03	`02`	`X`	`ENG`	`@0 Concurrent program @5 02`
C03	`02`	`X`	`SPA`	`@0 Programa competidor @5 02`
C03	`03`	`X`	`FRE`	`@0 Orienté objet @5 03`
C03	`03`	`X`	`ENG`	`@0 Object oriented @5 03`
C03	`03`	`X`	`SPA`	`@0 Orientado objeto @5 03`
C03	`04`	`X`	`FRE`	`@0 Non déterminisme @5 04`
C03	`04`	`X`	`ENG`	`@0 Non determinism @5 04`
C03	`04`	`X`	`SPA`	`@0 No determinismo @5 04`
N21				`@1 316`

A30	`01`	`1`	`ENG`	`@1 Object-based parallel and distributed computation. France-Japan workshop @3 Tokyo JPN @4 1995-06-21`

Format Inist (serveur)

NO :	PASCAL 96-0465941 INIST
ET :	Proofs, concurrent objects and computations in a FILL framework
AU :	GALMICHE (D.); BOUDINET (E.); BRIOT (Jean-Pierre); GEIB (Jean-Marc); YONEZAWA (Akinori)
AF :	CRIN-CNRS & INRIA Lorraine, Campus Scientifique - B.P. 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1996; Vol. 1107; Pp. 148-167; Bibl. 36 ref.
LA :	Anglais
EA :	There are several major approaches to model concurrent computations using logic. In this context, one aim can be to achieve different forms of programming as logic, object-oriented or concurrent ones in a same logical language. Linear logic seems to be well-suited to describe computations that are concurrent and based on state transitions. In this paper, we propose and analyse a framework based on Full Intuitionistic Linear Logic (FILL), logical fragment with potentialities for non-determinisms management, as foundation of concurrent object-oriented programming, following the two paradigms proof-search as computation and proofs as computations.
CC :	001D02A07; 001D02C02; 001D02B09
FD :	Logique intuitionniste; Programme concurrent; Orienté objet; Non déterminisme
ED :	Intuitionistic logic; Concurrent program; Object oriented; Non determinism
SD :	Lógica intuicionista; Programa competidor; Orientado objeto; No determinismo
LO :	INIST-16343.354000060641420080
ID :	96-0465941

Links to Exploration step

Pascal:96-0465941

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Proofs, concurrent objects and computations in a FILL framework</title>
<author><name sortKey="Galmiche, D" sort="Galmiche, D" uniqKey="Galmiche D" first="D." last="Galmiche">D. Galmiche</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN-CNRS & INRIA Lorraine, Campus Scientifique - B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Boudinet, E" sort="Boudinet, E" uniqKey="Boudinet E" first="E." last="Boudinet">E. Boudinet</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN-CNRS & INRIA Lorraine, Campus Scientifique - B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">96-0465941</idno>
<date when="1996">1996</date>
<idno type="stanalyst">PASCAL 96-0465941 INIST</idno>
<idno type="RBID">Pascal:96-0465941</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000D27</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Proofs, concurrent objects and computations in a FILL framework</title>
<author><name sortKey="Galmiche, D" sort="Galmiche, D" uniqKey="Galmiche D" first="D." last="Galmiche">D. Galmiche</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN-CNRS & INRIA Lorraine, Campus Scientifique - B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Boudinet, E" sort="Boudinet, E" uniqKey="Boudinet E" first="E." last="Boudinet">E. Boudinet</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN-CNRS & INRIA Lorraine, Campus Scientifique - B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<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="1996">1996</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>Concurrent program</term>
<term>Intuitionistic logic</term>
<term>Non determinism</term>
<term>Object oriented</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Logique intuitionniste</term>
<term>Programme concurrent</term>
<term>Orienté objet</term>
<term>Non déterminisme</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">There are several major approaches to model concurrent computations using logic. In this context, one aim can be to achieve different forms of programming as logic, object-oriented or concurrent ones in a same logical language. Linear logic seems to be well-suited to describe computations that are concurrent and based on state transitions. In this paper, we propose and analyse a framework based on Full Intuitionistic Linear Logic (FILL), logical fragment with potentialities for non-determinisms management, as foundation of concurrent object-oriented programming, following the two paradigms proof-search as computation and proofs as computations.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1107</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Proofs, concurrent objects and computations in a FILL framework</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>OBPDC '95 : object-based parallel and distributed computation : Tokyo, June 21-23, 1995</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>GALMICHE (D.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>BOUDINET (E.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>BRIOT (Jean-Pierre)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>GEIB (Jean-Marc)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>YONEZAWA (Akinori)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>CRIN-CNRS & INRIA Lorraine, Campus Scientifique - B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>148-167</s1>
</fA20>
<fA21><s1>1996</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000060641420080</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1996 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>36 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>96-0465941</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>There are several major approaches to model concurrent computations using logic. In this context, one aim can be to achieve different forms of programming as logic, object-oriented or concurrent ones in a same logical language. Linear logic seems to be well-suited to describe computations that are concurrent and based on state transitions. In this paper, we propose and analyse a framework based on Full Intuitionistic Linear Logic (FILL), logical fragment with potentialities for non-determinisms management, as foundation of concurrent object-oriented programming, following the two paradigms proof-search as computation and proofs as computations.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A07</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02C02</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001D02B09</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Logique intuitionniste</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Intuitionistic logic</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Lógica intuicionista</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Programme concurrent</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Concurrent program</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Programa competidor</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Orienté objet</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Object oriented</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Orientado objeto</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Non déterminisme</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Non determinism</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>No determinismo</s0>
<s5>04</s5>
</fC03>
<fN21><s1>316</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Object-based parallel and distributed computation. France-Japan workshop</s1>
<s3>Tokyo JPN</s3>
<s4>1995-06-21</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 96-0465941 INIST</NO>
<ET>Proofs, concurrent objects and computations in a FILL framework</ET>
<AU>GALMICHE (D.); BOUDINET (E.); BRIOT (Jean-Pierre); GEIB (Jean-Marc); YONEZAWA (Akinori)</AU>
<AF>CRIN-CNRS & INRIA Lorraine, Campus Scientifique - B.P. 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1996; Vol. 1107; Pp. 148-167; Bibl. 36 ref.</SO>
<LA>Anglais</LA>
<EA>There are several major approaches to model concurrent computations using logic. In this context, one aim can be to achieve different forms of programming as logic, object-oriented or concurrent ones in a same logical language. Linear logic seems to be well-suited to describe computations that are concurrent and based on state transitions. In this paper, we propose and analyse a framework based on Full Intuitionistic Linear Logic (FILL), logical fragment with potentialities for non-determinisms management, as foundation of concurrent object-oriented programming, following the two paradigms proof-search as computation and proofs as computations.</EA>
<CC>001D02A07; 001D02C02; 001D02B09</CC>
<FD>Logique intuitionniste; Programme concurrent; Orienté objet; Non déterminisme</FD>
<ED>Intuitionistic logic; Concurrent program; Object oriented; Non determinism</ED>
<SD>Lógica intuicionista; Programa competidor; Orientado objeto; No determinismo</SD>
<LO>INIST-16343.354000060641420080</LO>
<ID>96-0465941</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 000D27 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000D27 | 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:96-0465941
   |texte=   Proofs, concurrent objects and computations in a FILL framework
}}

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

Proofs, concurrent objects and computations in a FILL framework

Proofs, concurrent objects and computations in a FILL framework

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