[Haskell-cafe] Generic permutations

[Cetin Sert]

How can I make a generic permutations function?

-- boolean permutations
bpms :: Int → [[Bool]]
bpms 0 = [[]]
bpms n = map (False:) bss ++ map (True:) bss
         where
           bss = bpms (n - 1)

-- generic permutations
pms a :: Int → [[a]]

Best Regards,
Cetin Sert
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20080126/0df660ae/attachment.htm