| definition: |
leqFunc :: FuncDecl -> FuncDecl -> Bool leqFunc (Func (_,f1) _ _ _ _) (Func (_,f2) _ _ _ _) = f1 <= f2 |
| demand: |
arguments 1 2 |
| deterministic: |
deterministic operation |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Func},{Func}) |-> _}
|
| name: |
leqFunc |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
FlatCurry.Types.FuncDecl -> FlatCurry.Types.FuncDecl -> Prelude.Bool |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |