Lambda Expressions in Scheme

Lecture overview -- Keyboard shortcut: 'u'

Previous page: Evaluation of parenthesized expressions in Scheme -- Keyboard shortcut: 'p'

Next page: Lambda calculus -- Keyboard shortcut: 'n'

Lecture notes - all slides together

Annotated slide -- Keyboard shortcut: 't'

Alphabetic index

Help page about these notes

Introduction to Functional Programming in Scheme - slide 28 : 49

Lambda Expressions in Scheme

A lambda expression is an expression which is evaluated to a function object

(lambda (formal-parameter-list) expression)

Lambda expression characteristics in Scheme:
- No type declaration of formal parameter names
- Call by value parameters
  - In reality passing of references to lists and other structures
- Positional and required parameters
  - (lambda (x y z) expr) accepts exactly three parameters

Simple examples of lambda expressions.