| Safe Haskell | Safe |
|---|---|
| Language | Haskell98 |
Data.Copointed
- class Copointed p where
Documentation
Copointed does not require a Functor, as the only relationship
between copoint and fmap is given by a free theorem.
Minimal complete definition
Instances
| Copointed Identity # | |
| Copointed Min # | |
| Copointed Max # | |
| Copointed First # | |
| Copointed Last # | |
| Copointed WrappedMonoid # | |
| Copointed NonEmpty # | |
| Copointed Dual # | |
| Copointed Sum # | |
| Copointed Tree # | |
| Default m => Copointed ((->) m) # | |
| Copointed ((,) a) # | |
| Copointed (Arg a) # | |
| Copointed m => Copointed (WrappedMonad m) # | |
| Copointed f => Copointed (WrappedApplicative f) # | |
| Copointed f => Copointed (MaybeApply f) # | |
| Copointed f => Copointed (Lift f) # | |
| Copointed ((,,) a b) # | |
| (Default m, Copointed w) => Copointed (TracedT m w) # | |
| Copointed w => Copointed (StoreT s w) # | |
| Copointed w => Copointed (EnvT e w) # | |
| Copointed m => Copointed (IdentityT * m) # | |
| Copointed m => Copointed (WriterT w m) # | |
| Copointed m => Copointed (WriterT w m) # | |
| Copointed (Tagged * a) # | |
| Copointed f => Copointed (Reverse * f) # | |
| Copointed f => Copointed (Backwards * f) # | |
| Copointed ((,,,) a b c) # | |
| (Copointed f, Copointed g) => Copointed (Sum * f g) # | |
| (Copointed p, Copointed q) => Copointed (Compose * * p q) # | |