uAgda: A simplistic dependently-typed language with parametricity.

[ dependent-types, program ] [ Propose Tags ]

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.

Downloads

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 array (>=0.3 && <0.4), base (>=4 && <5), BNFC-meta (>=0.2 && <0.3), cmdargs (>=0.6 && <0.7), containers (>=0.4 && <0.5), mtl (>=2.0 && <2.1), parsec (>=2.1 && <2.2), pretty (>=1.1 && <1.2), split (>=0.1 && <0.2), 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 2012-03-10T08:41:12Z
Distributions NixOS:1.2.0.4
Executables uAgda
Downloads 6608 total (41 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-25 [all 6 reports]