CurryInfo: base-3.4.0 / Data.List.mapAccumR

 
mapAccumR :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])
mapAccumR _ s []        =  (s, [])
mapAccumR f s (x:xs)    =  (s'', y:ys)
                           where (s'',y ) = f s' x
                                 (s', ys) = mapAccumR f s xs

 argument 3

 deterministic operation

 
The `mapAccumR` function behaves like a combination of `map` and
`foldr`; it applies a function to each element of a list, passing
an accumulating parameter from right to left, and returning a final
value of this accumulator together with the new list.

 (_, _, _)

 referentially transparent operation

 no fixity defined

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

 mapAccumR

 no precedence defined

 {(,)}

 (a -> b -> (a, c)) -> a -> [b] -> (a, [c])

 operation might suspend on free variables

 yes

 reducible on all ground data terms