|
The Scheme Programming Language Authors: Dybvig R. K. Published year: 2003 Pages: 92-98/98 |
 |
Index
T
tail call, 5, 65
tail recursion, 5, 65
tan , 152
tconc, 51
tell , 48
templates, 188
threads, 250
thunk, 49, 105 ticks , see engines
timed preemption, 250
timer interrupts, 254
tokens, 277
top-level definitions, 29, 89
trace , 40
tracing, 40
transcript, 13, 179
transcript-off , 13, 179
transcript-on , 13, 179
transformer, 59
tree-copy , 42
true, 7, 35
truncate , 146
type predicates, 37
Index
U
underscore ( ), 59, 189, 203
unification, 247
unify , 248
unless , 62
unquote ( , ), 122
unquote-splicing ( ,@ ), 122
unspecified, 8
unwind-protect (in Lisp), 105
Index
V
values , 110, 110
variable binding, 23, 85
variable reference, 85
variables , 4, 18, 22, 29, 45
vector , 164
vector->list , 166
vector-fill! , 165
vector-length , 164
vector-ref , 165
vector-set! , 165
vector? , 132
vectors, 53, 164, 215
Index
W
when , 62
whitespace, 156, 277
whitespace characters , 7
winders, see dynamic-wind
with-input-from-file , 173
with-output-to-file , 177
with-syntax , 196
write , 177 , 228
write-char , 178
Index
X-Y
x++ , 204
Index
Z
zero? , 144
List of Code Examples
Chapter 2: Getting Started
- Exercise 2.2.1.
- Exercise 2.2.2.
- Exercise 2.2.3.
- Exercise 2.2.4.
- Exercise 2.2.5.
- Exercise 2.2.6.
- Exercise 2.2.7.
- Exercise 2.2.8.
- Exercise 2.3.1.
- Exercise 2.4.1.
- Exercise 2.4.2.
- Exercise 2.4.3.
- Exercise 2.5.1.
- Exercise 2.5.2.
- Exercise 2.5.3.
- Exercise 2.6.1.
- Exercise 2.6.2.
- Exercise 2.6.3.
- Exercise 2.7.1.
- Exercise 2.7.2.
- Exercise 2.8.1.
- Exercise 2.8.2.
- Exercise 2.8.3.
- Exercise 2.8.4.
- Exercise 2.8.5.
- Exercise 2.8.6.
- Exercise 2.8.7.
- Exercise 2.9.1.
- Exercise 2.9.2.
- Exercise 2.9.3.
- Exercise 2.9.4.
- Exercise 2.9.5.
- Exercise 2.9.6.
- Exercise 2.9.7.
- Exercise 2.9.8.
Chapter 3: Going Further
- Exercise 3.1.1.
- Exercise 3.1.2.
- Exercise 3.1.3.
- Exercise 3.1.4.
- Exercise 3.2.1.
- Exercise 3.2.2.
- Exercise 3.2.3.
- Exercise 3.2.4.
- Exercise 3.2.5.
- Exercise 3.2.6.
- Exercise 3.2.7.
- Exercise 3.3.1.
- Exercise 3.3.2.
- Exercise 3.3.3.
- Exercise 3.3.4.
- Exercise 3.3.5.
- Exercise 3.4.1.
- Exercise 3.4.2.
- Exercise 3.4.3.
- Exercise 3.5.1.
- Exercise 3.5.2.
- Exercise 3.5.3.
- Exercise 3.5.4.
Chapter 9: Extended Examples
- Exercise 9.1.1.
- Exercise 9.1.2.
- Exercise 9.1.3.
- Exercise 9.1.4.
- Exercise 9.2.1.
- Exercise 9.2.2.
- Exercise 9.2.3.
- Exercise 9.3.1.
- Exercise 9.3.2.
- Exercise 9.3.3.
- Exercise 9.4.1.
- Exercise 9.4.2.
- Exercise 9.4.3.
- Exercise 9.4.4.
- Exercise 9.4.5.
- Exercise 9.4.6.
- Exercise 9.5.1.
- Exercise 9.5.2.
- Exercise 9.6.1.
- Exercise 9.6.2.
- Exercise 9.6.3.
- Exercise 9.6.4.
- Exercise 9.7.1.
- Exercise 9.7.2.
- Exercise 9.7.3.
- Exercise 9.7.4.
- Exercise 9.7.5.
- Exercise 9.8.1.
- Exercise 9.8.2.
- Exercise 9.8.3.
- Exercise 9.8.4.
- Exercise 9.9.1.
- Exercise 9.9.2.
- Exercise 9.9.3.
- Exercise 9.9.4.
- Exercise 9.9.5.
- Exercise 9.10.1.
- Exercise 9.10.2.
- Exercise 9.10.3.
- Exercise 9.11.1.
- Exercise 9.11.2.
- Exercise 9.11.3.
- Exercise 9.11.4.
- Exercise 9.11.5.
- Exercise 9.11.6.
|
The Scheme Programming Language Authors: Dybvig R. K. Published year: 2003 Pages: 92-98/98 |
|
