type 'a t = 'a Async_kernel.Deferred.tinclude Core_kernel.Monad.S with type 'a t := 'a 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.
module Monad_infix : sig ... endval return : 'a -> 'a treturn v returns the (trivial) computation that returns v.
ignore_m t is map t ~f:(fun _ -> ()). ignore_m used to be called ignore, but we decided that was a bad name, because it shadowed the widely used Caml.ignore. Some monads still do let ignore = ignore_m for historical reasons.
module Let_syntax : sig ... endval fail : Core_kernel.Error.t -> _ tval ok_unit : unit tval ok_exn : 'a t -> 'a Async_kernel.Deferred.tval of_exn : exn -> _ tval of_exn_result : 'a Async_kernel.Deferred.t -> 'a tval error : string -> 'a -> ('a -> Core_kernel.Sexp.t) -> _ tval error_s : Core_kernel.Sexp.t -> _ tval error_string : string -> _ tval errorf : ('a, unit, string, _ t) Core_kernel.format4 -> 'aval tag_s : 'a t -> tag:Core_kernel.Sexp.t -> 'a tval tag_arg : 'a t -> string -> 'b -> ('b -> Core_kernel.Sexp.t) -> 'a tval unimplemented : string -> _ tval try_with : ?extract_exn:bool -> ?run:[ `Now | `Schedule ] -> ?here:Stdlib.Lexing.position -> ?name:string -> (unit -> 'a Async_kernel.Deferred.t) -> 'a tNote that try_with f is eager only in the Ok case.
val try_with_join : ?extract_exn:bool -> ?run:[ `Now | `Schedule ] -> ?here:Stdlib.Lexing.position -> ?name:string -> (unit -> 'a t) -> 'a tNote that try_with_join f is eager only when no exception is raised by f.
module List : Async_kernel.Monad_sequence.S with type 'a monad := 'a t with type 'a t := 'a list