Powerset of a set with list comprehension in Haskell

haskell recursion list-comprehension powerset
user3059248 picture user3059248 · Sep 15, 2015 · Viewed 8.7k times · Source

I am a complete beginner in Haskell and I have 11 exercises for homework, 10 of which I have already solved. I have found several solutions to get the powerset of a set, but none of them includes list comprehension. I know I should not ask for a complete answer in this case (because it is homework) but I would very much appreciate any feedback/clue.

The powerset of set S is a set containing all subsets of S. Write a recursive function powerset that returns a set containing all subsets of a given set. Use direct recursion and list comprehension.

Answer

Michael McKenna picture Michael McKenna · Sep 16, 2016

Using direct recursion and list comprehension:

type Set a = [a]

powerset :: Set a -> Set (Set a)
powerset [] = [[]]
powerset (x:xs) = [x:ps | ps <- powerset xs] ++ powerset xs

Related questions

Implications of foldr vs. foldl (or foldl')

Firstly, Real World Haskell, which I am reading, says to never use foldl and instead use foldl'. So I trust it. But I'm hazy on when to use foldr vs. foldl'. Though I can see the structure of how they …

Read More
Using Haskell's map function to calculate the sum of a list

Haskell addm::[Int]->Int addm (x:xs) = sum(x:xs) I was able to achieve to get a sum of a list using sum function but is it possible to get the sum of a list using map …

Read More
zip function in Haskell

implementation of a zip function that takes two lists as parameters and returns a new list of pairs. I got this so far myZip [] [] = [] myZip (x:xs) (y:ys) = [(x,y)] ++ myZip xs ys any help?

Read More