... Processing1.1
or alternatively, Lots of Irritating Stupid Parentheses 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... value1.2
When arguments are passed by value, the value of the argument is used to initialize the formal parameter, which then acts as a local variable in the procedure. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... square2.1
The same can also be written using lambda, see section 2.4. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... variables!2.2
See Structure and Interpretation of Computer Programs section 4.1.6, especially exercise 4.19. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... none2.3
This is true in most cases, but sometimes the Scheme implementation might rewrite the define expression using letrec instead of using lambda as an optimization trick. In some cases, when using recursive procedures, the final result of the two forms will differ. R5RS, however, regards the two forms as equivalent. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... not2.4
This is a very inefficient way of computing Fibonacci numbers. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... arguments2.5
Apply is described in section 8.6.3. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... list2.6
Lists are described in more detail in section 8.6.2. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
...list2.7
There is a primitive list in Scheme that does the exact same thing. It is, however, possible to redefine primitives. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
...let2.8
Named let does not work as it should in all Scheme implementations, so you might run into some surprises. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
...do2.9
do is described in section 6.2. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... expression4.1
Actually, the value of the last expression is returned. Since every standard value except #f is considered true, it is possible that the expressions are not boolean expressions. For example, if the last expression is the list (1 2 3) and all expressions evaluate to true, then (1 2 3) will be returned as the value of the whole and expression. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... expression4.2
Actually, the value of the first expression that was considered true will be returned. See the previous footnote discussing and. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
...do 6.1
do is seldom used because it is usually easier to implement the same things using, e.g., named let (see section 2.5.3). The reader is not encouraged to use do to perform iteration, but it never hurts to know of its existence. Someone once said, that the idea behind do is to compress a complex procedure into 4 lines so that nobody can understand it. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... ones8.1
See section 9.1. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
...equal?8.2
The equivalence predicates are described in section 9. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... way9.1
Note that upper and lower case are never distinguished except within character and string constants. Hence, 'foo and 'Foo are considered equal according to eq? Some implementations ignore this. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
...fact311.1
This might be okay in languages like C, but Scheme is not C! 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.