Results 1 
3 of
3
Asynchronous Communication Model Based on Linear Logic
 Formal Aspects of Computing
, 1995
"... We propose a new framework called ACL for concurrent computation based on linear logic. ACL is a kind of linear logic programming framework, where its operational semantics is described in terms of proof construction in linear logic. We also give a modeltheoretic semantics as a natural extension of ..."
Abstract

Cited by 47 (6 self)
 Add to MetaCart
We propose a new framework called ACL for concurrent computation based on linear logic. ACL is a kind of linear logic programming framework, where its operational semantics is described in terms of proof construction in linear logic. We also give a modeltheoretic semantics as a natural extension of phase semantics, a model of linear logic. Our framework well captures concurrent computation based on asynchronous communication. It will, therefore, provide us with a new insight into other models of concurrent computation from a logical point of view. We also expect ACL to become a formal framework for verification, reasoning, and transformation of concurrent programs by the use of techniques for traditional logic programming. ACL's attractive features for concurrent programming paradigms are also discussed. 1 Introduction For future massively parallel processing environments, concurrent programming languages based on asynchronous communication would become more and more important. Due ...
Formalising Actors in Linear Logic
 In Proceedings of the International Conference on ObjectOriented Information Systems (OOIS'94
, 1995
"... We present a logical formalism of the actorbased concurrent object oriented computation in terms of the deduction in linear logic. By encoding messages and objects in the actor model as formulae of linear logic, the distributed state of the actor computation, regarded as a configuration, can be rep ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We present a logical formalism of the actorbased concurrent object oriented computation in terms of the deduction in linear logic. By encoding messages and objects in the actor model as formulae of linear logic, the distributed state of the actor computation, regarded as a configuration, can be represented as a multiset of object formulae and message formulae. Methods are encoded as a special form of logical implication describing the effect of the communication between objects and messages. With this logical encoding, actor based concurrent computation can be fully modelled as a deduction procedure in linear logic. In the paper, we provide a detailed mapping of the actor model into the logical system. It is shown that, with such a mapping, the logical semantics of actors can be developed. 1 Introduction Concurrent interaction between objects is an intrinsic feature of object oriented systems. However, this feature has not been formally studied since there seems to exist no agreement...
Reduction as Deduction
 6th Implementation of Functional Languages
, 1994
"... ion as server [x := N ] ffi = !(8m:x(m) \Gammaffi [N ] ffi m ) Stored environment entry [(MN )] ffi z = 9x; y; u:([N ] ffi u\Omega (8v:u(v) \Gammaffi [M ] ffi x\Omega (8f:x(f) \Gammaffi f(y; z)\Omega [y := v] ffi ))) Call by value reduction [(MN )] ffi z = 9x; y:([M ] ffi x\Omega ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
ion as server [x := N ] ffi = !(8m:x(m) \Gammaffi [N ] ffi m ) Stored environment entry [(MN )] ffi z = 9x; y; u:([N ] ffi u\Omega (8v:u(v) \Gammaffi [M ] ffi x\Omega (8f:x(f) \Gammaffi f(y; z)\Omega [y := v] ffi ))) Call by value reduction [(MN )] ffi z = 9x; y:([M ] ffi x\Omega [y := N ] ffi\Omega (8f:x(f) \Gammaffi f(y; z))) Call by name reduction [(MN )] ffi z = 9x; y; u:([M ] ffi x\Omega (8f:x(f) \Gammaffi f(y; z)\Omega (8r:y(r) \Gammaffi [N ] ffi u\Omega (8v:u(v) \Gammaffi r(v)\Omega [y := v] ffi )))) Call by need reduction In the encoding, the behaviour of a function x:e is compiled as transmitting the new function name f , which is itself a channel, via the result channel z and storing the function as a server waiting on the channel f for the input messages (requests) (x; y) where x is the argument and y is the destination channel for the result of the function application. Such an encoding of abstraction provides a general protocol for the c...