Reading 16: Map, Filter, Reduce
In this reading you’ll learn a design pattern for implementing functions that operate on sequences of elements, and you’ll see how treating functions themselves as first-class values that we can pass around and manipulate in our programs is an especially powerful idea.
Reading 16: Map, Filter, Reduce Reading 16: Map, Filter, Reduce Software in 6.031 Safe from bugs Easy to understand Ready for change Correct today and correct in the unknown future. Communicating clearly with future programmers, including future you. Designed to accommodate change without rewriting. Objectives In this reading you’ll learn a design pattern for implementing functions that operate on sequences of elements, and you’ll see how treating functions themselves as first-class values that we can pass around and manipulate in our programs is an especially powerful idea. Map/filter/reduce
Explore this link on the map →related reading
- Reading 13: Map, Filter, Reduceweb.mit.edu
- A practical introduction to functional programmingmaryrosecook.com
- CSC 151 - Higher-order design, recursive and othereikmeier.sites.grinnell.edu
- An introduction to functional programmingcodewords.recurse.com
- CSC 151 - The "big three" list operationseikmeier.sites.grinnell.edu
- Reading 15: Promisesweb.mit.edu
- Reading 19: Little Languagesweb.mit.edu
- What’s so great about functional programming anyway?jrsinclair.com
- Rust Iterator Cheat Sheetdanielkeep.github.io
- adventures in uncertainty: An Introduction to Recursion Schemesblog.sumtypeofway.com
- Reading 11: Recursive Data Typesweb.mit.edu
- TypeScript: Documentation - TypeScript 3.7typescriptlang.org