Structure and Interpretation of Computer Programs
Yüklə 2,71 Mb. Pdf görüntüsü
|
[Go to first, previous, next page; contents; index] 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) ! in names " (double quote) calculus, see lambda calculus notation for mathematical function , see pi sum (sigma) notation , see theta ’ (single quote) read
and, [2] * (primitive multiplication procedure) + (primitive addition procedure) , (comma, used with backquote) - (primitive subtraction procedure) as negation / (primitive division procedure) < (primitive numeric comparison predicate) = (primitive numeric equality predicate) =number? =zero?
(generic) for polynomials > (primitive numeric comparison predicate) >= , [2]
? , in predicate names #f #t
(backquote) ; , see semicolon Abelson, Harold abs
, [2], [3] absolute value abstract data, see also data abstraction abstract models for data abstract syntax in metacircular evaluator in query interpreter abstraction, see also means of abstraction; data abstraction; higher-order procedures common pattern and metalinguistic procedural in register-machine design of search in nondeterministic programming abstraction barriers, [2], [3] in complex-number system in generic arithmetic system accelerated-sequence accumulate , [2] same as fold-right accumulate-n accumulator, [2] Áchárya, Bháscara Ackermann’s function acquire a mutex actions, in register machine actual-value Ada recursive procedures Adams, Norman I., IV add
(generic) used for polynomial coefficients, [2] add-action! , [2]
add-binding-to-frame! add-complex add-complex-to-schemenum add-interval add-lists add-poly
add-rat add-rule-or-assertion! add-streams add-terms add-to-agenda! , [2]
add-vect addend
adder full
half ripple-carry adder (primitive constraint) additivity, [2], [3], [4] address
address arithmetic Adelman, Leonard adjoin-arg adjoin-set binary-tree representation ordered-list representation unordered-list representation for weighted sets adjoin-term , [2]
advance-pc after-delay , [2] agenda, see digital-circuit simulation A’h-mose algebra, symbolic, see symbolic algebra algebraic expression differentiating representing simplifying algebraic specification for data Algol
block structure call-by-name argument passing, [2] thunks, [2] weakness in handling compound objects algorithm optimal probabilistic, [2] aliasing
all-regs (compiler) Allen, John alternative of if always-true amb amb
evaluator, see nondeterministic evaluator ambeval
an-element-of an-integer-starting-from analog computer analyze
metacircular nondeterministic analyze-...
metacircular, [2] nondeterministic analyze-amb analyzing evaluator as basis for nondeterministic evaluator
let
and (query language) evaluation of, [2], [3] and
(special form) evaluation of why a special form with no subexpressions and-gate
and-gate angle
data-directed polar representation rectangular representation angle-polar angle-rectangular announce-output APL Appel, Andrew W. append , [2], [3] as accumulation
append! vs.
with arbitrary number of arguments as register machine ‘‘what is’’ (rules) vs. ‘‘how to’’ (procedure) append!
as register machine append-instruction-sequences , [2] append-to-form (rules) application? applicative-order evaluation in Lisp normal order vs., [2], [3] apply
(lazy) apply
(metacircular) primitive apply vs.
apply (primitive procedure) apply-dispatch modified for compiled code apply-generic with coercion, [2] with coercion by raising with coercion of multiple arguments with coercion to simplify with message passing with tower of types apply-primitive-procedure , [2], [3] apply-rules arbiter arctangent argl register argument passing, see call-by-name argument passing; call-by-need argument passing argument(s) arbitrary number of, [2] delayed Aristotle’s De caelo (Buridan’s commentary on) arithmetic address arithmetic generic, see also generic arithmetic operations Yüklə 2,71 Mb. Dostları ilə paylaş:
|