G. Boudol. Asynchrony and the #-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....on processes P . Finally, notice that, in the definition of bisimilarity, actions n are treated apart asking for weaker matching requirements. This is because both actions are not observable. Somehow, this is very similar to what happens with input actions in the asynchronous # calculus [15, 3]. 3.1 Soundness Late and early bisimilarity represent two proof techniques for reduction barbed congruence. More precisely we prove that they are both contextual and contained in reduction barbed congruence. The following lemma is crucial for proving that is contextual. This lemma will be ....

G. Boudol. Asynchrony and the #-calculus. Technical Report RR-1702, INRIA-Sophia Antipolis, 1992.

....1. Introduction In recent years researchers have devoted a great effort in providing semantics for pure concurrent parallel programming languages within the realm of process calculi. Milner, Parrow and Walker s calculus or a asynchronous formulation due to Honda and Tokoro [11, 20] and Boudol [6] has been the starting point for most of these attempts. Several forms and extensions of the asynchronous calculus have since been proposed to provide for more direct programming styles, and to improve efficiency and expressiveness [7, 9, 32] Dataflow and von Neumann architectures represent ....

G. Boudol. Asynchrony and the -calculus (Note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, 1992.

....the notion of reduction machines we set up five concrete machines: the usual # calculus with the call by value reduction strategy [11] the CAM machine [4] the SECD machine [11] and two pi calculus based machines. For the first pi based machine, we pick processes of the asynchronous pi calculus [3, 5] typable under the input output type system, together with deterministic reduction, and strong barbed congruence [9] For the second # based machine, we pick contexts for states. A notion of reduction and of equivalence for # calculus contexts is then defined. A (typed) context performs a ....

Gerard Boudol. Asynchrony and the #-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.

....with simple data values and conditional expression and for the 7r calculus. In this paper we consider Plain LAL, a mobile process calculus which differs from the 7r calculus in the sense that the communication of data values hap pens asynchronously. Previously, Honda and Tokoro [4] and Boudol [2] have described so called asynchronous 7r calculi. However, they have not studied the notion of equivalence within this setting. The surprising result is that in the presence of asynchrony, the open, late and early bisimulation equivalences coincide. As the equivalences are one and the same, this ....

Grad Boudol. Asynchrony and the x-calculus. Technical report, INRIA Sophia-Antipolis, 1992.

.... to the distributed implementation of synchronization and selective communication [Mit86, PS92, Kna93, BG95] Our interest in the study of choice encodings originates from the design and implementation of the high level concurrent language Pict [PT95, PT99] an asynchronous choice free # calculus [HT91, Bou92] enriched with several layers of encoded syntactic sugar. The abstract machine of Pict does not provide instructions for selective communication; instead, choice is provided as a library module by a straightforward encoding. Surprisingly, however, this encoding turns out not to be valid with ....

....with asynchronous messages (or equivalently, with non blocking output prefix) This setting has received increasing attention in recent years. In the # calculus, asynchrony was treated using a non standard labeled semantics [HT91, HT92, Hon92] the mini # calculus used a chemical semantics [Bou92]; it has also been investigated using reduction semantics [HY95] concurrent combinators [HY94a, HY94b] and output only barbed congruences [Ode95a, FG96] Only recently, it has been extended with an input guarded choice operator, equipped with a standard labeled semantics, and studied with ....

[Article contains additional citation context not shown here]

G. Boudol. Asynchrony and the #-calculus (Note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.

....in that rather ad hoc setting. 1.2. Contribution In the current paper, we present a # calculus semantics for jeblik corresponding to the semantics proposed in [23] More precisely, our semantics uses an extension of Localised # [19, 18] in short L#, a variant of the asynchronous # calculus [10, 3], where, similar to the Join calculus [6] the recipients of a channel are local to the process that created the channel. The choice of L# as the target language is not by accident: one of its fundamental laws is the forwarder law (cf. Lemma 2) ab = #c) ac c(x) bx) 3) where represents ....

....safe surrogation, and in Section 7 we prove the main result of the paper. Section 8 contains conclusions. Finally, Appendix A contains proofs omitted from the main part of the paper. 2. THE TYPED LOCALISED # CALCULUS Localised # [19, 18] in short L#, is a variant of the asynchronous # calculus [10, 3] where, similar to the Join calculus [6] the recipients of a channel are local to the process that has created the channel. This is achieved by imposing the syntactic constraint that only the output capability of channels may be transmitted, i.e. the recipient of a channel may only use it in ....

Gerard Boudol. Asynchrony and the #-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992. 58

....of specifications. The logic of specifications is responsible for manipulation of specifications. At the level of pLSD we are talking about the logic of program development. This feature can also be found in Abramsky s approach to programming logics, see [3] and its specialisations, see e.g. [2, 13, 25]. But, for obvious reasons, pLSD cannot be seen as a specialisation of Abramsky s framework: the later was formulated for propositional logics and it does not allow linear theories on any level. 3 Towards an implementation of pLSD in Isabelle Why Isabelle As a general purpose theorem prover ....

Boudol, G. -calculi for (strict) parallel functions. Technical Report 1387, INRIA SophiaAntipolis, 1991.

....successful in modelling diverse computational phenomena, and it is natural to ask how much of it is really necessary in order to attain the expressive power. This has led to several interesting and expressive subcalculi. For example, in the more easily implemented asynchronous subcalculus [2, 8] the output pre x u v : P is replaced by the output particle u v. In the fusion calculus [19] the reduction of an input and output results in a fusion of names rather than a substitution. In that calculus both input and output pre x can be replaced by their corresponding particles, in other ....

G. Boudol. Asynchrony and the -calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.

....asynchrony strongly relies on the fact that sending messages to channel managers is always possible. Our point of view is that asynchronous communications are more realistic assumptions for distributed systems; thus we model them as (first class) language primitives. The variants of calculus [33, 34, 11, 26, 2] and that of CCS described in [42] model output actions as processes, and use bisimulation based equivalences to obtain observational semantics. We have followed a similar approach; output actions are modelled by means of internal moves that can always take place (i.e. are non blocking) and ....

G. Boudol. Asynchrony in the --calculus. Research Report 1702, INRIA Sophia--Antipolis, 1992.

....one of them can be seen at a time; thus anyone looking at the two processes would see an a followed by a b or viceversa. True concurrency explores the regions in which this assumption is not true, including the settings of Petri nets, pomsets, and event structures. Work in this area includes [Bou85, BRdS85, BC87, BC89, CH87, CMP87, Gis84, GG89, vGW89, PP88, Vaa89, Vaa89]. In this thesis, we propose a notion of ready simulation between processes. We are lead to ready simulation from semantical concerns; e.g. ready simulation semantics are fully abstract with respect to CCS with copying and asymmetric communication primitives. Ready simulation includes a positive ....

G'erard Boudol and Ilaria Castellani. Concurrency and atomicity. Technical Report 748, INRIA Sophia-Antipolis, France, 1987.

....1. Introduction In recent years researchers have devoted a great effort in providing semantics for pure concurrent parallel programming languages within the realm of process calculi. Milner, Parrow and Walker s calculus or a asynchronous formulation due to Honda and Tokoro [11, 20] and Boudol [6] has been the starting point for most of these attempts. Several forms and extensions of the asynchronous calculus have since been proposed to provide for more direct programming styles, and to improve efficiency and expressiveness [7, 9, 32] Dataflow and von Neumann architectures represent ....

G. Boudol. Asynchrony and the -calculus (Note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, 1992.

....in mind that some of the restrictions or grouping of This work is partly supported by the ESPRIT CONFER 2 WG 21836 operations are motivated by this concern of having a feasible and direct distributed implementation. The join calculus can be seen as a variant of the asynchronous pi calculus [19, 18, 7, 2], which it is at the same time more atomic and more broad for some operations. It is also suited to the integration into a functional language such as ML. The main differences with the pi calculus come from three points: the uniqueness of the localization of receptors, the permanent state of ....

.... into a process [ P ] 0 of the monadic calculus such that: P Q iff [ P ] 0 [ Q] 0 One can find the details of this encoding in [11] In this paper, there is also another interesting property for expressing the relative power of the join calculus and of the asynchronous pi calculus [7, 2] whose definition is: P; Q : xhui j P jQ j x(u) P j x(u) P j (x)P From the join calculus to the pi calculus, the translation [ j is rather easy since it is the following simple rewriting [ xhvi] j = xv [ P j Q] j = P ] j j [ Q] j [ def xhui j yhvi . P in Q] j = ....

G. Boudol. Asynchrony and the -calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, 1992.

.... semantics yield a better understanding of multiway synchronization in the join calculus, and they provide a basis for comparing the join calculus with other process calculi usually equipped with labeled transition systems and bisimulations and in particular to the asynchronous calculus [10]. In these calculi, asynchrony means that message outputs have no continuation, and thus that there is no way to detect that a given message has been received. The usual weak bisimulation of the calculus has too much discriminating power, and separates processes with the same behavior such as 0 ....

....our definitions to previous proposals in the literature and we compare the equivalences obtained by applying similar definitions to both calculi. In the sequel, we focus on the asynchronous calculus with the following grammar for processes: P : 0 j xhvi j x(y) P j x:P j P j P jP We refer to [10] for the operational semantics. In short, the basic reduction step matches complementary pairs of emission and reception (xhvi j x(y) Q Gamma Qf v = y g) other transitions render intrusion or extrusion of messages with labels that carry the same information as those of the open rcham. ....

G'erard Boudol. Asynchrony and the -calculus (note). Rapport de recherche 1702, INRIA Sophia-Antipolis, May 1992.

....for image nite types [25] 2 2 The calculus of objects T yCO (Typed Concurrent Objects) is a name passing calculus featuring asynchronous communication between concurrent objects via labelled messages carrying names. The calculus is an object oriented extension of the asynchronous calculus [13, 6], where the objects behave according to principles of the actor model of concurrent computation [12, 2] with exception of the uniqueness of actors names and the fairness assumption) Syntax. Consider names a; b; v; x; y, and labels l ; m;n, possibly subscripted or primed, such that the set of ....

Gerard Boudol. Asynchrony and the -calculus (note). Rapport de Recherche RR-1702, INRIA Sophia-Antipolis, 1992.

....extra power provided is in term of action observability; in this sense the minimal capability is given by the adoption of a convergency predicate detecting the possibility of performing some visible actions. It is therefore a may convergency predicate, in this sense the same used by Boudol in [7]. We call the resulting bisimulation relation and its induced congruence respectively barbed bisimulation and barbed congruence. This paper is mainly devoted to proving that barbed congruence and coincide. The barbed bisimulation strongly recalls Abramsky s applicative bisimulation for the ....

Boudol, G., A Lambda-Calculus for (strict) Parallel Function, Report N.1387, INRIA-Sophia Antipolis, 1991.

....the # calculus the transference of results. It also shows that only by indirect means one can statically detect possible run time errors in concurrent programs, for example, by using type systems. The asynchronous polyadic # calculus. We briefly present the asynchronous polyadic # calculus [3, 6, 8]. Assume a countable set of names a, b, p, q, u, v, x, and let v stand for a sequence of names, and x for a sequence of pairwise distinct names. Definition 1 (Processes) The set of processes is given by the following grammar. P : a[v] a(x) P P Q #xP a(x) P 0 An ....

Gerard Boudol. Asynchrony and the #-calculus (note). Rapport de Recherche RR--1702, INRIA Sophia-Antipolis, 1992.

....glue paradigms. We conclude with some remarks about future work and directions. 1. 2 The #L calculus In this section we introduce the #L calculus [Lum99] an o#spring of an asynchronous fragment of the (polyadic) # calculus [Mil91, MPW92] The asynchronous sublanguage was proposed first by Boudol [Bou92] and Honda and Tokoro [HT92] Sangiorgi [San95] extended the proposal by allowing polyadic communication. 1.2.1 Syntax In the #L calculus we replace the communication of names or tuples of names by communication of so called forms, a special notion of extensible records. More precisely, the ....

Boudol, G. Asynchony and the #-calculus. Technical Report 1702, INRIA Sophia-Antipolis, May 1992.

....logic that have been proposed in the literature [Lamport 83, 89, Barringer et al. 86] in that refinement takes place between different logics (each corresponding to a level of granularity) and not within a single logic that accommodates all levels of granularity. In this sense, we agree with [Boudol 91] in that the correct interpretation of action refinement is not by means of syntactic substitution of the action by a process term in the context of another process term. We believe that it is such substitution based techniques that lead to stuttering or dense structures for interpreting ....

G.Boudol, Atomic Actions, Research Notes, INRIA Sophia Antipolis, 1991

....with simple data values and conditional expression and for the calculus. In this paper we consider Plain LAL, a mobile process calculus which differs from the calculus in the sense that the communication of data values happens asynchronously. Previously, Honda and Tokoro [4] and Boudol [2] have described so called asynchronous calculi. However, they have not studied the notion of equivalence within this setting. The surprising result is that in the presence of asynchrony, the open, late and early bisimulation equivalences coincide. As the equivalences are one and the same, this ....

G'erad Boudol. Asynchrony and the -calculus. Technical report, INRIA Sophia-Antipolis, 1992.

....used in [2, 3] axiomatic logic in [12] while in [27, 14] type systems have been developed for a number of prototypical programming languages. In this paper, we explore the extent to which type systems for ensuring various forms of security can also be developed for the asynchronous calculus [4, 16]. We discuss two security issues: resource access control and information control. The former is described in terms of runtime errors, the latter in terms of non interference [27, 10] The (asynchronous) calculus is a very expressive language for describing distributed systems, 4, 22, 11] in ....

