The uAgda package

[ Tags: dependent-types, program ] [ Propose Tags ]

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.

Properties

Versions 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.*), 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
Maintainer jeanphilippe.bernardy@gmail.com
Category Dependent Types
Uploaded Thu Dec 2 15:11:34 UTC 2010 by JeanPhilippeBernardy
Distributions NixOS:1.2.0.4
Executables uAgda
Downloads 1903 total (11 in the last 30 days)
Rating 0.0 (0 ratings) [clear rating]
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-28 [all 6 reports]
Hackage Matrix CI

Downloads

Maintainer's Corner

For package maintainers and hackage trustees