Section: New Results
Since the advent of linear logic in 1987, numerous computer scientists have been working at trying to map process calculus directly into formulas of linear logic. Such encoding help to reveal surprisingly close relationships between what relations are possible in logic and what is important in operational semantics.
A recent addition to this linear of work was the internship report of David Baelde  . He should there that the various forms of reachability in asynchronous processes calculi can be encoded naturally in proof theory. In particular, he provided an encoding of the join calculus into linear logic and showed how to motivate CCS style prefixing using a non-canonical modal operator used for synchronization.