## Strong Normalisation in the π-Calculus (2001)

Citations: | 31 - 16 self |

### BibTeX

@MISC{Yoshida01strongnormalisation,

author = {Nobuko Yoshida and Martin Berger and Kohei Honda},

title = {Strong Normalisation in the π-Calculus},

year = {2001}

}

### Years of Citing Articles

### OpenURL

### Abstract

We introduce a typed π-calculus where strong normalisation is ensured by typability. Strong normalisation is a useful property in many computational contexts, including distributed systems. In spite of its simplicity, our type discipline captures a wide class of converging name-passing interactive behaviour. The proof of strong normalisability combines methods from typed l-calculi and linear logic with process-theoretic reasoning. It is adaptable to systems involving state and other extensions. Strong normalisation is shown to have significant consequences, including finite axiomatisation of weak bisimilarity, a fully abstract embedding of the simply-typed l-calculus with products and sums and basic liveness in interaction.