Control.Comonad

class Comonad :: (Type -> Type) -> Constraintclass (Extend w) <= Comonad w  where

Comonad extends the Extend class with the extract function which extracts a value, discarding the comonadic context.

Comonad is the dual of Monad, and extract is the dual of pure.

Laws:

• Left Identity: extract <<= xs = xs
• Right Identity: extract (f <<= xs) = f xs

Members

• extract :: forall a. w a -> a

class Extend :: (Type -> Type) -> Constraintclass (Functor w) <= Extend w  where

The Extend class defines the extension operator (<<=) which extends a local context-dependent computation to a global computation.

Extend is the dual of Bind, and (<<=) is the dual of (>>=).

Laws:

• Associativity: extend f <<< extend g = extend (f <<< extend g)

Members

• extend :: forall b a. (w a -> b) -> w a -> w b

Instances

• (Semigroup w) => Extend (Function w)
• Extend Array

duplicate :: forall a w. Extend w => w a -> w (w a)

Duplicate a comonadic context.

duplicate is dual to Control.Bind.join.

Operator alias for Control.Extend.extendFlipped (left-associative / precedence 1)

Operator alias for Control.Extend.composeCoKleisli (right-associative / precedence 1)

Operator alias for Control.Extend.composeCoKleisliFlipped (right-associative / precedence 1)

Operator alias for Control.Extend.extend (right-associative / precedence 1)

class Functor :: (Type -> Type) -> Constraintclass Functor f  where

A Functor is a type constructor which supports a mapping operation map.

map can be used to turn functions a -> b into functions f a -> f b whose argument and return types use the type constructor f to represent some computational context.

Instances must satisfy the following laws:

• Identity: map identity = identity
• Composition: map (f <<< g) = map f <<< map g

Members

• map :: forall a b. (a -> b) -> f a -> f b

Instances

• Functor (Function r)
• Functor Array
• Functor Proxy

void :: forall f a. Functor f => f a -> f Unit

The void function is used to ignore the type wrapped by a Functor, replacing it with Unit and keeping only the type information provided by the type constructor itself.

void is often useful when using do notation to change the return type of a monadic computation:

main = forE 1 10 \n -> void do
  print n
  print (n * n)

Operator alias for Data.Functor.map (left-associative / precedence 4)

Operator alias for Data.Functor.voidRight (left-associative / precedence 4)

Operator alias for Data.Functor.mapFlipped (left-associative / precedence 1)

Operator alias for Data.Functor.voidLeft (left-associative / precedence 4)