  We provide a proof of strong normalisation for lambda+, a recently
introduced, explicitly typed, non-deterministic lambda-calculus where
isomorphic propositions are identified. Such a proof is a non-trivial
adaptation of the reducibility candidates technique.
