Choice

abstract def choice[A, B, C](f: ⇒ =>:[A, C], g: ⇒ =>:[B, C]): =>:[\/[A, B], C]

abstract def compose[A, B, C](f: =>:[B, C], g: =>:[A, B]): =>:[A, C]

Associative =>: binary operator.

abstract def id[A]: =>:[A, A]

The left and right identity over compose.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def categoryLaw: CategoryLaw

val categorySyntax: CategorySyntax[=>:]

val choiceSyntax: ChoiceSyntax[=>:]

def clone(): AnyRef

def codiagonal[A]: =>:[\/[A, A], A]

def composeLaw: ComposeLaw

val composeSyntax: ComposeSyntax[=>:]

def empty: PlusEmpty[[α]=>:[α, α]]

monoid, but universally quantified.

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 monoid[A]: Monoid[=>:[A, A]]

The endomorphism monoid, where zero=id and append=compose.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def plus: Plus[[α]=>:[α, α]]

semigroup, but universally quantified.

def semigroup[A]: Semigroup[=>:[A, A]]

The endomorphism semigroup, where append=compose.

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