Hacker News new | ask | show | jobs
by bruce343434 1739 days ago
> It pursues its minimal language design further after removing several features from Go like pointers, mutability, method syntax, global variables, *circular references*, etc.

So no graphs? Or more complex data structures?

1 comments

We can still represent graphs expressing references explicitly, for example, using hash maps. Here, I just wanted to point out no circular references "on memory" in the language. It might be interesting for you to take a look at documentation of Rust or Koka and how they represent those data structures!