⇡

Term Index

Any inaccuracies in this index may be explained by the fact that it has been prepared with the help of a computer.

—Donald E. Knuth, Fundamental Algorithms
(Volume 1 of The Art of Computer Programming)

Jump to:   A   B   C   D   E   F   G   H   I   K   L   M   N   O   P   Q   R   S   T   U   V   W   Z  
Index Entry  Section
A
abstract models: 2.1.3
abstract syntax: 4.1.1
abstraction barriers: Chapter 2
abstraction barriers: 2.1.2
accumulator: 2.2.3
accumulator: 3.1.1
acquired: 3.4.2
action: 5.1.1
additive: 2.4.3
additively: Chapter 2
additively: 2.4
address: 5.3.1
address arithmetic: 5.3.1
agenda: 3.3.4
algebraic specification: 2.1.3
aliasing: 3.1.3
and-gate: 3.3.4
applicative-order: 4.2.1
applicative-order evaluation: 1.1.5
arbiter: 3.4.2
arguments: 1.1.1
assembler: 5.2.1
assertions: 4.4.1
assignment operator: 3.1
atomically: 3.4.2
automatic storage allocation: 5.3
average damping: 1.3.3
B
B-trees: 2.3.3
backbone: 3.3.3
backquote: 5.5.2
backtracks: 4.3.1
balanced: 2.2.2
barrier synchronization: 3.4.2
base address: 5.3.1
Bertrand’s hypothesis: 3.5.2
bignum: 5.3.1
bindings: 3.2
binds: 1.1.8
binomial coefficients: 1.2.2
block structure: 1.1.8
bound variable: 1.1.8
box-and-pointer notation: 2.2
breakpoint: 5.2.4
broken heart: 5.3.2
bugs: Chapter 1
C
cache-coherence: 3.4.1
call-by-name: 3.5.1
call-by-name: 4.2.2
call-by-name thunks: 3.5.1
call-by-need: 3.5.1
call-by-need: 4.2.2
call-by-need thunks: 3.5.1
capturing: 1.1.8
Carmichael numbers: 1.2.6
case analysis: 1.1.6
cell: 3.4.2
chronological backtracking: 4.3.1
Church numerals: 2.1.3
Church-Turing thesis: 4.1.5
clauses: 1.1.6
closed world assumption: 4.4.3
closure: Chapter 2
closure property: 2.2
code generator: 5.5.1
coerce: 2.5.2
coercion: 2.5.2
combinations: 1.1.1
comments: 2.2.3
compacting: 5.3.2
compilation: 5.5
compile-time environment: 5.5.6
composition: 1.3.4
compound data: Chapter 2
compound data object: Chapter 2
compound procedure: 1.1.4
computability: 4.1.5
computational process: Chapter 1
concurrently: 3.4
congruent modulo: 1.2.6
connectors: 3.3.5
consequent expression: 1.1.6
constraint networks: 3.3.5
constructors: 2.1
continuation procedures: 4.3.3
continued fraction: 1.3.3
control structure: 4.4.3
controller: 5.1
conventional interfaces: Chapter 2
conventional interfaces: 2.2.3
current time: 3.3.4
D
data: Chapter 1
data: 2.1.3
data abstraction: Chapter 2
data abstraction: 2.1
data paths: 5.1
data-directed: 2.4
data-directed programming: Chapter 2
data-directed programming: 2.4.3
deadlock: 3.4.2
deadlock-recovery: 3.4.2
debug: Chapter 1
deep binding: 4.1.3
deferred operations: 1.2.1
delayed argument: 3.5.4
delayed evaluation: Chapter 3
delayed evaluation: 3.5
delayed object: 3.5.1
dense: 2.5.3
dependency-directed backtracking: 4.3.1
depth-first search: 4.3.1
deque: 3.3.2
derived expressions: 4.1.2
digital signals: 3.3.4
dispatching on type: 2.4.3
displacement number: 5.5.6
dotted-tail notation: 2.2.1
driver loop: 4.1.4
E
empty list: 2.2.1
encapsulated: 3.1.1
enclosing environment: 3.2
entry points: 5.1.1
enumerator: 2.2.3
environment: 1.1.2
environment model: Chapter 3
environments: 3.2
Euclid’s Algorithm: 1.2.5
Euclidean ring: 2.5.3
evaluating: 1.1.1
evaluator: Chapter 4
event-driven simulation: 3.3.4
evlis tail recursion: 5.4.1
execution procedure: 4.1.7
explicit-control evaluator: 5.4
expression: 1.1.1
F
failure continuation: 4.3.3
FIFO: 3.3.2
filter: 1.3.1
filter: 2.2.3
first-class: 1.3.4
fixed point: 1.3.3
fixed-length: 2.3.4
forcing: 4.2.2
forwarding address: 5.3.2
frame: 4.4.2
frame coordinate map: 2.2.4
frame number: 5.5.6
framed-stack: 5.4.1
frames: 3.2
free: 1.1.8
free list: 5.3.1
front: 3.3.2
full-adder: 3.3.4
function boxes: 3.3.4
functional programming: 3.1.3
functional programming languages: 3.5.5
G
garbage: 5.3.2
garbage collection: 5.3
garbage collection: 5.3.2
garbage collector: 3.3.1
garbage-collected: 4.2.2
generic operations: Chapter 2
generic procedures: 2.3.4
generic procedures: 2.4
glitches: Chapter 1
global: 1.2
global: 3.2
global environment: 1.1.2
golden ratio: 1.2.2
grammar: 4.3.2
H
half-adder: 3.3.4
half-interval method: 1.3.3
Halting Theorem: 4.1.5
headed list: 3.3.3
hiding principle: 3.1.1
hierarchical: 2.2
hierarchy of types: 2.5.2
higher-order procedures: 1.3
Horner’s rule: 2.2.3
I
imperative programming: 3.1.3
indeterminates: 2.5.3
index: 5.3.1
indexing: 4.4.2
instantiated with: 4.4.1
instruction counting: 5.2.4
instruction execution procedure: 5.2.1
instruction sequence: 5.5.1
instruction tracing: 5.2.4
instructions: Chapter 5
instructions: 5.1.1
integerizing factor: 2.5.3
integers: 1.1
integrator: 3.5.3
interning: 5.3.1
interpreter: Chapter 1
interpreter: Chapter 4
invariant quantity: 1.2.4
inverter: 3.3.4
iterative improvement: 1.3.4
iterative process: 1.2.1
K
k-term: 1.3.3
key: 2.3.3
L
labels: 5.1.1
lazy evaluation: 4.2.1
lexical address: 5.5.6
lexical addressing: 4.1.3
lexical scoping: 1.1.8
linear iterative process: 1.2.1
linear recursive process: 1.2.1
linkage descriptor: 5.5.1
list: 2.2.1
list: 2.2.1
list: 2.2.1
list structure: 2.2.1
list-structured: 2.1.1
list-structured memory: 5.3
local evolution: 1.2
local state variables: 3.1
location: 5.3.1
logic-programming: Chapter 4
logical and: 3.3.4
logical deductions: 4.4.1
logical or: 3.3.4
M
machine language: 5.5
macro: 4.1.2
map: 2.2.3
mark-sweep: 5.3.2
memoization: 1.2.2
Memoization: 3.3.3
memoize: 4.2.2
merge: 3.5.5
message passing: 2.1.3
message passing: 2.4.3
message-passing: 3.1.1
metacircular: 4.1
Metalinguistic abstraction: Chapter 4
Miller-Rabin test: 1.2.6
modular: Chapter 3
modulo: 1.2.6
modulo: 1.2.6
modus ponens: 4.4.3
moments in time: 3.4
Monte Carlo integration: 3.1.2
Monte Carlo simulation: 3.1.2
mutable data objects: 3.3
mutators: 3.3
mutex: 3.4.2
mutual exclusion: 3.4.2
N
n-fold smoothed function: 1.3.4
native language: 5.5
needed: 5.5.1
networks: Chapter 4
Newton’s method: 1.3.4
nil: 2.2.1
non-computable: 4.1.5
non-strict: 4.2.1
nondeterministic: 3.4.1
nondeterministic choice point: 4.3.1
nondeterministic computing: Chapter 4
nondeterministic computing: 4.3
normal-order: 4.2.1
normal-order evaluation: 1.1.5
normal-order evaluation: Chapter 4
O
obarray: 5.3.1
object program: 5.5
objects: Chapter 3
open-code: 5.5.5
operands: 1.1.1
operator: 1.1.1
operator: 4.1.6
or-gate: 3.3.4
order of growth: 1.2.3
ordinary: 2.5.1
output prompt: 4.1.4
P
package: 2.4.3
painter: 2.2.4
pair: 2.1.1
pair: 2.1.1
parse: 4.3.2
Pascal’s triangle: 1.2.2
pattern: 4.4.1
pattern matcher: 4.4.2
pattern matching: 4.4.2
pattern variable: 4.4.1
pipelining: 3.4
pointer: 2.2
poly: 2.5.3
power series: 3.5.2
predicate: 1.1.6
predicate: 1.1.6
prefix: 2.3.4
prefix code: 2.3.4
prefix notation: 1.1.1
pretty-printing: 1.1.1
primitive constraints: 3.3.5
probabilistic algorithms: 1.2.6
procedural abstraction: 1.1.8
procedural epistemology: Preface 1e
procedure: 1.2.1
procedure definitions: 1.1.4
procedures: Chapter 1
process: 1.2.1
program: Chapter 1
programming languages: Chapter 1
prompt: 4.1.4
pseudo-random: 3.1.2
pseudodivision: 2.5.3
pseudoremainder: 2.5.3
Q
quasiquote: 5.5.2
queries: 4.4
query language: 4.4
queue: 3.3.2
quote: 2.3.1
R
Ramanujan numbers: 3.5.3
rational functions: 2.5.3
RC circuit: 3.5.3
read-eval-print loop: 1.1.1
reader macro characters: 4.4.4.7
real numbers: 1.1
rear: 3.3.2
recursion equations: Chapter 1
Recursion theory: 4.1.5
recursive: 1.1.3
recursive: 1.1.8
recursive process: 1.2.1
red-black trees: 2.3.3
referentially transparent: 3.1.3
register machine: Chapter 5
register table: 5.2.1
registers: Chapter 5
released: 3.4.2
remainder of: 1.2.6
resolution principle: 4.4
ripple-carry adder: 3.3.4
robust: 2.2.4
RSA algorithm: 1.2.6
rules: 4.4
rules: 4.4.1
S
satisfy: 4.4.1
scope: 1.1.8
selectors: 2.1
semaphore: 3.4.2
separator code: 2.3.4
sequence: 2.2.1
sequence accelerator: 3.5.3
sequences: 1.3.1
serializer: 3.4.2
serializers: 3.4.2
series RLC circuit: 3.5.4
shadow: 3.2
shared: 3.3.1
side-effect bugs: 3.1.3
sieve of Eratosthenes: 3.5.2
smoothing: 1.3.4
source language: 5.5
source program: 5.5
sparse: 2.5.3
special forms: 1.1.3
stack: 1.2.1
stack: 5.1.4
state variables: 1.2.1
state variables: 3.1
statements: 5.5.1
stop-and-copy: 5.3.2
stratified design: 2.2.4
stream processing: 1.1.5
streams: Chapter 3
streams: 3.5
streams: 3.5
strict: 4.2.1
subroutine: 5.1.3
substitution: 1.1.5
substitution model: 1.1.5
subtype: 2.5.2
success continuation: 4.3.3
summation of a series: 1.3.1
summer: 3.5.3
supertype: 2.5.2
symbolic expressions: Chapter 2
syntactic sugar: 1.1.3
syntax: 4.1
systematically search: 4.3.1
systems: Chapter 4
T
tableau: 3.5.3
tabulation: 1.2.2
tabulation: 3.3.3
tagged architectures: 5.3.1
tail-recursive: 1.2.1
tail-recursive: 5.4.2
target: 5.5.1
thrashing: UTF
thunk: 4.2.2
thunks: 4.2.2
time: 3.4
time segments: 3.3.4
tower: 2.5.2
tree accumulation: 1.1.3
tree recursion: 1.2.2
trees: 2.2.2
truth maintenance: 4.3.1
Turing machine: 4.1.5
type field: 5.3.1
type tag: 2.4.2
type tags: 2.4
type-inferencing: 3.5.4
typed pointers: 5.3.1
U
unbound: 3.2
unification: 4.4
unification: 4.4.2
unification: 4.4.2
unification algorithm: 4.4
univariate polynomials: 2.5.3
universal machine: 4.1.5
upward-compatible extension: 4.2.2
V
value: 1.1.2
value of a variable: 3.2
values: 2.3.1
variable: 1.1.2
variable-length: 2.3.4
vector: 5.3.1
W
width: 2.1.4
wires: 3.3.4
wishful thinking: 2.1.1
Z
zero crossings: 3.5.3
Jump to:   A   B   C   D   E   F   G   H   I   K   L   M   N   O   P   Q   R   S   T   U   V   W   Z  
⇣