trait
Laws[F[_]] extends Cobind.Laws[F] with Type[F]
Abstract Value Members
-
implicit abstract
def
cobind: Cobind[F]
-
implicit abstract
def
comonad: Comonad[F]
-
implicit abstract
def
functor: Functor[F]
Concrete Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
coflatMapAssociativity[A, B, C](fa: F[A], f: (F[A]) ⇒ B, g: (F[B]) ⇒ C): IsEquiv[F[C]]
-
def
coflatMapIdentity[A, B](fa: F[A]): IsEquiv[F[F[A]]]
-
def
coflattenCoherence[A, B](fa: F[A], f: (F[A]) ⇒ B): IsEquiv[F[B]]
-
def
coflattenThroughMap[A](fa: F[A]): IsEquiv[F[F[F[A]]]]
-
def
comonadLeftIdentity[A](fa: F[A]): IsEquiv[F[A]]
-
def
comonadRightIdentity[A, B](fa: F[A], f: (F[A]) ⇒ B): IsEquiv[B]
-
def
covariantComposition[A, B, C](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ C): IsEquiv[F[C]]
-
def
covariantIdentity[A](fa: F[A]): IsEquiv[F[A]]
-
-
-
def
extractCoflattenIdentity[A](fa: F[A]): IsEquiv[F[A]]
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
mapCoflatMapCoherence[A, B](fa: F[A], f: (A) ⇒ B): IsEquiv[F[B]]
-
def
mapCoflattenIdentity[A](fa: F[A]): IsEquiv[F[A]]
-
-
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
Laws for Comonad.