FreeApplicative

abstract def canEqual(that: Any): Boolean

abstract def productArity: Int

abstract def productElement(n: Int): Any

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def analyze[M](f: ~>[F, [α]M])(implicit arg0: Monoid[M]): M

Interpret this algebra into a Monoid

final def ap[B](b: FA[F, (A) ⇒ B]): FA[F, B]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def compile[G[_]](f: ~>[F, G]): FA[G, A]

Interpret this algebra into another FreeApplicative

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def fold(implicit F: Applicative[F]): F[A]

Interpret/run the operations using the semantics of Applicative[F].

final def foldMap[G[_]](f: ~>[F, G])(implicit G: Applicative[G]): G[A]

Interprets/Runs the sequence of operations using the semantics of Applicative G Tail recursive only if G provides tail recursive interpretation (ie G is FreeMonad)

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def map[B](f: (A) ⇒ B): FA[F, B]

final def monad: Free[F, A]

Compile this FreeApplicative algebra into a Free algebra.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def productIterator: Iterator[Any]

def productPrefix: String

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