Kind2
agda2hs
| Kind2 | agda2hs | |
|---|---|---|
| 5 | 4 | |
| 2,748 | 167 | |
| - | 1.8% | |
| 9.5 | 9.4 | |
| over 1 year ago | 7 days ago | |
| Rust | Agda | |
| MIT License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Kind2
-
Haskell is the greatest programming language of all time
Agreed. Even from a PLT perspective, I prefer Kind2 by the Kindelia Foundation for supporting inductive theorem proving (and hopefully some level of dependent types), as well as being faster to boot.
-
HVM, the parallel functional runtime, will soon run on GPUs!
I agree. Keep in mind our language (Kind-Lang) does target the HVM, and it is really promising. The type-checker is the fastest among proof assistants, by far; the error messages are really nice; it has a fully dependent type system which is a breath of fresh air to work with. It is still not production ready though (mostly due to lack of IO), but is the extend of our effort on that direction. We hope other lang developers get encouraged to target the HVM to. Elm and Idris are great candidates for that IMO.
-
The Little Prover
Another very small proof system: https://github.com/moonad/formcorejs
The core implementation is under 700 lines of JS, including the parser: https://github.com/moonad/FormCoreJS/blob/master/FormCore.js
The author has since moved on to building a runtime with optimal evaluation (https://github.com/kindelia/hvm) and a new proof language on top of that (https://github.com/Kindelia/Kind2) with considerably better performance than existing proof systems.
- What would be your “perfect” programming language?
- [28/03 a 03/04] - O que você vai desenvolver essa semana?
agda2hs
-
Do you use Idris or Coq, and why?
My concrete long term strategy is to learn Agda well enough that I can write all logic exclusively in Agda and then extract Haskell through agda2hs.
- Agda2hs: Verified and readable Haskell code from Agda
-
Haskell is the greatest programming language of all time
Have you seen agda2hs?
-
agda2hs, verify your haskell code in agda?
The tool itself can be found here: https://github.com/agda/agda2hs
What are some alternatives?
brainfuck-web-app - a web app written in Brainfuck that returns your user-agent to you
sdl-gpu-hs
Loritta - 💁 A multipurpose, multilanguage, customizable, modular, and very cute bot for Discord! ~Making your server more awesome~
macaroni.nix
smalltt - Demo for high-performance type theory elaboration
really-small-backpack-example - A really small example of the Backpack module system for Haskell
Functional-Benchmarks - Collection of benchmarks of functional programming languages and proof assistants.
cute-sound-hs
z3 - The Z3 Theorem Prover
hs-to-coq - Convert Haskell source code to Coq source code.
HVM - A massively parallel, optimal functional runtime in Rust
notes