J-M. Andreoli, L. Leth, R. Pareschi, and B. Thomsen. True concurrency semantics for a linear logic programming language with broadcast communication. In Proc. of TAPSOFT'93, Orsay (France), 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....an undelayed architecture. All these works analyze the expressive power of two languages form the point of view of their basic operators and constructors, while our emphasis is more on the architectural properties of the model underlying the languages. The closest approaches to ours are taken in [1] and in [16] where languages which do not differ on their operators but only on their communication mechanisms are compared. In [1] two possible implementations for the broadcast mechanism of the coordination language LO [2] are presented; the first one corresponds to the broadcast used in our ....

....and constructors, while our emphasis is more on the architectural properties of the model underlying the languages. The closest approaches to ours are taken in [1] and in [16] where languages which do not differ on their operators but only on their communication mechanisms are compared. In [1] two possible implementations for the broadcast mechanism of the coordination language LO [2] are presented; the first one corresponds to the broadcast used in our undelayed architecture while the second coincides with that of the locally delayed one. The equivalence between the two ....

J.-M. Andreoli, L. Leth, R. Pareschi, and B. Thomsen. True concurrency semantics for a linear logic programming language with broadcast communication. In Proc. of TAPSOFT'93, volume 668 of Lecture Notes in Computer Science, pages 182--198, Springer-Verlag, 1993.

....for a coordination language embodying an undelayed architecture. All these works analyze the expressive power of two languages form the point of view of their basic operators and constructors, while our emphasis is more on the architectural properties of the model underlying the languages. In [1] and in [16] the closest approaches to our approach are taken: languages are compared which do not differ on their operators but on their communication mechanisms. In [1] two possible implementations for the broadcast mechanism of the coordination language LO [2] are presented; the first one ....

....and constructors, while our emphasis is more on the architectural properties of the model underlying the languages. In [1] and in [16] the closest approaches to our approach are taken: languages are compared which do not differ on their operators but on their communication mechanisms. In [1] two possible implementations for the broadcast mechanism of the coordination language LO [2] are presented; the first one corresponds to the broadcast used in our undelayed architecture while the second coincides with that of the locally delayed one. The equivalence between the two ....

J.-M. Andreoli, L. Leth, R. Pareschi, and B. Thomsen. True concurrency semantics for a linear logic programming language with broadcast communication. In Proc. of TAPSOFT'93, volume 668 of Lecture Notes in Computer Science, pages 182--198, Springer-Verlag, 1993.

....paper, we concentrate on operators that are either local or realized via broadcast mechanisms. Moreover, here we separate the description of the software components from the specification of the software architectures. This is a necessary step towards a formal comparison among architectures. In [1] two possible implementations for the broadcast mechanism of the coordination language LO [2] are presented; the first one corresponds to the broadcast used in our undelayed architecture while the second coincides with that of the locally delayed one. The equivalence between the two ....

J.-M. Andreoli, L. Leth, R. Pareschi, and B. Thomsen. True Concurrency Semantics for a Linear Logic Programming Language with Broadcast Communication. In Proc. of TAPSOFT'93, volume 668 of LNCS, pages 182--198, Springer, 1993.

....3.1 A target proof for a sequent P G is a proof such that its root node is a sequent of the form P G; C where C is a context containing only atoms. Target proofs are searched in such a way that the context at their root node properly contains the initial resource of the program call. In [11] two proof construction mechanisms are considered: expansion let be an open leaf of Pi whose sequent matches the lower sequent of an inference figure. Let Pi 0 be a proof obtained by expanding Pi at node with branch(s) to new open leave(s) labeled with the upper sequent(s) of the selected ....

....context at each node of Pi, then Pi 0 is obtained by insertion from Pi ( Pi ) i Pi 0 ) 10 In both cases we say that Pi reduces Pi 0 and write Pi ) Pi 0 if either Pi ) e Pi 0 or Pi ) i Pi 0 . The reduction relation and target proofs are related in the following sense (see [11] [26] for detailed proofs) Theorem 3.1 If Pi 1 is a target proof for a given sequent s and Pi 1 ) Pi 2 then Pi 2 is also a target proof for s. The sequent P g is provable if each branch of a target proof for P g has a leaf of the form P C; An agent oriented approach to these ....

J.M. Andreoli, L. Leth, R. Pareschi, and B. Thompsen. True concurrency semantics for a linear logic programming language with broadcast communication. In Theory and pratice of software developments, TAPSOFT 93, 1993.

