koka
HVM
Our great sponsors
koka | HVM | |
---|---|---|
31 | 107 | |
3,040 | 7,101 | |
1.6% | 2.5% | |
9.8 | 6.7 | |
12 days ago | about 2 months ago | |
Haskell | Rust | |
GNU General Public License v3.0 or later | 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.
koka
- Koka v3 Released
-
Koka: A fast functional programming language with algebraic effects
This post by the Koka-author is an update about what's currently being worked on: https://github.com/koka-lang/koka/discussions/339
-
Not Use Path Based Imports
Some programming language like JS, use path-based imports, that's not good for making a stabel API.
See https://api-extractor.com/pages/setup/configure_rollup/#:~:text=(The%20API%20Extractor,with%20that%20effort.)
And https://github.com/koka-lang/koka/issues/31#issuecomment-1482200826
-
What features would you want in a new programming language?
It also offers a great Inversion of Control mechanism where everything is customisable, and, unlike Capability Objects, AESs also offer compatibility with type inference (you can pass functions doing IO to map, and it Just Works(TM)) and first-class control over stack frames (because really a continuation function is just some stack frames, which you can manually move to the heap if you want a closure; which means async is an effect!). It also is composable in ways Monads are not.
-
What are you doing about async programming models? Best? Worst? Strengths? Weaknesses?
Koka and other languages implementing Algebraic Effect Systems make everything a user-defined case of coroutines: async is just another effect/Monadic type. Zig does something similar by having first class stack frames, making all function calls possibly asynchronous.
-
Letlang, a programming language targetting Rust - Road to v0.1
Super interesting, there is a proposal to add this to JavaScript and several languages that use this, unison, koka & eff. I had no idea this was even a thing!
-
Let's collect relatively new research programming languages in this thread
Koka, already cited in this thread, early 2010s. Koka's first claim to fame was a usable effect system (at the type were, basically, effect systems were not usable in practice; in fact few languages have managed to do as well as Koka since). Now its author is working on cool implementation strategies for functional languages as well.
-
[Offer] Tutoring for Computer Science / Programming / Software Engineering topics
I'm a software engineer with 3 years of professional experience. I worked for 2 years at Microsoft on Azure Compute and now work at Google, working on improving Google search. I am the sole maintainer of the popular open-source library microlens with 80k downloads. I've also contributed to the Koka programming language developed at Microsoft Research.
-
Implementing the Perceus reference counting GC
By implementing all of those optimizations in the Koka programming language, they achieved GC overhead much less and execution time faster than the other languages including OCaml, Haskell, and even C++ in several algorithms and data structures that frequently keep common sub-structures of them, such as red-black trees. For more information, see the latest version of the paper.
- Creator of SerenityOS announces new Jakt programming language effort
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.
What are some alternatives?
effekt - A research language with effect handlers and lightweight effect polymorphism
Kind - A next-gen functional language [Moved to: https://github.com/Kindelia/Kind2]
rust - Empowering everyone to build reliable and efficient software.
rust-gpu - 🐉 Making Rust a first-class language and ecosystem for GPU shaders 🚧
wasm-effect-handlers - WebAssembly specification, reference interpreter, and test suite with effect handlers extension.
SICL - A fresh implementation of Common Lisp
FStar - A Proof-oriented Programming Language
Sharp-Bilinear-Shaders - sharp bilinear shaders for RetroPie, Recalbox and Libretro for sharp pixels without pixel wobble and minimal blurring
dafny - Dafny is a verification-aware programming language
fslang-suggestions - The place to make suggestions, discuss and vote on F# language and core library features
zig - General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.
atom - A DSL for embedded hard realtime applications.