Kind2
Functional-Benchmarks
| Kind2 | Functional-Benchmarks | |
|---|---|---|
| 5 | 3 | |
| 2,748 | 32 | |
| - | - | |
| 9.5 | 4.2 | |
| over 1 year ago | 11 months ago | |
| Rust | Lean | |
| 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?
Functional-Benchmarks
-
First (1/5) steps with HVM, A massively parallel, optimal functional runtime in Rust
By leveraging HVM's speed and paralelism, Kind manages to be faster than all the big name proof assistants.
-
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.
What are some alternatives?
brainfuck-web-app - a web app written in Brainfuck that returns your user-agent to you
Kind - A next-gen functional language
Loritta - 💁 A multipurpose, multilanguage, customizable, modular, and very cute bot for Discord! ~Making your server more awesome~
llvm-project - The LLVM Project is a collection of modular and reusable compiler and toolchain technologies.
smalltt - Demo for high-performance type theory elaboration
hvmcc
z3 - The Z3 Theorem Prover
fir
agda2hs - Compiling Agda code to readable Haskell
HVM - A massively parallel, optimal functional runtime in Rust
macro-lisp - Lisp-like DSL for Rust language