| definition: |
(\\) :: Eq a => [a] -> [a] -> [a] xs \\ ys = foldl (flip delete) xs ys |
| demand: |
argument 3 |
| deterministic: |
deterministic operation |
| documentation: |
--- Computes the difference of two lists. --- @param xs - a list --- @param ys - a list --- @return the list where the first occurrence of each element of --- `ys` has been removed from `xs` |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
infix |
| iotype: |
{(_,_,_) |-> _}
|
| name: |
\\ |
| precedence: |
5 |
| 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 |