Boudol, G.: Towards a lambda-calculus for concurrent and communicating systems. In Daz, J., Orejas, F., eds.: Proceedings of Theory and Practice of Software Development (TAPSOFT '89). Volume 351 of Lecture Notes in Computer Science., Springer Verlag (1989) 149--161  Home/Search   Document Not in Database   Summary   Related Articles   Check

....that may be exchanged or change site) and movements of communication links. Correspondingly, there are two main approaches to represent mobility in process algebra. In the higher order (or process passing) paradigm, terms of the language (like processes) may be transmitted; fl calculus [6], Plain CHOCS [39] CML [31] FACILE [13, 41] belong to this category. In the rst order (or name passing) paradigm, mobility is achieved by allowing transmission of names (but not arbitrary terms) The calculus is the prototypical rst order calculus. Name passing is simpler than process passing, ....

G. Boudol. Towards a lambda calculus for concurrent and communicating systems. In TAPSOFT '89, volume 351 of Lecture Notes in Computer Science, pages 149161, 1989.

....one can also achieve mobility by the powerful means of transmitting processes as messages; this is the higher order approach. It is well exemplified by the work Astesiano and Reggio [2] in the context of general algebraic specification, F. Nielson [22] with emphasis upon type structure, Boudol [6] in the context of calculus, and Thomsen [27] It has been a deliberate intention in the calculus to avoid higher order initially, since the goal was to demonstrate that in some sense it is sufficiently powerful to allow only names or channels to be the content of communications. Indeed ....

Boudol, G., Towards a lambda-calculus for concurrent and communicating systems, Proc. TAPSOFT 89, Lecture Notes in Computer Science, Vol 351, pp149--161, Springer-Verlag, 1989.

....uses to encode the lazy calculus. However, a precise statement and, especially, a full proof of this claim demands a lot of further work. Other connections to explore include the relationships with the calculus ( MPW92, Mil92] the higher order calculus ( San92, San93] and the fl calculus ([Bou89, BB92], cf. also [JP90] In the calculus, channel names are transmitted rather than processes, so an immediate correspondence is not to be expected. For another reason, the same holds for the fl calculus: the notion of sequential composition used there is essentially different from ours. 1. A ....

G. Boudol. Towards a Lambda-Calculus for Concurrent and Communicating Systems. In J. Diaz and F. Orejas, editors, Proceedings of the International Joint Conference on Theory and Practice of Software Development, volume 351 of Lecture Notes in Computer Science, pages 149--162, Barcelona, March 1989. Springer-Verlag.

....languages from calculi. Since then, there has been an extremely large body of work which aims to emulate the FP approach in a more general setting. One strand of work has devised extensions of lambda calculus with state [FH92, SF93, SRI91, ORH93, AS98] or non determinism and concurrency [Bou89, dP95, Bou97] Another strand of work has been designed concurrent functional languages [GMP89, Rep91, AMST97] based on some other operational semantics. Landin s program has also been repeated in the concurrent programming field, for instance with Occam and CSP [Hoa85] Pict [PT97] and ....

Gerard Boudol. Towards a lambda-calculus for concurrent and communicating systems. In J. Daz and F. Orejas, editors, Proceedings TAPSOFT '1989, pages 149--161, New York, March 1989. Springer-Verlag. Lecture Notes in Computer Science 351.

....43] These efforts receive new interest in connection with recent research activities aiming at a theory of higher order communicating processes. So it is natural to ask for a theory in which communication embodies functional application. This has been studied by Thomsen in [44] and by Boudol in [15] explicitly, while it is an implicit theme in current research on Milner s calculus [32] Non determinism and parallelism (usually represented by an interleaving operator) are fundamental concepts in process algebra theory. Combining them and calculus can enlighten the theory of higher order ....

G. Boudol, "Toward a Lambda-calculus for Concurrent and Communicating Systems", TAPSOFT'89, LNCS 351, Springer-Verlag, Berlin, 1989, 149-161. M.Dezani-Ciancaglini, U.de'Liguoro and A.Piperno - Conjunctive-Disjunctive -calculi 40

