What are higher order functions in functional programming? How does the 'map' function work and why is it a higher order function?

Higher order functions either have one or more arguments that are themselves functions, return a function as their result, or both. Arguments to higher order functions can themselves be higher order functions, though this is not a requirement. 
The ‘map’ function requires both a function and a list be passed as arguments. Since it requires a function as argument, 'map' must be a higher order function. The function that is passed as an argument is applied to every element of the list (using each element as the argument of the passed function), to form a new list of results. The resulting list will have the same length but may have a different type to the initial list, depending on the function used as argument.

JC
Answered by Joseph C. Computing tutor

1822 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

In a computer program, a parameter may be passed to a procedure by value. Explain how this method works.


Given a graph with n nodes and m edges, every edge has a passing cost that can be negative, find the minimum distance between node 1 and every other node


Convert the base-10 number 74 into an 8-bit binary number


Outline the differences between how a compiler and an interpreter works, and explain the advantages and usage of of each [12 marks]


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

MyTutor is part of the IXL family of brands:

© 2025 by IXL Learning