proposition: Theorem expected_poly_time_cons_f : forall A B (f1 : forall n, A n -> B n) (f2 : forall n, A n -> list (B n)), efficient _ f1 -> efficient _ f2 -> efficient _ (fun n (a : A n) => (cons (f1 n a) (f2 n a))).
proof: Proof. intuition. eapply (@expected_poly_time_compose_binary _ _ _ _ _ _ (fun n a b => cons a b)); intuition. eapply expected_poly_time_cons. Qed.
imports: FCF.Crypto FCF.Asymptotic FCF.FCF