[Haskell-cafe] Powerset of a set

[Brent Yorgey]

Jerzy, you have been on this list long enough to know that is not an
appropriate tone to use when responding to people asking questions.  I am
not disagreeing with the *content* of your message --- indeed, the original
message sounded a lot like asking the list to solve a homework problem.
But your response seemed unnecessarily sarcastic and condescending.

-Brent

On Mon, Sep 14, 2015 at 2:49 PM Jerzy Karczmarczuk <
jerzy.karczmarczuk at unicaen.fr> wrote:

>
>
> Le 14/09/2015 20:57, JORGE MALDONADO a écrit :
> > The powerset of set s is a set containing all subsets of s.
> > I need a clue on how to write Haskell code to get the superset of a
> > set using direct recursion and list comprehension.
> Clue?...
>
> Three years ago.
>
>
> http://stackoverflow.com/questions/11988184/how-is-this-power-set-generating-function-working
>
> Three years ago.
>
> http://chaos.weblogs.us/archives/354
>
> etc.
>
> Would you mind explaining us, Jorge Maldonaldo, why couldn't you find
> this by yourself? Is Google so difficult to use?
>
> Jerzy Karczmarczuk
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20150914/dacc1e4d/attachment.html>