Unifying type systems for mobile processes

Abstract : We present a unifying framework for type systems for process calculi. The core of the system provides an accurate correspondence between essentially functional processes and linear logic proofs; fragments of this system correspond to previously known connections between proofs and processes. We show how the addition of extra logical axioms can widen the class of typeable processes in exchange for the loss of some computational properties like lock-freeness or termination, allowing us to see various well studied systems (like i/o types, linearity, control) as instances of a general pattern. This suggests unified methods for extending existing type systems with new features while staying in a well structured environment and constitutes a step towards the study of denotational semantics of processes using proof-theoretical methods.
Type de document :
Pré-publication, Document de travail
2015
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01144215
Contributeur : Emmanuel Beffara <>
Soumis le : mardi 21 avril 2015 - 11:26:48
Dernière modification le : vendredi 29 mai 2015 - 01:08:59
Document(s) archivé(s) le : lundi 14 septembre 2015 - 11:15:54

Fichiers

article.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01144215, version 1
  • ARXIV : 1505.07794

Collections

Citation

Emmanuel Beffara. Unifying type systems for mobile processes. 2015. 〈hal-01144215〉

Partager

Métriques

Consultations de
la notice

69

Téléchargements du document

24