(prep for 0.2. moved out DataDriven. many new modules)
(Category:Applicative -> Applicative Functor)
|(12 intermediate revisions by 2 users not shown)|
Latest revision as of 17:48, 9 January 2011
 1 Abstract
TypeCompose provides some classes & instances for forms of type composition, as well as some modules that haven't found another home.
Besides this wiki page, here are more ways to find out about TypeCompose:
- Visit the Hackage page for library documentation and to download & install.
- Or install with cabal install TypeCompose.
- Get the code repository: darcs get http://code.haskell.org/~conal/code/TypeCompose.
 2 Type compositionThe
- Various type compositions (unary/unary, binary/unary, etc). Most are from Applicative Programming with Effects. In particular, composes functors in to functors and applicative functors (AFs) into AFs. (In contrast, monads do not in general compose.) Composition makes AF-based programming simple and elegant, partly because we don't need an AF counterpart to monad transformers.g `O` f
- Cofunctors (contravariant functors). Great for "consumer" types, just as functors suit "producer" (container) types. There are several composition options.
- Type argument flip. Handy for cofunctors: use , forFlip (->) o.(-> o)
- Constructor in pairs: .(f a, g a)
- Constructor in arrows/functions: .f a ~> g a
 3 Other features
 3.1 Composable bijections
Given all the type constructors and compositions of them, I found myself writing some pretty awkward code to wrap & unwrap through multiple layers. Composable bijections help a lot.The
 3.2 Pair- & function-like typesThe
 3.3 References
Monads with references. Direct rip-off from Global Variables in Haskell.