A sequential computation framework with wrapping the type S. All instances of the monad m must satisfy the following laws:

  • Left identity: For all f and a; m.flatMap(f)(m.pure(a)) equals to f(a),
  • Right identity: For all a; m.flatMap(m.pure)(a) equals to a,
  • Associativity: For all f, g and a; m.flatMap(f)(m.flatMap(g)(a)) equals to m.flatMap((x) => m.flatMap(f)(g(x)))(a).

Type Parameters

  • M

Hierarchy

Properties

apply: (<T, U>(fn) => ((t) => Instance<Apply1<M, U>>))

Type declaration

flatMap: (<T1, U1>(a) => ((t) => Instance<Apply1<M, U1>>))

Type declaration

liftPromise: (<T>(a) => Get1<M, T>)

Type declaration

    • <T>(a): Get1<M, T>
    • Type Parameters

      • T

      Parameters

      • a: Promise<T>

      Returns Get1<M, T>

map: (<T, U>(fn) => ((t) => Instance<Apply1<M, U>>))

Type declaration

pure: (<T>(t) => Instance<Apply1<M, T>>)

Type declaration

Generated using TypeDoc