....[4, 16] We discuss two security issues: resource access control and information control. The former is described in terms of runtime errors, the latter in terms of non interference [27, 10] The (asynchronous) calculus is a very expressive language for describing distributed systems, [4, 22, 11], in which processes intercommunicate using channels. Thus n (x) P is a process which receives some value on the channel named n, binds it to the variable x and executes the code P . Corresponding to this input command is the asynchronous output command n hvi which outputs the value v on n. The ....

G. Boudol. Asynchrony and the -calculus. Technical Report 1702, INRIA-Sophia Antipolis, 1992.

....be found in a technical annex. 2 2 The Calculus of Objects T yCO (Typed Concurrent Objects) is a name passing calculus featuring asynchronous communication between concurrent objects via labelled messages carrying names. The calculus is an objectbased extension of the asynchronous calculus [7, 14] where the objects behave according to the principles of the actor model of concurrent computation [3, 13] with the exception of the uniqueness of actors names and the fairness assumption) Syntax. Consider names a; b; v; x; y, and labels l; m; n; possibly subscripted or primed, such ....

Gerard Boudol. Asynchrony and the -calculus (note). Rapport de Recherche RR-1702, INRIA Sophia-Antipolis, 1992.

....been used in [3, 4] axiomatic logic in [13] while in [27, 15] type systems have been developed for a number of prototypical programming languages. In this paper, we explore the extent to which type systems for ensuring various forms of security can also be developed for the asynchronous calculus [5, 17]. We discuss two security issues: resource access control and information control. The former is described in terms of runtime errors, the latter in terms of non interference [27, 11] The (asynchronous) calculus is a very expressive language for describing distributed systems, 5, 23, 12] in ....

