pandora-0.2.3: A box of patterns and paradigms

Safe HaskellSafe
LanguageHaskell2010

Pandora.Pattern.Functor.Comonad

Synopsis

Documentation

class (Extractable t, Extendable t) => Comonad t Source #

Let f :: (Pointable t, Bindable t) => t a -> b
Let g :: (Pointable t, Bindable t) => t a -> b
When providing a new instance, you should ensure it satisfies the three laws:
* Left identity: extend extract ≡ identity
* Right identity: extract . extend f ≡ f
* Associativity: extend f . extend g ≡ extend (f . extend g)
Instances
Comonad Identity Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Identity

Covariant t => Comonad (Twister t) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Twister

Comonad (Product a) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Product

Comonad (Store p) Source # 
Instance details

Defined in Pandora.Paradigm.Inventory.Store

Comonad (Tagged tag) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Tagged

type Schematic Comonad (Store p) u Source # 
Instance details

Defined in Pandora.Paradigm.Inventory.Store

type Schematic Comonad (Store p) u = TUV Covariant Covariant Covariant ((:*:) p) u ((->) p :: Type -> Type)