sixten
verona
Our great sponsors
sixten | verona | |
---|---|---|
5 | 20 | |
748 | 3,550 | |
- | 0.8% | |
1.8 | 6.6 | |
over 3 years ago | 5 days ago | |
Haskell | C++ | |
BSD 3-clause "New" or "Revised" 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.
sixten
-
What do Haskellers think about Rust?
Immutable data structures don't necessarily require more memory: they can avoid deep copies. They are also automatically thread safe without expensive (slow) locking mechanisms. They also don't necessarily reduce cache locality. The reduced cache locality in the case of Haskell (I think) mainly comes from the representation of objects in its implementation (improved STG) which uses extensive boxing and jumps that hinder both spatial and temporal locality (require review/comment from GHC/Computer Architecture experts, take it with a grain of salt). Objects can be much more efficiently represented if not for the need to implement lazy (call-by-need) semantics. See sixten and futhark for examples.
-
Not well known programming languages with interesting features?
[Sixten](https://github.com/ollef/sixten): functional programming with unboxed data by default.
-
Tree Sitter and the Complications of Parsing Languages
I can't answer this well and don't know of any resources, but I have seen it before in the parser for sixten:
https://github.com/ollef/sixten/blob/60d46eee20abd62599badea85774a9365c81af45/src/Frontend/Parse.hs#L458
-
What languages have bit struct / field constructs?
Sixten is a language that allows precise control over memory layout of algebraic data types.
-
Designing a language where all types are memcpy/blittable.
For something more peripherally related, check out Sixten. Its focus is on using unboxed value representations, which is in spirit close to what you are proposing, and some of its ideas might be good inspiration.
verona
-
Snmalloc: A Message Passing Allocator
According to this FAQ, snmalloc was designed for the Verona language:
https://microsoft.github.io/verona/faq.html
Unfortunately, I cannot find any significant code samples for Verona on the website or in the GitHub repo. There are a few types defined in a pretty low-level way:
https://github.com/microsoft/verona/tree/master/std/builtin
- Microsoft Project Verona, a research programming language
-
Making C++ Safe Without Borrow Checking, Reference Counting, or Tracing GC
I think the future lies in figuring out how to get the benefits of that secret sauce, while mitigating or avoiding the downsides.
Like Boats said, the borrow checker works really well with data, but not so well with resources. I'd also add that it works well with data transformation, but struggles with abstraction, both the good and bad kind. It works well with tree-shaped data, but struggles with programs where the data has more intra-relationships.
So if we can design some paradigms that can harness Rust's borrow checker's benefits without its drawbacks, that could be pretty stellar. Some promising directions off the top of my head:
* Vale-style "region borrowing" [0] layered on top of a more flexible mutably-aliasing model, either involving single-threaded RC (like in Nim) generational references (like in Vale).
* Forty2 [1] or Verona [2] isolation, which let us choose between arenas and GC for isolated subgraphs. Combining that with some annotations could be a real home run. I think Cone [3] was going in this direction for a while.
* Val's simplified borrowing (mutable value semantics) combined with some form of mutable aliasing (this might sound familiar).
[0] https://verdagon.dev/blog/zero-cost-borrowing-regions-part-1... (am author)
[1] http://forty2.is/
[2] https://github.com/microsoft/verona
[3] https://cone.jondgoodwin.com/
-
A Flexible Type System for Fearless Concurrency
Their approach lines up pretty well with how we do regions in Vale. [0]
Specifically, we consider the "spine" of a linked list to be in a separate "region" than the elements. This lets us freeze the spine, while keeping the elements mutable.
This mechanism is particularly promising because it likely means one can iterate over a collection with zero run-time overhead, without the normal restrictions of a more traditional Rust/Cyclone-like borrow checker. We'll know for sure when we finish part 3 (one-way isolation [1]); part 1 landed in the experimental branch only a few weeks ago.
The main difference between Vale and the paper's approach is that Vale doesn't assume that all elements are self-isolated fields, Vale allows references between elements and even references to the outside world. However, this does mean that Vale sometimes needs "region annotations", whereas the paper's system doesn't need any annotations at all, and that's a real strength of their method.
Other languages are experimenting with regions too, such as Forty2 [2] and Verona [3] though they're leaning more towards a garbage-collection-based approach.
Pretty exciting time for languages!
[0] https://verdagon.dev/blog/zero-cost-borrowing-regions-overvi...
[1] https://verdagon.dev/blog/zero-cost-borrowing-regions-part-3...
[2] http://forty2.is/
[3] https://github.com/microsoft/verona
- Microsoft is rewriting core Windows libraries in Rust
-
Microsoft is to enable Rust use for Windows 11 kernel
Does this count? https://microsoft.github.io/verona/
-
Microsoft rewriting core Windows libraries in Rust
What about new Rust that "Microsoft Research" trying to "explore" https://github.com/microsoft/verona/blob/master/docs/explore.md ?
- Concurrent ownership in Verona
- Concurrent Ownership in Verona
-
Pony Programming Language
Fun fact: the person who created Pony, Sylvan Clebsch, has been working on a Microsoft Research project called Verona. From it's README [0]:
> Project Verona is a research programming language to explore the concept of concurrent ownership. We are providing a new concurrency model that seamlessly integrates ownership.
https://github.com/microsoft/verona/tree/master
What are some alternatives?
atom-focus-mode - Atom editor extension - fades editor content and highlights only the lines you are working on
tour_of_rust - A tour of rust's language features
tree-hugger - A light-weight, extendable, high level, universal code parser built on top of tree-sitter
PurefunctionPipelineDataflow - My Blog: The Math-based Grand Unified Programming Theory: The Pure Function Pipeline Data Flow with principle-based Warehouse/Workshop Model
pony-tutorial - :horse: Tutorial for the Pony programming language
dolt - Dolt – Git for Data
felix - The Felix Programming Language
ante - A safe, easy systems language
vscode-theme-alabaster-dark - Dark version of alabaster ported from https://github.com/tonsky/sublime-scheme-alabaster
cone - Cone Programming Language