batterseapower

9 ms·

31.
by batterseapower 10y ago
Hydra ( https://nixos.org/hydra/ ) addresses a couple of these concerns as well, specifically the snowflakiness and version controlled config.
32.
by batterseapower 10y ago
By "stored procedures" the author seems to mean what is more usually described as "prepared statements": https://docs.voltdb.com/UsingVoltDB/DesignProcAnatomy.php#De...
33.
by batterseapower 11y ago
Oh hey, it's my blog post. I reported this to Oracle about 3 months ago (ref JI-9024492) but haven't heard anything since 2015-09-29, when they contacted me asking for some code to reproduce the issue (which I gave to them on the
34.
by batterseapower 11y ago
The FTSE 100 total return index is at 5,898.87 i.e. the levels of November 2012: https://www.google.com/finance?cid=15424700
35.
by batterseapower 13y ago
Thinking about this from a Haskell perspective, it seems that with promises the lambda waiting for the callback is basically encapsulated into the promise: type Promise a = (a -> IO ()) -> IO () getData :: Promise String Wher
36.
by batterseapower 13y ago
A while ago I wrote a Haskell compiler for a simple functional language that uses the JIT features of LLVM in order to make the Haskell-level "compile" function lazy in the term being compiled. Quite a fun trick I thought: https:
37.
by batterseapower 13y ago
This is just the Church encoding of Haskell's Maybe type. It is indeed a powerful way to simulate algebraic sum types when you only have product types in your language.
38.
by batterseapower 13y ago
All enum types look a bit sad when you're used to the full algebraic sum types + pattern matching provided by a functional language
39.
by batterseapower 14y ago
Previously on HN: http://news.ycombinator.com/item?id=2940505
40.
by batterseapower 14y ago
As soon as I stopped building computers from off-the-shelf parts, stopped installing unpopular applications and plugins and stopped trying to use OSes like Linux with relatively few users the amount of my life I spent fixing weird computer
41.
by batterseapower 14y ago
Pedants would add that the analogy with number of inhabitants is all a little screwed up in Haskell since bottom is an implicit inhabitant of all data types, which means that e.g. Either Void () has a different number of inhabitants than ()
42.
by batterseapower 14y ago
In Haskell at least you do not have to explicitly yield. Instead, any call to the garbage collector is treated as a possible yield point (so it's possible to hog a CPU if you write a non-allocating loop). Not sure what to say about your sec
43.
by batterseapower 14y ago
I had lunch with him yesterday and I can assure you that scaling down his involvement with Haskell is the furthest thing from his mind. In fact, a number of his side projects have recently reached a point where he will have even more time t
44.
by batterseapower 14y ago
Perhaps you are looking for http://www.haskell.org/pipermail/haskell/2012-November/02356...
45.
by batterseapower 14y ago
I'm glad you liked my package. Let me just plug my related package ansi-wl-pprint ( http://hackage.haskell.org/package/ansi-wl-pprint-0.6.4 ) which (I think) is an even more convenient interface to ANSI text colouring for most programs.
46.
by batterseapower 14y ago
I think you might have misinterpreted the contents of that page. As someone who has worked on GHC, I can assure you that it does perform tail call optimisation.
47.
by batterseapower 14y ago
I can't imagine this advertising method is cost effective once the novelty value has worn off, so I can't really see this being a major environmental issue.
48.
by batterseapower 14y ago
Basically, it inlines across module boundaries (except where such modules are mutually recursive).
49.
by batterseapower 14y ago
Monads are to state as fruits are to apples: one of their applications (and probably the most common one) is for state, but it's by no means the only application.
50.
by batterseapower 14y ago
id x = id x
51.
by batterseapower 14y ago
I find this happens a lot with Haskell. I can write hundreds of lines of code and have them work perfectly as soon as I get a error-free and warning-free compilation. The type system is definitely a big part of this, but almost as important
52.
by batterseapower 14y ago
I'm pretty sure you can use the tradeable assets in your films without owning them. You only need to have them in your inventory if you want to use them in the game proper.
53.
by batterseapower 14y ago
Apparently identifier lookup is done case-insensitively...
54.
by batterseapower 14y ago
I think it was pretty interesting, first time I've heard of OCSP stapling. Apparently the AES-NI stuff is actually already part of the public OpenSSL codebase: http://datacenteroverlords.com/2011/09/07/aes-ni-pimp-your-a...
55.
by batterseapower 14y ago
This explanation is unlikely because the same pattern was repeated in the results from the UK.
56.
by batterseapower 14y ago
On the face of it this doesn't sale make a lot of economic sense, so this says to me that signalling to customers and employees that 37 signals is serious about focus is worth $18k a month to them. Viewed from this perspective the decisio
57.
by batterseapower 14y ago
You may already know this, but uTP's congestion control algorithm is usable with vanilla TCP, where it is called LEDBAT ( http://tools.ietf.org/html/draft-ietf-ledbat-congestion-01 ). Of course, from the perspective of a Bittorrent client a
58.
by batterseapower 14y ago
Simple things can be done simply in Haskell too. It is straightforward to write an emulator without any monads, typeclasses and so forth. The reason the code here looks so complex is that Jaspers implementation adds additional abstractions
59.
by batterseapower 15y ago
"something is making them uncomfortable, and so they attack it on “rational” grounds" I don't think this is confined to just geek behaviour -- in my experience, it is typical human behaviour.
60.
by batterseapower 15y ago
Haskell.org has been accepted this year despite its non-presence on the list.

More ›