Sign inSign in
ConceptSystems & CS

Higher-order functions

Functions that can take other functions as arguments or return them.
as John Hughes defines itChalmers University of TechnologyThe wording closest to all 3 definitions
Watch it explained

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.

Function3Function pointers or objects1Lisp1List1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • John Hughes

    Chalmers University of Technology · Undergraduate

    Functions that can take other functions as arguments or return them as results, such as maplist.
    • 10:15Why Functional Programming Matters: Higher-Order Glue & Lazy Evaluation
  • Bartosz Milewski

    Undergraduate

    A function that takes another function as an argument or returns a function.
    • 26:21Category Theory 3.2: Kleisli Category

Lectures that assume it

11

Connections

21

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.