Concurrent Programming as Proof Net Construction
Identifieur interne : 001C84 ( Crin/Corpus ); précédent : 001C83; suivant : 001C85Concurrent Programming as Proof Net Construction
Auteurs : Guy PerrierSource :
English descriptors
- KwdEn :
Abstract
We propose a concurrent process calculus, called Calcul Parallèle Logique (CPL), based on the paradigm of computation as proof net construction in linear logic. CPL uses a fragment of first order intuitionistic linear logic where formulas represent processes and proof nets successful computations. In these computations, communication is expressed in an asynchronous way by means of axiom links. We define testing equivalences for processes, which are based on a concept of interface and use the power of proof theory in linear logic.
Links to Exploration step
CRIN:perrier96bLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="313">Concurrent Programming as Proof Net Construction</title></titleStmt><publicationStmt><idno type="RBID">CRIN:perrier96b</idno><date when="1996" year="1996">1996</date><idno type="wicri:Area/Crin/Corpus">001C84</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Concurrent Programming as Proof Net Construction</title><author><name sortKey="Perrier, Guy" sort="Perrier, Guy" uniqKey="Perrier G" first="Guy" last="Perrier">Guy Perrier</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Concurrency</term><term>Concurrent programming</term><term>Linear logic</term><term>Logic programming</term><term>Process algebras</term><term>Proof nets</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1452">We propose a concurrent process calculus, called Calcul Parallèle Logique (CPL), based on the paradigm of computation as proof net construction in linear logic. CPL uses a fragment of first order intuitionistic linear logic where formulas represent processes and proof nets successful computations. In these computations, communication is expressed in an asynchronous way by means of axiom links. We define testing equivalences for processes, which are based on a concept of interface and use the power of proof theory in linear logic.</div></front></TEI><BibTex type="techreport"><ref>perrier96b</ref><crinnumber>96-R-132</crinnumber><category>15</category><equipe>CALLIGRAMME</equipe><author><e>Perrier, Guy</e></author><title>Concurrent Programming as Proof Net Construction</title><year>1996</year><keywords><e>Linear logic</e><e>Concurrency</e><e>Process algebras</e><e>Concurrent programming</e><e>Logic programming</e><e>Proof nets</e></keywords><abstract>We propose a concurrent process calculus, called Calcul Parallèle Logique (CPL), based on the paradigm of computation as proof net construction in linear logic. CPL uses a fragment of first order intuitionistic linear logic where formulas represent processes and proof nets successful computations. In these computations, communication is expressed in an asynchronous way by means of axiom links. We define testing equivalences for processes, which are based on a concept of interface and use the power of proof theory in linear logic.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001C84 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 001C84 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Corpus
|type= RBID
|clé= CRIN:perrier96b
|texte= Concurrent Programming as Proof Net Construction
}}
| This area was generated with Dilib version V0.6.33. |  |