Sign inSign in
ConceptSystems & CS

Lambda expressions

Expressions that produce anonymous procedures without needing to explicitly define them with a name.
as Hal Abelson & Gerald Jay Sussman defines itMITThe wording closest to all 6 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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

4

Each in their own terms, from the easiest level.

  • Hal Abelson & Gerald Jay Sussman

    MIT · Undergraduate

    • 44:03Overview and Introduction to Lisp: Procedural & Symbolic Abstraction
    • 17:15Higher-Order Procedures and Functional Abstraction
  • Eric Grimson

    MIT · Undergraduate

    A special form that creates a procedure and returns it as a value, containing formal parameters and a body.
    • 1:15Scheme Basics: Lambdas and Procedural Abstractions
  • Bartosz Milewski

    Undergraduate

    An anonymous function that can be created on the fly and used as an argument or returned.
    • 27:11Category Theory 3.2: Kleisli Category
  • Bjarne Stroustrup

    University of Edinburgh · Undergraduate

    An anonymous function expression that allows the compiler to write the function object for you.
    • 1:01:59The Essence of C++: Zero-Overhead Abstraction

Lectures that assume it

10

Connections

24

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

4 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.