7 ms·

The tutorial contains a nice overview of the language: https://github.com/pika/LinearML/wiki/Tutorial https://github.com/pika/LinearML/wiki/Tutorial The most

The tutorial contains a nice overview of the language: https://github.com/pika/LinearML/wiki/Tutorial https://github.com/pika/LinearML/wiki/Tutorial 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.

eru 16y ago
Sounds a bit like Clean.
- jemfinch 16y ago
  Linear types are unrelated to uniqueness types.
  - eru 16y ago
    The linked tutorial says: >>> 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 ! <<<
ejones 16y ago
Indeed. Linear Lisp promises the same thing (http://www.deepdyve.com/lp/association-for-computing-machinery/lively-linear-lisp-look-ma-no-garbage-LvEqZZStmU http://www.deepdyve.com/lp/association-for-computing-machine...) and perhaps Linear Joy (http://osdir.com/ml/lang.concatenative/2005-10/msg00009.html http://osdir.com/ml/lang.concatenative/2005-10/msg00009.html)... 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?
- hga 16y ago
  Henry Baker has copies of many/most/nearly all of his papers on his home page, in this case: http://home.pipeline.com/~hbaker1/LinearLisp.html http://home.pipeline.com/~hbaker1/LinearLisp.html
tianyicui 16y ago
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.

eru 16y ago

Sounds a bit like Clean.

jemfinch 16y ago
Linear types are unrelated to uniqueness types.
- eru 16y ago
  The linked tutorial says: >>> 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 ! <<<

ejones 16y ago

Indeed. Linear Lisp promises the same thing (http://www.deepdyve.com/lp/association-for-computing-machinery/lively-linear-lisp-look-ma-no-garbage-LvEqZZStmU http://www.deepdyve.com/lp/association-for-computing-machine...) and perhaps Linear Joy (http://osdir.com/ml/lang.concatenative/2005-10/msg00009.html http://osdir.com/ml/lang.concatenative/2005-10/msg00009.html)... 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?

hga 16y ago
Henry Baker has copies of many/most/nearly all of his papers on his home page, in this case: http://home.pipeline.com/~hbaker1/LinearLisp.html http://home.pipeline.com/~hbaker1/LinearLisp.html

tianyicui 16y ago

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.