Problem 54380. Define the higher order function - foldl
Given a binary function f, a starting value a, and a list (row vector) xs of values, the higher order function foldl folds the function f through the list from left to right. Your task is to provide a definition for foldl. Consider a recursive definition for elegance. Non-recursive definitions would be just fine as well.
Refer to the following mechanism as an example:
For more information on foldl visit : https://wiki.haskell.org/Foldr_Foldl_Foldl'
Solution CommentsShow comments
Problem Recent Solvers2