%0 Unpublished work
%T Unifying type systems for mobile processes
%+ Institut de Mathématiques de Marseille (I2M)
%A Beffara, Emmanuel
%8 2015-04-20
%D 2015
%Z 1505.07794
%K Process calculi
%K Type systems
%K Linear logic
%K Semantics
%Z Computer Science [cs]/Logic in Computer Science [cs.LO]Preprints, Working Papers, ...
%X 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.
%G English
%2 https://hal.science/hal-01144215/document
%2 https://hal.science/hal-01144215/file/article.pdf
%L hal-01144215
%U https://hal.science/hal-01144215
%~ CNRS
%~ UNIV-AMU
%~ EC-MARSEILLE
%~ I2M
%~ I2M-2014-
%~ ANR