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

Kohei Honda (1) , Olivier Laurent (2)

1 Department of Computer Science
2 PPS - Preuves, Programmes et Systèmes

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) (for proof-nets) and Kohei Honda et al. (2004) (for the π-calculus).

Mots clés: Pi-calculus; Proof-nets; Processes; Logics; Proofs; Types; Interaction; Concurrency; Linear Logic; Polarity; Embedding; Determinism; Non-determinism

Domaines: Logique [math.LO]; Calcul parallèle, distribué et partagé [cs.DC]; Logique en informatique [cs.LO]

Kohei Honda, Olivier Laurent. An exact correspondence between a typed pi-calculus and polarised proof-nets. Theoretical Computer Science, 2010, 411 (22--24), pp.2223--2238. ⟨10.1016/j.tcs.2010.01.028⟩. ⟨hal-00483227⟩