Module `List.Let_syntax`

val return : 'a -> 'a Base__List.t

include Base__.Monad_intf.Infix with type 'a t := 'a Base__List.t

type 'a t

val (>>=) : 'a t -> ('a -> 'b t) -> 'b 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 t -> ('a -> 'b) -> 'b t: t >>| f is t >>= (fun a -> return (f a)).

module Let_syntax : sig ... end