Problem 54380. Define the higher order function - foldl

• Created by Sourabh Warrier

×

Like (0)

Difficulty:

(3824)

Rate

• Solve Later   
• Add To GroupÂ

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:

foldl(f,[4,7,5,6],2)

= foldl(f,[11,5,6],2)

= foldl(f,[16,6],2)

= foldl(f,[22],2)

= f(22,2)

= 24

For more information on foldl visit : https://wiki.haskell.org/Foldr_Foldl_Foldl'

Solve

Solution Stats

100.0% Correct | 0.0% Incorrect

• 4 Solutions
• 4 Solvers

Last Solution submitted on Jun 25, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers4

Suggested Problems

• Project Euler: Problem 6, Natural numbers, squares and sums.

  2351 Solvers

• Return the first and last characters of a character array

  10925 Solvers

• Binary

  211 Solvers

• Convert yards to feet

  542 Solvers

• Calculate a Damped Sinusoid

  10367 Solvers

More from this Author2

• Pay up

  5 Solvers

• That's not my hat!

  8 Solvers