|
definition:
|
mapTerm :: (a -> b) -> Term a -> Term b
mapTerm _ (TermVar v) = TermVar v
mapTerm f (TermCons c ts) = TermCons (f c) (map (mapTerm f) ts)
|
|
demand:
|
argument 2
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Transforms a term by applying a transformation on all constructors.
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,{TermVar}) |-> {TermVar} || (_,{TermCons}) |-> {TermCons}}
|
|
name:
|
mapTerm
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{TermCons,TermVar}
|
|
signature:
|
(a -> b) -> Term a -> Term b
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
reducible on all ground data terms
|