Translating Core Facile
Identifieur interne : 00CB89 ( Main/Exploration ); précédent : 00CB88; suivant : 00CB90Translating Core Facile
Auteurs : R. AmadioSource :
Abstract
In first approximation Core Facile is a simply typed λ-calculus enriched with {\it parallel composition}, {\it dynamic channel generation}, and {\it input-output synchronous communication primitives}. In this paper we explore the (dynamic) semantics of core Facile programs. This should be taken as a basis for the definition of abstract machines, the transformation of programs, and the development of modal specification languages. We claim two main contributions. We introduce a new semantics based on the notion of barbed bisimulation. We argue that the derived equivalence provides a more satisfying treatment of restriction, in particular by proving the adequacy of a natural translation of Facile into \pi-calculus we suggest that our approach is in good harmony with previous research onthe semantics of sub-calculi of Core Facile such as Chocs and \pi-calculus. We illustrate at an abstract level various aspects of Facile compilation. In particular we introduce an `asynchronous' version of the Facile language, say F_{a}, where asynchrony here means that a process terminates after having performed an output action. We then present an adequate CPS translation from Facile to F_{a}. Moreover we describe an abstract machine which executes code of F_{a} programs. This machine is basically a multiset of environment machines for eager functional evaluation enriched with a mechanism for the dynamic generation of channel names.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 001543
- to stream Crin, to step Curation: 001543
- to stream Crin, to step Checkpoint: 003158
- to stream Main, to step Merge: 00D456
- to stream Main, to step Curation: 00CB89
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="150">Translating Core Facile</title></titleStmt><publicationStmt><idno type="RBID">CRIN:amadio94b</idno><date when="1994" year="1994">1994</date><idno type="wicri:Area/Crin/Corpus">001543</idno><idno type="wicri:Area/Crin/Curation">001543</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001543</idno><idno type="wicri:Area/Crin/Checkpoint">003158</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">003158</idno><idno type="wicri:Area/Main/Merge">00D456</idno><idno type="wicri:Area/Main/Curation">00CB89</idno><idno type="wicri:Area/Main/Exploration">00CB89</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Translating Core Facile</title><author><name sortKey="Amadio, R" sort="Amadio, R" uniqKey="Amadio R" first="R." last="Amadio">R. Amadio</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="5537">In first approximation Core Facile is a simply typed λ-calculus enriched with {\it parallel composition}, {\it dynamic channel generation}, and {\it input-output synchronous communication primitives}. In this paper we explore the (dynamic) semantics of core Facile programs. This should be taken as a basis for the definition of abstract machines, the transformation of programs, and the development of modal specification languages. We claim two main contributions. We introduce a new semantics based on the notion of barbed bisimulation. We argue that the derived equivalence provides a more satisfying treatment of restriction, in particular by proving the adequacy of a natural translation of Facile into \pi-calculus we suggest that our approach is in good harmony with previous research onthe semantics of sub-calculi of Core Facile such as Chocs and \pi-calculus. We illustrate at an abstract level various aspects of Facile compilation. In particular we introduce an `asynchronous' version of the Facile language, say F_{a}, where asynchrony here means that a process terminates after having performed an output action. We then present an adequate CPS translation from Facile to F_{a}. Moreover we describe an abstract machine which executes code of F_{a} programs. This machine is basically a multiset of environment machines for eager functional evaluation enriched with a mechanism for the dynamic generation of channel names.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Amadio, R" sort="Amadio, R" uniqKey="Amadio R" first="R." last="Amadio">R. Amadio</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00CB89 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00CB89 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:amadio94b
|texte= Translating Core Facile
}}
| This area was generated with Dilib version V0.6.33. |  |