....to the problem of efficiency of LO since we provide language means to achieve what Andreoli and Pareschi purport to achieve using compilation techniques (in particular, abstract interpretation and partial evaluation) 5. 1 Future Work A CHAM based semantics of TCLO (adapted from the one for LO, [ALPT93][CC94] is under development. The exact relation of our channel variables to second order variables, and the non linear properties of channels should be investigated. For example, channel replication calls for the use of contraction, thus exponentials. We wonder what are the limits of abstract ....

J.-M. Andreoli, L. Leth, R. Pareschi, and B. Thomsen. True concurrency semantics for a linear logic programming language with broadcast communication. In Theory and Practice of Software Development (TAPSOFT'93), pages 182--198, 1993.

....Pareschi [10] based on their earlier work on Linear Objects [13] see also Section 5) Communication is achieved by global broadcasting to all objects which is specified using a tell marker . This is an extralogical feature of LO; a CHAM style operational semantics for this language is given in [11]. No buffers or message queues are used; the message simply appears as a literal in every object. A message in which a particular object is not interested won t affect its behavior, it simply will never be picked by the object. This leads however to garbaging the objects with message leterals they ....

J.-M. Andreoli, L. Leth, R. Pareschi, and B. Thomsen. True concurrency semantics for a linear logic programming language with broadcast communication. In Theory and Practice of Software Development (TAPSOFT'93), pages 182--198, 1993.

....paper, we concentrate on operators that are either local or realized via broadcast mechanisms. Moreover, here we separate the description of the software components from the specification of the software architectures. This is a necessary step towards a formal comparison among architectures. In [1] two possible implementations for the broadcast mechanism of the coordination language LO [2] are presented; the first one corresponds to the broadcast used in our undelayed architecture while the second coincides with that of the locally delayed one. The equivalence between the two ....

J.-M. Andreoli, L. Leth, R. Pareschi, and B. Thomsen. True Concurrency Semantics for a Linear Logic Programming Language with Broadcast Communication. In Proc. of TAPSOFT'93, volume 668 of LNCS, pages 182--198, Springer, 1993.

....being resolved non deterministically. Hearing only happens when someone else speaks. Although a number of papers have, in passing, pointed to similarities and possible connections between CBS and Gamma (and between CBS and other coordination languages, such as the broadcast based language LO [AP90, ALPT93]) a more thorough investigation has not been forthcoming. A connection between broadcasting and the Gamma inspired chemical abstract machine has been forgred in the development of interaction abstract machines [ACP93] which extend the chemical reaction metaphor with a notion of broadcast ....

JM. Andreoli, L. Leth, R. Pareschi, and B. Thomsen. True Concurrency Semantics for a Linear Logic Programming Language with Broadcast Communication. In Proc. Conf. on Theory and Practice of Software Development (TAPSOFT 93), volume 668 of LNCS, pages 182--198, France, 1993. Springer.

No context found.

J-M. Andreoli, L. Leth, R. Pareschi, and B. Thomsen. True concurrency semantics for a linear logic programming language with broadcast communication. In Proc. of TAPSOFT'93, Orsay (France), 1993.

.... transitions Although, in the sequel, we are only interested in transitions of the expansion type, we mention here an other kind of transitions which was historically contained in the Prolog notion of unification, and was later given a proper proof based status under the name instantiation in [3]. In that paper, a special formula constructor (known as the tell marker or hat ) was introduced to specify transitions which, given an input state (proof) would produce an output state (proof) obtained by adding the formula at all the nodes in the input proof (in the fragment considered in ....

J-M. Andreoli, L. Leth, R. Pareschi, and B. Thomsen. True concurrency semantics for a linear logic programming language with broadcast communication. In Proc. of TAPSOFT'93, Orsay (France), 1993.

....large scale systems. However, little or no attention is paid to integrating these constructs into the programming environment. To repair this situation several research teams and even a few commercial systems have proposed the notion of coordination languages (e.g. Linda [14] Gamma [6] and LO [4, 5]) The languages are usually not full programming languages, but rather limited to constructs for coordinating communication between component subsystems. Clearly coordination languages solve many of the problems found in the construction of large scale systems by unifying the level of ....

J.-M Andreoli, R. Pareschi, L. Leth and B. Thomsen: "True Concurrency Semantics for a Linear Logic Programming Language with Broadcast Communication". In proc. Conf. on Theory and Practice of Software Development (TAPSOFT'93), vol 668 of LNCS, pp. 182-198. Springer Verlag, 1993.

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