unbound-kind-generics: Support for programming with names and binders using kind-generics

[ bsd3, language, library ] [ Propose Tags ]

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.Kind.Derive to get started.

This is an independent re-implementation of unbound-generics but using kind-generics instead of GHC Generics.


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS],,
Change log CHANGELOG.md
Dependencies base (>=4.12 && <5), kind-generics (>=0.4), kind-generics-th, unbound-generics (>=0.4) [details]
License BSD-3-Clause
Author Alejandro Serrano
Maintainer trupill@gmail.com
Category Language
Uploaded by AlejandroSerrano at 2023-05-22T15:10:12Z
Downloads 761 total (12 in the last 30 days)
Rating 1.75 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]