Strong Normalisation in the π-Calculus

Strong Normalisation in the π-Calculus (2001)

by Nobuko Yoshida , Martin Berger , Kohei Honda

Citations:

26 - 14 self

User correction supplied by mph

Datum	Value	Source
TITLE	Strong Normalisation in the π-Calculus	user correction
AUTHOR NAME	Nobuko Yoshida	user correction
AUTHOR NAME	Martin Berger	user correction
AUTHOR NAME	Kohei Honda	user correction
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.	user correction
YEAR	2001	user correction - Legacy Corrections
CITATIONS	47 found	ParsCit 1.0