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 suit
β¦ LIBER β¦
Linearity Analysis of Concurrent Logic Programs
β Scribed by Kazunori Ueda
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 76 KB
- Volume
- 30
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Distributed concurrent linear logic prog
β
Naoki Kobayashi; Toshihiro Shimizu; Akinori Yonezawa
π
Article
π
1999
π
Elsevier Science
π
English
β 227 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
Continuation compilation for concurrent
β
B Kemp; P Soper; A King
π
Article
π
1994
π
Elsevier Science
β 913 KB
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
β11-universality of some propositional l
β
M.K. Valiev
π
Article
π
1993
π
Elsevier Science
π
English
β 686 KB