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.
|Versions [faq]||188.8.131.52, 184.108.40.206, 220.127.116.11, 18.104.22.168, 22.214.171.124, 126.96.36.199, 188.8.131.52, 184.108.40.206, 220.127.116.11|
|Dependencies||base (==4.*), BNFC-meta (==0.1.*), cmdargs (==0.6.*), containers (==0.3.*), monads-fd (==0.1.*), parsec (==2.1.*), pretty (==1.0.*), transformers (==0.2.*) [details]|
|Uploaded||by JeanPhilippeBernardy at Mon Feb 14 19:08:26 UTC 2011|
|Downloads||4567 total (184 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs not available [build log]
All reported builds failed as of 2016-12-28 [all 6 reports]
For package maintainers and hackage trustees