The most interesting feature is the use of linear types to statically ensure sound usage of resources, including memory, in other words, no garbage collector.
It seems that when you do that, though, and especially from looking at the tutorial, you end up with semantics that are a) fundamentally different from GC-ed semantics, and b) explicit about memory management. But perhaps it amounts to a kind of type-safe memory management?
The tutorial is different from the article most people want. Most people just want something highlight the uniqueness of this language, not how to represent list and array. I like the kind of article explaining something (e.g. a particular parallel algorithm) used to be difficult in conventional languages but not in this new one.
>>> Some people will argue that these are in fact "unique types" as opposed to "linear types", the difference being subtle (a unique type enforces that only ONE pointer exists at any given time, a linear type enforces that the amount of pointers is stable). However, you will often see unique types been called linear types in the litterature, and if P. Wadler can do it, so can I ! <<<
The readme on the github page doesn't contain much more information than the title on HN.
I can't quickly evaluate whether this is worth downloading, configuring, and installing.
Maybe its just me, but I don't like HN submissions that point to github repositories, with skeleton readmes - I think we could do better.