Higher-order functions are functions that manipulate other functions. We introduce the notion of nameless functions, functional arguments and functional results. We discuss currying, a common transformation between some traditional functions and some higher-order functions, and study situations where one or the other representation is advantageous. We present some standard higher-order functions that allow to concisely work with lists and other inductive data structures.