trait
Monad[M[_]] extends Applicative[M] with Bind[M] with Pointed[M]
Abstract Value Members
-
abstract
def
bind[A, B](a: M[A], f: (A) ⇒ M[B]): M[B]
-
abstract
def
pure[A](a: ⇒ A): M[A]
Concrete Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
apply[A, B](f: M[(A) ⇒ B], a: M[A]): M[B]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
fmap[A, B](fa: M[A], f: (A) ⇒ B): M[B]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
liftA2[A, B, C](a: M[A], b: M[B], f: (A, B) ⇒ C): M[C]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
xmap[A, B](ma: M[A], f: (A) ⇒ B, g: (B) ⇒ A): M[B]
Inherited from AnyRef
Inherited from Any
Abstract a model that sequences computation through an environment.
All monad instances must satisfy 3 laws:
forall a f. f(a) == bind(pure(a), f)
forall a. a == bind(a, x => pure(x))
forall a f g. bind(a, x => bind(f(x), g)) == bind(bind(a, f), g)