N. Kobayashi and A. Yonezawa. Typed higher-order concurrent linear logic programming. Technical Report 94-12, Department of Information Science, University of Tokyo, July 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... National College of Technology Nara, Japan Naoyuki Tamura Department of Computer and Systems Engineering Kobe University Kobe, Japan Abstract There have been several proposals for logic programming language based on linear logic: Lolli [8] Lygon [7] LO [3] LinLog [2] Forum [11] HACL [10]. In these languages, it is possible to create and consume resources dynamically as logical formulas. The e#cient handling of resource formulas is, therefore, an important issue in the implementation of these languages. Lolli, Lygon, and Forum are implemented as interpreter systems; Lolli is on ....

.... . In other words, assumptions not marked can only be used once. Limited resources can be therefore represented by formulas rather than by terms. There have been several proposals for logic programming language based on linear logic: Lolli [8] Lygon [7] LO [3] LinLog [2] Forum [11] HACL [10]. In these languages, it is possible to create and consume resources dynamically as logical formulas. The e#cient handling of resource formulas is therefore an important issue in the implementation of these languages. Lolli, Lygon, and Forum are implemented as interpreter systems; Lolli is on SML ....

[Article contains additional citation context not shown here]

N. Kobayashi and A. Yonezawa. Typed higher-order concurrent linear logic programming. Technical Report 94-12, University of Tokyo, 1994.

....for e#cient memory management [29] and for a type system [1] The application to logic programming language is one of the most active topic in linear logic. Several logic programming languages based on linear logic have been proposed: Lygon [13] LO [4] LinLog [3] Lolli [18] Forum [33] HACL [28] etc. We discuss more about linear logic programming languages in the next chapter. 8 A # A (Axiom) # # A, # # # , A # # # #, # # # #, # # (Cut) Logical axiom and Cut rule # # A, # #A # # # ( # L ) #, A # # # # A # , # ( # R ) #, A # # #, A B # # ( L1 ) ....

N. Kobayashi and A. Yonezawa. Typed higher-order concurrent linear logic programming. Technical Report 94-12, University of Tokyo, 1994.

....of Computer and Systems Engineering, Kobe University 1 1 Rokkodai, Nada, Kobe, 657 8501, Japan Phone: 81 78 803 6247 tamura kobe u. ac.jp Abstract There have been several proposals for logic programming language based on linear logic: Lolli [8] Lygon [7] LO [3] LinLog [2] Forum [11] HACL [10]. In these languages, it is possible to create and consume resources dynamically as logical formulas. The e#cient handling of resource formulas is, therefore, an important issue in the implementation of these languages. Lolli, Lygon, and Forum are implemented as interpreter systems; Lolli is on ....

....Technology assumptions not marked can only be used once. Limited resources can be therefore represented by formulas rather than by terms. There have been several proposals for logic programming language based on linear logic: Lolli [8] Lygon [7] LO [3] LinLog [2] Forum [11] HACL [10]. In these languages, it is possible to create and consume resources dynamically as logical formulas. The e#cient handling of resource formulas is therefore an important issue in the implementation of these languages. Lolli, Lygon, and Forum are implemented as interpreter systems; Lolli is on SML ....

[Article contains additional citation context not shown here]

N. Kobayashi and A. Yonezawa. Typed higher-order concurrent linear logic programming. Technical Report 94-12, University of Tokyo, 1994.

....more than one input channel and can create and drop channels dynamically. To date, there are only a few proposals for integration of OOP and LP based on Linear Logic. LO was the first one. Saraswat and Lincoln proposed lcc [SL92] Sar93] and independently Kobayashi and Yonezawa proposed ACL [KY94a][KY94b]. They recast the earlier renditions of Milner s calculus as LL theories [BS92, Mil92] into the LP paradigm of computation as proof search (e.g. ACL is dubbed process calculus in logical form ) These languages contain two crucial ingredients of objects: state change (provided for by 6 Here ....

N. Kobayashi and A. Yonezawa. Typed higher-order concurrent linear logic programming. Technical Report 94-12, University of Tokyo, July 1994. Available by FTP from camille.is.s.u-tokyo.ac.jp /pub/papers/ TR94-12-hacl-a4.ps.Z.

....mapped into . and message passing is implemented using Omega . ACL and its corresponding Higher Order formulation, HACL [49], provide remarkable intuitions behind the study of concurrent logic languages in LL. A similar approach has been considered in CPL, 67] and FILL, 32] in which two sided sequents are considered in the context of a single and a multiple conclusion formulation of Intuitionistic Linear Logic ....

N. Kobayashi and A. Yonezawa. Typed Higher-Order Concurrent Linear Logic Programming. Technical report, Department of Information Science the University of Tokyo, Report No. 94-12, 1994.

