An efficient compilation framework for languages based on a concurrent process calculus

1997 ◽  
pp. 546-553 ◽  
Author(s):  
Yoshihiro Oyama ◽  
Kenjiro Taura ◽  
Akinori Yonezawa
Keyword(s):  
Process Calculus ◽  
Concurrent Process ◽  
Compilation Framework

Concurrent programming as proof net construction

1998 ◽  
Vol 8 (6) ◽  
pp. 681-710
Author(s):  
G. PERRIER
Keyword(s):  
Proof Theory ◽  
Linear Logic ◽  
Concurrent Programming ◽  
Process Calculus ◽  
Concurrent Process ◽  
First Order ◽  
Proof Nets ◽  
Intuitionistic Linear Logic

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.

Sign in / Sign up

Export Citation Format

Share Document