End step.
Implicit Arguments stepS [state step cont s k s' k' n].
Inductive prog_star : state -> prog -> state -> cont -> Prop :=
| star_prog : forall P s k s' k',
P 0%N = Some k -> star (step P) s k s' k' ->
prog_star s P s' k'.
(** interpreter is sound *)

Lemma eval_soundN n k P s h s' h' :
eval n k P s h = Some (State s' h') ->
exists k', stepN (step P) n (State s h) k (State s' h') k'.