Ltac prog_assoc_r :=
    eapply comp_spec_eq_trans_r; [ idtac | eapply comp_spec_assoc].(* A bounded repeat based on fold. *)
Definition repeatMax(A : Set)(eqd : EqDec A)(c : Comp A)(P : A -> bool) def (n : nat):=
  compFold _ (fun a' i => if (P a') then (ret a') else c) def (allNatsLt n).

Lemma compFold_wf : forall (A B : Set)(eqd : EqDec A)(c : A -> B -> Comp A)(ls : list B) init, (forall a b, well_formed_comp (c a b)) -> well_formed_comp (compFold _ c init ls).