| definition: |
simpClassEq :: Expr -> Expr
simpClassEq exp = case exp of
Comb FuncCall qt1
[Comb FuncCall qt2
[Comb FuncCall qt3 [_], e1], e2]
| qt1 == pre "apply" && qt2 == pre "apply" && qt3 == pre "=="
-> Comb FuncCall (pre "==") [e1,e2]
_ -> exp
|
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Comb}) |-> {Comb} || ({Var}) |-> {Var} || ({Lit}) |-> {Lit} || ({Let}) |-> {Let} || ({Free}) |-> {Free} || ({Or}) |-> {Or} || ({Case}) |-> {Case} || ({Typed}) |-> {Typed}}
|
| name: |
simpClassEq |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
FlatCurry.Types.Expr -> FlatCurry.Types.Expr |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |