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.


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]
License OtherLicense
Author Jean-Philippe Bernardy
Stability Unknown
Category Dependent Types
Uploaded Fri Dec 3 10:15:16 UTC 2010 by JeanPhilippeBernardy
Distributions NixOS:
Downloads 1637 total (16 in the last 30 days)
0 []
Status Docs not available [build log]
All reported builds failed as of 2015-11-25 [all 4 reports]


Maintainer's Corner

For package maintainers and hackage trustees