


Description 
Subsets.


Synopsis 



Documentation 


All possible ways to choose k elements from a list, without
repetitions. "Antisymmetric power" for lists. Synonym for kSublists.



All possible ways to choose k elements from a list, with repetitions.
"Symmetric power" for lists. See also Math.Combinat.Combinations.
TODO: better name?



A synonym for combine.



"Tensor power" for lists. Special case of listTensor:
tuplesFromList k xs == listTensor (replicate k xs)
See also Math.Combinat.Tuples.
TODO: better name?


listTensor :: [[a]] > [[a]]  Source 

"Tensor product" for lists.



Sublists of a list having given number of elements.


sublists :: [a] > [[a]]  Source 

All sublists of a list.



# = binom { n } { k }.



# = 2^n.


Produced by Haddock version 2.6.1 