An exact correspondence between a typed pi-calculus and polarised proof-nets

This paper presents an exact correspondence in typing and dynamics between polarised linear logic and a typed π-calculus based on IO-typing. The respective incremental constraints, one on geometric structures of proof-nets and one based on types, precisely correspond to each other, leading to the exact correspondence of the respective formalisms as they appear in Olivier Laurent (2003) [27], (for proof-nets) and Kohei Honda et al. (2004) [24] (for the π-calculus).