We give a presentation of Pure type systems where contexts need not be well-formed and show that this is equivalent to the usual one. The main motivation for that, when we extend with computation rules, like in logical framework Dedukti, want declare constants before rules are needed check well-typedness their type.