....aspects proper of the object oriented paradigm. Languages like HACL [10] based on a similar Linear Logic fragment, and Forum itself [14] are significant representative of such combination. The approach followed in the paper shares many aspects with the object oriented languages presented in [3, 11]. It differs from the former on the granularity used to represent objects (in [3] object are represented by . disjunction ....

..... disjunction of slots but messages among objects are difficultly handled) and from the latter on the above discussed separation on the representation of knowledge (in [11] objects are represented by complex formulas, used in a contextual way) An object based language, in a subset of F O, closer to the functional perspective has also been defined in [4] The motivations behind these studies is to show that the proposal system [6] is powerful enough to model a wide ....

[Article contains additional citation context not shown here]

N. Kobayashi and A. Yonezawa. Typed Higher-Order Concurrent Linear Logic Programming. Technical report, Department of Information Science the University of Tokyo, Report No. 94-12, 1994.

....of logic programming languages based on linear logic. Some of these, like LinLog [1] are based on proof theoretic analyses, as Lygon is, but, to the authors knowledge, have not been implemented and hence do not involve the problems of lazy splitting discussed in this paper. Others, like ACL [18, 25, 17] and LO [4, 5, 3] use linear logic as motivation and a design guide for concurrent logic programming. These languages use a somewhat restricted class of formulae which excludes Omega . As a result the implementation problems are correspondingly simpler, in that neither language needs lazy ....

Naoki Kobayashi and Akinori Yonezawa. Typed higher-order concurrent linear logic programming. Technical Report 12, University of Tokyo, 1994.

....Composition G G starts two independent processes in parallel. The same connective is used for message send, e.g. P ffi Gamma m Q means that P sends message m and then becomes Q. In fact the distinction between messages (Am ) and processes (AP ) is blurred in this LL setting, and this is used in [98] to pass processes as first class messages. Message Reception m 1 Omega Delta Delta Delta Omega mn Omega G waits until all the messages m 1 ; mn become available, consumes them and then executes G. R 1 Phi R 2 is external choice : depending on the configuration, only the receptor R ....

N. Kobayashi and A. Yonezawa. Typed higher-order concurrent linear logic programming. Technical Report 94-12, University of Tokyo, July 1994. Available by FTP from camille.is.s.u-tokyo.ac.jp /pub/papers/ TR94-12-hacl-a4.ps.Z.

....is that the static distinction produces higer efficiency. It also has a static type system with the parametric polymorphism found in ML. HACL HACL is a typed, higher order concurrent programming language based on linear logic programming. For the theoretical background of HACL, please refer to [11][12] 9] 10] Computational model in HACL is close to that of concurrent object oriented computing[23] Computation is performed by multiple processes that communicate each other via asynchronous message passing. Each process performs one of the following actions: 1. divided into two concurrent ....

....forks a left child, waits for replying, receives a value, and then forks a right one. On the other hand, the former waits after forking two children. Chapter 6 The Intermediate Language This section explains the intermediate language Venezia. 6. 1 Background Concurrent calculi, such as HACL[11] and calculus[14] have been drawing much attention and some languages have been designed based on them. The goal is to identify the core language which express various computation patterns by a small number of fundamental primitives. In their simplest form, both HACL and calculus are based ....

Kobayashi, N., A. Yonezawa, Typed Higher-Order Concurrent Linear Logic Programming, Tech. Rep. 94-12, Department of Information Science, University of Tokyo, 1994.

....the arguments contain reply channel c and the reply value is returned explicitly by reply. Schematic parser interprets synchronous process invocation (f x) as (touch (future (f x) 1 . Eliminating synchronous calls enables us (1) to get direct correspondence to process calculus such as HACL [14], calculus [15] and (2) to simplify implementation and optimization very much. Venezia has ML [3] like syntax, which we define below. P (proc) P 1 P 2 parallel execution j x.P channel creation j e 1 e 2 process call j e(x) P receive j e 1 =e 2 send j if e then P 1 condition ....

....it is slightly different from that of Schematic. For example, control may not return after calling (f x) in some cases. it waits until one arrives. e 1 =e 2 sends value e 2 to channel e 1 . e 1 e 2 invocates process e 1 with arguments e 2 . Our laboratory has proposed so far the language HACL [14], which aggressively uses the concept of asynchronous process and communication channel. Venezia is quite similar to HACL, except that Venezia does not have choice, function ( expression) and static type system. Because Venezia is the subset of HACL, we can refer to the research achievements of ....

[Article contains additional citation context not shown here]

N. Kobayashi and A. Yonezawa. Typed Higher-Order Concurrent Linear Logic Programming. Technical report, Department of Information Science, University of Tokyo, December 1994.

No context found.

N. Kobayashi and A. Yonezawa. Typed higher-order concurrent linear logic programming. Technical Report 94-12, Department of Information Science, University of Tokyo, July 1994.

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