demand: |
argument 2 |
deterministic: |
deterministic operation |
failfree: |
(_, _) |
indeterministic: |
referentially transparent operation |
infix: |
no fixity defined |
iotype: |
{(_,{Var}) |-> _ || (_,{Lit}) |-> _ || (_,{Free}) |-> _ || (_,{Let}) |-> _ || (_,{Or}) |-> _ || (_,{Typed}) |-> _ || (_,{Comb}) |-> _ || (_,{Case}) |-> _} |
name: |
ren |
precedence: |
no precedence defined |
result-values: |
_ |
signature: |
(Prelude.Int -> Prelude.Int) -> FlatCurry.Types.Expr -> Control.Monad.Trans.State.StateT Prelude.Int Data.Functor.Identity.Identity FlatCurry.Types.Expr |
solution-complete: |
operation might suspend on free variables |
terminating: |
possibly non-terminating |
totally-defined: |
possibly non-reducible on same data term |