We show that adequate semantics can be provided for imperative higher order concurrent languages simply using syntactical final coalgebras. In particular we investigate and compare various behavioural equivalences on higher order processes defined by finality using hypersets and c.m.s.'s. Correspondingly, we derive various coinduction and mixed induction-coinduction proof principles for establishing these equivalences.