Results

**1 - 2**of**2**### A Non Functional Calculus: Linear Logic and Concurrency

, 2000

"... this paper to an interaction mechanism inspired to the computational behaviour of proof nets, a deduction system of linear logic [7]. In this setting the conclusion of a derivation is the type of the corresponding proof net. The computational mechanism is cut elimination that can only occur between ..."

Abstract
- Add to MetaCart

this paper to an interaction mechanism inspired to the computational behaviour of proof nets, a deduction system of linear logic [7]. In this setting the conclusion of a derivation is the type of the corresponding proof net. The computational mechanism is cut elimination that can only occur between terms with the same type. The relationship between proof nets and processes have already been studied in the literature. Abramsky interprets proof as processes and consider a cut-elimination as communication paradigm [1]. Similar typed calculi based on linear logic where developed also by Solitro and Valentini [13, 14]. Yuxi Fu [6] studies a computational model in which the role of process and proofs is reversed with respect to the Abramsky's view. The corresponding paradigm is thus communication as cut-elimination for classical proofs. Bellin and Scott implements the cut-elimination of linear logic in the -calculus. We here push forward the work in [13, 14] where : : : . Our approach differ from the one mentioned above in that we move from the mentioned calculi for linear logic and borrow some ideas from cham by Berry and Boudol [3].

### Functional Features of a Calculus for Logic and Concurrency

, 2000

"... We propose a simple untyped calculus inspired by the proofs encodings of the Linear Logic by Girard. The basic elements of our calculus are multiset of terms sharing a workspace and their dynamic behaviour is dened by a reduction semantics in the style of the Chemical Abstract Machine. We addres ..."

Abstract
- Add to MetaCart

(Show Context)
We propose a simple untyped calculus inspired by the proofs encodings of the Linear Logic by Girard. The basic elements of our calculus are multiset of terms sharing a workspace and their dynamic behaviour is dened by a reduction semantics in the style of the Chemical Abstract Machine. We address the issue of treating concurrency via a model of computation whose basic step can be interpreted as cutelimination.