A Scheme expression is a construct that returns a value, such as a
variable reference, literal, procedure call, or conditional.

Expression types are categorized as primitive or derived.
Primitive expression types include variables and procedure calls.
Derived expression types are not semantically primitive, but can instead
be explained in terms of the primitive constructs as in
section derived expression types. They are redundant in the strict sense of
the word, but they capture common patterns of usage, and are therefore
provided as convenient abbreviations.

(section Variables and regions) is a variable reference. The value of
the variable reference is the value stored in the location to which the
variable is bound. It is an error to reference an
unbound
variable.

(quote <datum>) evaluates to <datum>.
<Datum> may be any external representation of a Scheme object (see
section External representations). This notation is used to
include literal constants in Scheme code.

A procedure call is written by simply enclosing in parentheses
expressions for the procedure to be called and the arguments to be
passed to it. The operator and operand expressions are evaluated (in an
unspecified order) and the resulting procedure is passed the resulting
arguments.

(+ 3 4) => 7
((if #f + *) 3 4) => 12

A number of procedures are available as the values of variables in the
initial environment; for example, the addition and multiplication
procedures in the above examples are the values of the variables
+ and *.
New procedures are created by evaluating lambda expressions (see section
section Lambda expressions).

Procedure calls are also called combinations.

Note: In contrast to other dialects of Lisp, the order of
evaluation is unspecified, and the operator expression and the operand
expressions are always evaluated with the same evaluation rules.

Note: Although the order of evaluation is otherwise unspecified, the effect of
any concurrent evaluation of the operator and operand expressions is
constrained to be consistent with some sequential order of evaluation.
The order of evaluation may be chosen differently for each procedure call.

Note: In many dialects of Lisp, the empty combination,
(), is a legitimate expression. In Scheme, combinations must
have at
least one subexpression, so () is not a syntactically valid
expression.

Syntax: <Formals> should be a formal arguments list as described below,
and <body> should be a sequence of one or more expressions.

Semantics:
A lambda expression evaluates to a procedure. The environment in
effect when the lambda expression was evaluated is remembered as part of the
procedure. When the procedure is later called with some actual
arguments, the environment in which the lambda expression was evaluated will
be extended by binding the variables in the formal argument list to
fresh locations, the corresponding actual argument values will be stored
in those locations, and the expressions in the body of the lambda expression
will be evaluated sequentially in the extended environment. The result
of the last expression in the body will be returned as the result of
the procedure call.

(<variable 1> ...):
The procedure takes a fixed number of arguments; when the procedure is
called, the arguments will be stored in the bindings of the
corresponding variables.

<variable>:
The procedure takes any number of arguments; when the procedure is
called, the sequence of actual arguments is converted into a newly
allocated list, and the list is stored in the binding of the
<variable>.

(<variable 1> ... <variable n-1> . <variable n>):
If a space-delimited period precedes the last variable, then
the value stored in the binding of the last variable will be a
newly allocated
list of the actual arguments left over after all the other actual
arguments have been matched up against the other formal arguments.

It is an error for a <variable> to appear more than once in
<formals>.

Syntax: <Test>, <consequent>, and <alternate> may be arbitrary
expressions.

Semantics: An if expression is evaluated as follows: first,
<test> is evaluated. If it yields a true value
(see section Booleans), then <consequent> is evaluated
and its value is returned. Otherwise <alternate> is evaluated and
its value is returned. If <test> yields a false value and no
<alternate> is specified, then the result of the expression is
unspecified.

<Expression> is evaluated, and the resulting value is stored in
the location to which <variable> is bound. <Variable> must
be bound either in some region
enclosing the set! expression
or at top level. The result of the set! expression is
unspecified.

where <test> is any expression. The last <clause> may be
an "else clause," which has the form

(else <expression 1> <expression 2> ...).

Semantics: A cond expression is evaluated by evaluating the <test>
expressions of successive <clause>s in order until one of them
evaluates to a true value
(see section Booleans). When a <test> evaluates to a
true value, then the remaining <expression>s in its <clause> are
evaluated in order, and the result of the last <expression> in the
<clause> is returned as the result of the entire cond
expression. If the selected <clause> contains only the <test>
and no <expression>s, then the value of the <test> is returned
as the result. If all <test>s evaluate to false values, and there
is no else clause, then the result of the conditional expression is
unspecified; if there is an else clause, then its <expression>s are
evaluated, and the value of the last one is returned.

Some implementations support an alternative <clause> syntax,
(<test> => <recipient>), where <recipient> is an
expression. If <test> evaluates to a true value, then
<recipient> is evaluated. Its value must be a procedure of one
argument; this procedure is then invoked on the value of the
<test>.

(cond ((assv 'b '((a 1) (b 2))) => cadr)
(else #f)) => 2

essential syntax:case<key> <clause 1> <clause 2> ...

Syntax: <Key> may be any expression. Each <clause> should have
the form

((<datum 1> ...) <expression 1> <expression 2> ...),

where each <datum> is an external representation of some object.
All the <datum>s must be distinct.
The last <clause> may be an "else clause," which has the form

(else <expression 1> <expression 2> ...).

Semantics: A case expression is evaluated as follows. <Key> is
evaluated and its result is compared against each <datum>. If the
result of evaluating <key> is equivalent (in the sense of
eqv?; see section Equivalence predicates) to a <datum>, then the
expressions in the corresponding <clause> are evaluated from left
to right and the result of the last expression in the <clause> is
returned as the result of the case expression. If the result of
evaluating <key> is different from every <datum>, then if
there is an else clause its expressions are evaluated and the
result of the last is the result of the case expression;
otherwise
the result of the case expression is unspecified.

The <test> expressions are evaluated from left to right, and the
value of the first expression that evaluates to a false value (see
section Booleans) is returned. Any remaining expressions
are not evaluated. If all the expressions evaluate to true values, the
value of the last expression is returned. If there are no expressions
then #t is returned.

The <test> expressions are evaluated from left to right, and the value of the
first expression that evaluates to a true value (see
section Booleans) is returned. Any remaining expressions
are not evaluated. If all expressions evaluate to false values, the
value of the last expression is returned. If there are no
expressions then #f is returned.

The three binding constructs let, let*, and letrec
give Scheme a block structure, like Algol 60. The syntax of the three
constructs is identical, but they differ in the regions
they establish
for their variable bindings. In a let expression, the initial
values are computed before any of the variables become bound; in a
let* expression, the bindings and evaluations are performed
sequentially; while in a letrec expression, all the bindings are
in
effect while their initial values are being computed, thus allowing
mutually recursive definitions.

essential syntax:let<bindings> <body>

Syntax: <Bindings> should have the form

((<variable 1> <init 1>) ...),

where each <init> is an expression, and <body> should be a
sequence of one or more expressions. It is
an error for a <variable> to appear more than once in the list of variables
being bound.

Semantics: The <init>s are evaluated in the current environment (in some
unspecified order), the <variable>s are bound to fresh locations
holding the results, the <body> is evaluated in the extended
environment, and the value of the last expression of <body> is
returned. Each binding of a <variable> has <body> as its
region.

Semantics:Let* is similar to let, but the bindings are performed
sequentially from left to right, and the region
of a binding indicated
by (<variable> <init>) is that part of the let*
expression to the right of the binding. Thus the second binding is done
in an environment in which the first binding is visible, and so on.

(let ((x 2) (y 3))
(let* ((x 7)
(z (+ x y)))
(* z x))) => 70

essential syntax:letrec<bindings> <body>

Syntax: <Bindings> should have the form

((<variable 1> <init 1>) ...),

and <body> should be a sequence of
one or more expressions. It is an error for a <variable> to appear more
than once in the list of variables being bound.

Semantics: The <variable>s are bound to fresh locations
holding undefined values, the <init>s are evaluated in the resulting
environment (in some unspecified order), each <variable> is assigned
to the result of the corresponding <init>, the <body> is
evaluated in the resulting environment, and the value of the last
expression in <body> is returned. Each binding of a <variable>
has the entire letrec expression as its region , making it
possible to define mutually recursive procedures.

One restriction on letrec is very important: it must be possible
to evaluate each <init> without assigning or referring to the value of any
<variable>. If this restriction is violated, then it is an error. The
restriction is necessary because Scheme passes arguments by value rather than by
name. In the most common uses of letrec, all the <init>s are
lambda expressions and the restriction is satisfied automatically.

Do is an iteration construct. It specifies a set of variables to
be bound, how they are to be initialized at the start, and how they are
to be updated on each iteration. When a termination condition is met,
the loop exits with a specified result value.

Do expressions are evaluated as follows:
The <init> expressions are evaluated (in some unspecified order),
the <variable>s are bound to fresh locations, the results of the
<init> expressions are stored in the bindings of the
<variable>s, and then the iteration phase begins.

Each iteration begins by evaluating <test>; if the result is
false (see section Booleans), then the <command>
expressions are evaluated in order for effect, the <step>
expressions are evaluated in some unspecified order, the
<variable>s are bound to fresh locations, the results of the
<step>s are stored in the bindings of the
<variable>s, and the next iteration begins.

If <test> evaluates to a true value, then the
<expression>s are evaluated from left to right and the value of
the last <expression> is returned as the value of the do
expression. If no <expression>s are present, then the value of
the do expression is unspecified.

The region
of the binding of a <variable> consists of the entire do
expression except for the <init>s. It is an error for a
<variable> to appear more than once in the list of do
variables.

A <step> may be omitted, in which case the effect is the
same as if (<variable> <init> <variable>) had
been written instead of (<variable> <init>).

Some implementations of Scheme permit a variant on the syntax of
let called "named let" which provides a more general
looping construct than do, and may also be used to express
recursions.

Named let has the same syntax and semantics as ordinary
let except that <variable> is bound within <body> to a
procedure whose formal arguments are the bound variables and whose body
is <body>. Thus the execution of <body> may be repeated by
invoking the procedure named by <variable>.

The delay construct is used together with the
procedure force to
implement lazy evaluation or call by need.
(delay <expression>) returns an object called a
promise which at some point in the future may be asked (by
the force procedure)
to evaluate <expression> and deliver the resulting value.

See the description of force (section Control features) for a
more complete description of delay.

"Backquote" or "quasiquote"
expressions are useful
for constructing a list or vector structure when most but not all of the
desired structure is known in advance. If no
commas
appear within the <template>, the result of evaluating
`<template> is equivalent to the result of evaluating
'<template>. If a comma
appears within the
<template>, however, the expression following the comma is
evaluated ("unquoted") and its result is inserted into the structure
instead of the comma and the expression. If a comma appears followed
immediately by an at-sign (@),
then the following
expression must evaluate to a list; the opening and closing parentheses
of the list are then "stripped away" and the elements of the list are
inserted in place of the comma at-sign expression sequence.

Quasiquote forms may be nested. Substitutions are made only for
unquoted components appearing at the same nesting level
as the outermost backquote. The nesting level increases by one inside
each successive quasiquotation, and decreases by one inside each
unquotation.

The notations `<template> and
(quasiquote <template>) are identical in all respects.
,<expression> is identical to (unquote
<expression>), and ,<expression> is identical to
(unquote-splicing <expression>). The external syntax
generated by write for two-element lists whose
car is one of these symbols may vary between implementations.