miga

26 ms·

301.
by miga 14y ago
An example HN article about that: http://firstround.com/article/The-inside-story-of-how-382-re...
302.
by miga 14y ago
Same problem here. Because I am outside US, maybe?
303.
by miga 14y ago
Very appropriate for a chess server. Would like to have GO captcha too! :-)
304.
by miga 14y ago
I would rather recommend chapter on deterministic concurrency in this paper: http://community.haskell.org/~simonmar/par-tutorial.pdf [In particular `par` and promises.] This solution is quickest to debug, and most efficient. One can also
305.
by miga 14y ago
Times change. Interestingly enough, "fringe" languages were breathed new life with introduction of LLVM, and Haskell is no longer research project, so there are industry job offers there too. And we know what happened with "winners" within
306.
by miga 14y ago
Not any more...
307.
by miga 14y ago
Except that nowadays creativity develops best when you are proficient in programming!
308.
by miga 14y ago
Indeed the kind of argument is inappropriate to say the least. Information content below 4bit in a whole message?
309.
by miga 14y ago
I recall similar results on nearly all applications since my late MSc study: Mutexes are bad, pipes and sockets give better scaling. Thread sync primitives just sometimes scale up to 8-12 cores, but indeed multiprocess applications usually
310.
by miga 14y ago
Please support git fast-forward!
311.
by miga 14y ago
Well, it didn't recognize pi.
312.
Wireless gadgets track illegally cut Amazon trees(gemalto.com)
1 points by miga 14y ago|0 comments
313.
Sugar Haskell tries to catch on syntactic extensibility of Lisp(informatik.uni-marburg.de)
5 points by miga 14y ago|0 comments
314.
by miga 14y ago
As a user of X31, X41, X301, I expect that X220 or X1 will give you resistance to direct spills on the keyboard, and accidental dropping to the floor and convenient experience. But wouldn't try any GPU development there. If you want fast co
315.
by miga 14y ago
I assume you don't have your pet project then. Otherwise, you wouldn't ask :-). Normally the most difficult part is adapting your code (if exists) to the supercomputer anyway. What about cross-referencing non-coding parts of all existing ge