Structure and Interpretation of Computer Programs
Yüklə 2,71 Mb. Pdf görüntüsü
|
detecting Darlington, John data, [2] abstract, see also data abstraction abstract models for algebraic specification for compound concrete representation of hierarchical, [2] list-structured meaning of mutable, see mutable data objects procedural representation of as program shared symbolic tagged, [2] data abstraction, [2], [3], [4], [5], see also metacircular evaluator for queue data base data-directed programming and indexing, [2] Insatiable Enterprises personnel logic programming and as set of records data paths for register machine data-path diagram data types in Lisp in strongly typed languages data-directed programming, [2] case analysis vs. in metacircular evaluator in query interpreter data-directed recursion deadlock
avoidance recovery debug decimal point in numbers declarative vs. imperative knowledge, [2] nondeterministic computing and decode
decomposition of program into parts deep binding deep-reverse deferred operations define (special form) with dotted-tail notation environment model of
lambda
vs. for procedures, [2] syntactic sugar value of why a special form define
(special form) internal, see internal definition define-variable! , [2]
definite integral estimated with Monte Carlo simulation, [2] definition, see define
; internal definition definition-value definition-variable definition? deKleer, Johan, [2] delay
(special form) explicit explicit vs. automatic implementation using lambda lazy evaluation and memoized, [2] why a special form delay, in digital circuit delay-it
delayed argument delayed evaluation, [2] assignment and explicit vs. automatic in lazy evaluator normal-order evaluation and printing and streams and delayed object delete-queue! , [2] denom
, [2] axiom for dense polynomial dependency-directed backtracking deposit
, with external serializer deposit
message for bank account depth-first search deque deriv
(numerical) deriv
(symbolic) data-directed derivative of a function
derived expressions in evaluator adding to explicit-control evaluator design, stratified differential equation, see also solve
differentiation numerical rules for, [2] symbolic, [2] diffusion, simulation of digital signal digital-circuit simulation agenda implementation primitive function boxes representing wires sample simulation Dijkstra, Edsger Wybe Dinesman, Howard P. Diophantus’s Arithmetic, Fermat’s copy of disjoin
dispatching comparing different styles on type, see also data-directed programming display
(primitive procedure), [2] display-line display-stream distinct? div (generic) div-complex div-interval division by zero div-poly
div-rat div-series div-terms divides?
divisible? division of integers dog, perfectly rational, behavior of DOS/Windows dot-product dotted-tail notation for procedure parameters, [2] in query pattern, [2] in query-language rule
read and
Doyle, Jon draw-line driver loop
in explicit-control evaluator in lazy evaluator in metacircular evaluator in nondeterministic evaluator, [2] in query interpreter, [2] driver-loop
for lazy evaluator for metacircular evaluator for nondeterministic evaluator e as continued fraction as solution to differential equation
, power series for Earth, measuring circumference of edge1-frame edge2-frame efficiency, see also order of growth, see also order of growth of compilation of data-base access of evaluation of Lisp of query processing EIEIO eight-queens puzzle, [2] electrical circuits, modeled with streams, [2] element-of-set? binary-tree representation ordered-list representation unordered-list representation else
(special symbol in cond
) embedded language, language design using empty list denoted as ’() recognizing with null? empty stream empty-agenda? , [2]
empty-arglist empty-instruction-sequence empty-queue? , [2]
empty-termlist? , [2]
encapsulated name enclosing environment enclosing-environment encode
end-of-list marker end-segment , [2] end-with-linkage engineering vs. mathematics entry
Yüklə 2,71 Mb. Dostları ilə paylaş:
|