Kind2
sdl-gpu-hs
Kind2 | sdl-gpu-hs | |
---|---|---|
5 | 4 | |
2,748 | - | |
- | - | |
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.
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?
sdl-gpu-hs
-
3D graphics on Haskell in 2023
The bindings are currently source-only here. I am going to release to Hackage soon (tm), but I just haven't had the time to button it up. However, they do work great. Every game I've done for Ludum Dare except 47 (which was gloss) has used these bindings.
-
Monthly Hask Anything (January 2023)
The guts are in the Memorable module. There are some operators in there that allow you to pluck individual fields from struct pointers in IO instead of marshaling entire structs needlessly.
-
Haskell is the greatest programming language of all time
The games are built on a custom "engine" made with SDL2 and some other C libraries I wrote bindings for: sdl-gpu, cute_c2, and cute_sound. I use apecs and cleff for the general architecture. And for animations, I use a combination of animate and ease.
-
Linear Types AmA!
You can't exactly allocate data in this custom memory management system, but you can get close with some type-level/generics stuff I think. I've been playing with it quite a bit for no-marshal hsc FFI bindings [1] [2], and it's worked nicely for that in raw IO. With some extra elbow grease, I can probably make it work for pure linear code too.
What are some alternatives?
brainfuck-web-app - a web app written in Brainfuck that returns your user-agent to you
agda2hs - Compiling Agda code to readable Haskell
Loritta - 💁 A multipurpose, multilanguage, customizable, modular, and very cute bot for Discord! ~Making your server more awesome~
really-small-backpack-example - A really small example of the Backpack module system for Haskell
smalltt - Demo for high-performance type theory elaboration
libspng - Haskell bindings for libspng
Functional-Benchmarks - Collection of benchmarks of functional programming languages and proof assistants.
macaroni.nix
z3 - The Z3 Theorem Prover
cute-c2-hs
ghc-proposals - Proposed compiler and language changes for GHC and GHC/Haskell