Structure and Interpretation of Computer Programs
Yüklə 2,71 Mb. Pdf görüntüsü
|
Fenichel, Robert Fermat, Pierre de Fermat test for primality variant of Fermat’s Little Theorem alternate form proof fermat-test fetch-assertions fetch-rules fib
logarithmic version register machine for (tree-recursive), [2] stack usage, compiled stack usage, interpreted with memoization with named let
Fibonacci numbers, see also fib
Euclid’s GCD algorithm and infinite stream of, see fibs
fibs
(infinite stream) implicit definition FIFO buffer filter, [2] filter filtered-accumulate find-assertions find-divisor first-agenda-item , [2]
first-class elements in language first-exp first-frame first-operand first-segment first-term , [2] fixed point computing with calculator of cosine cube root as golden ratio as as iterative improvement in Newton’s method nth root as square root as, [2], [3] of transformed function unification and fixed-length code fixed-point as iterative improvement fixed-point-of-transform flag
register flatmap
flatten-stream flip-horiz , [2] flip-vert , [2] flipped-pairs , [2], [3] Floyd, Robert fold-left fold-right for-each , [2]
for-each-except Forbus, Kenneth D. force , [2]
forcing a thunk vs. force a thunk force-it memoized version forget-value! , [2]
formal parameters names of scope of formatting input expressions Fortran, [2] inventor of restrictions on compound data forwarding address fourth root, as fixed point fraction, see rational number(s) frame (environment model) as repository of local state global frame (picture language), [2] coordinate map frame (query interpreter), see also pattern matching; unification representation frame-coord-map frame-values frame-variables framed-stack discipline Franz Lisp free register, [2] free list free variable in internal definition Friedman, Daniel P., [2] fringe
as a tree enumeration front-ptr front-queue , [2]
full-adder
full-adder function (mathematical) notation for Ackermann’s composition of derivative of fixed point of procedure vs. rational repeated application of smoothing of function box, in digital circuit functional programming, [2] concurrency and functional programming languages time and Gabriel, Richard P. garbage collection memoization and mutation and tail recursion and garbage collector compacting mark-sweep GCD, see greatest common divisor gcd register machine for, [2] gcd-terms general-purpose computer, as universal machine generate-huffman-tree generating sentences generic arithmetic operations structure of system generic operation generic procedure, [2] generic selector, [2] Genesis
get , [2]
get-contents get-global-environment get-register get-register-contents , [2] get-signal , [2] get-value , [2] glitch
global environment, [2] in metacircular evaluator global frame Goguen, Joseph golden ratio as continued fraction Gordon, Michael goto (in register machine) label as destination simulating goto-dest grammar
graphics, see picture language Gray, Jim greatest common divisor, see also gcd
generic of polynomials used to estimate used in rational-number arithmetic Green, Cordell Griss, Martin Lewis Guttag, John Vogel half-adder
half-adder simulation of half-interval method
half-interval-method Newton’s method vs. halting problem Halting Theorem Hamming, Richard Wesley, [2] Hanson, Christopher P., [2] Hardy, Godfrey Harold, [2] has-value? , [2] Hassle
Havender, J. Haynes, Christopher T. headed list, [2] Hearn, Anthony C. Henderson, Peter, [2], [3] Henderson diagram Heraclitus Heron of Alexandria Hewitt, Carl Eddie, [2], [3], [4] hiding principle hierarchical data structures, [2] hierarchy of types in symbolic algebra inadequacy of Yüklə 2,71 Mb. Dostları ilə paylaş:
|