Laurent Dami, Type Inference and Subtyping for Higher-Order Generative Communication, in this volume.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....in tuples. While positional notation is easy to use, it is also error prone (two tuples of the same arity can easily get mixed up) and does not lend itself to extensions. Labels make the agreement explicit (it is necessary to agree on names before communicating) and help in making code more robust [10]. Although we are interested in coordinating mobile agents, the language presented here does not allow the exchange of code or processes. A treatment of mobility can be found in [26, 6] The calculi could be merged at the cost of some complexity, but we prefer to leave this as a topic of future ....

....in the space which are matched with requests. An offer or request is an interface form that matches if the type of the service is a subtype of the requestor s. Alice is the type system employed for matching these interfaces [23] Dami also investigates type inference for generative communication [10]. As regards implementing the shared object paradigm in Java, we have already cited JavaSpaces [22] and Jada [9] Jada is one example of the shared space paradigm being used to coordinate mobile agents: it is employed in the PageSpace agent architecture. More generally, neither Jada nor ....

L. Dami. Type Inference and Subtyping in Higher-Order Generative Communication. In D. Tsichritzis, editor, Object Applications. University of Geneva, 1996. 21

....in the space which are matched with requests. An offer or request is an interface form that matches if the type of the service is a subtype of the requestor s. Alice is the type system employed for matching these interfaces [25] Dami also investigates type inference for generative communication [10]. As regards implementing the shared object paradigm in Java, we have already cited JavaSpaces [23] and Jada [9] Jada is one example of the shared space paradigm being used to coordinate mobile agents: it is employed in the PageSpace agent architecture. More generally, neither Jada nor ....

L. Dami. Type Inference and Subtyping in Higher-Order Generative Communication. In D. Tsichritzis, editor, Object Applications. University of Geneva, 1996.

....in tuples. While positional notation is easy to use, it is also error prone (two tuples of the same arity can easily get mixed up) and does not lend itself to extensions. Labels make the agreement explicit (it is necessary to agree on names before communicating) and help in making code more robust [7]. 4 Implementing the SOS Model The examples of the previous section have demonstrated the expressive power of the SOS model. This section looks at its implementation in the context of Java based mobile agent systems. In particular, we argue that this implementation is efficient since, though ....

....in the space which are matched with requests. An offer or request is an interface form that matches if the type of the service is a subtype of the requestor s. Alice is the type system employed for matching these interfaces [22] Dami also investigates type inference for generative communication [7]. As regards implementing the shared object paradigm in Java, we have already cited JavaSpaces [20] and Jada [6] In particular, section 4.1 mentioned the different approaches taken by these systems to implementing the match function. Jada is one example of the shared space paradigm being used to ....

L. Dami. Type Inference and Subtyping in Higher-Order Generative Communication. In D. Tsichritzis, editor, Object Applications, pages 173--204. University of Geneva, 1996.

....treatment to all the constructs seen so far. Dynamic binding cannot be expressed in the traditional calculus; so HOP is based on a modified calculus, called N , in which functions can have several named parameters at each abstraction level. A detailed presentation of the calculus is given in [Dami96] in this volume, so here we only supply a condensed summary of its main properties. 3.1 Syntax and rewrite rules The calculus is constructed from a set V of variables and a set N of names (or labels) Letters x; y; z range over V; letter l ranges over N ; letters a; b; c; range over the ....

....lambda terms. These can be embedded in LN by the following function LN [ Gamma] L LN : LN [x] x inv ; LN [x:a] x:LN [a] LN [ab] LN [a] inv = LN [b] So in the following we will freely use traditional calculus syntax whenever convenient, assuming this translation to be implicit. In [Dami96] an observational ordering on terms is defined, yielding the following (in)equations: 8a; b; c; 1. a(l 1 = b) l 2 = c) a(l 2 = c) l 1 = b) if l 1 6j l 2 a(l 1 = b) if l 1 j l 2 2. a(l = b) v a 3. a v x:a(l 1 = x l 1 ) l n = x l n ) if x 62 FV (a) These support our intuitive ....

[Article contains additional citation context not shown here]

Laurent Dami. Type inference and subtyping for higher-order generative communication, in this volume. Also to appear in Coordination Programming: Mechanisms, Models, Semantics, J.-M. Andreoli, C. Hankin and D. Le Metayer, eds. Imperial College Press, 1996.

....[24,27] although not fully equivalent. Calculi of extensible records internally distinguish between functional and record values, while N treats everything as a function, much like the pure classical calculus. This paper borrows some material from a previous presentation of the N calculus [10], but with a different emphasis. In [10] we were mainly concerned with inference of principal types for Nand their use for filtering communication in a shared dataspace. The motivation for using names and dynamic binding for coordination purposes was discussed in some detail in this paper. Here, ....

....Calculi of extensible records internally distinguish between functional and record values, while N treats everything as a function, much like the pure classical calculus. This paper borrows some material from a previous presentation of the N calculus [10] but with a different emphasis. In [10] we were mainly concerned with inference of principal types for Nand their use for filtering communication in a shared dataspace. The motivation for using names and dynamic binding for coordination purposes was discussed in some detail in this paper. Here, by contrast, we concentrate on the basic ....

[Article contains additional citation context not shown here]

L. Dami, Type inference and subtyping for higher-order generative communication, in [2] 98-138.

No context found.

Laurent Dami, Type Inference and Subtyping for Higher-Order Generative Communication, in this volume.

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