[Haskell-cafe] Powerset of a set

[Francesco Ariis]

On Mon, Sep 14, 2015 at 09:48:41PM +0200, Jerzy Karczmarczuk 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?

Clue /= solution. Searching the web tentds to give straight answers
rather than hints (which some of us find more useful to progress).