|Number of watchers on Github||53|
|Number of open issues||2|
|Average time to close an issue||6 months|
|Average time to merge a PR||about 14 hours|
|Open pull requests||0+|
|Closed pull requests||4+|
|Last commit||almost 2 years ago|
|Repo Created||over 5 years ago|
|Repo Last Updated||almost 2 years ago|
|Organization / Author||ulfnorell|
|Do you use agda-prelude? Leave a review!|
|View open issues (2)|
|View agda-prelude activity|
|View on github|
|Fresh, new opensource launches 🚀🚀🚀|
Trendy new open source projects in your inbox! View examples
This is an alternative to the Agda standard library that focuses more on programming and type checking time performance.
Makes heavy use of instance arguments.
Efficient decision procedures for natural number arithmetic (Tactic.Nat).
Evidence-producing and efficient gcd and primality testing (Data.Nat.GCD and Data.Nat.Prime).
This is very much work in progress, so expect major changes. In particular the proof-side of things is very much unstructured.