....concurrent processes, all of them issuing or originated in enrichements of the traditional support calculi, calculus and CCS like systems, which aim at breaking both the rigid structure of process algebra and the intrinsically sequential nature of calculus. Striking examples are the fl calculus [3, 2] and the Calculus of Higher order Communicating Systems (CHOCS) 16] allowing any kind of entity to be passed in a communication, and the calculus of Milner, Parrow and Walker [10] based on the communication of access to processes rather than processes themselves. In relation with , we can also ....

G. Boudol . Towards a lambda-calculus for concurrent and communicating systems. In TAPSOFT 1989, LNCS 351. 1989

....We insist on types reflecting no more and no less than the functionality of expressions. The collection of the (dynamic) information concerning the communication possibilities of expressions should be handled separately from the statically checkable notion of type. The fl calculus developed in [Bou89] and equipped with a domain theoretic model in [JP90] represents Boudol s attempt to establish a hybrid calculus. is thought to be just a distinguished port name and fi reduction is a typical instance of a more general communication law. The aim was to invent a CCS like language which contains ....

G. Boudol. Towards a LambdaCalculus for Concurrent and Communicating Systems. In Theory and Practice of Software Development (TAPSOFT), pages 149--161. Springer, 1989. LNCS 351.

....for communicating systems which contains higher order constructs like communication of terms. We analyse the notion of bisimulation in these calculi. We argue that both the standard definition of bisimulation (i.e. the one for CCS and related calculi) as well as higher order bisimulation [AGR88, Bou89, Tho90] are in general unsatisfactory, because of their overdiscrimination. We propose and study a new form of bisimulation for such calculi, called context bisimulation, which yields a more satisfactory discriminanting power. A drawback of context bisimulation is the heavy use of universal ....

....mobile systems, i.e. concurrent systems whose communication topology may change dynamically. We can categorise these calculi into first order calculi like calculus [MPW92] in which only names (i.e. ports, or channels) can be communicated, and higher order calculi like CHOCS [Tho90] fl calculus [Bou89], Higher Order calculus [San92] in which agents (i.e. terms of the language) can be communicated. Higher order calculi are formally closer to the calculus, whose basic computational step fi reduction involves term instantiation. In this paper we analyse the notion of bisimulation in ....

[Article contains additional citation context not shown here]

G. Boudol. Towards a lambda calculus for concurrent and communicating systems. In TAPSOFT '89, volume 351 of Lecture Notes in Computer Science, pages 149--161, 1989.

....for communicating systems which contains higher order constructs like communication of terms. We analyse the notion of bisimulation in these calculi. We argue that both the standard definition of bisimulation (i.e. the one for CCS and related calculi) as well as higher order bisimulation [AGR88, Bou89, Tho90] are in general unsatisfactory, because over discriminating. We propose and study a new form of bisimulation for such calculi, called context bisimulation, which yields a more satisfactory discriminanting power. A drawback of context bisimulation is the heavy use of universal quantification in ....

....qui contient des op erateurs d ordre sup erieur comme communications des termes. Nous analysons la notion de bisimulation pour ces calculs. Nous retenons que la d efinition standard de bisimulation (c a d, celle pour CCS et les calculs s y rapportant) ainsi que celle de higher order bisimulation [AGR88, Bou89, Tho90] sont en general non satisfaisantes, car trop discriminantes. Nous proposons et etudions une nouvelle forme de bisimulation pour de tels calculs, appel ee context bisimulation, qui offre un pouvoir de discrimination plus satisfaisant. Un inconv enient a la context bisimulation est l utilisation ....

[Article contains additional citation context not shown here]

G. Boudol. Towards a lambda calculus for concurrent and communicating systems. In TAPSOFT '89, volume 351 of Lecture Notes in Computer Science, pages 149--161, 1989.

....developing programming languages from calculi. Since then, there has been an extremely large body of work which aims to emulate the FP approach in a more general setting. One strand of work has devised extensions of lambda calculus with state [13, 34, 36, 28, 3] or nondeterminism and concurrency [7, 12, 9]. Another strand of work has been designed concurrent functional languages [19, 33, 2] based on some other operational semantics. Landin s programme has also been repeated in the concurrent programming field, for instance with Occam and CSP [22] Pict [30] and # calculus [27] or Oz and its ....

G. Boudol. Towards a lambda-calculus for concurrent and communicating systems. In J. Daz and F. Orejas, editors, Proceedings TAPSOFT '1989, pages 149--161, New York, March 1989. Springer-Verlag. Lecture Notes in Computer Science 351.

.... or name sortings [Ode95b] Join calculus [FGL 96, FG96] can provide a unifying basis of call by value functional programming, sequential imperative programming and concurrent programming, and at the same time is simpler than previous calculi which try to model some combination of these areas [Bou89, Ode95a, Bou97] As such it seems well suited to take over from lambda calculus as a generally agreed upon foundation of programming. Join calculus has traditionally been introduced as a process calculus, and its operational semantics has been explained as a chemical abstract machine [BB90, ....

Gerard Boudol. Towards a lambda-calculus for concurrent and communicating systems. In J. Daz and F. Orejas, editors, Proceedings TAPSOFT '1989, pages 149--161, New York, March 1989. Springer-Verlag. Lecture Notes in Computer Science 351.

....is powerful enough to encode computations over arbitrary data types. 1 There has also been considerable progress towards formalizing an object paradigm as a basis of computational encapsulation (for example, see [Wal90, BB90] One of the main motivations for models of concurrency (such as [MPW91, Bou89]) is to develop a formalism for concurrent communicating processes which would be the concurrent analogue of the calculus. In particular, the calculus would be a sub calculus of the concurrent formalism. However, it is not clear whether the calculus, for example, can do all the reductions of ....

B. Boudol. Towards a lambda-calculus for concurrent and communicating systems. Lecture Notes in Computer Science, 1989.

....of Theorem 16, from where we found the same fact from Lemma 13(2) This concludes the proof of Theorem 18. 2 5 Encoding the Calculus Most process calculi with the ability of treating processes as first class objects (directly or indirectly) have attempted to embed or encode the calculus, e.g. [Bou89, Tho90, Mil92, San93, San94, San95, Bou97]. The lazy calculus [Abr89] has been modelled and analysed in the calculus by Milner [Mil92] and Sangiorgi [San93, San95] The strong lazy reduction strategy, where reduction is possible under abstraction, has not been encoded in the pure calculus. The problem is that input binding in calculus ....

G. Boudol. Towards a lambda-calculus for concurrent and communicating systems. In J. D ' iaz and F. Orejas, editors, Proceedings of TAPSOFT '89, Volume 1, volume 351 of LNCS, pages 149--161. Springer, 1989.

....in Theorem 6. The proofs of Lemma 7 and Theorem 8 are by simultaneous induction over the depth of agents. 5 Encoding the Calculus Most process calculi with the ability of treating processes as first class objects (directly or indirectly) have attempted to embed or encode the calculus, e.g. [2, 18, 6, 13, 14, 15, 3]. The lazy calculus [1] has been modelled and analysed in the calculus by Milner [6] and Sangiorgi [13, 15] The strong lazy reduction strategy, where reduction is possible under abstraction, is more difficult to encode. The problem is that input binding in calculus can only be done by ....

G. Boudol. Towards a lambda-calculus for concurrent and communicating systems. In J. D ' iaz and F. Orejas, editors, Proceedings of TAPSOFT '89, Volume 1, volume 351 of LNCS, pages 149--161. Springer, 1989.

....of closed agents, it makes sense to redefine the notion of weak transition as well: We write p = fi p 0 for p( Gamma fi ) p 0 , p ffl = p 0 for p ( Gamma ) p 0 and p = p 0 for p ffl = Gamma ffl = p 0 . Higher order bisimulation has been proposed by [Tho89, Bou89] following earlier ideas of [AGR88] as an adequate notion of process equivalence for dynamic scoping. It results from an extension of the standard equivalence for value passing CCS [Mil89] to the higher order setting, and requires bisimilarity rather than identity of the agent emitted in an ....

G. Boudol. Towards a lambda--calculus for concurrent and communicating systems. In Int. Joint Conference on Theory and Practice of Software Development (TAPSOFT), number 351 in Lecture Notes in Computer Science, pages 149--161. Springer--Verlag, Berlin, Heidelberg, New York, 1989.

.... A deep comparison between a process calculus and calculus is interesting for several reasons; indeed, virtually all proposals for process calculi with the capability of treating directly or indirectly processes as first class objects have incorporated attempts at embedding the calculus [Bou89, Tho90]. From the process calculus point of view, it is a significant test of expressiveness, and helps in getting deeper insight into its theory. From the calculus point of view, it provides the means to study terms in contexts other than purely sequential ones, and with the instruments developed in ....

....] def = p) q (H[ M ] hqi j qhH[ N ] pi:0) The higher order features of HO allow us a simpler encoding than Milner s into calculus [Mil90] Indeed, there is a one to one correspondence between reductions in terms and in their HO counterparts. Therefore, following Boudol s terminology [Bou89], we can claim that lazy calculus is a subcalculus of HO . Proposition4 (operational correspondence for H) Let M and M 0 be closed terms. 1: If M Gamma M 0 then H[ M ] hpi Gamma H[ M 0 ] hpi, 2: the converse, i.e. if H[ M ] hpi Gamma Q then there is an M 0 such that M Gamma M ....

