 |
|
|
|
| HAL : hal-00462484, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
|
|
| Concurrent processes as wireless proof nets |
|
|
| Emmanuel Beffara 1Virgile Mogbil 2 |
|
|
| (10/02/2010) |
|
|
|
| We present a proofs-as-programs correspondence between linear logic and process calculi that permits non-deterministic behaviours. Processes are translated into wireless proof nets, i.e. proof nets of multiplicative linear logic without cut wires. Typing a term using them consists in typing some of its possible determinisations in standard sequent calculus. Generalized cut-elimination steps in wireless proof nets is shown to correspond to executions that avoid deadlocks. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Institut de mathématiques de Luminy (IML) |
|
|
|
CNRS : UMR6206 – Université de la Méditerranée - Aix-Marseille II |
|
|
| 2 : | Laboratoire d'informatique de Paris-nord (LIPN) |
|
|
|
CNRS : UMR7030 – Université Paris XIII - Paris Nord |
|
|
|
|
|
|
|
|
|
| LDP ; LCR |
|
|
|
|
| Domaine | : | Informatique/Logique en informatique Informatique/Calcul parallèle, distribué et partagé |
|
|
| Pi-calculus – Linear Logic – Proof Nets – Non-deterministic Cut-elimination |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00462484, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00462484 | |
| oai:hal.archives-ouvertes.fr:hal-00462484 | |
| Contributeur : Virgile Mogbil | |
| Soumis le : Mardi 9 Mars 2010, 22:13:08 | |
| Dernière modification le : Mercredi 10 Mars 2010, 07:13:18 | |
