go-sumtype
HVM
go-sumtype | HVM | |
---|---|---|
11 | 107 | |
403 | 7,156 | |
- | 2.4% | |
0.0 | 6.7 | |
about 1 year ago | 2 months ago | |
Go | Rust | |
The Unlicense | 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.
go-sumtype
-
Small sum types in Golang
I find this implementation to be quite minimal and less clumsy than alternatives. Sure, you don't get nice exhaustive pattern matching. Also, type inference gets in the way when instantiating UserKey (though you can wrap it in constructor functions). But expressing your intent using types still makes your code much more convenient and easier to understand.
-
Switching from C++ to Rust
The call out to sum types is something I feel. I've been using Rust daily for almost 10 years now, and sum types are absolutely still one of the things I love most about it. It's easily one of the things I miss the most in other languages. I'm usually a proponent of "using languages as they're intended," but I missed exhaustiveness checking so much that I ported a version of it to Go[1] as a sort of lint.
[1]: https://github.com/BurntSushi/go-sumtype
-
Rusty enums in Go
A Google search for golang sum types currently shows my project as a second hit: https://github.com/BurntSushi/go-sumtype
-
Carbon Language: An experimental successor to C++
I've been writing Go and Rust nearly daily for about a decade now (Go is more than a decade, Rust is about 8 years). You are not going to teach me anything about the pros and cons of either language in a reddit comment. I do not need to be taught about the "iota mess" when I've written tooling for exhaustiveness checking in Go.
-
a go linter to check switch statements for default
https://github.com/BurntSushi/go-sumtype forces exhaustive type switches for interfaces specifically annotated to need that.
-
Go: Making state explicit using the type system
We can fix these two problems by relying on static analyzers such as go-sumtypes
-
Hacking sum types with Go generics
See also https://github.com/BurntSushi/go-sumtype
- What I'd like to see in Go 2.0
-
Upcoming Features in Go 1.18
go-sumtype[0] has completeness checking for sealed interfaces.
[0] https://github.com/BurntSushi/go-sumtype
-
I want enum more than generics
Pretty easy to achieve outside of the compiler: https://github.com/BurntSushi/go-sumtype
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?
go101 - An up-to-date (unofficial) knowledge base for Go programming self learning
Kind - A next-gen functional language [Moved to: https://github.com/Kindelia/Kind2]
enumer - A Go tool to auto generate methods for your enums
rust-gpu - 🐉 Making Rust a first-class language and ecosystem for GPU shaders 🚧
go - The Go programming language
SICL - A fresh implementation of Common Lisp
hylo - The Hylo programming language
Sharp-Bilinear-Shaders - sharp bilinear shaders for RetroPie, Recalbox and Libretro for sharp pixels without pixel wobble and minimal blurring
crubit
fslang-suggestions - The place to make suggestions, discuss and vote on F# language and core library features
mo - 🦄 Monads and popular FP abstractions, powered by Go 1.18+ Generics (Option, Result, Either...)
atom - A DSL for embedded hard realtime applications.