| definition: |
findFn :: Term -> [([Term],Term)] findFn t = case t of FunTerm pairs -> findMaps pairs _ -> [([],t)] -- result of mapping |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({FunTerm}) |-> _ || ({Cons}) |-> _ || ({LogVarTerm}) |-> _ || ({UnEval}) |-> _ || ({Bottom}) |-> _ || ({Black}) |-> _}
|
| name: |
findFn |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Term -> [([Term], Term)] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |