C. Fournet, C. Laneve, L. Maranget, and D. R emy. Inheritance in the Join Calculus. In FSTTCS 2000, volume 1974 of LNCS, pages 397--408. Springer, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....primitives for objects and for concurrent processes coexist. Systematic translations of objects into calculus can be found, for instance, in [Wal95,HK96,San98,KS98] Works that belong to the second approach are much closer to what we do here. Among these it is worth to mention the approaches of [Vas94,PT95,FMLR00] which, given a name passing calculus, build high level constructors distinctive of object oriented languages. A complementary approach is followed by [GH98] and [DBF96] since they add primitives for concurrency to the imperative object oriented calculus of, respectively, AC96] and [FHM94] ....

C'edric Fournet, Luc Maranget, Cosimo Laneve, and Didier R'emy. Inheritance in the Join Calculus. In Foundations of Software Technology and Theoretical Computer Science, volume 1974 of Lecture Notes in Computer Science. Springer, December 2000.

.... 0 a a sublocation of 0 S : con guration nothing j S k S 0 soup composition j D ;I;F a P running location Figure 1: Syntax for the dynamic Join Calculus In order to account for the di erent routings of static and dynamic messages, we split the routing in two steps (much as in [12]) The rst step, called the name lookup step, resolves the location where to route the message, and prepends this location to the message. The destination is the location containing the de nition the message is bound to. For static channels, it is the unique location de ning the channel; for ....

....con gurations where dynamic messages are bound to a dynamic de nition in some enclosing location. Types are de ned in gure 5. This type system is similar to the one for the distributed Join Calculus. It uses the same generalization criterion as the one implemented in JoCaml and formalized in [12]. Types and subtyping ( g. 5 and 6) Intuitively, locations provide dynamic de nitions, either by directly de ning them, or by requesting enclosing locations to de ne them. The type of a location is loc( where is the set of dynamic names that are available in the location. Thus, inside such ....

[Article contains additional citation context not shown here]

C. Fournet, L. Maranget, C. Laneve, and D. Remy. Inheritance in the join calculus. In Foundations of Software Technology and Theoretical Computer Science, volume

....we may write nh e n i i for nh e n i i; 0. A process may also be a migration go(a) P to a with continuation P , a local de nition def D in P , a dynamic name creation n:P , or a routed message a:nh e n i i to location a. This last construction is very similar to the message construction of [11], with the exception that it is an internal state of the routing of a message that cannot be used directly by the programmer. Free, bound, received and de ned names are de ned as usual. The formal de nitions are in appendix A. We also introduce the notion of de ned local names (dln) as names that ....

....pattern are consumed, and the guarded process is spawned, with its formal arguments replaced by the arguments of the messages using the substitution on received names rn . In the distributed Join Calculus, messages are communicated in one step. In our calculus, it takes two steps, much as in [11]. The rst step (Route) routes the message nh e n i i; P by prepending its destination location. If the message is on a dynamic name (n 2 c , typing guarantees that all dynamic names are mentioned in c ) and if the routing function is de ned for this name (F (n) 6= then the message is ....

[Article contains additional citation context not shown here]

C. Fournet, L. Maranget, C. Laneve, and D. Remy. Inheritance in the join calculus. In Foundations of Software Technology and Theoretical Computer Science, volume

....is joined with g( and so on. It is possible to devise more complex and permissive rules for overriding which would, for example, allow the earlier ActiveObject example to implement the CloseDown chord in the base class. Our current rule has the advantage of simplicity, but we refer the reader to [10] for a more thorough study of inheritance in the Join calculus, including more advanced type systems for its control. The second restriction above (that there be at most one synchronous method in a chord) is also caused by a potentially bad interaction between existing C ] features and the pure ....

C. Fournet, C. Laneve, L. Maranget, and D. Remy. Inheritance in the join-calculus (extended abstract). In FST TCS

....while the formers,being object based calculi, definitely overlook these issues. Regrettable, forgetting about classes eludes any treatment of inheritance, which is a crucial notion in object oriented programming and even more when concurrency is added. Some progress in this direction is done in [5], where a class based calculus has been developed out of a well known process calculus the join calculus and a formal analysis of inheritance and possible anomalies is undertaken. ....

Cedric Fournet, Cosimo Laneve, Luc Maranget and Didier Remy. Inheritance in the join-calculus. ftp://ftp.cs.unibo.it/pub/laneve/obj.ps.gz, October 1998.

No context found.

C. Fournet, C. Laneve, L. Maranget, and D. R emy. Inheritance in the Join Calculus. In FSTTCS 2000, volume 1974 of LNCS, pages 397--408. Springer, 2000.

No context found.

C. Fournet, L. Maranget, C. Laneve, D. R emy. Inheritance in the Join Calculus. In Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science v. 1974.

No context found.

C. Fournet, C. Laneve, L. Maranget, and D. Remy. Inheritance in the Join Calculus. In S. Kapoor and S. Prasad, editors, Foundations of Software Technology and Theoretical Computer Science (FSTTCS2000.

No context found.

C. Fournet, L. Maranget, C. Laneve, and D. Remy. Inheritance in the join calculus. In FST-TCS'00, LNCS, Dec. 2000.

No context found.

C. Fournet, C. Laneve, L. Maranget, and D. Remy. Inheritance in the Join Calculus. In S. Kapoor and S. Prasad, editors, Foundations of Software Technology and Theoretical Computer Science (FSTTCS2000.

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