Generic support for programming with names and binders


Version on this page:0.5.1
LTS Haskell 9.21:0.5.1
Stackage Nightly 2017-07-25:0.5.1
Latest on Hackage:

See all snapshots unbound appears in

BSD-3-Clause licensed by Stephanie Weirich, Brent Yorgey
Maintained by Stephanie Weirich
This version can be pinned in stack with:unbound-0.5.1@sha256:d7625cddd5a6ac18658dbf16f1219658e88f5041a1da2a4f0bf3fd2d9696d559,3030

Specify the binding structure of your data type with an expressive set of type combinators, and Unbound handles the rest! Automatically derives alpha-equivalence, free variable calculation, capture-avoiding substitution, and more. See Unbound.LocallyNameless to get started.