package base

  1. Overview
  2. Docs
Module type
Class type


module X : Basic


val (>>=) : 'a X.t -> ('a -> 'b X.t) -> 'b X.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 X.t -> ('a -> 'b) -> 'b X.t

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

module Monad_infix : sig ... end
val bind : 'a X.t -> f:('a -> 'b X.t) -> 'b X.t

bind t ~f = t >>= f

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

return v returns the (trivial) computation that returns v.

val map : 'a X.t -> f:('a -> 'b) -> 'b X.t

map t ~f is t >>| f.

val join : 'a X.t X.t -> 'a X.t

join t is t >>= (fun t' -> t').

val ignore_m : 'a X.t -> unit X.t

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 Pervasives.ignore. Some monads still do let ignore = ignore_m for historical reasons.

val all : 'a X.t list -> 'a list X.t
val all_unit : unit X.t list -> unit X.t
val all_ignore : unit X.t list -> unit X.t
  • deprecated [since 2018-02] Use [all_unit]
module Let_syntax : sig ... end

These are convenient to have in scope when programming with a monad:


Innovation. Community. Security.