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.
Type de document :
Article dans une revue
Mathematical Structures in Computer Science, Cambridge University Press (CUP), 1998, 8 (6), pp.681-710
Liste complète des métadonnées

https://hal.inria.fr/inria-00098491
Contributeur : Publications Loria <>
Soumis le : lundi 25 septembre 2006 - 17:02:02
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00098491, version 1

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

126