𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distributed concurrent linear logic programming

✍ Scribed by Naoki Kobayashi; Toshihiro Shimizu; Akinori Yonezawa


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
227 KB
Volume
227
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis


We propose a framework of distributed concurrent linear logic programming, which can elegantly capture the essential features of distributed computation: location-dependence=independence of names and movement of computation. We ΓΏrst deΓΏne the syntax and semantics of a modal linear logic that is suitable for expressing distributed computation, and then show that there is a close relationship between formulas of a fragment of the modal linear logic and distributed processes.


πŸ“œ SIMILAR VOLUMES


Constraint Satisfaction in Distributed C
✍ HO-FUNG LEUNG; KEITH L. CLARK πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 602 KB

In constraint logic programming, unification is replaced by more general constraint satisfaction. To support constraint solving in a committed-choice concurrent logic programming language, the constraint solver also needs to determine the status of the 'ask'-constraints with respect to the current c