Kind
awesome-rust-formalized-reasoning
Our great sponsors
Kind | awesome-rust-formalized-reasoning | |
---|---|---|
21 | 3 | |
2,565 | 263 | |
- | - | |
9.5 | 7.6 | |
over 1 year ago | 10 days ago | |
Rust | ||
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.
Kind
-
Eliezer Yudkowsky has great news: "Parents conceiving today may have a fair chance of their kids living to see kindergarten."
As a developer of a proof assistant (Kind) I'm highly interested in this line of work. Can you point me to some of these papers? And perhaps people involved in this line of work?
- Somos os devs da HVM, o compilador Brasileiro que rodou o mundo. Vamos colocar nosso logo no /r/place?
-
A list of new budding programming languages and their interesting features?
Kind: A modern proof language (though functional).
- Fornjot: A next-generation Code-CAD application
-
How to handle list / contiguous array definition and implementation in a type system?
I have seen in languages like KindLang the definition of Array be like a Binary tree, but there is some magic there in the definition of the Array type that I don't understand yet. Also, I don't want to define the contiguous array further., it should be a literal contiguous array. The Kind "Word" type definition (arbitrary number of bytes) is closer to my contiguous array, but it has a similarly complex definition which like I said I don't understand.
-
Type Checking as Calculation
Totally agree about the Blub Paradox, but there's definitely value in Self Types. See, for example, [Kind](https://github.com/Kindelia/Kind), which is able to type recursive data types by using Self Types.
-
Please, keep in mind there is ZERO FUNDING for my projects.
For these who don't know, I'm the author of Kind and HVM. I've recently seen a criticism from an influent person in the community, who I often took as an inspiration, that made me really sad. "the guy behind this has built some impressive-sounding stuff before... it looks like his projects tend to just... go nowhere and he just abandons them and does something else?"
-
Is it possible to make join work for arbitrary depths?
This is very easy with dependent types! For example, in Kind:
- A massively parallel, optimal functional runtime in Rust
- Eu acabei de lançar um dos "compiladores" mais rápidos do mundo. Apoiem o trabalho brasileiro!
awesome-rust-formalized-reasoning
-
CreuSAT: Formally verified SAT solver written in Rust and verified with Creusot
Unsurprisingly, we can see a growing interest in the Rust ecosystem regarding formal verification. I try to keep https://github.com/newca12/awesome-rust-formalized-reasoning up to date. I will add CreuSAT shortly.
-
Kani Rust Verifier – a bit-precise model-checker for Rust
This dispersed progress is the sign of an absence of maturity but the exploration of this space with Rust is very promising : https://github.com/newca12/awesome-rust-formalized-reasoning
- Awesome-Rust-Formalized-Reasoning
What are some alternatives?
HVM - A massively parallel, optimal functional runtime in Rust
kani - Kani Rust Verifier
opencascade.js - Port of the OpenCascade CAD library to JavaScript and WebAssembly via Emscripten.
cicada - Cicada Language
CascadeStudio - A Full Live-Scripted CAD Kernel in the Browser
Formality - A modern proof language [Moved to: https://github.com/kind-lang/Kind]
urweb - The Ur/Web programming language
opennars - OpenNARS for Research 3.0+
awesome-programming-languages - The list of an awesome programming languages that you might be interested in
minisat - Minisat Haskell bundle
tlaplus - TLC is a model checker for specifications written in TLA+. The TLA+Toolbox is an IDE for TLA+.
tptp - Parser and pretty printer for the TPTP language