The uAgda package
uAgda implements an experimental dependently-typed language (and proof assistant by the Curry-Howard isomorphism). The goal of the project is twofold:
1. Experiment with a minimalistic language that is strong enough to program and reason in.
2. Give a simple implementation of its type-checker (ours is ~200 lines).
See the share/tutorial directory for how to get started.
|Versions||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, 18.104.22.168|
|Change log||None available|
|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.*)|
|Uploaded||Thu Dec 2 15:11:34 UTC 2010 by JeanPhilippeBernardy|
|Downloads||1094 total (56 in last 30 days)|
|Status||Docs not available [build log]|
All reported builds failed as of 2015-06-10 [all 1 reports]
For package maintainers and hackage trustees