[Haskell-cafe] Powerset of a set

Jerzy Karczmarczuk jerzy.karczmarczuk at unicaen.fr
Mon Sep 14 19:48:41 UTC 2015

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.

Three years ago.


Three years ago.



Would you mind explaining us, Jorge Maldonaldo, why couldn't you find 
this by yourself? Is Google so difficult to use?

Jerzy Karczmarczuk

More information about the Haskell-Cafe mailing list