Elementary-Affine-Type-Theor
Kind
Our great sponsors
Elementary-Affine-Type-Theor | Kind | |
---|---|---|
1 | 21 | |
- | 2,565 | |
- | - | |
- | 9.5 | |
- | over 1 year ago | |
Rust | ||
- | 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.
Elementary-Affine-Type-Theor
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!
What are some alternatives?
constraints - An experiment in writing algebraic constraint solvers for 3D CAD
HVM - A massively parallel, optimal functional runtime in Rust
Fornjot - The world needs another CAD program.
opencascade.js - Port of the OpenCascade CAD library to JavaScript and WebAssembly via Emscripten.
truck - Truck is a Rust CAD Kernel.
CascadeStudio - A Full Live-Scripted CAD Kernel in the Browser
openscad - OpenSCAD - The Programmers Solid 3D CAD Modeller
urweb - The Ur/Web programming language
arcs
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.
arcade - A rust CAD engine (NURBS kernel)
awesome-programming-languages - The list of an awesome programming languages that you might be interested in