G. Boudol. Towards a lambda calculus for concurrent and communicating systems. In TAPSOFT '89, volume 351 of Lecture Notes in Computer Science, pages 149--161, 1989.

....to derive the correctness of the calculus encodings (on terms as well as on types) from those of the CPS transforms and of the compilation of HO into calculus. Translations of functions into process calculi have been given by Kennaway and Sleep [KS82] Leth [Let91] Thomsen [Tho90] Boudol [Bou89] Robin Mil68 ner s work on functions as calculus processes [Mil92] is a landmark in the area. Milner considers the call by name and parallel call by value strategies (his encodings are, respectively, that in Table 8 and a variant of that in 3) Milner proves the operational correpondence ....

G. Boudol. Towards a lambda calculus for concurrent and communicating systems. In TAPSOFT '89, volume 351 of Lecture Notes in Computer Science, pages 149161, 1989.

....some detail in my thesis [Sar89] and we shall not re make that case here. The purpose of this paper is to explore the higher order analog of the cc languages. We are motivated in part by the obvious need to understand the interaction between concurrency and higher order calculi (see for example [Bou89, Tho90, MPW89, BB90]) in part by the need to understand at a more fundamental level the relationship between the cc programming framework, and Scott s conception of computation, and in part by the need to get a more powerful framework for computing with constraints than provided by the first order cc languages. For ....

Gerard Boudol. Towards a lambda-calculus for concurrent and communicating systems. In TAPSOFT 1989, volume 351 of Lecture Notes in Computer Science, pages 141--169, 1989.

No context found.

Boudol, G.: Towards a lambda-calculus for concurrent and communicating systems. In Daz, J., Orejas, F., eds.: Proceedings of Theory and Practice of Software Development (TAPSOFT '89). Volume 351 of Lecture Notes in Computer Science., Springer Verlag (1989) 149--161

No context found.

G. Boudol. Towards a lambda calculus for concurrent and communicating systems. In Proc. TAPSOFT '89, volume 351 of LNCS, pages 149--161. Springer Verlag, 1989.

No context found.

G. Boudol, "Towards a lambda-calculus for concurrent and communicating systems", LNCS 351, 1989.

No context found.

G. Boudol. Towards a lambda calculus for concurrent and communicating systems. In Proc. TAPSOFT '89, volume 351 of LNCS, pages 149--161. Springer Verlag, 1989.

No context found.

G. Boudol, "Towards a Lambda Calculus for Concurrent and Communicating Systems", in Proc. TAPSOFT '89, LNCS 351, 1989.

No context found.

G. Boudol. Towards a lambda-calculus for concurrent and communicating systems. In J. D'iaz and F. Orejas, editors, Proceedings of TAPSOFT `89, pages 149--161. Springer-Verlag, 1989. LNCS 351.

No context found.

G. Boudol. Towards a lambda calculus for concurrent and communicating systems. In TAPSOFT '89, volume 351 of Lecture Notes in Computer Science, pages 149--161, 1989.

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