Concurrent Programming as Proof Net Construction

Guy Perrier 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Journal articles
Liste complète des métadonnées
Contributor : Publications Loria <>
Submitted on : Monday, September 25, 2006 - 5:02:02 PM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM


  • HAL Id : inria-00098491, version 1



Guy Perrier. Concurrent Programming as Proof Net Construction. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 1998, 8 (6), pp.681-710. 〈inria-00098491〉



Record views