Package4.4.4Data StructuresAdjunctions
adjunctions
Adjunctions and representable functors
- Version4.4.4
- CategoryData Structures, Adjunctions
- LicenceBSD-2-Clause
- AuthorEdward A.
Kmett - MaintainerEdward A.
Kmett <ekmett@ gmail. com> - Homepagegithub.
com/ ekmett/ adjunctions - Pinned byhackage adjunctions 4.
4. 4 - Sourceadjunctions-4.
4. 4 on Hackage
Modules
- Control.Comonad.Representable.StoreThis is a generalized Store Comonad, parameterized by a Representable Functor.
- Control.Comonad.Trans.Adjoint
- Control.Monad.Representable.ReaderRepresentable functors on Hask are all monads, because they are isomorphic to
- Control.Monad.Representable.StateA generalized State monad, parameterized by a Representable functor.
- Control.Monad.Trans.Adjoint
- Control.Monad.Trans.Contravariant.AdjointUses a contravariant adjunction: f -| g : Hask^op -> Hask to build a Comonad to Monad transformer. Sadly, the dual construction,
- Control.Monad.Trans.ContsCont r ~ Contravariant.Adjoint (Op r) (Op r)
- Data.Functor.Adjunction
- Data.Functor.Contravariant.Adjunction
- Data.Functor.Contravariant.RepRepresentable contravariant endofunctors over the category of Haskell
- Data.Functor.RepRepresentable endofunctors over the category of Haskell types are
Description
Adjunctions and representable functors.
Depends on
10 packages- base-4.22.0.0with GHC
- comonad-5.0.10in this set
- containers-0.8with GHC
- distributive-0.6.3in this set
- free-5.2in this set
- mtl-2.3.1with GHC
- profunctors-5.6.3in this set
- semigroupoids-6.0.2in this set
- tagged-0.8.11in this set
- transformers-0.6.1.2with GHC