Soundness conditions for big-step semantics

We propose a general proof technique to show that a predicate is sound, that is, prevents stuck computation, with respect to a big-step semantics.This result may look surprising, since in big-step semantics there is no difference between non-terminating and stuck computations, hence soundness cannot even be expressed.The key idea is to define constructions yielding an extended version of a given arbitrary big-step semantics, where the difference is made explicit.The extended semantics are exploited in the meta-theory, notably they are necessary to show that the proof technique works.However, they remain transparent when using the proof technique, since it consists in checking three conditions on the original rules only, as we illustrate by several examples.