CurryInfo: base-3.4.0 / Data.List.replace

 
replace :: a -> Int -> [a] -> [a]
replace _ _ []     = []
replace x p (y:ys) | p==0      = x:ys
                   | otherwise = y:(replace x (p-1) ys)

 argument 3

 deterministic operation

 
Replaces an element in a list.
@param x - the new element
@param p - the position of the new element (head = 0)
@param ys - the old list
@return the new list where the `p`. element is replaced by `x`

 (_, _, _)

 referentially transparent operation

 no fixity defined

 {(_,_,{[]}) |-> {[]} || (_,_,{:}) |-> {:}}

 replace

 no precedence defined

 {:,[]}

 a -> Prelude.Int -> [a] -> [a]

 operation might suspend on free variables

 yes

 possibly non-reducible on same data term