Section ListHybrid.
Variable A B State : Set.
Variable defA : A.
Variable c1 c2 : A -> Comp B.
Hypothesis c1_wf : forall a, well_formed_comp (c1 a).
Hypothesis c2_wf : forall a, well_formed_comp (c2 a).
Hypothesis A_EqDec : EqDec A.
Hypothesis B_EqDec : EqDec B.
Hypothesis State_EqDec : EqDec State.
Variable A1 : Comp ((list A) * State).
Variable A2 : State -> list B -> Comp bool.
Variable maxA : nat.
Hypothesis maxA_correct :
forall ls s_A,
In (ls, s_A) (getSupport A1) ->
(length ls <= maxA)%nat.
Definition ListHybrid_G (c : A -> Comp B) :=
[lsA, s_A] <-$2 A1;
lsB <-$ compMap _ c lsA;
A2 s_A lsB.
Definition ListHybrid_Advantage :=
| Pr[ListHybrid_G c1] - Pr[ListHybrid_G c2] |.
Definition G_hybrid i :=
[lsA, s_A] <-$2 A1;
lsA1 <- firstn i lsA;
lsA2 <- skipn i lsA;
lsB1 <-$ compMap _ c1 lsA1;
lsB2 <-$ compMap _ c2 lsA2;
A2 s_A (lsB1 ++ lsB2).
unfold ListHybrid_G, G_hybrid.
comp_skip.
comp_simp.
eapply comp_spec_eq_impl_eq.
simpl.
comp_simp.
simpl.
eapply comp_spec_eq_refl.
Qed.
induction ls; destruct n; intuition; simpl in *.
omega.
eapply IHls.
omega.
Qed.
unfold ListHybrid_G, G_hybrid.
comp_skip.
comp_simp.
rewrite firstn_ge_all.
comp_skip.
rewrite skipn_ge_nil.
eapply comp_spec_eq_impl_eq.
simpl.
comp_simp.
rewrite app_nil_r.
eapply comp_spec_eq_refl.
eauto.
eauto.
Qed.
Definition B1 i :=
[lsA, s_A] <-$2 A1;
lsA1 <- firstn i lsA;
a <- nth i lsA defA;
lsA2 <- skipn (S i) lsA;
incla <- if (lt_dec i (length lsA)) then true else false;
ret (a, (incla, lsA1, lsA2, s_A)).
Definition B2 (e : bool * _ * _ * _) b :=
let '(incla, lsA1, lsA2, s_A) := e in
lsB1 <-$ compMap _ c1 lsA1;
lsB2 <-$ compMap _ c2 lsA2;
lsB <- if incla then (lsB1 ++ (b :: lsB2)) else lsB1;
A2 s_A lsB.
Local Open Scope list_scope.
induction ls; intuition; simpl in *.
comp_skip.
Qed.
induction ls; intuition; simpl in *.
omega.
destruct n; simpl in *; intuition.
discriminate.
eapply IHls; eauto.
omega.
Qed.
induction ls; destruct n; intuition; simpl in *.
eauto.
Qed.
induction ls; intuition; simpl in *.
rewrite skipn_nil.
trivial.
destruct n; simpl in *.
trivial.
eauto.
Qed.
induction ls; destruct n; intuition; simpl in *.
omega.
eapply IHls; eauto.
omega.
Qed.
intuition.
unfold G_hybrid, DistSingle_G, B1, B2.
inline_first.
comp_skip.
comp_simp.
comp_swap_r.
comp_skip.
eapply comp_spec_eq_impl_eq.
destruct (lt_dec i (length l)).
eapply comp_spec_eq_trans.
eapply comp_spec_seq_eq; eauto with inhabited.
eapply compMap_unroll.
intuition.
eapply skipn_lt_nil_false;
eauto.
intuition.
eapply comp_spec_eq_refl.
inline_first.
comp_skip.
rewrite hd_skip_eq_nth.
eapply comp_spec_eq_refl.
subst.
inline_first.
rewrite tl_skipn_eq.
comp_skip.
rewrite skipn_gt_nil; intuition.
simpl.
comp_simp.
rewrite app_nil_r.
comp_irr_r.
comp_irr_r.
eapply compMap_wf.
intuition.
Qed.

Theorem compMap_unroll_tl :
forall (A B : Set)(def : A)(eqdb : EqDec B)(c : A -> Comp B)(ls : list A) n,
length ls = S n ->
comp_spec eq (compMap _ c ls) (y <-$ compMap _ c (firstn n ls); x <-$ c (nth n ls def); ret (y ++ x :: nil)).