In this paper I present a partial formalisation of a normaliser for type theory in Agda[Nor07]; extending previous work on big-step normalisation[AC08,AC06]. The normaliser in written as an environment machine. Only the computational behaviour of the normaliser is presented omitting details of termination.