Hi all,
This is my sister's proposition:
http://origami.bieszczady.pl/images/The_Lamb_Da.png
What do you think?
Best,
Karol Samborski
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Tim Baumgartner wrote:
Thanks a lot! Althaugh I have some understanding of the Haskell basics and
the most important monads, I feel that I have to see more well designed
code in order to become a good Haskeller. Can somebody make suggestions
what materials are best to work through in order to
Hi there.
I tried to follow the program of the paper Scrap your boilerpolate
Revolutions. Unfortunately,
I found the program in the section lifted spine view does not compile in my
GHC, could anybody
point out where I am wrong? Many Thanks
My code is posted here http://hpaste.org/54357
On 20 Nov 2011, at 22:20, Ivan Lazar Miljenovic wrote:
On 21 November 2011 03:19, David Fox dds...@gmail.com wrote:
On Fri, Nov 18, 2011 at 1:10 AM, Ertugrul Soeylemez e...@ertes.de wrote:
Ivan Lazar Miljenovic ivan.miljeno...@gmail.com wrote:
Wasn't there talk at one stage of integrating
I would say a good practice with folds (and maybe in Haskell in general) is
that either all be strict or all be lazy.
In the expression: foldXX f init list:
Remember that foldr does:
x `f` ( ... the accumulator ... )
and foldl:
(... the accumulator ...) `f` x
The accumulator has to match a
Yves Parès:
if *f* is lazy in its second argument, then use foldr. Everything is
lazy, you build a very small thunk since nothing is evaluated.
In the rare cases where*f *is (also) lazy in its first argument, you
can use foldl.
...
I have the impression that this is not the most useful advice
2011/11/21 Karol Samborski edv.ka...@gmail.com:
Hi all,
This is my sister's proposition:
http://origami.bieszczady.pl/images/The_Lamb_Da.png
What do you think?
Second version: http://origami.bieszczady.pl/images/The_Lamb_Da2.png
Best,
Karol Samborski
Hi cafe,
Are there any (possibly unfinished?) libraries dedicated to drawing charts
over large amounts of data? I mean, such amounts that you don't want to
store the whole set of input data in memory and instead you prefer to do
one or a few passes over the input, calling the library's drawing
This doesn't directly solve your problem, but you may want to take a
look at zoom-cache [1]. I've never used it myself, but it seems
pretty nice.
Cheers,
[1] http://hackage.haskell.org/package/zoom-cache
--
Felipe.
___
Haskell-Cafe mailing list
I've read Martin Erwig and Steve Kollmansberger's *Probabilistic functional
programming in Haskell*.
Does someone know if the library they are talking about is available on
hackage?
2011/11/21 Heinrich Apfelmus apfel...@quantentunnel.de
Tim Baumgartner wrote:
Thanks a lot! Althaugh I have
On Mon, Nov 21, 2011 at 4:44 AM, Jerzy Karczmarczuk
jerzy.karczmarc...@unicaen.fr wrote:
In general, sorry for the cynism, but when I read:
There are times when I would like to find out which to use in the quickest
way possible, rather than reading a long explanation of why each one behaves
Magicloud Magiclouds wrote:
So I think I got what you guys meant, I limited ClassB to only H.
Then how to archive my requirement, that from and to only return items
that instanced ClassB?
If you are willing to go beyond Haskell98 (or Haskell2010), you can use a
multi-parameter class. Enable
On Sun, Nov 20, 2011 at 2:20 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
On 21 November 2011 03:19, David Fox dds...@gmail.com wrote:
On Fri, Nov 18, 2011 at 1:10 AM, Ertugrul Soeylemez e...@ertes.de wrote:
Ivan Lazar Miljenovic ivan.miljeno...@gmail.com wrote:
Wasn't there
On Mon, Nov 21, 2011 at 12:28, David Fox dds...@gmail.com wrote:
On Sun, Nov 20, 2011 at 2:20 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
On 21 November 2011 03:19, David Fox dds...@gmail.com wrote:
I'm not sure the pandoc license (GPL) is compatible with the GHC
license.
On 21 November 2011 14:48, Yves Parès limestr...@gmail.com wrote:
I've read Martin Erwig and Steve Kollmansberger's Probabilistic functional
programming in Haskell.
Does someone know if the library they are talking about is available on
hackage?
Henning Thielemann has a batteries included
Free Monads. It's amazing to be confronted again with notions I learned
more than ten years ago for groups. I have to admit that I'm probably not
yet prepared for a deeper understanding of this, but hopefully I will
return to it later ;-)
Is Cont free as well? I guess so because I heard it's
Hi Heinrich,
I read your article about the operational monad and found it really very
enlightening. So I'm curious to work through the material you linked below.
Thanks!
Regards
Tim
2011/11/21 Heinrich Apfelmus apfel...@quantentunnel.de
Tim Baumgartner wrote:
Thanks a lot! Althaugh I have
Cute! I like it!
On Mon, Nov 21, 2011 at 7:52 AM, Karol Samborski edv.ka...@gmail.comwrote:
2011/11/21 Karol Samborski edv.ka...@gmail.com:
Hi all,
This is my sister's proposition:
http://origami.bieszczady.pl/images/The_Lamb_Da.png
What do you think?
Second version:
Thanks, I don't see the footnote, but that works. :-)
On Mon, Nov 21, 2011 at 5:15 AM, Andres Löh andres.l...@googlemail.comwrote:
Hi there.
I tried to follow the program of the paper Scrap your boilerpolate
Revolutions. Unfortunately,
I found the program in the section lifted spine
On Mon, Nov 21, 2011 at 2:13 PM, Tim Baumgartner
baumgartner@googlemail.com wrote:
Free Monads. It's amazing to be confronted again with notions I learned more
than ten years ago for groups. I have to admit that I'm probably not yet
prepared for a deeper understanding of this, but hopefully
On 21 November 2011 17:34, Brandon Allbery allber...@gmail.com wrote:
Haddock carries the same license as GHC.
More to the point, Haddock uses ghc internals these days; it's not just a
matter of bundling, and the licenses *must* be compatible.
No. If the haddock library any program that
2011/11/21 David Menendez d...@zednenem.com
Here's how you might implement your monad using Cont,
type InteractionM a b = Cont (Interaction a b)
exit b = Cont $ \k - Exit b
output b = Cont $ \k - Output b (k ())
input= Cont $ \k - Input k
runM m = runCont m Exit
That's what I
You'll probably get answers from people who are more proficient with this,
but here's what I learned over the years.
Tim Baumgartner wrote:
Is Cont free as well?
No. In fact, free monads are quite a special case, many monads are not free,
e.g. the list monad. I believe what David Menendez
Parallel Haskell Programmers
Parallel Scientific, LLC is a Boulder, CO based early stage, but funded
startup company working in the area of scalable parallelization for
scientific and large data computing. We are implementing radically new
software tools for the creation and optimization of
heathmatlock wrote:
Cute! I like it!
Yea, it's cute. I don't like the formula, though: \x - x + x is just too
trivial and not very Haskellish. Something higher order is the minimum
requirement, IMO. The original (lambda knights) formula was cool: the fixed
point operator is directly related
On 21 November 2011 22:36, Felipe Almeida Lessa felipe.le...@gmail.com wrote:
This doesn't directly solve your problem, but you may want to take a
look at zoom-cache [1]. I've never used it myself, but it seems
pretty nice.
Cheers,
[1] http://hackage.haskell.org/package/zoom-cache
Hi,
On Mon, Nov 21, 2011 at 3:47 PM, Conrad Parker con...@metadecks.org wrote:
zoom-cache is useful for managing time-series data. There is a
zoom-cache-gnuplot in development, and it would probably be useful to
make a tool that uses Chart. I'm happy to help with that :)
Be aware that Chart is
On Fri, Nov 18, 2011 at 4:05 AM, Yves Parès limestr...@gmail.com wrote:
(Sorry for the double mail)
...so there is no way to do that inside the function passed to modifySTRef?
In other words, there is no way to ensure *inside* a function that its
result will be evaluated strictly?
On 21/11/2011, at 9:22 PM, Karol Samborski wrote:
Hi all,
This is my sister's proposition:
http://origami.bieszczady.pl/images/The_Lamb_Da.png
What do you think?
It looks like a skittle with a baby bonnet.
C'est mignon, mais ce n'est pas la guerre
as Pierre Bosquet almost said.
Yea, it's cute. I don't like the formula, though: \x - x + x is just too
trivial and not very Haskellish. Something higher order is the minimum
requirement, IMO. The original (lambda knights) formula was cool: the fixed
point operator is directly related to recursion, which is reflected in the
I think the artwork is nice, but I am not sure that a lamb is an
appropriate mascot for Haskell.
A mascot is supposed to represent characteristics, emotions, or
desires that a particular group of people aspire to have, be like,
etc. To outsiders, it provides a quick way to see if it might be a
On Tue, Nov 22, 2011 at 12:22 AM, Jeremy Shaw jer...@n-heptane.com wrote:
- honey badger - can't beat that for 'robust' and 'fearless',
http://www.youtube.com/watch?v=wPKlryXwmXk
i think you were referring to this vid:
http://www.youtube.com/watch?v=m7pGZudN8rE (nsfw... almost)
i +1 a honey
I'm taking the liberty of forwarding this super-relevant advert to Haskell Cafe
in case any readers read the Cafe but not the main Haskell mailing list.
Simon
From: haskell-boun...@haskell.org [mailto:haskell-boun...@haskell.org] On
Behalf Of Peter Braam
Sent: 21 November 2011 22:23
To:
33 matches
Mail list logo
