Theoretical Computer Science
Concurrent constraint programming
Concurrent constraint programming
A calculus of mobile processes, II
Information and Computation
On the &pgr;-calculus and linear logic
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
On proof normalization in linear logic
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
The pi-Calculus as a Theory in Linear Logic: Preliminary Results
ELP '92 Proceedings of the Third International Workshop on Extensions of Logic Programming
| Hi-index | 0.00 |
We propose a concurrent process calculus, called Calcul Parallèle Logique (CPL), based on the paradigm of computation as proof net construction in linear logic. CPL uses a fragment of first-order intuitionistic linear logic where formulas represent processes and proof nets represent successful computations. In these computations, communication is expressed in an asynchronous way by means of axiom links. We define testing equivalences for processes, which are based on a concept of interface, and use the power of proof theory in linear logic.