Lecture 2 - Page 31 : 46
Functional Programming in Scheme
Expressions, 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
Definitions
A
definition
binds a name to a value
(define name expression)
A name is first introduced and the name is bound to the value of the expression
About Scheme
define
forms
Appears normally at
top level
in a program
Creates a new location named
name
and binds the value of
expression
to that location
In case the location already exists we have a
redefinition
, and the
define
form is equivalent to the assignment
(set! name expr)
Does not allow for imperative programming, because
define
cannot appear in selections, iterations, etc.
Can also appear at certain positions in bodies, but only as syntactic sugar for local binding forms (
letrec
)
R5RS: Definitions