generics-sop

Generic Programming using True Sums of Products

Version on this page:	0.2.1.0
LTS Haskell 22.39:	0.5.1.3
Stackage Nightly 2024-10-31:	0.5.1.4@rev:1
Latest on Hackage:	0.5.1.4@rev:1

See all snapshots generics-sop appears in

BSD-3-Clause licensed by Edsko de Vries, Andres Löh

Maintained by [email protected]

This version can be pinned in stack with:generics-sop-0.2.1.0@sha256:c2f9f969fc3fd26d6aabbc3ebf5e7680f1d9f603926da17553aed3cfe6abb101,4039

Module documentation for 0.2.1.0

Generics
- Generics.SOP

Depends on 3 packages(full list with versions):

base, ghc-prim, template-haskell

Used by 4 packages in nightly-2016-04-19(full list with versions):

binary-tagged, exhaustive, getopt-generics, pagerduty

A library to support the definition of generic functions. Datatypes are viewed in a uniform, structured way: the choice between constructors is represented using an n-ary sum, and the arguments of each constructor are represented using an n-ary product.

The module Generics.SOP is the main module of this library and contains more detailed documentation.

Examples of using this library are provided by the following packages:

basic-sop basic examples,
pretty-sop generic pretty printing,
lens-sop generically computed lenses,
json-sop generic JSON conversions.

A detailed description of the ideas behind this library is provided by the paper:

Edsko de Vries and Andres Löh. True Sums of Products. Workshop on Generic Programming (WGP) 2014.