.... calculus [5, 17] We discuss two security issues: resource access control and information control. The former is described in terms of runtime errors, the latter in terms of non interference [27, 11] The (asynchronous) calculus is a very expressive language for describing distributed systems, [5, 23, 12], in which processes intercommunicate using channels. Thus n (x)P is a process which receives some value on the channel named n, binds it to the variable x and executes the code P . Corresponding to this input command is the asynchronous output command n hvi which outputs the value v on n. The set ....

G. Boudol. Asynchrony and the -calculus. Technical Report 1702, INRIA-Sophia Antipolis, 1992.

....for a process calculus with simple data values and conditional expression and for the calculus. In this paper we consider Plain LAL, a mobile process calculus which differs from the calculus in the sense that the communication of data values happens asynchronously. Previously, HT91] and [Bou92] have described so called asynchronous calculi. In [Ode95] it is shown how familiar programming constructs can be encoded in a straightforward fashion within an asynchronous calculus, thus confirming the naturalness of the combination of asynchrony and mobility. The main result of the present ....

....setting of the operational semantics provided. It turns out that these notions of bisimulation coincide here. We give a sound and complete axiomatization of the common notion of bisimulation equivalence for finite Plain LAL agents. Plain LAL looks somewhat different from the calcui of [HT91] and [Bou92] but it is in fact quite easy to come up with compositional encodings of these calculi in Plain LAL. Although we have not persued this subject very further, this leeds us to belive that our results will indeed also hold for asynchronous versions of the calculus. An interesting question is: How ....

