Structure and Interpretation of Computer Programs
Yüklə 2,71 Mb. Pdf görüntüsü
|
make-simplified-withdraw , [2]
make-stack make-sum , [2]
make-table
message-passing implementation one-dimensional table make-tableau make-term , [2]
make-test make-time-segment make-tree make-vect make-wire , [2], [3] make-withdraw in environment model using let
making change, see counting change map
, [2] as accumulation with multiple arguments map-over-symbols map-successive-pairs mapping
over lists nested, [2] as a transducer over trees mark-sweep garbage collector mathematical function, see function (mathematical) mathematics computer science vs., [2] engineering vs. matrix, represented as sequence matrix-*-matrix matrix-*-vector max (primitive procedure) McAllester, David Allen, [2] McCarthy, John, [2], [3], [4] McDermott, Drew MDL
means of abstraction
define means of combination, see also closure measure in a Euclidean ring member
memo-fib memo-proc memoization, [2] call-by-need and by delay
garbage collection and of thunks memoize memory
in 1964 list-structured memq merge
merge-weighted merging infinite streams, see infinite stream(s) message passing, [2] environment model and in bank account in digital-circuit simulation tail recursion and metacircular evaluator metacircular evaluator for Scheme analyzing version combinations (procedure applications) compilation of, [2] data abstraction in, [2], [3], [4] data-directed eval derived expressions driver loop efficiency of environment model of evaluation in environment operations
eval
and apply
eval
- apply
cycle, [2] expression representation, [2] global environment higher-order procedures in implemented language vs. implementation language job of order of operand evaluation primitive procedures representation of environments representation of procedures representation of true and false running special forms (additional), [2], [3], [4], [5], [6] special forms as derived expressions symbolic differentiation and syntax of evaluated language, [2], [3] tail recursiveness unspecified in
true and
false metalinguistic abstraction MicroPlanner Microshaft midpoint-segment Miller, Gary L. Miller, James S. Miller-Rabin test for primality Milner, Robin min
(primitive procedure) Minsky, Marvin Lee, [2] Miranda MIT
Artificial Intelligence Laboratory Project MAC Research Laboratory of Electronics, [2] MIT Scheme the empty stream
eval
internal definitions numbers
random
user-initial-environment
without-interrupts ML mobile
modeling as a design strategy in science and engineering models of evaluation modified registers, see instruction sequence modifies-register? modularity, [2] along object boundaries functional programs vs. objects hiding principle streams and through dispatching on type through infinite streams through modeling with objects modulo n
money, changing, see counting change monitored procedure Monte Carlo integration Monte Carlo simulation stream formulation monte-carlo infinite stream Moon, David A., [2] morning star, see evening star Morris, J. H. Morse code Mouse, Minnie and Mickey mul (generic) used for polynomial coefficients mul-complex mul-interval more efficient version mul-poly mul-rat
mul-series mul-streams mul-terms Multics time-sharing system multiple-dwelling multiplicand multiplication by Russian peasant method multiplier
primitive constraint selector Munro, Ian mutable data objects, see also queue; table implemented with assignment pairs procedural representation of shared data mutator mutex
mutual exclusion mystery
name, see also local name; variable; local variable encapsulated of a formal parameter of a procedure named let
(special form) naming
of computational objects of procedures naming conventions
!
?
native language of machine natural language parsing, see parsing natural language quotation in needed registers, see instruction sequence needs-register? negate nested applications of car and
cdr nested combinations Yüklə 2,71 Mb. Dostları ilə paylaş:
|