J-M. Andreoli. Proposition pour une synth`ese des paradigmes de la programmation logique et de la programmation par objets, 1990. Th`ese d'Informatique de l'Universit'e de Paris 6.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Parlog [13, 15] or GHC [31] However, these languages, based on Classical Logic (more precisely, its fragment restricted to Horn clauses) offer a very limited structure for representing process states. Indeed, a state must be encoded as a simple atom, i.e. a first order term. It has been shown in [3, 4, 7, 6] that this kind of representation is inadequate both from the point of view of knowledge sharing and communication between processes, mainly because the tree structure of terms enforces an artificial hierarchical order on their components and this, in turn, results in unwanted sequentiality in the ....

....are directly significant in the framework of concurrent object oriented systems, especially in the actors tradition. With this perspective in mind, the subset of LinLog called LO (for Linear Objects) in which goals are built only from the asynchronous connectives and , has been studied in [3, 7, 4, 6, 8], where computational examples can be found. For instance, dynamic programming techniques find a very natural concurrent implementation in LO, as shown in [6, 8] LO has also been applied in [7] to the optimization of Horn clause programs which have an exponential complexity when executed by the ....

[Article contains additional citation context not shown here]

J-M. Andreoli. Proposition pour une synth`ese des paradigmes de la programmation logique et de la programmation par objets, 1990. Th`ese d'Informatique de l'Universit'e de Paris 6.

....extension in the logic underlying these languages, given by the introduction of a novel form of concurrent disjunction (denoted by the symbol ) will provide us with the capabilities of structuring such processes to support an organization like style of programming. We have shown elsewhere [4, 2, 3, 5] that this extension finds a rigorous proof theoretic counterpart in Linear Logic, a logic recently introduced to provide a theoretical basis for the study of concurrency [8] The programming language LO (for Linear Objects) which we have designed according to these principles, is therefore ....

....methods. They are built from atomic formulae, using four main connectives: and ( The first two connectives correspond, respectively, to concurrent forms of conjunction and disjunction. The other two correspond to two different, albeit strictly related, forms of implication. As shown in [4, 2, 3, 5], all these connectives can be reconstructed in terms of Linear Logic connectives [10, 9] in fact, is the additive conjunction of Linear Logic, is the multiplicative disjunction, is linear implication and ( is linear implication combined with the modality of course . We also use the ....

J-M. Andreoli. Proposition pour une synth`ese des paradigmes de la programmation logique et de la programmation par objets, 1990. Th`ese d'Informatique de l'Universit'e de Paris 6.

....new computational model for the object oriented concurrent programming language LO, presented at last year OOPSLA ECOOP (1990) which exploits the proof theory of Linear Logic also to achieve a powerful form of knowledge sharing. 1 Introduction The programming language LO (for Linear Objects) [5, 4, 3] has been designed to supply a logical framework for object oriented concurrent programming, with the purpose of rigorously accounting for its various aspects (concurrent communication, knowledge sharing, object creation, object termination etc. in terms of the prooftheoretic behavior of logical ....

....which LO is an offspring on the side of its logic programming branch [27] communication of such kind reduces procedure calls to exchanges of messages between objects, thus leading to a completely decentralized and truly concurrent model of computation. The computational model for LO presented in [5, 4, 3] has dealt with interobject communication simply by importing the technique of shared logical variables directly from concurrent logic programming languages based on Horn logic, like Concurrent Prolog [26] Parlog [12] and GHC [29] However, such a solution is to be considered as temporary and ....

[Article contains additional citation context not shown here]

J-M. Andreoli. Proposition pour une synth`ese des paradigmes de la programmation logique et de la programmation par objets, 1990. Th`ese d'Informatique de l'Universit'e de Paris 6.

....primitives of Concurrent Constraint Logic Programming Languages [28] 4 Proof Theory We discuss here the relationship between LO and, respectively, Classical and Linear Logic. Proofs of the theorems in this section can be found in the Appendix. Further proof theoretic results can be found in [3, 4, 6]. 4.1 LO and Classical Logic 4.1.1 Properties of the Derivability Relation Let c be the derivability relation in Classical Logic. See [13] for various sequent systems for Classical Logic. The classical interpretation of a goal G is a classical formula written G c defined inductively by A ....

J-M. Andreoli. Proposition pour une synth`ese des paradigmes de la programmation logique et de la programmation par objets, 1990. Th`ese d'Informatique de l'Universit'e de Paris 6.

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