Where exactly does that event take place?
Is it open to public?
And I strongly disadvise fibonacci, quicksort and other mind-blowing
reality-escapist stuff. Show something real world and practical.
2012/2/27 Arnaud Bailly arnaud.oq...@gmail.com
Hello Cafe,
I will be (re)presenting Haskell in
Nevermind, I think I found:
http://jduchess.org/duchess-france/blog/battle-language-a-la-marmite/
You could try the JSON parser exercise. (
https://github.com/revence27/JSON-hs) Or anything else with Parsec, it's a
pretty good power-showing library.
2012/2/28 Yves Parès yves.pa...@gmail.com
Hello, cafe.
Is it possible to read data from different concurrent sources,
i.e. read data from source as soon as it become avaliable, e.g.
runResourceT $ (source1 stdin $= CL.map Left)
= (source2 handle $= CL.map Right)
$= application
$$ sink
Thanks Yves for your advice. And I agree with you that too much laziness
may be mind-blowing for most of the audience, yet this is one of the
characteristics of Haskell, whether or not we like it and whatever troubles
it can induce.
I really think the knapsack is simple, not too far away from
On Tue, Feb 28, 2012 at 14:05, Arnaud Bailly arnaud.oq...@gmail.com wrote:
Thanks Yves for your advice. And I agree with you that too much laziness may
be mind-blowing for most of the audience, yet this is one of the
characteristics of Haskell, whether or not we like it and whatever troubles
Arnaud Bailly wrote:
Hello Cafe,
I will be (re)presenting Haskell in a Batlle Language event Wednesday
evening: A fun and interactive contest where various programming language
champions try to attract as much followers as possible in 5 minutes.
Having successfully experimented the power of
Here's an example that fits comfortably in 5 minutes--if
your audience knows elementary calculus:
http://www.cs.dartmouth.edu/~doug/powswer.html
It depends critically on lazy evaluation, which knocks out
a lot of competing languages right from the start.
The five-minute version would begin with
Hi, I apologize if the formatting or content of my previous email caused offence. Hopefully my question is better phrased and presented this time. Below is my attempt to code the first example from Walder’s Theorems for free! paper[1]. {-# LANGUAGE ExistentialQuantification #-} import
There was a typo in the link, here's the corrected version
http://www.cs.dartmouth.edu/~doug/powser.html
- Joel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Le 28 février 2012 14:45, Doug McIlroy d...@cs.dartmouth.edu a écrit :
Here's an example that fits comfortably in 5 minutes--if
your audience knows elementary calculus:
http://www.cs.dartmouth.edu/~doug/powswer.html
404 invalid url !
David.
___
Hi all,
Anyone interested in acting as an admin for haskell.org this year? I'm
afraid I won't have time. It's not that much work (filling in some
information, sending out some emails, making sure things happen in time.)
-- Forwarded message --
From: Carol Smith car...@google.com
Sorry, a typo in the url for the power-series example.
It should have been
http://www.cs.dartmouth.edu/~doug/powser.html
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Two functions that I see useful are described here and I would like to
know if they are defined in some more or less standard Haskell
library. Hoogle (http://www.haskell.org/hoogle) did not reveal
anything about that.
Function 'inter' applies given function to each succeeding pair of
elements of
On Tue, Feb 28, 2012 at 6:04 PM, Alexander V Vershilov
alexander.vershi...@gmail.com wrote:
Hello, cafe.
Is it possible to read data from different concurrent sources,
i.e. read data from source as soon as it become avaliable, e.g.
runResourceT $ (source1 stdin $= CL.map Left)
Hi,
I downloaded those vim extensions, and I just wonder how I could have done
before syntastic ;)
Is there a vim plugin useful for runtime (putting breakpoints, seeing if an
expression has been evaluated or if it's still a thunk?)
I believe it exists for emacs.
2012/2/16 Nicolas Wu
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.
withPair :: (a' - b' - c) - (a - a') - (b - b') - (a,b) - c
Hello,
On Tue, Feb 21, 2012 at 8:11 AM, Ryan Newton rrnew...@gmail.com wrote:
Oops, I've attached the PDF. It's a good overview that includes a bunch of
the key ideas that appear in recent work in the area.
Very cool article, thank you! I genuinely enjoyed reading it :-)
Absolutely! Feel
Am 28.02.2012 um 18:06 schrieb Johan Holmquist:
Two functions that I see useful are described here and I would like to
know if they are defined in some more or less standard Haskell
library. Hoogle (http://www.haskell.org/hoogle) did not reveal
anything about that.
Function 'inter'
inter :: (a - a - b) - [a] - [b]
inter f [] = []
inter f l = map (uncurry f) $ zip l (tail l)
This is the same as
inter :: (a - a - b) - [a] - [b]
inter f l = zipWith f l (tail l)
Except when l == [], but the second equation can be replaced by this nicer one.
and you can use it to
Arnaud Bailly arnaud.oq...@gmail.com wrote:
Thanks Yves for your advice. And I agree with you that too much
laziness may be mind-blowing for most of the audience, yet this is one
of the characteristics of Haskell, whether or not we like it and
whatever troubles it can induce.
I really think
First of all, I'd probably name that operator =, since = is Kleisli
composition in Control.Monad.
Second, you're going to need new threads for this, since you'll be reading
from two sources concurrently. This isn't as big a problem as you might
think, because Haskell threads are dirt cheap,
Am 28.02.2012 um 20:21 schrieb Johan Holmquist:
inter :: (a - a - b) - [a] - [b]
inter f [] = []
inter f l = map (uncurry f) $ zip l (tail l)
This is the same as
inter :: (a - a - b) - [a] - [b]
inter f l = zipWith f l (tail l)
Except when l == [], but the second equation can be
Finally, I've uploaded a new version of stm-conduit [1] with these
combinators included. You should cabal update and then cabal install
stm-conduit to get the latest version, and now you can vertically compose
your sources!
Regards,
- clark
[1]
Hello.
Naming operator = instead of = is a good idea.
But this functions are looks very good and will make code easier to understand.
Also I'll try using non-STM channel (as Michael adviced) because in such a task
I don't need all STM power.
Thanks for response.
--
Alexander
Tue, Feb 28,
Except when l == [], but the second equation can be replaced by this nicer
one.
Even then. :) (zipWith f l (tail l)) first tries to match l with pattern
(a:as), and if that
fails it will not touch its other argument (tail l).
Hm, you're right, it did work for empty lists. I wonder if one
I'm new to Template Haskell and just started playing with it.
I have Haskell platform 2011.4.0 and I get this error when I try to run this
simple code.
main = do
code - runQ $ recover (return []) th
putStrLn (pprint code)
putStrLn (show code)
th :: Q [Dec]
th = [d|
Gloss having been mentioned, I thought I'd look into it.
m% cabal install gloss
Resolving dependencies...
cabal: cannot configure gloss-1.6.1.1. It requires base ==4.5.*
For the dependency on base ==4.5.* there are these packages: base-4.5.0.0.
However none of them are available.
base-4.5.0.0 was
On 29 February 2012 08:40, Richard O'Keefe o...@cs.otago.ac.nz wrote:
Gloss having been mentioned, I thought I'd look into it.
m% cabal install gloss
Resolving dependencies...
cabal: cannot configure gloss-1.6.1.1. It requires base ==4.5.*
For the dependency on base ==4.5.* there are these
On 28 February 2012 17:06, Johan Holmquist holmi...@gmail.com wrote:
Function 'withPair' takes a pair and applies a function to it's first
element, another function to it's second element and finally combines
the results with yet another function.
withPair :: (a' - b' - c) - (a - a') - (b -
Thanks for your support. I would really like to do this but 1) the talk is
tomorrow evening and 2) I do not have time in the interval to learn yesod
and/or gloss enough to be confident that I will not botch anything in a 5
minutes time frame.
I did recently a 2-hours long talk with same purpose
30 matches
Mail list logo
