Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
eagle2001
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
1.
▲
by
eagle2001
9y ago
+1
2.
▲
by
eagle2001
9y ago
The LtU blurb says "a variant of Haskell", but the github readme does not mention non-strict. Strict or not?
3.
▲
by
eagle2001
9y ago
> In short, we over-reward those at the top and dismiss the rest. This is standard tournament theory: big rewards at the top to provide a strong incentives for excellence. Look at the prize structure in sporting events and at the three-
4.
▲
by
eagle2001
12y ago
It's still early days for Julia, and performance is uneven. I wouldn't use it for serious work unless 1) an expert in your field is already using it (e.g. Udell and Convex.jl) or 2) you carefully benchmark your key computations.
5.
▲
by
eagle2001
12y ago
Can this be made to work with the ESS julia mode?
6.
▲
by
eagle2001
12y ago
"There are more advanced languages than Haskell, they aren't ML, and PL researchers/experimenters are still working out how to make them work nicely for day to day stuff." Examples, please. (I like bright, shiny things.