# data-combinator-gen: Generate a special combinator from any data type.

This library provides a function to generate a special combinator from any data type (GADTs are not currently supported).
This was inspired by the recursion-schemes library where they have a function to automagically generate a base functor. Although, this new base functor data type has custom constructors and to define the *-morphism algebras turns into boring pattern matching.
So, this library provides a function called `makeCombinator`

that produces a
nice combinator to deal with data types as they were defined in terms of Pairs
( (,) ) and Sums (`Either`

). With this nice combinator we are able to view a
data type as its equivalent categorical isomorphism and manipulate it with an
interface similar as the `either`

function provided from `base`

.

[Skip to Readme]

## Downloads

- data-combinator-gen-0.1.0.4.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)

#### Maintainer's Corner

For package maintainers and hackage trustees

Candidates

- No Candidates

Versions [RSS] | 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.0.4 |
---|---|

Change log | CHANGELOG.md |

Dependencies | base (>=4.12 && <4.13), template-haskell (>=2.5.0.0 && <2.16) [details] |

License | MIT |

Author | Armando Santos |

Maintainer | armandoifsantos@gmail.com |

Category | Data |

Home page | https://github.com/bolt12/data-combinator-gen |

Uploaded | by bolt12 at 2019-05-26T12:34:59Z |

Distributions | |

Downloads | 1982 total (5 in the last 30 days) |

Rating | (no votes yet) [estimated by Bayesian average] |

Your Rating | |

Status | Docs uploaded by user Build status unknown [no reports yet] |