trait CommutativeArrowLaws[F[_, _]] extends ArrowLaws[F]

Reference: "Causal Commutative Arrows", Journal of Functional Programming Figure 4.

Linear Supertypes
ArrowLaws[F], StrongLaws[F], ProfunctorLaws[F], CategoryLaws[F], ComposeLaws[F], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CommutativeArrowLaws
  2. ArrowLaws
  3. StrongLaws
  4. ProfunctorLaws
  5. CategoryLaws
  6. ComposeLaws
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. implicit abstract def F: CommutativeArrow[F]
    Definition Classes
    CommutativeArrowLaws → ArrowLaws → StrongLaws → ProfunctorLaws → CategoryLaws → ComposeLaws

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def arrowAssociation[A, B, C, D](f: F[A, B]): IsEq[F[((A, C), D), (B, (C, D))]]
    Definition Classes
    ArrowLaws
  5. def arrowCommutative[A, B, C, D](f: F[A, B], g: F[C, D]): IsEq[F[(A, C), (B, D)]]
  6. def arrowComposition[A, B, C](f: (A) ⇒ B, g: (B) ⇒ C): IsEq[F[A, C]]
    Definition Classes
    ArrowLaws
  7. def arrowExchange[A, B, C, D](f: F[A, B], g: (C) ⇒ D): IsEq[F[(A, C), (B, D)]]
    Definition Classes
    ArrowLaws
  8. def arrowExtension[A, B, C](g: (A) ⇒ B): IsEq[F[(A, C), (B, C)]]
    Definition Classes
    ArrowLaws
  9. def arrowFunctor[A, B, C, D](f: F[A, B], g: F[B, C]): IsEq[F[(A, D), (C, D)]]
    Definition Classes
    ArrowLaws
  10. def arrowIdentity[A]: IsEq[F[A, A]]
    Definition Classes
    ArrowLaws
  11. def arrowUnit[A, B, C](f: F[A, B]): IsEq[F[(A, C), B]]
    Definition Classes
    ArrowLaws
  12. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  13. def categoryLeftIdentity[A, B](f: F[A, B]): IsEq[F[A, B]]
    Definition Classes
    CategoryLaws
  14. def categoryRightIdentity[A, B](f: F[A, B]): IsEq[F[A, B]]
    Definition Classes
    CategoryLaws
  15. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  16. def composeAssociativity[A, B, C, D](fab: F[A, B], fbc: F[B, C], fcd: F[C, D]): IsEq[F[A, D]]
    Definition Classes
    ComposeLaws
  17. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  19. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  20. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  21. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  22. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  23. def mergeConsistentWithAndThen[A, B, C](f: F[A, B], g: F[A, C]): IsEq[F[A, (B, C)]]
    Definition Classes
    ArrowLaws
  24. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  25. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  26. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  27. def profunctorComposition[A2, A1, A0, B0, B1, B2](fab: F[A0, B0], f2: (A2) ⇒ A1, f1: (A1) ⇒ A0, g1: (B0) ⇒ B1, g2: (B1) ⇒ B2): IsEq[F[A2, B2]]
    Definition Classes
    ProfunctorLaws
  28. def profunctorIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
    Definition Classes
    ProfunctorLaws
  29. def profunctorLmapComposition[A2, A1, A0, B](fab: F[A0, B], f: (A2) ⇒ A1, g: (A1) ⇒ A0): IsEq[F[A2, B]]
    Definition Classes
    ProfunctorLaws
  30. def profunctorLmapIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
    Definition Classes
    ProfunctorLaws
  31. def profunctorRmapComposition[A, B2, B1, B0](fab: F[A, B0], f: (B0) ⇒ B1, g: (B1) ⇒ B2): IsEq[F[A, B2]]
    Definition Classes
    ProfunctorLaws
  32. def profunctorRmapIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
    Definition Classes
    ProfunctorLaws
  33. def splitConsistentWithAndThen[A, B, C, D](f: F[A, B], g: F[C, D]): IsEq[F[(A, C), (B, D)]]
    Definition Classes
    ArrowLaws
  34. def strongFirstDistributivity[A0, A1, B1, B2, C](fab: F[A1, B1], f: (A0) ⇒ A1, g: (B1) ⇒ B2): IsEq[F[(A0, C), (B2, C)]]
    Definition Classes
    StrongLaws
  35. def strongSecondDistributivity[A0, A1, B1, B2, C](fab: F[A1, B1], f: (A0) ⇒ A1, g: (B1) ⇒ B2): IsEq[F[(C, A0), (C, B2)]]
    Definition Classes
    StrongLaws
  36. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  37. def toString(): String
    Definition Classes
    AnyRef → Any
  38. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from ArrowLaws[F]

Inherited from StrongLaws[F]

Inherited from ProfunctorLaws[F]

Inherited from CategoryLaws[F]

Inherited from ComposeLaws[F]

Inherited from AnyRef

Inherited from Any

Ungrouped