HVM
kanal
| HVM | kanal | |
|---|---|---|
| 107 | 7 | |
| 7,156 | 1,250 | |
| 2.4% | - | |
| 6.7 | 5.4 | |
| 2 months ago | 21 days ago | |
| Rust | Rust | |
| MIT License | 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.
HVM
-
SaberVM
Reminds me of HVM[0]
[0]https://github.com/HigherOrderCO/HVM
Really interesting to see how new lang concepts and refinements keep popping up this last decade, between Vale, Gleam, Hylo, Austral...
Linear types really opened up lots of ways to improve memory management and compilation improvements.
- GPU Survival Toolkit for the AI age: The bare minimum every developer must know
-
A new F# compiler feature: graph-based type-checking
I have a tangential question that is related to this cool new feature.
Warning: the question I ask comes from a part of my brain that is currently melted due to heavy thinking.
Context: I write a fair amount of Clojure, and in Lisps the code itself is a tree. Just like this F# parallel graph type-checker. In Lisps, one would use Macros to perform compile-time computation to accomplish something like this, I think.
More context: Idris2 allows for first class type-driven development, where the types are passed around and used to formally specify program behavior, even down to the value of a particular definition.
Given that this F# feature enables parallel analysis, wouldn't it make sense to do all of our development in a Lisp-like Trie structure where the types are simply part of the program itself, like in Idris2?
Also related, is this similar to how HVM works with their "Interaction nets"?
https://github.com/HigherOrderCO/HVM
https://www.idris-lang.org/
https://clojure.org/
I'm afraid I don't even understand what the difference between code, data, and types are anymore... it used to make sense, but these new languages have dissolved those boundaries in my mind, and I am not sure how to build it back up again.
-
A History of Functional Hardware
Impressive presentation but I find two things missing in particular:
* GRIN [1] - arguably a breakthrough in FP compilation; there are several implementation based on this
* HVM [2] - parallel optimal reduction. The results are very impressive.
[1] https://link.springer.com/chapter/10.1007/3-540-63237-9_19
[2] https://github.com/HigherOrderCO/HVM
-
Is the abstraction of lazy-functional-purity doomed to leak?
Purity has nothing to do with memoization. Haskell's semantics never "rewrite under a lambda" (unlike, e.g. HVM). Calling (\_ -> e) () twice will (modulo optimizations) always perform the computation in e twice.
-
Can one use lambda calculus as an IR?
The most recent exploration of this, that I'm aware of is HVM (another intermediate language / runtime), although this one is not actually based on the lambda calculus, but on the interaction calculus.
-
The Rust I Wanted Had No Future
Then, actually unrelated but worth mentioning: HVM. Finally, something new on the functional front that isn't dependent types!
- The Halting Problem Is Decidable on a Set of Asymptotic Probability One (2006)
-
Bachelor Thesis Topic
If you are into functional PL, how about https://github.com/HigherOrderCO/HVM? You could experiment if you could schedule that on a GPU?
-
For those of you self taught,how did you cope with distractions while using a computer ?
In the interest of seeking ways of optimizing my code, I stumbled upon http://www.rntz.net/datafun/ as a means to do incremental computations of fixpoints while avoiding redundant work. And also the idea of automatic parallelism achieved by using Interaction Nets as a model of computation https://github.com/HigherOrderCO/HVM.
kanal
-
I've incidentally created one of the fastest bounded MPSC queue
How does it compare to kanal?
- GitHub - fereidani/kanal: The fast sync and async channel that Rust deserves
-
Which async channel is best?
kanal is a quite recent crate with outstanding performance characteristics. Though it is still quite new. tokio is also very good.
- Kanal: Channels 80x faster than the standard library!
-
Fast sync and async channel, to bring the best of both worlds together.
Thanks both of you, I fixed it with this commit: https://github.com/fereidani/kanal/commit/8a4df536c5723acce491f34a3b1014d00e407187
What are some alternatives?
Kind - A next-gen functional language [Moved to: https://github.com/Kindelia/Kind2]
unsafe-code-guidelines - Forum for discussion about what unsafe code can and can't do
rust-gpu - 🐉 Making Rust a first-class language and ecosystem for GPU shaders 🚧
rust-channel-benchmarks - rust channel benchmarks to keep stat of performance of Kanal library in comparison with other competitors.
SICL - A fresh implementation of Common Lisp
ScyllaDB Async Rust Driver - Async CQL driver for Rust, optimized for ScyllaDB
Sharp-Bilinear-Shaders - sharp bilinear shaders for RetroPie, Recalbox and Libretro for sharp pixels without pixel wobble and minimal blurring
crossbeam - Tools for concurrent programming in Rust
fslang-suggestions - The place to make suggestions, discuss and vote on F# language and core library features
rust - Empowering everyone to build reliable and efficient software.
atom - A DSL for embedded hard realtime applications.
loole - A safe sync/async multi-producer, multi-consumer channel