CurryInfo: combinatorial-3.2.0 / Combinatorial.allSubsets

definition:
 
allSubsets :: Ord a => [a] -> [[a]]
allSubsets xs = sortValues (set1 subset xs)
demand:
 no demanded arguments
deterministic:
 deterministic operation
failfree:
 (_, _)
indeterministic:
 referentially transparent operation
infix:
 no fixity defined
iotype:
 {(_,_) |-> _}
name:
 allSubsets
precedence:
 no precedence defined
result-values:
 _
signature:
 Prelude.Ord a => [a] -> [[a]]
solution-complete:
 operation might suspend on free variables
terminating:
 possibly non-terminating
totally-defined:
 possibly non-reducible on same data term