3 ms·
Just having a collection oriented interface is not enough. However, with aggressive deforestation and JIT it would make for an interesting rival. I think and ho
by srean 12y ago
Just having a collection oriented interface is not enough. However, with aggressive deforestation and JIT it would make for an interesting rival. I think and hope this is where Julia is headed.
The novelty of array languages lie not just in their semantics of acting on collections rather than items at a time. They shine when their interpreters are especially tuned for this use case. So in spite of being interpreted, these languages can be quite fast because once the interpreter dispatches to a(n ideally) hefty primitive that operates on collections, the interpreter gets out of the way for a while.
These languages are designed to express and, critically, also exploit low
(interpetation workload) / (computation workload)
This is a similar to the notion of minimizing communication per computation.
Assuming this post will attract some array language experts, may I ask what happened to Nial ?
@sedachv If you arent familiar already, Manticore might interest you. http://manticore.cs.uchicago.edu http://manticore.cs.uchicago.edu
- sedachv 12y ago> However, with aggressive deforestation and JIT it would make for an interesting rival. SERIES had a lot of early work in deforestation and almost made it into the Common Lisp standard: http://series.sourceforge.net/ http://series.sourceforge.net/ I want to see NESL (http://www.cs.cmu.edu/~scandal/nesl.html http://www.cs.cmu.edu/~scandal/nesl.html) brought back for modern systems. Even StarLisp (http://en.wikipedia.org/wiki/*Lisp http://en.wikipedia.org/wiki/*Lisp) makes Hadoop look absolutely retarded.
- mamcx 12y agoI ask about this on http://lambda-the-ultimate.org/node/5075 http://lambda-the-ultimate.org/node/5075. This make me understand how can be a interpreter be faster than C/compiled code. I'm interested in how exactly implement this stuff. Somebody suggest this link: http://sblom.github.io/openj-core/ioj.htm http://sblom.github.io/openj-core/ioj.htm I haven't digest it yet, but I wonder if exist a more "normal" implementation example, ie: How get the semantic/performance without use single letter commands/hyper-dense coding!. So, exist some code/tutorial in how do this as easy like http://journal.stuffwithstuff.com/2013/12/08/babys-first-garbage-collector/ http://journal.stuffwithstuff.com/2013/12/08/babys-first-gar...?