scalaz

Adjunction

abstract class Adjunction[F[_], G[_]] extends AnyRef

An adjunction formed by two functors F and G such that F is left-adjoint to G. The composite functor GF is a monad and the composite functor FG is a comonad.

The minimal defition is either (unit, counit) or (leftAdjunct, rightAdjunct)

Self Type
Adjunction[F, G]
Source
Adjunction.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Adjunction
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Adjunction()(implicit F: Functor[F], G: Functor[G])

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. implicit val F: Functor[F]

  5. implicit val G: Functor[G]

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. implicit val comonad: Comonad[[α]F[G[α]]]

    Every adjunction gives rise to a comonad.

  9. def compose[P[_], Q[_]](implicit A: Adjunction.-|[P, Q]): Adjunction.-|[[α]P[F[α]], [α]G[Q[α]]]

    Adjunctions compose in a natural fashion.

    Adjunctions compose in a natural fashion. If F -| G is an adjunction, and P -| Q is an adjunction, then PF -| GQ is an adjunction. In fact, adjunctions in Scala form a monoid.

  10. def counit[A](a: F[G[A]]): A

    Extracts a value out of the comonad.

  11. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  15. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  16. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  17. def leftAdjunct[A, B](a: ⇒ A)(f: (F[A]) ⇒ B): G[B]

    Every F-algebra maps to a G-coalgebra.

  18. implicit val monad: Monad[[α]G[F[α]]]

    Every adjunction gives rise to a monad.

  19. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  20. final def notify(): Unit

    Definition Classes
    AnyRef
  21. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  22. implicit val representable: Representable[G, F[Unit]]

    Every adjunction is representable.

  23. def rightAdjunct[A, B](a: F[A])(f: (A) ⇒ G[B]): B

    Every G-coalgebra maps to an F-algebra.

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

    Definition Classes
    AnyRef
  25. def toString(): String

    Definition Classes
    AnyRef → Any
  26. def unit[A](a: ⇒ A): G[F[A]]

    Puts a value into the monad.

  27. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. implicit val zapFG: Zap[F, G]

    Adjoint functors annihilate each other.

  31. implicit val zapGF: Zap[G, F]

    Adjoint functors annihilate each other.

Inherited from AnyRef

Inherited from Any

Ungrouped