A fully abstract domain model for the /spl pi/-calculus

Abramsky's domain equation for bisimulation and the author's categorical models for names combine to give a domain-theoretic model for the /spl pi/-calculus. This is set in a functor category which provides a syntax-free interpretation of fresh names, privacy visibility and non-interference between processes. The model is fully abstract for strong late bisimilarity and equivalence (bisimilarity under all name substitutions).