Hello Cafe,
Thanks to all of you who provided ideas and suggestions for introducing
Haskell. I finally went the simple way, presenting the "knapsack" problem
slightly reframed using tapas (spanish dishes). This problem is small
enough to fit in the 5 minutes time-frame and it actually illustrates s
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:
http://www.mail-archive.com/haskell-cafe@hask
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 wrote:
> Yes, but in 5 minutes I take it they won't have time to ask questions
> before your presentation is over.
>
> I haven't
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. M
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 (i
Arnaud Bailly 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 the knapsack is
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
Le 28 février 2012 14:45, Doug McIlroy 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.
___
Haskell-Cafe mailing l
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
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 po
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 l
On Tue, Feb 28, 2012 at 14:05, Arnaud Bailly 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
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 real
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
> Where exactly does tha
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
> Hello Cafe,
>
> I will be (re)presenting Haskell in a "Batlle Language"
Well, solving knapsack problem in a couple lines of code looks really fun
and instructive.
Thanks Ertugrul for suggesting Yesod. This is definitely a great tool for
creating web applications but I fear that's too much to swallow in 5
minutes. And thanks also Jason for reminding me of the gems one
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
On Mon, 27 Feb 2012, Arnaud Bailly wrote:
Hello Cafe,
I will be (re)presenting Haskell in a "Batlle Language" event Wed
On Mon, Feb 27, 2012 at 7:18 AM, 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.
>
> Hav
Arnaud Bailly wrote:
> 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 liv
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 live coding in a recent
20 matches
Mail list logo
