CurryInfo: flatcurry-transform-0.0.1 / FlatCurry.Transform.Utils.recursive
demand: 
|
argument 2 |
|
deterministic:
|
deterministic operation |
|
failfree:
|
(_, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,{Var}) |-> _ || (_,{Lit}) |-> {False} || (_,{Comb}) |-> _ || (_,{Or}) |-> _ || (_,{Typed}) |-> _ || (_,{Free}) |-> _ || (_,{Let}) |-> _ || (_,{Case}) |-> _}
|
|
name:
|
recursive |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
Prelude.Int -> FlatCurry.Types.Expr -> Prelude.Bool |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
possibly non-reducible on same data term |