AppFunc

abstract def F: Applicative[F]

abstract def run: (A) ⇒ F[B]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def andThen[G[_], C](g: AppFunc[G, B, C]): AppFunc[[γ$3$]Nested[F, G, γ$3$], A, C]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[G[_], C](g: AppFunc[G, C, A]): AppFunc[[γ$0$]Nested[G, F, γ$0$], C, B]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def map[C](f: (B) ⇒ C): AppFunc[F, A, C]

def map[C](f: (B) ⇒ C)(implicit FF: Functor[F]): Func[F, A, C]

def mapK[G[_]](f: ~>[F, G]): Func[G, A, B]

Modify the context F using transformation f.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def product[G[_]](g: AppFunc[G, A, B]): AppFunc[[α]Tuple2K[F, G, α], A, B]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def traverse[G[_]](ga: G[A])(implicit GG: Traverse[G]): F[G[B]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit