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
β¦ 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
Linearity Analysis of Concurrent Logic P
β
Kazunori Ueda
π
Article
π
2000
π
Elsevier Science
π
English
β 76 KB
Continuation compilation for concurrent
β
B Kemp; P Soper; A King
π
Article
π
1994
π
Elsevier Science
β 913 KB
Associative concurrent evaluation of log
β
Katsuhiko Nakamura
π
Article
π
1984
π
Elsevier Science
π
English
β 655 KB
The βHoare logicβ of concurrent programs
β
Leslie Lamport
π
Article
π
1980
π
Springer-Verlag
π
English
β 864 KB
Modeling advanced manufacturing systems
β
D. Ben-Arieh; I. Miron
π
Article
π
1990
π
Elsevier Science
π
English
β 728 KB