# TypeCompose

### From HaskellWiki

(Difference between revisions)

m (→Data-driven computation: "Compose" --> "O") |
(prep for 0.2. moved out DataDriven. many new modules) |
||

Line 1: | Line 1: | ||

== Abstract == | == Abstract == | ||

− | '''TypeCompose''' provides some classes & instances for forms of type composition | + | '''TypeCompose''' provides some classes & instances for forms of type composition, as well as some modules that haven't found another home. |

* Read [http://darcs.haskell.org/packages/TypeCompose/doc/html the Haddock docs] (with source code, additional examples, and Comment/Talk links). | * Read [http://darcs.haskell.org/packages/TypeCompose/doc/html the Haddock docs] (with source code, additional examples, and Comment/Talk links). | ||

* Get the code repository: '''<tt>darcs get http://darcs.haskell.org/packages/TypeCompose</tt>''', or | * Get the code repository: '''<tt>darcs get http://darcs.haskell.org/packages/TypeCompose</tt>''', or | ||

* Grab a [http://darcs.haskell.org/packages/TypeCompose/dist distribution tarball]. | * Grab a [http://darcs.haskell.org/packages/TypeCompose/dist distribution tarball]. | ||

− | * See the [ | + | * See the [[TypeCompose/Versions| version history]]. |

− | + | ||

− | + | ||

== Type composition == | == Type composition == | ||

− | + | The <hask>Control.Compose</hask> module includes | |

+ | * Various type compositions (unary/unary, binary/unary, etc). Most are from [http://www.soi.city.ac.uk/~ross/papers/Applicative.html Applicative Programming with Effects]. In particular, <hask>g `O` f</hask> 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. | ||

+ | * 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 <hask>Flip (->) o</hask>, for <hask>(-> o)</hask>. | ||

+ | * Constructor in pairs: <hask>(f a, g a)</hask>. | ||

+ | * Constructor in arrows/functions: <hask>f a ~> g a</hask>. | ||

+ | |||

+ | == Other features == | ||

+ | |||

+ | === 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 <hask>Data.Bijection</hask> module is inspired by [http://citeseer.ist.psu.edu/alimarine05there.html There and Back Again: Arrows for Invertible Programming], though done here in a less general setting. | |

− | + | === Pair- & function-like types === | |

− | < | + | The <hask>Data.Pair</hask> and <hask>Data.Lambda</hask> patterns emerged while working on [[DeepArrow]] and [[Eros]]. <hask>Data.Pair</hask> generalizes <hask>zip</hask> and <hask>unzip</hask> from <hask>[]</hask> to other functors. It also provides variants of type <hask>f a -> f (a,b)</hask> and <hask>f a -> f (a,b)</hask>. <hask>Data.Lambda</hask> is similar with classes for lambda-like constructions. |

− | type | + | |

− | </ | + | |

− | + | For example uses of <hask>Pair</hask> and <hask>Lambda</hask>, see [[TV]] and [[Eros]]. | |

− | + | === References === | |

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | Monads with references. Direct rip-off from [http://citeseer.ist.psu.edu/473734.html Global Variables in Haskell]. | |

− | === | + | === Titling === |

− | + | For giving titles to things. I know it sounds kind of random. More useful than I first thought. Used in [[Phooey]], [[TV]], and [[Eros]]. | |

− | + | === Partial values === | |

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | A monoid of partial values. See the [http://conal-elliott.blogspot.com/2007/07/type-for-partial-values.html teaser] and [http://conal-elliott.blogspot.com/2007/07/implementing-type-for-partial-values.html solution] blog | |

− | + | posts. | |

− | type | + | |

− | + | ||

− | + | === Context-dependent monoids === | |

− | + | ||

− | + | ||

− | + | ||

− | + | Bit of an oddball also. <hask>Data.CxMonoid</hask> defines a sort of meta-monoid, that can be supplied dynamically with choices of <hask>mempty</hask> and <hask>mappend</hask>. Used in [[Phooey]] (starting with version 1.3) so that layout could be a monoid but still vary in style. | |

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + |

## Revision as of 05:10, 9 September 2007

## Contents |

## 1 Abstract

**TypeCompose** provides some classes & instances for forms of type composition, as well as some modules that haven't found another home.

- Read the Haddock docs (with source code, additional examples, and Comment/Talk links).
- Get the code repository:
, or`darcs get http://darcs.haskell.org/packages/TypeCompose` - Grab a distribution tarball.
- See the version history.

## 2 Type composition

TheControl.Compose

- 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.

TheData.Bijection

### 3.2 Pair- & function-like types

TheData.Pair

Data.Lambda

Data.Pair

zip

unzip

[]

f a -> f (a,b)

f a -> f (a,b)

Data.Lambda

Pair

Lambda

### 3.3 References

Monads with references. Direct rip-off from Global Variables in Haskell.

### 3.4 Titling

For giving titles to things. I know it sounds kind of random. More useful than I first thought. Used in Phooey, TV, and Eros.

### 3.5 Partial values

A monoid of partial values. See the teaser and solution blog posts.

### 3.6 Context-dependent monoids

Bit of an oddball also.Data.CxMonoid

mempty

mappend