| definition: |
leqList :: Eq a => (a -> a -> Bool) -> [a] -> [a] -> Bool
leqList _ [] _ = True
leqList _ (_:_) [] = False
leqList leq (x:xs) (y:ys) | x == y = leqList leq xs ys
| otherwise = leq x y
|
| demand: |
argument 3 |
| deterministic: |
deterministic operation |
| documentation: |
--- Less-or-equal on lists. |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,{[]},_) |-> {True} || (_,_,{:},{[]}) |-> {False} || (_,_,{:},{:}) |-> _}
|
| name: |
leqList |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Eq a => (a -> a -> Prelude.Bool) -> [a] -> [a] -> Prelude.Bool |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
possibly non-reducible on same data term |