| definition: |
rnmTerm :: (Ident -> Ident) -> Term -> Term rnmTerm rnm term = case term of TConst _ -> term TSVar _ -> term TComb f args -> TComb (rnmQId rnm f) (map (rnmTerm rnm) args) Forall svs arg -> Forall svs (rnmTerm rnm arg) Exists svs arg -> Exists svs (rnmTerm rnm arg) Let bs e -> Let (map (\ (v,s) -> (v, rnmTerm rnm s)) bs) (rnmTerm rnm e) Match e ps -> Match (rnmTerm rnm e) (map (\ (v,s) -> (v, rnmTerm rnm s)) ps) |
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{TConst}) |-> {TConst} || (_,{TSVar}) |-> {TSVar} || (_,{TComb}) |-> {TComb} || (_,{Forall}) |-> {Forall} || (_,{Exists}) |-> {Exists} || (_,{Let}) |-> {Let} || (_,{Match}) |-> {Match}}
|
| name: |
rnmTerm |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(String -> String) -> Term -> Term |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |