unbound-kind-generics: Support for programming with names and binders using kind-generics
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
Warnings:
- These packages miss upper bounds: - kind-generics - kind-generics-th - unbound-generics Please add them, using `cabal gen-bounds` for suggestions. For more information see: https://pvp.haskell.org/
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.
Properties
| Versions | 0.2.0.0, 0.2.1.0, 0.2.1.1, 0.2.1.1 |
|---|---|
| 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:09:53Z |
Modules
[Index] [Quick Jump]
- Unbound
- Generics
Downloads
- unbound-kind-generics-0.2.1.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees