Lecture 2 - Page 3 : 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
Scheme
Scheme is a small, yet powerful language in the Lisp family
Scheme characteristics:
Supports functional programming - but not on an exclusive basis
Functions are first class data objects
Uses static binding of free names in procedures and functions
Types are checked and handled at run time - no static type checking
Parameters are evaluated before being passed - no lazyness
Scheme
is an attractive alternative to
Common Lisp
(a big monster) and
Emacs Lisp
(the rather primitive extension language of the Emacs text editor).
Schemers.org home page
The Scheme Language Report
Foldoc: Scheme
Getting started with Scheme and LAML
![Next page: Expressions and values [Section] -- Keyboard shortcut: 'n'](./images/nav-right.gif "Next page: Expressions and values [Section] -- Keyboard shortcut: 'n'")
