Re: [Haskell-cafe] why are applicative functors (often) faster than monads? (WAS Google Summer of Code - Lock-free data structures)

2012-04-20 Thread Ben
the sequencing matters for applicative functors. from McBride and Patterson [1]: "The idea is that 'pure' embeds pure computations into the pure fragment of an effectful world -- the resulting computations may thus be shunted around freely, as long as the order of the genuinely effectful compu

Re: [Haskell-cafe] why are applicative functors (often) faster than monads? (WAS Google Summer of Code - Lock-free data structures)

2012-04-20 Thread KC
Sorry, I thought you or someone was asking why are Applicative Functors faster in general than Monads. Functional programming is structured function calling to achieve a result where the functions can be evaluated in an unspecified order; I thought Applicative Functors had the same unspecified eva

Re: [Haskell-cafe] why are applicative functors (often) faster than monads? (WAS Google Summer of Code - Lock-free data structures)

2012-04-20 Thread Ben
i'm not sure what your email is pointing at. if it is unclear, i understand the difference between applicative and monadic. i suppose the easy answer to why applicative can be faster than monadic is that you can give a more specialized instance declaration. i was just wondering if there was a

Re: [Haskell-cafe] why are applicative functors (often) faster than monads? (WAS Google Summer of Code - Lock-free data structures)

2012-04-20 Thread KC
Think of the differences (and similarities) of Applicative Functors and Monads and the extra context that monads carry around. -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] TLS support for haskell-xmpp

2012-04-20 Thread John Goerzen
I'll probably give it a go then. Incidentally, I am not sure if the original author is responsive. I'm fixing some other bugs while I'm at it; would it be kosher for me to make a new version upload of it to Hackage in the event that the original author doesn't respond? -- John On 04/17/201

Re: [Haskell-cafe] [web-devel] http-enumerator: users?

2012-04-20 Thread Michael Litchard
If no one else wants to be responsible for maintaining, I vote for deprecation. On Thu, Apr 19, 2012 at 2:33 AM, Michael Snoyman wrote: > Hi all, > > I'm wondering if there are still active users out there of > http-enumerator. Four months ago I released http-conduit, and since > then, my develop

[Haskell-cafe] why are applicative functors (often) faster than monads? (WAS Google Summer of Code - Lock-free data structures)

2012-04-20 Thread Ben
heinrich and all -- thanks for the illuminating comments, as usual. i've had a little bit of time to play around with this and here's what i've concluded (hopefully i'm not mistaken.) 1 - while composeability makes STM a great silver bullet, there are other composable lower level paradigms.

Re: [Haskell-cafe] Fwd: Now Accepting Applications for Mentoring Organizations for GSoC 2012

2012-04-20 Thread Ryan Newton
Did anyone end up being the co-admin? On Thu, Mar 1, 2012 at 4:50 PM, Johan Tibell wrote: > On Thu, Mar 1, 2012 at 1:42 PM, Ganesh Sittampalam wrote: > >> On 01/03/2012 21:37, Johan Tibell wrote: >> > On Thu, Mar 1, 2012 at 12:54 PM, Ganesh Sittampalam > > > wrote: >> >

Re: [Haskell-cafe] Profiling with QtHaskell

2012-04-20 Thread Ivan Perez
FYI, you'll also have to compile all the dependencies with profiling on as well. On 20 April 2012 12:40, Øystein Kolsrud wrote: > Well, the problem was that I didn't know how to go about compiling it with > profiling support. Thanks for the tip! I'll try that out. > > /Øystein > > > On Fri, Apr 2

Re: [Haskell-cafe] Profiling with QtHaskell

2012-04-20 Thread Øystein Kolsrud
Well, the problem was that I didn't know how to go about compiling it with profiling support. Thanks for the tip! I'll try that out. /Øystein On Fri, Apr 20, 2012 at 12:08 PM, Stefan Kersten wrote: > On 20.04.12 10:07, Øystein Kolsrud wrote: > > Hi! Does anyone know if it is possible to use QtH

Re: [Haskell-cafe] Profiling with QtHaskell

2012-04-20 Thread Stefan Kersten
On 20.04.12 10:07, Øystein Kolsrud wrote: > Hi! Does anyone know if it is possible to use QtHaskell with profiling turned > on? afair i've used it when profiling an application (not qtHaskell itself). what's the problem you're running into? you need to compile the library with profiling support

Re: [Haskell-cafe] ANN: signed-multiset-0.1

2012-04-20 Thread Stefan Holdermans
Wren, >> For a specific example, I haven't the faintest intuition about >> what 'map' should do. Suppose we have >> {(k1)x1, (k2)x2} >> and f x1 == f x2 = y. Should the value of map f {...} be >> {(k1+k2)y} or {(k1`max`k2)y} or what? > > Good question. I'd suppose that they should be param

Re: [Haskell-cafe] ANN: signed-multiset-0.1

2012-04-20 Thread Stefan Holdermans
Richard, Thanks for your excellent feedback! Very helpful! > Signed multisets are unfamiliar to most of us, and I for one found the paper > a little fast-paced. Can you put a bit more into the documentation? Definitely. That's what weekends are for... :) I'll add some sections to the document

[Haskell-cafe] Profiling with QtHaskell

2012-04-20 Thread Øystein Kolsrud
Hi! Does anyone know if it is possible to use QtHaskell with profiling turned on? -- Mvh Øystein Kolsrud ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Parallel Haskell Digest 9

2012-04-20 Thread Eric Kow
Parallel Haskell Digest 9 = Hello Haskellers! The Google Summer of Code is upon us and students have already submitted their proposals. There are a couple potential projects on concurrent data structures, which we'll have a look at below. We will also be continuing our t