CurryInfo: base-3.4.0 / Data.List.mapAccumL

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

 argument 3

 deterministic operation

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

 (_, _, _)

 referentially transparent operation

 no fixity defined

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

 mapAccumL

 no precedence defined

 {(,)}

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

 operation might suspend on free variables

 yes

 reducible on all ground data terms