Live briefing
Everything about Map (higher-order function)
Computer programming function
In many programming languages, map is a higher-order function that applies a given function to each element of a collection, e.g. a list or set, returning the results in a collection of the same type. It is often called apply-to-all when considered in functional form. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Map (higher-order function)A 5-minute orientation
- Pick up a classic book: Intelligence BulletinThe most-reprinted book on the subject
- Read the landmark paper: On the Stability of the Equator Map for Higher Order Energy FunctionalsCited 2 times
- Go sideways: CatamorphismA closely related topic
- Go sideways: Functor (functional programming)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
Intelligence BulletinUnited States. War Department. Military Intelligence Service · 1942
Eloquent JavascriptMarijn Haverbeke · 2009
Introduction to PolicingSteven M. Cox, Susan Marchionna · 2013- 📕How to be a quantitative ecologistJason Matthiopoulos · 2011
The Conspirators HierarchyJohn Coleman · 1992
Treaty Occupationay ToxicologySuelen Queiroz · 2010
Advanced engineering mathematicsDennis G. Zill · 1992
Principles of gene manipulation and genomicsS. B. Primrose · 2006
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Catamorphism In functional programming, the concept of catamorphism (from the Ancient Greek: κατά "downwards" and μορφή "form, shape") denotes the unique homomorphism…
- Functor (functional programming) In functional programming, a functor is a design pattern inspired by the definition from category theory that allows one to apply a function to values…
- Functor In mathematics, specifically category theory, a functor is a mapping between categories. Functors were first considered in algebraic topology, where algebraic…
- Anamorphism In computer programming, an anamorphism is a function that generates a sequence by repeated application of the function to its previous result. You begin…
- Fold (higher-order function) In functional programming, a fold is a higher-order function that analyzes a recursive data structure and, through use of a given combining operation,…
- Monad (functional programming) In functional programming, monads are a way to structure computations as a sequence of steps, where each step produces a value, plus some extra information…
- Currying In mathematics and computer science, currying (named after Haskell Curry) is the technique of translating a function that takes multiple arguments into…
- Initial algebra In mathematics, an initial algebra is an initial object in the category of F-algebras for a given endofunctor F. This initiality provides a general framework…