unbound: Generic support for programming with names and binders
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.
[Skip to Readme]
Versions [faq] | 0.2, 0.2.1, 0.2.2, 0.2.3, 0.2.4, 0.2.5, 0.3, 0.3.1, 0.4, 0.4.0.1, 0.4.0.2, 0.4.1, 0.4.1.1, 0.4.2, 0.4.3, 0.4.3.1, 0.4.4, 0.5.0, 0.5.1, 0.5.1.1 |
---|---|
Change log | CHANGES |
Dependencies | base (>=4.3 && <5), containers (>=0.3 && <0.5), mtl (>=2.0 && <2.2), RepLib (>=0.5.1 && <0.6), transformers (>=0.2.2.0 && <0.4) [details] |
License | BSD-3-Clause |
Author | Stephanie Weirich |
Maintainer | Brent Yorgey <byorgey@cis.upenn.edu> Stephanie Weirich <sweirich@cis.upenn.edu> |
Category | Language, Generics, Compilers/Interpreters |
Home page | http://code.google.com/p/replib/ |
Source repo | head: svn checkout https://replib.googlecode.com/svn/trunk/ |
Uploaded | by BrentYorgey at Tue Apr 10 16:13:43 UTC 2012 |
Distributions | NixOS:0.5.1.1 |
Downloads | 7819 total (210 in the last 30 days) |
Rating | (no votes yet) [estimated by rule of succession] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |
Modules
[Index]
Downloads
- unbound-0.4.0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)