awesome-rust-formalized-reasoning VS Formality

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.

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

Also, my current work is using Kind as a foundation, the purpose of this language is exactly what you have asked for, give a check on https://github.com/uwu-tech/Kind.

Kind has a "how I learned to stop worrying and love the `Type:Type`" vibe. That doesn't make it invalid as a proof language. It just inverts the priority: instead of consistency being the default and expressivity being opt-in (as in Agda, with the `type-in-type` pragma), it is expressive by default, and consistency is an opt-in. I strongly believe that is the right way. We plan to add opt-in termination (thus consistency) checkers, it is just not an immediate priority, but the language is completely ready for that. About `Type in Type` specifically, keep in mind that there are consistent, interesting type theories that feature `Type in Type`. So it isn't problematic in itself, and removing it seems wrong.

About erasure, you can flag an argument as computationally irrelevant by writing `` instead of `(x: A)`. So, for example, in the [Vector/concat.kind](https://github.com/uwu-tech/Kind/blob/master/base/Vector/con...) file, `A`, `n` and `m` are erased. As such, the length of the vector doesn't affect the runtime. As a good practice, you may also write `f` instead of `f(x)` syntax for erased arguments, but that is optional.

> TL;DR -- I think the language looks nice, and the compile to JS (from what I read of the Formcore source) looks to be well done. Also, the docs that are present are well presented in a non-academic way that I find pretty readable.

Thanks for the kind words. We put a lot of effort on the compilers and, while there is still a lot to improve, I'm confident they're ahead of all the other languages, by far.

Yes! We're 1 file away from supporting a Python (and any other) back-end. For example, [this](https://github.com/uwu-tech/Kind/blob/master/base/Kind/Comp/...) is the simplified JS back-end. If you just copy/paste that file and edit the syntax to Python instead, we'll have a Python back-end. That kind of contribution is always welcome.

Kind is a functional, general-purpose programming language featuring theorems and proofs. It has the smallest core, a pretty solid JavaScript and Scheme compiler (seriously, check how clean is the generated kind.js), and a syntax that is a middle ground between Haskell and TypeScript, in an attempt to make it more accessible.

Hello! Kind is a functional programming language based on self types that has the smallest core, pretty solid JavaScript and Scheme compilers (seriously, check how clean is the generated kind.js is), and a syntax that is a middle ground between Haskell and TypeScript, in an attempt to make it more accessible. In short, it is a general-purpose, practical functional featuring featuring theorems and proofs. Kind still has a lot to evolve, but, at this point in time, it is one of the most mature proof languages in some aspects. We do research related to optimal evaluators, we explore self types, we build web apps (most are in development, but the performance is stellar), and we're close to have great inter-op with Haskell (one file away), EVM compilers (a linearity-checker away). All in all, I believe Kind is a great addition to the functional programming community. We are a small, mostly self-funded team.

I'm writing CONTRIBUTE.md right now.

I mean, I could be ignorant about Elixir, but the first thing you do when programming in a language like Kind, Agda, is modeling your problem with types. Everything follows from that. Elixir doesn't even have sum types! It seems like you can't even express very basic concepts like List, Either, Maybe, List, Monad directly. Let alone more sophisticate concepts like subsets, propositional equality, logical negation? I see libs like this which "implement" half-baked, wrong versions of these concepts in contrived ways. Let me know if I'm wrong, but if you can't even translate the first lines of a Kind program in Elixir, I really can't see it as the same thing, at all. Not being elitist! Just saying these are not the same - and that is okay.