Definition procedure_family(A : nat -> Type) := forall n, A n.Definition efficiency_predicate := forall (A : nat -> Type), procedure_family A -> Prop.

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))).