We propose a typing system for the true concurrent model of event structures that guarantees an interesting behavioural property known as confusion freeness. A system is confusion free if nondeterministic choices are localised and do not depend on the scheduling of independent components. It is a generalisation of con uence to systems that allow nondeterminism. Ours is the rst typing system to control behaviour in a true concurrent model. To demonstrate its applicability, we show that typed event structures give a semantics of linearly typed version of the p-calculi with internal mobility. The semantics we provide is the rst event structure semantics of the p-calculus and generalises Winskel's original event structure semantics of CCS
