          Lecture 2 - Page 38 : 46
 Functional Programming in SchemeExpressions, Types, and Functions * Lisp and Scheme Lisp Scheme * Expressions and values Expressions, values, and types Examples of expressions and their values Evaluation of parenthesized expressions Arithmetic expressions Equality in Scheme The read-eval-print loop * Types Types Type checking Static type checking An example of type checking Types in functional programming languages * Lists Proper lists Symbolic expressions and improper lists Practical list construction List functions Association lists Property lists Tables as lists of rows Programs represented as lists * Other Data Types Other simple types Vectors Strings * Definitions Definitions * Functions The function concept Lambda calculus Functions in Scheme Function objects Functions as first class values Anonymous functions Lambda expressions in Scheme Optional parameters of Scheme functions (1) Optional parameters of Scheme functions (2) Closures Function definition in Scheme Simple web-related functions (1) Simple web-related functions (2) Function exercises
 Anonymous functions
 A function object does not have a name, and a function object is not necessarily bound to a name
 ```1> ((lambda(x) (+ x 1)) 3) 4 2> (define fu-lst (list (lambda (x) (+ x 1)) (lambda (x) (* x 5)))) 3> fu-lst (# #) 4> ((second fu-lst) 6) 30```

An illustration of anonymous functions. The function (lambda(x) (+ x 1)) is the function that adds one (to its parameter). It is organized in a list side by side with the function that multiplies by five. Notice in this context that none of these two functions are named. In the last interaction we apply the latter to the number 6.