ConceptSystems & CS
Higher-order functions
Functions that can take other functions as arguments or return them.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
John Hughes
Functions that can take other functions as arguments or return them as results, such as maplist.Bartosz Milewski
A function that takes another function as an argument or returns a function.
Lectures that assume it
11- The Henderson Escher Example: Recursive Graphics
- Henderson Escher Example
- Computational Objects
- List Comprehension, Functions as Objects, Testing, and Debugging in Python
- On Notation: Principles and Impact in Computing
- Category Theory 7.1: Functoriality and Bifunctors
- Data Parallel Haskell
- Category Theory 6.2: Functors in Programming
- Functional Design Patterns
- Design Patterns in Functional Programming
- Mojo: Modular's Unified Device Accelerator Language
Connections
21The lectures that define it or assume it, and the concepts next to it.
Concepts7
Show 1 moreShow fewer
Lectures14
- Why Functional Programming Matters: Higher-Order Glue & Lazy Evaluation
- Category Theory 3.2: Kleisli Category
- Why Functional Programming Matters
- The Henderson Escher Example: Recursive Graphics
- Henderson Escher Example
- Computational Objects
Show 8 moreShow fewer
- List Comprehension, Functions as Objects, Testing, and Debugging in Python
- On Notation: Principles and Impact in Computing
- Category Theory 7.1: Functoriality and Bifunctors
- Data Parallel Haskell
- Category Theory 6.2: Functors in Programming
- Functional Design Patterns
- Design Patterns in Functional Programming
- Mojo: Modular's Unified Device Accelerator Language