uAgda: A simplistic dependently-typed language with parametricity.
uAgda implements an experimental dependently-typed language (and proof assistant by the Curry-Howard isomorphism). The goal of the project is twofold:
Experiment with a minimalistic language that is strong enough to program and reason in.
Give a simple implementation of its type-checker (ours is ~200 lines).
See the share/tutorial directory for how to get started.
Downloads
- uAgda-1.0.0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 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 | base (>=4 && <5), BNFC-meta (>=0.1 && <0.2), cmdargs (>=0.6 && <0.7), containers (>=0.3 && <0.4), monads-fd (>=0.1 && <0.2), parsec (>=2.1 && <2.2), pretty (>=1.0 && <1.1), transformers (>=0.2 && <0.3) [details] |
| License | LicenseRef-OtherLicense |
| Author | Jean-Philippe Bernardy |
| Maintainer | jeanphilippe.bernardy@gmail.com |
| Category | Dependent Types |
| Uploaded | by JeanPhilippeBernardy at 2010-12-03T10:15:16Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Executables | uAgda |
| Downloads | 6856 total (19 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-28 [all 6 reports] |