uAgda: A simplistic dependently-typed language with parametricity.
uAgda implements an experimental dependently-typed language (and proof assistant by the Curry-Howard isomorphism), extended with support for parametricity.
See the share/tutorial directory for how to get started.
| Versions [faq] | 1.0.0.0, 1.0.0.1, 1.0.0.2, 1.1.0.0, 1.2.0.0, 1.2.0.1, 1.2.0.2, 1.2.0.3, 1.2.0.4 |
|---|---|
| Dependencies | array (==0.3.*), base (==4.*), BNFC-meta (==0.3.*), cmdargs (==0.6.*), containers (==0.4.*), mtl (==2.0.*), parsec (==2.1.*), pretty (==1.0.*), split (==0.1.*), transformers (==0.2.*) [details] |
| License | LicenseRef-OtherLicense |
| Author | Jean-Philippe Bernardy |
| Maintainer | jeanphilippe.bernardy@gmail.com |
| Category | Dependent Types |
| Uploaded | by JeanPhilippeBernardy at 2012-01-05T10:38:09Z |
| Distributions | NixOS:1.2.0.4 |
| Executables | uAgda |
| Downloads | 6160 total (3 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs not available [build log] All reported builds failed as of 2016-12-26 [all 6 reports] |
Downloads
- uAgda-1.2.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)