Module Quickcheck.Let_syntax

val return : 'a -> 'a Generator.t
val (>>=) : 'a Generator.t -> ('a -> 'a Generator.t) -> 'a Generator.t

t >>= f returns a computation that sequences the computations represented by two monad elements. The resulting computation first does t to yield a value v, and then runs the computation returned by f v.

val (>>|) : 'a Generator.t -> ('a -> 'b) -> 'a Generator.t

t >>| f is t >>= (fun a -> return (f a)).

module Let_syntax : sig ... end with module Let_syntax.Open_on_rhs = Generator