Read Structure and Interpretation of Computer Programs Online

Authors: Harold Abelson and Gerald Jay Sussman with Julie Sussman

Structure and Interpretation of Computer Programs (118 page)

#t
table
    
backbone of
    
for coercion
    
for data-directed programming
    
local
    
n
-dimensional
    
one-dimensional
    operation-and-type,
see
operation-and-type table
    
represented as binary tree vs. unordered list
    
testing equality of keys
    
two-dimensional
    
used in simulation agenda
    
used to store computed values
tableau
tabulation
,
[2]
tack-on-instruction-sequence
tagged architecture
tagged data
,
[2]
tagged-list?
tail recursion
    
compiler and
    
environment model of evaluation and
    
explicit-control evaluator and
,
[2]
,
[3]
    
garbage collection and
    
metacircular evaluator and
    
in Scheme
tail-recursive evaluator
tangent
    
as continued fraction
    
power series for
target register
Technological University of Eindhoven
Teitelman, Warren
term list of polynomial
    
representing
term-list
terminal node of a tree
test
(in register machine)
    
simulating
test operation in register machine
test-and-set!
,
[2]
test-condition
text-of-quotation
Thatcher, James W.
THE Multiprogramming System
the-cars
    
register
,
[2]
    
vector
the-cdrs
    
register
,
[2]
    
vector
the-empty-stream
    
in MIT Scheme
the-empty-termlist
,
[2]
the-global-environment
,
[2]
theorem proving (automatic)
θ
(
f
(
n
)) (theta of
f
(
n
))
thunk
    
call-by-name
    
call-by-need
    
forcing
    
implementation of
    
origin of name
time
    
assignment and
    
communication and
    
in concurrent systems
    
functional programming and
    
in nondeterministic computing
,
[2]
    
purpose of
time segment, in agenda
time slicing
timed-prime-test
timing diagram
TK!Solver
tower of types
tracing
    
instruction execution
    
register assignment
transform-painter
transparency, referential
transpose
a matrix
tree
    
B-tree
    
binary
,
see also
binary tree
    
combination viewed as
    
counting leaves of
    
enumerating leaves of
    
fringe of
    
Huffman
    
lazy
    
mapping over
    
red-black
    
represented as pairs
    
reversing at all levels
tree accumulation
tree->list...
tree-map
tree-recursive process
    
order of growth
trigonometric relations
true
true
true?
truncation error
truth maintenance
try-again
Turing machine
Turing, Alan M.
,
[2]
Turner, David
,
[2]
,
[3]
type field
type tag
,
[2]
    
two-level
type(s)
    
cross-type operations
    
dispatching on
    
hierarchy in symbolic algebra
    
hierarchy of
    
lowering
,
[2]
    
multiple subtype and supertype
    
raising
,
[2]
    
subtype
    
supertype
    
tower of
type-inferencing mechanism
type-tag
    
using Scheme data types
typed pointer
typing input expressions

unbound variable
unev
register
unification
    
discovery of algorithm
    
implementation
    
pattern matching vs.
,
[2]
unify-match
union-set
    
binary-tree representation
    
ordered-list representation
    
unordered-list representation
unique
(query language)
unique-pairs
unit square
univariate polynomial
universal machine
    
explicit-control evaluator as
    
general-purpose computer as
University of California at Berkeley
University of Edinburgh
University of Marseille
UNIX
,
[2]
unknown-expression-type
unknown-procedure-type
unordered-list representation of sets
unspecified values
    
define
    
display
    
if
without alternative
    
newline
    
set!
    
set-car!
    
set-cdr!
up-split
update-insts!
upper-bound
upward compatibility
user-initial-environment
(MIT Scheme)
user-print
    
modified for compiled code

V operation on semaphore
val
register
value
    
of a combination
    
of an expression
,
see also
unspecified values
value-proc
variable
,
see also
local variable
    
bound
    
free
    
scope of
,
see also
scope of a variable
    
unbound
    
value of
,
[2]
variable
variable-length code
variable?
,
[2]
vector (data structure)
vector (mathematical)
    
operations on
,
[2]
    
in picture-language frame
    
represented as pair
    
represented as sequence
vector-ref
(primitive procedure)
vector-set!
(primitive procedure)
Venus
verbs
very high-level language

Wadler, Philip
Wadsworth, Christopher
Wagner, Eric G.
Walker, Francis Amasa
Wallis, John
Wand, Mitchell
,
[2]
Waters, Richard C.
weight
weight-leaf
Weyl, Hermann
“what is” vs. “how to” description,
see
declarative vs. imperative knowledge
wheel
(rule)
,
[2]
width
width of an interval
Wilde, Oscar (Perlis's paraphrase of)
Wiles, Andrew
Winograd, Terry
Winston, Patrick Henry
,
[2]
wire, in digital circuit
Wisdom, Jack
Wise, David S.
wishful thinking
,
[2]
withdraw
    
problems in concurrent system
without-interrupts
world line of a particle
,
[2]
Wright, E. M.
Wright, Jesse B.

xcor-vect
Xerox Palo Alto Research Center
,
[2]

Y
operator
ycor-vect
Yochelson, Jerome C.

Zabih, Ramin
zero crossings of a signal
,
[2]
,
[3]
zero test (generic)
    
for polynomials
Zetalisp
Zilles, Stephen N.
Zippel, Richard E.

Other books

No Resting Place by William Humphrey
Bred By A Barbarian 1 by Kensin, Eva
When It's Right by Jennifer Ryan
100 Days To Christmas by Delilah Storm
The Boyfriend Project by Rachel Hawthorne


readsbookonline.com Copyright 2016 - 2024