Structure and Interpretation of Computer Programs

enumerate-interval

enumerate-tree

enumerator

env

 register

environment, [2]

    compile-time, see compile-time environment 

    as context for evaluation

    enclosing

    global, see global environment 

    lexical scoping and

    in query interpreter

    renaming vs.

environment model of evaluation, [2]

    environment structure

    internal definitions

    local state

    message passing

    metacircular evaluator and

    procedure-application example

    rules for evaluation

    tail recursion and

eq?

 (primitive procedure)

    for arbitrary objects

    as equality of pointers, [2]

    implementation for symbols

    numerical equality and

equ?

 (generic predicate)

equal-rat?

equal?

equality 

    in generic arithmetic system

    of lists

    of numbers, [2], [3]

    referential transparency and

    of symbols

equation, solving, see half-interval method; Newton’s method; 

solve

 

Eratosthenes

error

 (primitive procedure)

error handling 

    in compiled code

    in explicit-control evaluator, [2]

Escher, Maurits Cornelis

estimate-integral

estimate-pi

, [2]

Euclid’s Algorithm, [2], see also greatest common divisor 

    order of growth

    for polynomials

Euclid’s Elements

Euclid’s proof of infinite number of primes

Euclidean ring

---

Euler, Leonhard

    proof of Fermat’s Little Theorem

    series accelerator

euler-transform

ev-application

ev-assignment

ev-begin

ev-definition

ev-if

ev-lambda

ev-quoted

ev-self-eval

ev-sequence

 

    with tail recursion

    without tail recursion

ev-variable

eval

 (lazy)

eval

 (metacircular), [2]

    analyzing version

    data-directed

    primitive 

eval

 vs.

eval

 (primitive procedure)

    MIT Scheme

    used in query interpreter

eval-assignment

eval-definition

eval-dispatch

eval-if

 (lazy)

eval-if

 (metacircular)

eval-sequence

evaluation 

    applicative-order, see applicative-order evaluation 

    delayed, see delayed evaluation 

    environment model of, see environment model of evaluation 

    models of

    normal-order, see normal-order evaluation 

    of a combination

    of 

and

    of 

cond

    of 

if

    of 

or

    of primitive expressions

    of special forms

    order of subexpression evaluation, see order of evaluation 

    substitution model of, see substitution model of procedure application 

evaluator, see also interpreter 

    as abstract machine

    metacircular

    as universal machine

evaluators, see metacircular evaluator; analyzing evaluator; lazy evaluator; nondeterministic evaluator;

---

query interpreter; explicit-control evaluator 

even-fibs

, [2]

even?

evening star, see Venus 

event-driven simulation

evlis tail recursion

exact integer

exchange

exclamation point in names

execute

execute-application

 

    metacircular

    nondeterministic

execution procedure 

    in analyzing evaluator

    in nondeterministic evaluator, [2], [3]

    in register-machine simulator, [2]

exp

 register

expand-clauses

explicit-control evaluator for Scheme

    assignments

    combinations

    compound procedures

    conditionals

    controller

    data paths

    definitions

    derived expressions

    driver loop

    error handling, [2]

    expressions with no subexpressions to evaluate

    as machine-language program

    machine model

    modified for compiled code

    monitoring performance (stack use)

    normal-order evaluation

    operand evaluation

    operations

    optimizations (additional)

    primitive procedures

    procedure application

    registers

    running

    sequences of expressions

    special forms (additional), [2]

    stack usage

    tail recursion, [2], [3]

    as universal machine

expmod

, [2], [3]

exponential growth

---

    of tree-recursive Fibonacci-number computation

exponentiation

    modulo n

expression, see also compound expression; primitive expression 

    algebraic, see algebraic expressions 

    self-evaluating

    symbolic, see also symbol(s) 

expression-oriented vs. imperative programming style

expt

 

    linear iterative version

    linear recursive version

    register machine for

extend-environment

, [2]

extend-if-consistent

extend-if-possible

external-entry

extract-labels

, [2]

#f

factorial, see also 

factorial

 

    infinite stream

    with 

letrec

    without 

letrec

 or 

define

factorial

 

    as an abstract machine

    compilation of, [2]

    environment structure in evaluating

    linear iterative version

    linear recursive version

    register machine for (iterative), [2]

    register machine for (recursive), [2]

    stack usage, compiled

    stack usage, interpreted, [2]

    stack usage, register machine

    with assignment

    with higher-order procedures

failure continuation (nondeterministic evaluator), [2]

    constructed by 

amb

    constructed by assignment

    constructed by driver loop

failure, in nondeterministic computation

    bug vs.

    searching and

false

false

false?

fast-expt

fast-prime?

feedback loop, modeled with streams

Feeley, Marc

Feigenbaum, Edward

---