Only glanced through the paper on mutable value semantics (MVS). Which appears to be the differentiator of this from Rust.
The claim is that MVS enables mutable operations safely without the complexity of Rust - but still high performance.
“Mutable value semantics (MVS) sits at third point in the
design space where both goals are satisfied and mutation is
supported, without the complexity inherent to flow-sensitive
type systems. The key to this balance is simple: MVS does not
surface references as a first-class concept in the programming
model. As such, they can neither be assigned to a variable nor
stored in object fields, and all values form disjoint topological
trees rooted in the program’s variables”
You are not logged in. However you can subscribe from another Fediverse account, for example Lemmy or Mastodon. To do this, paste the following into the search field of your instance: !programming@programming.dev
Welcome to the main community in programming.dev! Feel free to post anything relating to programming here!
Cross posting is strongly encouraged in the instance. If you feel your post or another person’s post makes sense in another community cross post into it.
Hope you enjoy the instance!
Rules
Rules
Follow the programming.dev instance rules
Keep content related to programming in some way
If you’re posting long videos try to add in some form of tldr for those who don’t want to watch videos
Only glanced through the paper on mutable value semantics (MVS). Which appears to be the differentiator of this from Rust.
The claim is that MVS enables mutable operations safely without the complexity of Rust - but still high performance.
“Mutable value semantics (MVS) sits at third point in the design space where both goals are satisfied and mutation is supported, without the complexity inherent to flow-sensitive type systems. The key to this balance is simple: MVS does not surface references as a first-class concept in the programming model. As such, they can neither be assigned to a variable nor stored in object fields, and all values form disjoint topological trees rooted in the program’s variables”