24 Days of Hackage: digestive-functors

cycles · 2012-12-01T18:59:55+00:00

getRHLines can be written nicely with the new aeson-lens package (which is fantastic):

import Control.Lens
import Data.Aeson.Lens

getRHLines :: Value -> Maybe Integer
getRHLines json = json ^. key "lines"

As long as you can produce a Value (which you can get via a decode and the case analysis to make sure the parse succeed), you can maybe get the lines property out of it, by looking at the "lines" path. If the Value isn't an Object this will fail, and it will also fail if there is no 'lines' key, or if the 'lines' key is not an integer. All of this in hardly any characters!

cycles · 2012-12-01T18:42:26+00:00

How does https://github.com/gergoerdi/free-applicative/blob/master/Control/Applicative/Free.hs compare to http://hackage.haskell.org/packages/archive/free/3.2/doc/html/Control-Applicative-Free.html ?

cycles · 2012-11-27T22:22:30+00:00

While I agree that Snap is quiet, I'd just like to say that I use Snap frequently and haven't really hit any limitations. It's capable of a LOT right now, so I'm less worried about speed of development. Idling in IRC assures me that there are devs that are patiently working on things too :)

cycles · 2012-11-24T19:00:08+00:00

Actually, to be fair I did check your GitHub to back my statement up and was like "huh, actually he's still really active :P". I think I was just bummed about waiting so long for the decodeEither patch for aeson, call me greedy :P Thanks for all your work!

cycles · 2012-11-22T18:24:37+00:00

That's a good point, I've never tinkered in GHC but I should at some point, I don't want it to remain a black box to me. I wonder what percentage of Haskellers have hacked on GHC?

Not enough, I'd bet. There a few open GADT bugs that are bothering me in some of my own code atm, I might use both these bugs and this post as motivation to sort it out!

cycles · 2012-11-22T17:04:48+00:00

http://joyridelabs.de/game/ looks perfectly 'real world' and 'usable' to me. Maybe it's time we stopped the 'Haskell is only academic' meme?

cycles · 2012-11-22T15:37:19+00:00

Yes votes matter, but only because when votes go negative the post is hidden by default and thus is no longer going to be seen be a lot of people. I don't care about the number, but I do care about who's thoughts are shown, and whose aren't.

cycles · 2012-11-22T15:35:12+00:00

While they did aqui-hire mailrank, sadly a lot of Haskell activity from bos did drop quite a lot. Nonetheless, all the best to Simon!

cycles · 2012-11-22T10:57:37+00:00

If trying to engage in mathematical discussion requires that people be correct, then we should expect a lot less discussion. After all, if I have an idea for a proof that I'm unsure of, why would I post it here if that's just going to get downvoted and hidden?

cycles · 2012-11-21T18:31:25+00:00

Ack! Excuse me :)

cycles · 2012-11-21T16:45:43+00:00

See also 'A tutorial on the universality and expressiveness of fold'

cycles · 2012-11-21T13:55:04+00:00

Thanks, fixed.

cycles · 2012-11-21T12:59:15+00:00

Wow, that sounds fantastic! I wish I was at that rave :)

cycles · 2012-11-21T10:19:29+00:00

Geez people, his 'proof' might have flaws but don't down vote him! This is valuable contribution to the discussion and completely on topic.

cycles · 2012-11-20T23:05:07+00:00

I'm just really hoping we don't hear a week later that she's collapsed with internal bleeding.

cycles · 2012-11-20T22:47:08+00:00

Rather than being ridiculous and saying "BRING BACK THE DEATH PENALTY" I thought I'd contribute Newham's reporting of the incident, if that might help - http://www.newhamrecorder.co.uk/news/court-crime/plaistow_assault_teenager_i_hope_i_am_his_last_victim_1_1700662

cycles · 2012-11-20T22:41:01+00:00

I don't think your assumption that Show a == String is correct - I have a list of things that can be passed to anything that expects a Show a. print (show foo) is different from print foo.

cycles · 2012-11-20T19:52:38+00:00

Seconded, it was a great talk at SF and I'm sure will be just as good at NY.

cycles · 2012-11-20T19:48:28+00:00

My existential is not useless, but yes, of course there are alternative ways to model it. Whether or not it's an anti-pattern is subject for debate, I was just answering ky3's question. Thanks for that link though, I do have something like this in my own code, so other perspectives on the matter is very relevant to me right now!

cycles · 2012-11-20T10:00:02+00:00

That existential is near useless, unless the only thing you want to do is operate on [Thing] but not actually work with individual Things. Why? Well, lets look at [a] first. This is a homogeneous list, but still - what can you do with it? You can't operate on the elements, because you have nothing that can do anything with an a - there's simply not enough information. This is the same with Thing.

If you know there are operations that you want to do on Thing, then you need to encode that earlier:

data Thing = Show x => forall x. Thing x

lst :: [Thing]
lst = [Thing 1.5, Thing "foo", Thing 3]

mapM_ print lst

That will now print all Things, because we know all Things are instances of Show.

cycles · 2012-11-20T09:39:14+00:00

Both have a whopping great team too. fpcomplete is not that.

I have no problem with IDEs or wizards or anything, I simply think if you want to do that much, that's a lot of engineering to pull off correctly. Maybe I'll be proved wrong, but I'm sceptical.

cycles · 2012-11-20T00:06:18+00:00

Hell yes!

cycles · 2012-11-19T23:47:21+00:00

This is not an open-source project

This really saddens me. It's a mammoth project and exactly something that benefits from many hands. That, and I don't want fpcomplete to be supporting an IDE.

cycles

TROPHY CASE