Concurrent Programming as Proof Net Construction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematical Structures in Computer Science Year : 1998

Concurrent Programming as Proof Net Construction


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 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.
No file

Dates and versions

inria-00098491 , version 1 (25-09-2006)


  • HAL Id : inria-00098491 , version 1


Guy Perrier. Concurrent Programming as Proof Net Construction. Mathematical Structures in Computer Science, 1998, 8 (6), pp.681-710. ⟨inria-00098491⟩
61 View
0 Download


Gmail Facebook Twitter LinkedIn More