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 and notes together  slide -- Keyboard shortcut: 't'  Help page about these notes  Alphabetic index  Course home  Lecture 1 - Page 28 : 49
Programming Paradigms
Introduction to Functional Programming in Scheme
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

c:/Users/Kurt/Teaching-material/Pp-Scheme-17/notes/includes/simple-lambda-expressions.scmSimple examples of lambda expressions.