trait
Applicative[Z[_]] extends Pointed[Z] with Apply[Z]
Abstract Value Members
-
abstract
def
pure[A](a: ⇒ A): Z[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: Z[(A) ⇒ B], a: Z[A]): Z[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: Z[A], f: (A) ⇒ B): Z[B]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
liftA2[A, B, C](a: Z[A], b: Z[B], f: (A, B) ⇒ C): Z[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: Z[A], f: (A) ⇒ B, g: (B) ⇒ A): Z[B]
Inherited from AnyRef
Inherited from Any
Defines an applicative functor as described by McBride and Paterson in Applicative Programming with Effects.
All instances must satisfy 4 laws:
forall a. a == apply(a, pure(identity))
forall af ag a. apply(apply(a, ag), af) == apply(a, apply(ag, apply(af, pure(compose))))
forall f a. apply(pure(a), pure(f)) == pure(f(a))
forall af a. apply(pure(a), af) == apply(af, pure(f => f(x)))