proposition: Theorem expected_poly_time_bind_0_f : forall (A B : nat -> Set) (a : forall n, Comp (A n)) (b : forall n, A n -> Comp (B n)), efficient _ a -> efficient _ b -> efficient _ (fun n => (Bind (a n) (b n))).
proof: Proof. intuition. eapply (@expected_poly_time_compose_0_binary _ _ _ a b (fun n a b => Bind a b)); eauto. eapply expected_poly_time_bind. Qed.
imports: FCF.Crypto FCF.Asymptotic FCF.FCF