patty
Kind2
Our great sponsors
patty | Kind2 | |
---|---|---|
3 | 5 | |
263 | 2,748 | |
- | - | |
2.1 | 9.5 | |
about 1 year ago | over 1 year ago | |
Nim | 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.
patty
-
Removing Garbage Collection from the Rust Language (2013)
This comment is misleading &| misinformed.
Sum types are built-in [1] for formal parameters. `nil` is only for `ref|ptr` types. In much code you can just use stack allocated value types and there is neither GC concern nor nil concern, but there is also a mode to help: https://nim-lang.github.io/Nim/manual_experimental_strictnot...
Nim has an easy-ish to use Lisp-like syntax macro system where you just receive & process an AST. So, to do the rest you can make libraries adding the feature without relying upon upstream compiler: such as https://github.com/beef331/sumtypes for variables with sum types or pattern matching libs like https://andreaferretti.github.io/patty/ | https://github.com/alehander92/gara.
- What would be your “perfect” programming language?
-
Patten Matching in Nim
...except that macros don't change the syntax of the language! They just offer convenience on top of it, most common example is the `=>` lambda operator from the `sugar` module. I do agree, that the pattern matching macro presented in the article is a bit hard to get used to, but you don't have to, if you don't like pattern matching. And of course there are plenty of alternatives available as well, the simplest one imo is https://github.com/andreaferretti/patty
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?
What are some alternatives?
nimble - Package manager for the Nim programming language.
brainfuck-web-app - a web app written in Brainfuck that returns your user-agent to you
samsara - a reference-counting cycle collection library in rust
Loritta - 💁 A multipurpose, multilanguage, customizable, modular, and very cute bot for Discord! ~Making your server more awesome~
nitter - Alternative Twitter front-end
smalltt - Demo for high-performance type theory elaboration
union - Anonymous unions in Nim
Functional-Benchmarks - Collection of benchmarks of functional programming languages and proof assistants.
nimlings - Learn the Nim programming language by fixing tiny broken programs.
z3 - The Z3 Theorem Prover
sumtypes - Easy to use Nim sum type library
agda2hs - Compiling Agda code to readable Haskell