CurryInfo: base-3.4.0 / Data.List.intersect
definition: 
|
intersect :: Eq a => [a] -> [a] -> [a]
intersect [] _ = []
intersect (x:xs) ys = if x `elem` ys then x : intersect xs ys
else intersect xs ys
|
|
demand:
|
argument 2 |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Computes the intersection of two lists. |
|
failfree:
|
(_, _, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,{[]},_) |-> {[]} || (_,{:},_) |-> {:,[]}}
|
|
name:
|
intersect |
|
precedence:
|
no precedence defined |
|
result-values:
|
{:,[]}
|
|
signature:
|
Prelude.Eq a => [a] -> [a] -> [a] |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
reducible on all ground data terms |