ruststep
Kind
Our great sponsors
ruststep | Kind | |
---|---|---|
3 | 21 | |
107 | 2,565 | |
2.8% | - | |
4.8 | 9.5 | |
4 months ago | over 1 year ago | |
Rust | Rust | |
Apache License 2.0 | 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.
ruststep
Kind
- 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.
-
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?"
- 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!
-
High level overview of the algorithm steps of Rust's borrow checker?
I really like the idea of ownership and ownership types / affine types, which it seems like the borrow checker implements (for garbage collection features and the general type theory benefits you get). Though I am no type theory expert, just been browsing around trying to figure out how the ideal compiler would work, finding things like lobster lang and kind lang along the way.
-
Beyond inductive datatypes: exploring Self types
The plan for Kind itself seems to be to allow possibly unsound expressions (for example that don’t terminate), but to have consistency checkers. See:
https://github.com/kind-lang/Kind/blob/master/CONTRIBUTE.md#...
What are some alternatives?
HVM - A massively parallel, optimal functional runtime in Rust
opencascade.js - Port of the OpenCascade CAD library to JavaScript and WebAssembly via Emscripten.
CascadeStudio - A Full Live-Scripted CAD Kernel in the Browser
urweb - The Ur/Web programming language
awesome-rust-formalized-reasoning - An exhaustive list of all Rust resources regarding automated or semi-automated formalization efforts in any area, constructive mathematics, formal algorithms, and program verification.
awesome-programming-languages - The list of an awesome programming languages that you might be interested in
tlaplus - TLC is a model checker for specifications written in TLA+. The TLA+Toolbox is an IDE for TLA+.
lobster - The Lobster Programming Language
truck - Truck is a Rust CAD Kernel.
frag - Frag is a 3D first person shooting game written in Haskell, by Mun Hon Cheong
fornjot - Early-stage b-rep CAD kernel, written in the Rust programming language.
coffeescript - Unfancy JavaScript