MiniAgda: A toy dependently typed programming language with type-based termination.
MiniAgda is a tiny dependently-typed programming language in the style of Agda. It serves as a laboratory to test potential additions to the language and type system of Agda. MiniAgda's termination checker is a fusion of sized types and size-change termination and supports coinduction. Equality incorporates eta-expansion at record and singleton types. Function arguments can be declared as static; such arguments are discarded during equality checking and compilation. Recent features include bounded size quantification and destructor patterns for a more general handling of coinduction.
[Skip to Readme]
|Versions [faq]||0.2014.1.9, 0.2014.5.5, 0.2014.9.12, 0.2016.12.19, 0.2017.2.18, 0.2018.11.4, 0.2018.11.6|
|Dependencies||array (>=0.3 && <0.6), base (>=4.6 && <5), containers (>=0.3 && <0.6), haskell-src-exts (>=1.20 && <2.0), mtl (>=2.2.2 && <2.3), pretty (>=1.0 && <1.2) [details]|
|Author||Andreas Abel and Karl Mehltretter|
|Maintainer||Andreas Abel <email@example.com>|
|Source repo||head: git clone https://github.com/andreasabel/miniagda|
|Uploaded||by AndreasAbel at Tue Nov 6 08:12:32 UTC 2018|
|Downloads||2210 total (40 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs not available [build log]
Last success reported on 2018-11-06 [all 2 reports]
For package maintainers and hackage trustees