Evan Martin (evan) wrote in evan_tech,
Evan Martin


Beautiful Haskell implementation of math's "power set":
import Control.Monad

powerset :: [a] -> [[a]]
powerset = filterM (const [True, False])

And powerset [1,2,3] produces [[1,2,3],[1,2],[1,3],[1],[2,3],[2],[3],[]].

Oh man is that hard for me to grok, mostly because I haven't internalized the list monad.
(It helped me to write out the definition of filterM, which has type Monad m => (a -> m Bool) -> [a] -> m [a].)

But roughly, it's saying "for each assignment of true and false over the values of the list, grab the true values".

[via Adam Langley via a private mailing list]
Tags: haskell

  • your vcs sucks

    I've been hacking on some Haskell stuff lately that's all managed in darcs and it's reminded me of an observation I made over two years ago now (see…

  • ghc llvm

    I read this thesis on an LLVM backend for GHC, primarily because I was curious to learn more about GHC internals. The thesis serves well as an…

  • found my bug!

    Not too interesting, but this has been bugging me for a week. Been working on a toy program that proxies a TCP connection. It was working fine for…

  • Post a new comment


    default userpic
    When you submit the form an invisible reCAPTCHA check will be performed.
    You must follow the Privacy Policy and Google Terms of use.