G'erard Boudol. Asynchrony and the ß-calculus. Technical report, INRIA Sophia-Antipolis, 1992.

....i.e. P Gamma P 0 is the only immediate possible transition for P . We write P Gamma n d P 0 if P evolves to P 0 by performing n deterministic reductions. A.0. 3 The asynchronous calculus A common subcalculus of the calculus is the asynchronous calculus ( a ) HT91, Bou92, ACS96] which has no operators of summation and matching, and all output pre xes are of the form ahbi (they have no continuation) The encodings of the calculus in this paper are written in a . The processes of a enjoy some interesting behavioural properties, some of which are reported ....

G. Boudol. Asynchrony and the ß-calculus. Technical Report RR1702, INRIA-Sophia Antipolis, 1992.

.... to the distributed implementation of synchronization and selective communication [Mit86, PS92, Kna93, BG95] Our interest in the study of choice encodings originates from the design and implementation of the high level concurrent language Pict [PT95, PT97] an asynchronous choice free calculus [HT91, Bou92] enriched with several layers of encoded syntactic sugar. The abstract machine of Pict does not provide instructions for selective communication; instead, choice is provided as a library module by a straightforward encoding. Surprisingly, however, this encoding turns out not to be valid with ....

....with asynchronous messages (or equivalently, with non blocking output prefix) This setting has received increasing attention in recent years. In the calculus, asynchrony was treated using a non standard labeled semantics [HT91, HT92, Hon92] the mini calculus used a chemical semantics [Bou92]; it has also been investigated using reduction semantics [HY95] concurrent combinators [HY94a, HY94b] and output only barbed congruences [Ode95a, FG96] Only recently, it has been extended with an input guarded choice operator, equipped with a standard labeled semantics, and studied with ....

