Specify the binding structure of your data type with an expressive set of type combinators, and unbound-generics handles the rest! Automatically derives alpha-equivalence, free variable calculation, capture-avoiding substitution, and more. See 'Unbound.Generics.LocallyNameless' to get started.
This is an independent re-implementation of <http://hackage.haskell.org/package/unbound Unbound> but using <http://www.haskell.org/ghc/docs/latest/html/libraries/base-4.9.0.0/GHC-Generics.html GHC.Generics> instead of <http://hackage.haskell.org/package/RepLib RepLib>. See the accompanying README for some porting notes.
Package Version | Update ID | Released | Package Hub Version | Platforms | Subpackages |
---|---|---|---|---|---|
0.3.1-bp150.2.3 info | GA Release | 2018-08-01 | 15 |
|
|
0.3.1-bp150.2.5 info | GA Release | 2018-07-31 | 15 |
|
|
0.3.1-bp150.2.6 info | GA Release | 2018-07-30 | 15 |
|
|