|
definition:
|
replaceTerm :: Term f -> Pos -> Term f -> Term f
replaceTerm _ [] s = s
replaceTerm t@(TermVar _) (_:_) _ = t
replaceTerm t@(TermCons c ts) (i:p) s
| i > 0 && i <= length ts = TermCons c ts'
| otherwise = t
where
(ts1, ti:ts2) = splitAt (i - 1) ts
ts' = ts1 ++ (replaceTerm ti p s : ts2)
|
|
demand:
|
argument 2
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Replaces the subterm of a term at the given position with the given term
--- if the position exists within the term.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,{[]},_) |-> _ || ({TermVar},{:},_) |-> {TermVar} || ({TermCons},{:},_) |-> {TermCons}}
|
|
name:
|
replaceTerm
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Rewriting.Term.Term a -> [Prelude.Int] -> Rewriting.Term.Term a
-> Rewriting.Term.Term a
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|