Yes, but in 5 minutes I take it they won't have time to ask questions
before your presentation is over.
I haven't thought about parallel computing but it's one of the many assets
of the language.
The problem IMHO with STM is that it relies on too many Haskell elements to
be grasped in 5 minutes.
Great ! Good to have some support. Hope you will like it, I think I got
something worthwhile that fits in 5 minutes flat.
On Wed, Feb 29, 2012 at 10:46 AM, Yves Parès yves.pa...@gmail.com wrote:
Yes, but in 5 minutes I take it they won't have time to ask questions
before your presentation is
Is there any official way that mentors should sign up to become part of the
org?
For one thing I heard a rumor that bigger orgs look better from Google's
end.
-Ryan
On Tue, Feb 28, 2012 at 11:23 AM, Johan Tibell johan.tib...@gmail.comwrote:
Hi all,
Anyone interested in acting as an admin
On Wed, Feb 29, 2012 at 6:29 AM, Ryan Newton rrnew...@gmail.com wrote:
Is there any official way that mentors should sign up to become part of
the org?
For one thing I heard a rumor that bigger orgs look better from Google's
end.
Once haskell.org is registered as an organization you need
On 12-02-27 04:36 PM, rocon...@theorem.ca wrote:
In less than 5 minutes I can solve NP-Complete problems in restaurant
orders:
http://www.reddit.com/comments/24p2c/xkcd_does_anyone_else_feel_compelled_to_solve_this/c24pc5
and right in haskell-cafe:
Hello,
I bit premature perhaps but I wanted to post it on a leap day...
http://fremissant.net/freesect
Thanks for eyebloom on #haskell for motivating me to finally implement
an old idea. Thanks to the rest on #haskell for doing their best to
talk me out of it. ;)
I make no claims regarding
Welcome to the 217th issue of the HWN, a newsletter covering
developments in the Haskell community during the week of February 19 to
25, 2012.
You can find the HTML version of this issue at:
http://contemplatecode.blogspot.com/2012/02/haskell-weekly-news-issue-217.html
Quotes of the Week
*
-- stm-chans 1.3.1
The stm-chans package offers a collection of channel types, similar to
Control.Concurrent.STM.TChan but with additional features.
--
On 2/28/12 1:25 PM, Brent Yorgey wrote:
On Tue, Feb 28, 2012 at 06:06:25PM +0100, Johan Holmquist wrote:
inter :: (a - a - b) - [a] - [b]
inter f [] = []
inter f l = map (uncurry f) $ zip l (tail l)
I've never seen this function defined anywhere, but it looks nice.
I've used it a few
On 01/03/12 14:40, wren ng thornton wrote:
Of course, you can simplify the implementation by:
inter f xs = zipWith f xs (tail xs)
inter f = zipWith f * tail
--
Tony Morris
http://tmorris.net/
___
Haskell-Cafe mailing list
Hello.
I'm trying to add monad stack into network-conduit, and everything
works except some details [1].
I've run runReaderT $ runTCPServer (wrapper around runResourceT) and
inside conduit I want to run writer to gather results of inner computation.
In inner computation I want to use IO, data
11 matches
Mail list logo