[Article contains additional citation context not shown here]

G. Boudol. Asynchrony and the ß-calculus (Note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.

....over image finite processes. Beyond its use as a proof technique, our semantics yields a better understanding of the join calculus, and provides a basis for comparing it with other calculi, which are usually equipped with weak bisimulations, and especially with the asynchronous calculus [3]. In these calculi, asynchrony means that message outputs have no continuation, and thus that there is no direct way to detect that a message has been received. Noticeably, the usual weak bisimulation of the calculus has too much discriminating power, and separates processes with the same ....

....previous proposals in the literature, and we compare the equivalences obtained by applying similar definitions to both the join calculus and the calculus. In the sequel, we use the following grammar for asynchronous calculus processes. P : 0 j xhvi j x(y) P j x:P j P j P j P We refer to [3] for the definition of its semantics. We recall the basic reduction step, which matches complementary pairs of emission and reception, and substitutes actual names for the variables in the receiving process: xhvi j x(y) Q Gamma Qf y = v g Other transitions render intrusion or extrusion of ....

G'erard Boudol. Asynchrony and the ß-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, 1992.

....with simple data values and conditional expression and for the calculus. In this paper we consider Plain LAL, a mobile process calculus which differs from the calculus in the sense that the communication of data values happens asynchronously. Previously, Honda and Tokoro [4] and Boudol [2] have described so called asynchronous calculi. However, they have not studied the notion of equivalence within this setting. The surprising result is that in the presence of asynchrony, the open, late and early bisimulation equivalences coincide. As the equivalences are one and the same, this ....

G'erad Boudol. Asynchrony and the ß-calculus. Technical report, INRIA Sophia-Antipolis, 1992.

....is described in [3] The calculus [28] is one of the best studied examples of mobile process calculi, namely calculi in which the communication topology among processes can dynamically evolve when computation progresses. The asynchronous version of the calculus has been introduced in [8,21] and studied in [5] The tile model, introduced in [16] is described in general terms in [17,18] Tiles are much like SOS inference rules [30] but they can be composed horizontally, vertically and in parallel to build larger proof steps. Tile systems generalize Kim Larsen and Liu Xinxin context ....

G. Boudol, Asynchrony and the ß-calculus (note), Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.

....leading to a general theory of relative normalisation for rewriting systems. 3 Scientific and Technological Contributions of the Project OGR and the calculus Milner [24] showed that a mini calculus could be used to encode the lazy and strict calculus. Honda and Tokoro [15] and Boudol [1] investigated an asynchronous calculus leading to the mini asynchronous calculus which has been the focus of much recent research. In [4] Glauert developed a form of polyadic asynchronous calculus exchanging terms. The model was implemented using a graph rewriting system in which graph terms ....

G. Boudol: Asynchrony and the ß-calculus, INRIA Report 1702, INRIA Sophia-Antipolis, 1992.

....channel and asynchrony strongly relies on the fact that sending messages to channel managers is always possible. Our point of view is that asynchronous communications are more realistic assumptions for distributed systems; thus we model them as language primitives. The variants of calculus [35, 36, 11, 28, 2] and that of CCS described in [44] model output actions as processes, and use bisimulation based equivalences to obtain observational semantics. We have followed a similar approach; output actions are modelled by means of internal moves which can always be performed (i.e. are non blocking) and ....

G. Boudol. Asynchrony in the ß--calculus. Research Report 1702, INRIA Sophia--Antipolis, 1992.

No context found.

G. Boudol. Asynchrony and the -calculus. Technical Report 1702, INRIA-Sophia Antipolis, 1992.

.... objects Chapter 3 Typed concurrent objects T yCO Typed Concurrent Objects is a name passing calculus featuring asynchronous communication between concurrent objects via labelled messages carrying names [VT93] The calculus is an object based extension of the asynchronous calculus [Bou92, HT91] synchronous communication and the returning of results are implemented by means of reply messages . T yCO is reminiscent of the calculus [AC96] the Object Calculus of Abadi and Cardelli, in the sense that objects are sums of labelled methods (the variable self being interpreted as the ....

Gerard Boudol. Asynchrony and the -calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, 1992.

....extended version of the cal culus with a special case construct, which basically amounts to an extended matching operator. As the target calculus for our translation we instead go for as simple a version of the calculus as possible. The version that we shall use is the asynchronous calculus [CS96, Bou92, HT91, HK95]. The syntax of asynchronous calculus is in the present paper given by: P : a b j P jP j ( a)P j G j G G : 0 j a( b) P j :P j G G We let a; b; 2 Names range over an infinite c ountable set of names, b denote tuples of names, a tuple of the names a, b and c will be written ....

G'erard Boudol. Asynchrony and the -calculus. Technical report, INRIA Sophia-Antipolis, 1992.

....both for a process calculus with simple data values and conditional expression and for the calculus. In this paper we consider Plain LAL, a mobile process calculus which differs from the calculus in the sense that the communication of data values happens asynchronously. Previously, HT91] and [Bou92] have described so called asynchronous calculi. In [Ode95] it is shown how familiar programming constructs can be encoded in a straightforward fashion within an asynchronous calculus, thus confirming the naturalness of the combination of asynchrony and mobility. The main result of the present ....

....of the operational semantics provided. It turns out that 15 these notions of bisimulation coincide here. We give a sound and complete axiomatization of the common notion of bisimulation equivalence for finite Plain LAL agents. Plain LAL looks somewhat different from the calcui of [HT91] and [Bou92] but it is in fact quite easy to come up with compositional encodings of these calculi in Plain LAL. Although we have not persued this subject very further, this leeds us to belive that our results will indeed also hold for asynchronous versions of the calculus. An interesting question is: How ....

G'erard Boudol. Asynchrony and the -calculus. Technical report, INRIA Sophia-Antipolis, 1992. 16

No context found.

G. Boudol. Asynchrony and the #-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, 1992.

No context found.

G. Boudol. Asynchrony and the -calculus. Technical Report 1702, INRIA-Sophia Antipolis, 1992.

No context found.

G. Boudol. Asynchrony and the p-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.

No context found.

G. Boudol. Asynchrony and the -calculus (Note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.

No context found.

G. Boudol. Asynchrony and the -calculus (note). Rapport de recherche 1702, INRIA Sophia-Antipolis, May 1992.

No context found.

Gerard Boudol. Asynchrony and the -calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.

No context found.

G. Boudol, Asynchrony and the -calculus (note), Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.

No context found.

G#rard Boudol. Asynchrony and the -calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.

No context found.

Gerard Boudol. Asynchrony and the #-calculus (note). Rapport de Recherche RR--1702, INRIA Sophia-Antipolis, 1992.

No context found.

G. Boudol. Asynchrony and the #-calculus. Technical Report RR-1702, INRIA-Sophia Antipolis, 1992.

No context found.

G. Boudol. Asynchrony and the #-calculus. Technical Report RR-1702, INRIA-Sophia Antipolis, 1992.

No context found.

Gerard Boudol. Asynchrony and the -calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.

No context found.

Gerard Boudol. Asynchrony and the #-calculus (note). Rapport de Recherche RR-1702, INRIA Sophia-Antipolis, 1992.

No context found.

G. Boudol. Asynchrony and the -calculus (note). Technical Report 1702, INRIA Sophia-Antipolis, May 1992.

No context found.

G. Boudol. Asynchrony and the -calculus (note). Technical Report 1702, INRIA Sophia-Antipolis, May 1992.

No context found.

G. Boudol. Asynchrony and the -calculus (note). Technical Report 1702, INRIA Sophia-Antipolis, May 1992.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC