Structure and Interpretation of Computer Programs
Yüklə 2,71 Mb. Pdf görüntüsü
|
data-directed, see data-directed programming demand-driven elements of functional, see functional programming imperative odious style programming language design of functional logic object-oriented strongly typed Prolog, [2] prompt-for-input prompts
explicit-control evaluator lazy evaluator metacircular evaluator nondeterministic evaluator query interpreter propagate propagation of constraints proving programs correct pseudo-random sequence pseudodivision of polynomials pseudoremainder of polynomials push
put , [2]
puzzles eight-queens puzzle, [2] logic puzzles Pythagorean triples with nondeterministic programs, [2], [3] with streams qeval , [2]
quantum mechanics quasiquote queens query, see also simple query; compound query query interpreter adding rule or assertion compound query, see compound query data base driver loop, [2] environment structure in frame, [2] improvements to, [2], [3] infinite loops, [2] instantiation Lisp interpreter vs., [2], [3] overview pattern matching, [2] pattern-variable representation, [2] problems with not
and lisp-value , [2] query evaluator, [2] rule, see rule simple query, see simple query stream operations streams of frames, [2] syntax of query language unification, [2] query language, [2] abstraction in compound query, see compound query data base equality testing in extensions to, [2] logical deductions mathematical logic vs. rule, see rule simple query, see simple query query-driver-loop question mark, in predicate names queue double-ended front of operations on procedural implementation of rear of in simulation agenda quotation of character strings of Lisp data objects quotation mark, single vs. double quote (special form) read
and, [2] quoted?
quotient (primitive procedure) Rabin, Michael O. radicand
Ramanujan numbers Ramanujan, Srinivasa rand with reset random (primitive procedure) assignment needed for MIT Scheme random-in-range
random-number generator, [2] in Monte Carlo simulation in primality testing with reset with reset, stream version random-numbers (infinite stream) Raphael, Bertram rational package
rational function reducing to lowest terms rational number(s) arithmetic operations on in MIT Scheme reducing to lowest terms, [2] represented as pairs rational-number arithmetic interfaced to generic arithmetic system need for compound data Raymond, Eric, [2] RC circuit read
(primitive procedure) dotted-tail notation handling by macro characters read
operation in register machine read-eval-print loop, see also driver loop read-eval-print-loop reader macro character real number real-part
data-directed polar representation rectangular representation real-part-polar real-part-rectangular rear-ptr
receive procedure record, in a data base rectangle, representing rectangular package
rectangular? recursion data-directed expressing complicated process in rules in working with trees recursion equations recursion theory recursive procedure
recursive procedure definition recursive process vs. specifying without define
recursive process iterative process vs., [2], [3], [4] linear, [2] recursive procedure vs. register machine for tree, [2] red-black tree reducing to lowest terms, [2], [3] Rees, Jonathan A., [2] referential transparency reg (in register machine) simulating register machine actions controller controller diagram data paths data-path diagram design of language for describing monitoring performance simulator stack subroutine test operation register table, in simulator register(s) representing tracing register-exp register-exp-reg register-machine language
assign , [2]
branch
, [2]
const , [2], [3] entry point
goto , [2]
instructions, [2] label
label
, [2]
op , [2]
perform
, [2]
reg , [2]
restore
, [2]
save , [2]
test
, [2] register-machine simulator Yüklə 2,71 Mb. Dostları ilə paylaş:
|