## ACL - A Concurrent Linear Logic Programming Paradigm (1993)

Venue: | Proceedings of the 1993 International Logic Programming Symposium |

Citations: | 48 - 5 self |

### BibTeX

@INPROCEEDINGS{Kobayashi93acl-,

author = {Naoki Kobayashi and Akinori Yonezawa},

title = {ACL - A Concurrent Linear Logic Programming Paradigm},

booktitle = {Proceedings of the 1993 International Logic Programming Symposium},

year = {1993},

pages = {279--294},

publisher = {MIT Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

We propose a novel concurrent programming framework called ACL. ACL is a variant of linear logic programming, where computation is described in terms of bottom-up proof search of some formula in linear logic. The whole linear sequent calculus is too non-deterministic to be interpreted as an operational semantics for a realistic programming language. We restrict formulas and accordingly refine inference rules for those formulas, hence overcoming this problem. Don't care interpretation of non-determinism in the resulting system yields a very clean and powerful concurrent programming paradigm based on message-passing style communication. It is remarkable that each ACL inference rule has an exact correspondence to some operation in concurrent computation and that non-determinism in proof search just corresponds to an inherent non-determinism in concurrent computation, namely, non-determinism on message arrival order. We demonstrate the power of our ACL framework by showing several programm...

### Citations

3463 |
Communication and Concurrency
- Milner
- 1989
(Show Context)
Citation Context ...ond clause means that F ullBuffer waits for a message get, then, after reception, sends a message reply, and becomes a EmptyBuffer. This definition is quite similar to the following description in CCS=-=[19]-=-, EmptyBuffer = put:F ullBuffer F ullBuffer = get:reply:EmptyBuffer although there is a significant difference that communication in ACL is asynchronous as is described below, whereas it is synchronou... |

1163 |
Actors: a Model of Concurrent Computation in Distributed Systems
- Agha
- 1986
(Show Context)
Citation Context ...subsequent computation depends on which of m and n is received. Notice that this kind of non-determinism is just the same as nondeterminism on message arrival order in concurrent programming languages=-=[1]-=-[24]. In the case of (b), both of two processes, m ?\Omega A and m ?\Omega B, can receive the same message m. Therefore, non-determinism arises according to which process receives m. This kind of non-... |

1042 | Generative Communication in Linda
- Gelernter
- 1985
(Show Context)
Citation Context ...an be translated into our ACL framework[14]. ACL especially provides rich communication mechanisms; besides one-to-one and one-tomany communication, it has a flavor of Linda's generative communication=-=[9]-=-. We demonstrate the power of our ACL framework by showing several programming examples. For other results such as model theoretic semantics, please refer to [15][14]. Note that the main difference be... |

782 | Rewrite systems
- Dershowitz, Jouannaud
- 1990
(Show Context)
Citation Context ...m(a); 0 Arithmetic operations (for example) can be included in ACL by providing rewriting systems on first order terms. We consider convergent(i.e. Church Rosser and terminating) term rewriting system=-=[8]-=- R, and add the following inference rule: ffl Rewriting Rule (RW1) ` p(t); 0 ` p(s); 0 if s ! t 2 R Generally, R can be any programming language, including functional languages and imperative language... |

677 | Linear logic
- Girard
- 1987
(Show Context)
Citation Context ...in concurrent computation, namely, non-determinism on message arrival order. We demonstrate the power of our ACL framework by showing several programming examples. 1 Introduction Girard's linear logic=-=[11]-=- has been drawing great attentions since he proposed it in 1987. It is natural to consider a new logic programming language based on linear logic, namely linear logic programming, where computation is... |

460 | Concurrent Constraint Programming
- Saraswat
- 1993
(Show Context)
Citation Context ...ed their language to several problems such as theorem proving and natural language parsing. Miller[18] also investigated a connection between linear logic and -calculus. Linear cc Saraswat and Lincoln=-=[21]-=- recently investigated linear logic as a theoretical foundation and an extension of concurrent constraint programming[22] almost simultaneously with our work[15]. Their work seem to have several funda... |

346 | Logic Programming with Focusing Proofs in Linear Logic
- ANDREOLI
- 1992
(Show Context)
Citation Context ... to be interpreted as an operational semantics for a realistic programming language. Although Andreoli has reduced this non-determinism by defining a certain normal proof in his work on focusing proof=-=[4]-=-, there still remains a problematic inference rule, namely,\Omega -rule. In a bottom-up proof search,\Omega -rule requires a current context to be partitioned, which causes exponential numbers of nond... |

307 | Logic Programming in a Fragment of Intuitionistic Linear logic
- Hodas, Miller
- 1994
(Show Context)
Citation Context ...y linear logic programming, where computation is described in terms of proof search in linear logic instead of the usual logic. Several linear logic programming languages have already been proposed[5]=-=[12]-=- and shown to improve the expressive power of traditional logic programming languages. We propose a novel concurrent programming paradigm called ACL along this line. The proof system of full linear lo... |

279 |
The family of Concurrent Logic Programming Languages
- Shapiro
- 1989
(Show Context)
Citation Context ...ework by showing several programming examples. For other results such as model theoretic semantics, please refer to [15][14]. Note that the main difference between ACL and concurrent logic programming=-=[23]-=- lies not only in the underlying logic but also in message representation; messages in ACL are represented by formulas rather than terms. We would urge the reader to keep this difference in mind. We d... |

176 |
An overview of Prolog
- Miller, Nadathur
- 1988
(Show Context)
Citation Context ...d for communication in LO, while communication in ACL is purely logical. Hodas and Miller[13] proposed a rather different linear logic programming language. It can be considered a refinement of Prolog=-=[20]-=-, rather than a reactive paradigm. They applied their language to several problems such as theorem proving and natural language parsing. Miller[18] also investigated a connection between linear logic ... |

126 |
ABCL — An Object-Oriented Concurrent System
- Yonezawa, editor
- 1990
(Show Context)
Citation Context ...sequent computation depends on which of m and n is received. Notice that this kind of non-determinism is just the same as nondeterminism on message arrival order in concurrent programming languages[1]=-=[24]-=-. In the case of (b), both of two processes, m ?\Omega A and m ?\Omega B, can receive the same message m. Therefore, non-determinism arises according to which process receives m. This kind of non-dete... |

106 |
Multiple tuple spaces in linda
- Gelernter
- 1989
(Show Context)
Citation Context ...e m(a;X) does not much m(c; a). This kind of communication, one-to-oneof -many communication, is often called generative communication[9] or associative communication[6]. It was introduced in Linda[9]=-=[10]-=-, and its importance especially (A) Two processes compete with each other for a message m(a; b). (` m(a; b); m(a; b) ? ) ` A(b); 9Y 9Z(m(Y; Z) ?\Omega B(Y; Z)) ` m(a; b); 9X(m(a; X) ?\Omega A(X)); 9Y ... |

102 | The pi-calculus as a theory in linear logic: Preliminary results
- Miller
- 1992
(Show Context)
Citation Context ...language. It can be considered a refinement of Prolog[20], rather than a reactive paradigm. They applied their language to several problems such as theorem proving and natural language parsing. Miller=-=[18]-=- also investigated a connection between linear logic and -calculus. Linear cc Saraswat and Lincoln[21] recently investigated linear logic as a theoretical foundation and an extension of concurrent con... |

61 |
ActorSpace: an open distributed programming paradigm
- Agha, Callsen
- 1993
(Show Context)
Citation Context ...Y = c; Z = a Figure 5: Competing processes for a single message in open systems and distributed systems was addressed in Linda and also in the recent work on other concurrent programming frameworks[6]=-=[3]-=-. Although generative communication may be inefficient compared with point-to-point communication, it allows more flexible program designs than mere point-to-point communication. For example, let us c... |

53 |
The Structure and Semantics of Actor Languages
- Agha
- 1990
(Show Context)
Citation Context ...odal message sending is different from the ordinary broadcast, since each modal message can be read multiple times by the same process. 3.1.2 Embedding Actor Computation We show that actor computation=-=[2]-=- can be directly embedded into ACL framework. In the actor model, computation is performed by concurrent agents, called actors, communicating each other by message passing. Upon receiving a message, a... |

50 |
W.J.: Concurrent aggregates (ca
- Chien, Dally
- 1990
(Show Context)
Citation Context ... communication, thus has the great advantage in increasing modularity of concurrent programs. It is also useful for exploiting intra-process parallelism in the same fashion as in Concurrent Aggregates=-=[7]-=-, and for programming in open system environments where processes who are unknown to each other may communicate[3]. For the comparison with Linda's tuple space, please see Table 2. A normal message in... |

48 | Asynchronous communication model based on linear logic
- Kobayashi, Yonezawa
- 1995
(Show Context)
Citation Context ...lready shown that a number of previous frameworks for concurrent computation, including Petri Nets, Actor, CCS, -calculus and concurrent constraint programming can be translated into our ACL framework=-=[14]-=-. ACL especially provides rich communication mechanisms; besides one-to-one and one-tomany communication, it has a flavor of Linda's generative communication[9]. We demonstrate the power of our ACL fr... |

46 | Communication as fair distribution of knowledge
- Andreoli, Pareschi
- 1991
(Show Context)
Citation Context ...mely linear logic programming, where computation is described in terms of proof search in linear logic instead of the usual logic. Several linear logic programming languages have already been proposed=-=[5]-=-[12] and shown to improve the expressive power of traditional logic programming languages. We propose a novel concurrent programming paradigm called ACL along this line. The proof system of full linea... |

9 | Logical, testing and observation equivalence for processes in a linear logic programming - Kobayashi, Yonezawa - 1993 |

8 |
Associative communication and its optimization via abstract interpretation
- Andreoli, Pareschi
- 1992
(Show Context)
Citation Context ...g processes, that is, processes whose receptor matches it, picks it up. This kind of communication, one-to-one-of-many communication, is called generative communication or associative communication[9]=-=[6]-=-. We will discuss it in section 3.2. 3.1 Object-Oriented Concurrent Computing 3.1.1 One-to-one and One-to-many Communication A normal message in ACL allows an access to it only once, that is, multiple... |

6 |
Reasoning on actions and change in linear logic programming
- Kobayashi, Yonezawa
- 1993
(Show Context)
Citation Context ...correct choice. We assume don't care non-determinism throughout this paper, because we like to interpret ACL as a reactive paradigm. Regarding ACL based on don't know non-determinism, please refer to =-=[17]-=-. 2.3 Extended System The above propositional fragment can be naturally extended to the following firstorder versions. The first-order existential quantifier is used for value passing, while universal... |