[Haskell-cafe] Powerset of a set
JORGE MALDONADO
jorgemal1960 at gmail.com
Mon Sep 14 18:57:10 UTC 2015
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.
Best regads.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20150914/acd94b28/attachment.html>
More information about the Haskell-Cafe
mailing list