{
  "\"!=": [
    "1.1.6"
  ],
  "(as numeric negation operator)": [
    "1.1.6"
  ],
  "(as numeric subtraction operator)": [
    "1.1.1"
  ],
  "+ (as numeric addition operator)": [
    "1.1.1"
  ],
  "//": [
    "1.2.4"
  ],
  "<=": [
    "1.1.6"
  ],
  "==": [
    "1.1.6"
  ],
  ">=": [
    "1.1.6"
  ],
  "\\#f": [
    "1.1.6"
  ],
  "\\#t": [
    "1.1.6"
  ],
  "abc": [
    "1"
  ],
  "abs": [
    "1.1.6"
  ],
  "absolute value": [
    "1.1.6"
  ],
  "abstraction": [
    "1.1.8",
    "1.3.1"
  ],
  "abstraction (common pattern and)": [
    "1.3.1"
  ],
  "abstraction (functional)": [
    "1.1.8"
  ],
  "accumulate": [
    "1.3.1"
  ],
  "ackermann's function": [
    "1.2.1"
  ],
  "adleman, leonard": [
    "1.2.6"
  ],
  "al karaji": [
    "1.2.2"
  ],
  "algol": [
    "1.1.8"
  ],
  "algol (block structure)": [
    "1.1.8"
  ],
  "algorithm": [
    "1.2.6"
  ],
  "algorithm (probabilistic)": [
    "1.2.6"
  ],
  "alternate form": [
    "1.2.6"
  ],
  "alternative": [
    "1.1.6",
    "1.3.2"
  ],
  "amoeba operating system": [
    "1"
  ],
  "and (logical conjunction)": [
    "1.1.6"
  ],
  "and (logical conjunction) (evaluation of)": [
    "1.1.6"
  ],
  "and (logical conjunction) (why a syntactic form)": [
    "1.1.6"
  ],
  "anonymous": [
    "1.3.2"
  ],
  "applicative order evaluation": [
    "1.1.5",
    "1.1.6",
    "1.2.5"
  ],
  "applicative order evaluation (normal order vs.)": [
    "1.1.6",
    "1.2.5"
  ],
  "approximation with half interval method": [
    "1.3.3"
  ],
  "argument(s)": [
    "1.1.4"
  ],
  "arithmetic": [
    "1.1.1"
  ],
  "arithmetic (operators for)": [
    "1.1.1"
  ],
  "as continued fraction": [
    "1.3.3"
  ],
  "associativity": [
    "1.1.1",
    "1.1.6"
  ],
  "average": [
    "1.1.7"
  ],
  "average damping": [
    "1.3.3"
  ],
  "average_damp": [
    "1.3.4"
  ],
  "bhaskara": [
    "1.2.2"
  ],
  "binary operator": [
    "1.1.6"
  ],
  "bind": [
    "1.1.8"
  ],
  "binomial coefficients": [
    "1.2.2"
  ],
  "black box": [
    "1.1.8"
  ],
  "block": [
    "1.1.8"
  ],
  "block structure": [
    "1.1.8"
  ],
  "body of": [
    "1.1.4"
  ],
  "body of a function": [
    "1.1.4"
  ],
  "boolean values (true, false)": [
    "1.1.6"
  ],
  "bound name": [
    "1.1.8"
  ],
  "branch of a tree": [
    "1.1.3"
  ],
  "bug": [
    "1",
    "1.1.8"
  ],
  "bug (capturing a free name)": [
    "1.1.8"
  ],
  "bytecode": [
    "1"
  ],
  "c (recursive functions in)": [
    "1.2.1"
  ],
  "calculator, fixed points with": [
    "1.3.3"
  ],
  "capturing a free name": [
    "1.1.8"
  ],
  "carmichael numbers": [
    "1.2.6"
  ],
  "case analysis": [
    "1.1.6"
  ],
  "case analysis (general)": [
    "1.1.6"
  ],
  "chandah sutra": [
    "1.2.4"
  ],
  "church, alonzo": [
    "1.3.2"
  ],
  "clause of a case analysis": [
    "1.1.6"
  ],
  "combination": [
    "1.1.1"
  ],
  "combination, means of": [
    "1.1"
  ],
  "composition of functions": [
    "1.3.4"
  ],
  "compound": [
    "1.1.4"
  ],
  "compound expression": [
    "1.1.1",
    "1.1.6"
  ],
  "compound function": [
    "1.1.4"
  ],
  "compound function (used like primitive function)": [
    "1.1.4"
  ],
  "computational process": [
    "1"
  ],
  "computer science": [
    "1.1.7"
  ],
  "computer science (mathematics vs.)": [
    "1.1.7"
  ],
  "conditional expression": [
    "1.1.6",
    "1.1.7"
  ],
  "conditional expression (evaluation of)": [
    "1.1.6"
  ],
  "conditional expression (non boolean value as predicate)": [
    "1.1.6"
  ],
  "conditional expression (normal order evaluation of)": [
    "1.1.6"
  ],
  "conditional expression (precedence of)": [
    "1.1.6"
  ],
  "conditional expression (right associativity of)": [
    "1.1.6"
  ],
  "conditional expression (why a syntactic form)": [
    "1.1.7"
  ],
  "conditional statement": [
    "1.3.2"
  ],
  "conditional statement (alternative statements of)": [
    "1.3.2"
  ],
  "conditional statement (consequent statements of)": [
    "1.3.2"
  ],
  "conditional statement (need for)": [
    "1.3.2"
  ],
  "conditional statement (predicate, consequent, and alternative of)": [
    "1.3.2"
  ],
  "congruent modulo $n$": [
    "1.2.6"
  ],
  "conjunction": [
    "1.1.6"
  ],
  "consequent": [
    "1.1.6",
    "1.3.2"
  ],
  "continued fraction": [
    "1.3.3"
  ],
  "continued fraction (golden ratio as)": [
    "1.3.3"
  ],
  "continued fraction (tangent as)": [
    "1.3.3"
  ],
  "correctness of a program": [
    "1.1.7"
  ],
  "cosine": [
    "1.3.3"
  ],
  "cosine (fixed point of)": [
    "1.3.3"
  ],
  "cosmic radiation": [
    "1.2.6"
  ],
  "count_change": [
    "1.2.2"
  ],
  "counting change": [
    "1.2.2"
  ],
  "cpython": [
    "1"
  ],
  "creating with lambdalambda expression": [
    "1.3.2"
  ],
  "cryptography": [
    "1.2.6"
  ],
  "cube": [
    "1.2.3",
    "1.3",
    "1.3.4"
  ],
  "cube root": [
    "1.1.7",
    "1.3.4"
  ],
  "cube_root": [
    "1.3.4"
  ],
  "cwi (centrum wiskunde en informatica)": [
    "1"
  ],
  "data": [
    "1",
    "1.1"
  ],
  "data (numerical)": [
    "1.1"
  ],
  "debug": [
    "1"
  ],
  "declaration": [
    "1.1.2",
    "1.1.4",
    "1.3.2"
  ],
  "declaration (use of name before)": [
    "1.3.2"
  ],
  "declaration assignment": [
    "1.1.2",
    "1.1.3"
  ],
  "declaration assignment (why a syntactic form)": [
    "1.1.3"
  ],
  "declarative vs. imperative knowledge": [
    "1.1.7"
  ],
  "decomposition of program into parts": [
    "1.1.8"
  ],
  "def": [
    "1.1.4"
  ],
  "def (function definition)": [
    "1.1.4"
  ],
  "deferred operations": [
    "1.2.1"
  ],
  "definite integral": [
    "1.3.1"
  ],
  "definition": [
    "1.1.4"
  ],
  "deriv": [
    "1.3.4"
  ],
  "derivative of a function": [
    "1.3.4"
  ],
  "differentiation": [
    "1.3.4"
  ],
  "differentiation (numerical)": [
    "1.3.4"
  ],
  "diophantus's arithmetic , fermat's copy of": [
    "1.2.6"
  ],
  "disjunction": [
    "1.1.6"
  ],
  "divides": [
    "1.2.6"
  ],
  "edwards, anthony william fairbank": [
    "1.2.2"
  ],
  "efficiency": [
    "1",
    "1.2.2"
  ],
  "efficiency (of python)": [
    "1"
  ],
  "else": [
    "1.3.2"
  ],
  "engineering vs. mathematics": [
    "1.2.6"
  ],
  "environment": [
    "1.1.2",
    "1.1.3",
    "1.1.8"
  ],
  "environment (lexical scoping and)": [
    "1.1.8"
  ],
  "equality": [
    "1.1.6"
  ],
  "error": [
    "1.3.3"
  ],
  "euclid's algorithm": [
    "1.2.5"
  ],
  "euclid's algorithm (order of growth)": [
    "1.2.5"
  ],
  "euler, leonhard": [
    "1.2.6",
    "1.3.3"
  ],
  "euler, leonhard (proof of fermat's little theorem)": [
    "1.2.6"
  ],
  "evaluation": [
    "1.1.3",
    "1.1.4",
    "1.1.6"
  ],
  "evaluation (of conditional expression)": [
    "1.1.6"
  ],
  "evaluation (of function application)": [
    "1.1.4"
  ],
  "evaluation (of operator combination)": [
    "1.1.3"
  ],
  "evaluation (of or)": [
    "1.1.6"
  ],
  "evaluation (of primitive expression)": [
    "1.1.3"
  ],
  "expmod": [
    "1.2.6"
  ],
  "exponential growth": [
    "1.2.2",
    "1.2.3"
  ],
  "exponentiation": [
    "1.2.4",
    "1.2.6"
  ],
  "exponentiation (modulo $n$)": [
    "1.2.6"
  ],
  "expression": [
    "1.1.1",
    "1.1.6"
  ],
  "expression (boolean)": [
    "1.1.6"
  ],
  "expt": [
    "1.2.4"
  ],
  "expt (linear iterative version)": [
    "1.2.4"
  ],
  "expt (linear recursive version)": [
    "1.2.4"
  ],
  "factorial": [
    "1.2.1",
    "1.3.1"
  ],
  "factorial (linear iterative version)": [
    "1.2.1"
  ],
  "factorial (linear recursive version)": [
    "1.2.1"
  ],
  "factorial (with higher order functions)": [
    "1.3.1"
  ],
  "false": [
    "1.1.6"
  ],
  "fast_expt": [
    "1.2.4"
  ],
  "fast_is_prime": [
    "1.2.6"
  ],
  "fermat test for primality": [
    "1.2.6"
  ],
  "fermat test for primality (variant of)": [
    "1.2.6"
  ],
  "fermat_test": [
    "1.2.6"
  ],
  "fib": [
    "1.2.2",
    "1.2.4"
  ],
  "fib (linear iterative version)": [
    "1.2.2"
  ],
  "fib (logarithmic version)": [
    "1.2.4"
  ],
  "fib (tree recursive version)": [
    "1.2.2"
  ],
  "fibonacci numbers": [
    "1.2.2",
    "1.2.5"
  ],
  "fibonacci numbers (euclid's gcd algorithm and)": [
    "1.2.5"
  ],
  "filter": [
    "1.3.1"
  ],
  "filtered_accumulate": [
    "1.3.1"
  ],
  "find_divisor": [
    "1.2.6"
  ],
  "first class": [
    "1.3.4"
  ],
  "first class elements in language": [
    "1.3.4"
  ],
  "fixed point": [
    "1.3.3",
    "1.3.4"
  ],
  "fixed point (computing with calculator)": [
    "1.3.3"
  ],
  "fixed point (cube root as)": [
    "1.3.4"
  ],
  "fixed point (fourth root as)": [
    "1.3.4"
  ],
  "fixed point (golden ratio as)": [
    "1.3.3"
  ],
  "fixed point (square root as)": [
    "1.3.3",
    "1.3.4"
  ],
  "fixed_point": [
    "1.3.3",
    "1.3.4"
  ],
  "fixed_point_of_transform": [
    "1.3.4"
  ],
  "fourth root, as fixed point": [
    "1.3.4"
  ],
  "free name": [
    "1.1.8"
  ],
  "free name (capturing)": [
    "1.1.8"
  ],
  "function": [
    "1.1.4"
  ],
  "function (creating with def)": [
    "1.1.4"
  ],
  "function (mathematical)": [
    "1.1.7",
    "1.2.1",
    "1.3.3",
    "1.3.4"
  ],
  "function (mathematical) ($\\mapsto$ notation for)": [
    "1.3.3"
  ],
  "function (mathematical) (ackermann's)": [
    "1.2.1"
  ],
  "function (mathematical) (composition of)": [
    "1.3.4"
  ],
  "function (mathematical) (derivative of)": [
    "1.3.4"
  ],
  "function (mathematical) (fixed point of)": [
    "1.3.3"
  ],
  "function (mathematical) (python function vs.)": [
    "1.1.7"
  ],
  "function (mathematical) (repeated application of)": [
    "1.3.4"
  ],
  "function (mathematical) (smoothing of)": [
    "1.3.4"
  ],
  "function (naming (with def ))": [
    "1.1.4"
  ],
  "function application": [
    "1.1.4",
    "1.1.6",
    "1.3.4"
  ],
  "function application (compound expression as function expression of)": [
    "1.1.6"
  ],
  "function application (evaluation of)": [
    "1.1.4"
  ],
  "function definition": [
    "1.1.4",
    "1.3.2"
  ],
  "function definition (lambda expression vs.)": [
    "1.3.2"
  ],
  "function expression": [
    "1.1.4",
    "1.1.6",
    "1.3.2",
    "1.3.4"
  ],
  "function expression (application as)": [
    "1.3.4"
  ],
  "function expression (compound expression as)": [
    "1.1.6"
  ],
  "function expression (lambda expression as)": [
    "1.3.2"
  ],
  "functional abstraction": [
    "1.1.8"
  ],
  "gcd": [
    "1.2.5"
  ],
  "get_time": [
    "1.2.6"
  ],
  "golden ratio": [
    "1.2.2",
    "1.3.3"
  ],
  "greatest common divisor": [
    "1.2.5"
  ],
  "half interval method": [
    "1.3.3",
    "1.3.4"
  ],
  "half interval method (half_interval_method)": [
    "1.3.3"
  ],
  "half interval method (newton's method vs.)": [
    "1.3.4"
  ],
  "heron of alexandria": [
    "1.1.7"
  ],
  "hewitt, carl eddie": [
    "1.2.1"
  ],
  "higher order proceduresfunctions": [
    "1.3",
    "1.3.1",
    "1.3.3",
    "1.3.4"
  ],
  "higher order proceduresfunctions (procedurefunction as argument)": [
    "1.3.1"
  ],
  "higher order proceduresfunctions (procedurefunction as general method)": [
    "1.3.3"
  ],
  "higher order proceduresfunctions (procedurefunction as returned value)": [
    "1.3.4"
  ],
  "identity": [
    "1.3.1"
  ],
  "if": [
    "1.3.2"
  ],
  "if else expression": [
    "1.1.6"
  ],
  "imperative vs. declarative knowledge": [
    "1.1.7"
  ],
  "inc": [
    "1.3.1"
  ],
  "incremental development of programs": [
    "1.1.2"
  ],
  "infix notation": [
    "1.1.1"
  ],
  "infix operator": [
    "1.1.1"
  ],
  "integer division": [
    "1.2.4"
  ],
  "integer(s)": [
    "1.1"
  ],
  "integral": [
    "1.3.1",
    "1.3.2"
  ],
  "internal definition": [
    "1.1.8"
  ],
  "internal definition (free name in)": [
    "1.1.8"
  ],
  "internal definition (position of)": [
    "1.1.8"
  ],
  "interpreter": [
    "1",
    "1.1.1"
  ],
  "interpreter (read evaluate print loop)": [
    "1.1.1"
  ],
  "invariant quantity of an iterative process": [
    "1.2.4"
  ],
  "is_even": [
    "1.2.4"
  ],
  "is_prime": [
    "1.2.6"
  ],
  "iterative improvement": [
    "1.3.4"
  ],
  "iterative process": [
    "1.1.7",
    "1.2.1",
    "1.2.3",
    "1.2.4"
  ],
  "iterative process (design of algorithm)": [
    "1.2.4"
  ],
  "iterative process (implemented by function call)": [
    "1.1.7",
    "1.2.1"
  ],
  "iterative process (linear)": [
    "1.2.1",
    "1.2.3"
  ],
  "iterative process (recursive process vs.)": [
    "1.2.1"
  ],
  "java, recursive functions in": [
    "1.2.1"
  ],
  "just in time (jit) compilation": [
    "1"
  ],
  "kaldewaij, anne": [
    "1.2.4"
  ],
  "keywords": [
    "1.1.4",
    "1.1.6",
    "1.3.2"
  ],
  "keywords (def)": [
    "1.1.4"
  ],
  "keywords (else)": [
    "1.3.2"
  ],
  "keywords (false)": [
    "1.1.6"
  ],
  "keywords (if)": [
    "1.3.2"
  ],
  "keywords (return)": [
    "1.1.4"
  ],
  "keywords (true)": [
    "1.1.6"
  ],
  "knuth, donald e.": [
    "1.2.4",
    "1.2.5"
  ],
  "lambda expression": [
    "1.3.2"
  ],
  "lambda expression (function definition vs.)": [
    "1.3.2"
  ],
  "lambda expression (precedence of)": [
    "1.3.2"
  ],
  "lambert, j.h.": [
    "1.3.3"
  ],
  "landin, peter": [
    "1.1.6"
  ],
  "left associative": [
    "1.1.1"
  ],
  "leibniz's series for": [
    "1.3.1"
  ],
  "leibniz, baron gottfried wilhelm von": [
    "1.2.6",
    "1.3.1"
  ],
  "leibniz, baron gottfried wilhelm von (proof of fermat's little theorem)": [
    "1.2.6"
  ],
  "leibniz, baron gottfried wilhelm von (series for $\\pi$)": [
    "1.3.1"
  ],
  "lexical scoping": [
    "1.1.8"
  ],
  "linear growth": [
    "1.2.1",
    "1.2.3"
  ],
  "linear iterative process": [
    "1.2.1",
    "1.2.3"
  ],
  "linear iterative process (order of growth)": [
    "1.2.3"
  ],
  "linear recursive process": [
    "1.2.1",
    "1.2.3"
  ],
  "linear recursive process (order of growth)": [
    "1.2.3"
  ],
  "lisppython": [
    "1.3.4"
  ],
  "lisppython (first class proceduresfunctions in)": [
    "1.3.4"
  ],
  "local evolution of a process": [
    "1.2"
  ],
  "local name": [
    "1.1.8",
    "1.3.2"
  ],
  "locke, john": [
    "1"
  ],
  "logarithmic growth": [
    "1.2.3",
    "1.2.4"
  ],
  "logical conjunction": [
    "1.1.6"
  ],
  "logical disjunction": [
    "1.1.6"
  ],
  "looping constructs": [
    "1.1.7",
    "1.2.1"
  ],
  "math_cos": [
    "1.3.3"
  ],
  "math_floor": [
    "1.2.6"
  ],
  "math_log": [
    "1.1.4",
    "1.3.3"
  ],
  "math_sin": [
    "1.3.3"
  ],
  "mathematical function vs.": [
    "1.1.7"
  ],
  "mathematics": [
    "1.1.7",
    "1.2.6"
  ],
  "mathematics (computer science vs.)": [
    "1.1.7"
  ],
  "mathematics (engineering vs.)": [
    "1.2.6"
  ],
  "means of abstraction": [
    "1.1",
    "1.1.2"
  ],
  "means of abstraction (declaration assignment as)": [
    "1.1.2"
  ],
  "means of combination": [
    "1.1"
  ],
  "memoization": [
    "1.2.2"
  ],
  "message passing": [
    "1.2.1"
  ],
  "message passing (tail recursion and)": [
    "1.2.1"
  ],
  "miller – rabin test for primality": [
    "1.2.6"
  ],
  "miller, gary l.": [
    "1.2.6"
  ],
  "modeling": [
    "1.1.5"
  ],
  "modeling (in science and engineering)": [
    "1.1.5"
  ],
  "modula 3": [
    "1"
  ],
  "modulo $n$": [
    "1.2.6"
  ],
  "multiplication by russian peasant method": [
    "1.2.4"
  ],
  "name": [
    "1.1.4",
    "1.1.8"
  ],
  "name (bound)": [
    "1.1.8"
  ],
  "name (free)": [
    "1.1.8"
  ],
  "name (scope of)": [
    "1.1.8"
  ],
  "name of": [
    "1.1.4"
  ],
  "naming": [
    "1.1.2",
    "1.1.4"
  ],
  "naming (of computational objects)": [
    "1.1.2"
  ],
  "naming (of functions)": [
    "1.1.4"
  ],
  "naming conventions": [
    "1.1.7"
  ],
  "negation": [
    "1.1.6"
  ],
  "negation (logical ( not ))": [
    "1.1.6"
  ],
  "negation (numeric (   ))": [
    "1.1.6"
  ],
  "nested operator combinations": [
    "1.1.1"
  ],
  "newton's method": [
    "1.1.7",
    "1.3.4"
  ],
  "newton's method (half interval method vs.)": [
    "1.3.4"
  ],
  "newton_transform": [
    "1.3.4"
  ],
  "newtons_method": [
    "1.3.4"
  ],
  "node of a tree": [
    "1.1.3"
  ],
  "normal order evaluation": [
    "1.1.5",
    "1.1.6",
    "1.2.5"
  ],
  "normal order evaluation (applicative order vs.)": [
    "1.1.6",
    "1.2.5"
  ],
  "not (logical negation operator)": [
    "1.1.6"
  ],
  "not (logical negation)": [
    "1.1.6"
  ],
  "notation in this book": [
    "1.1.1",
    "1.1.4"
  ],
  "notation in this book (italic symbols in expression syntax)": [
    "1.1.4"
  ],
  "notation in this book (slanted characters for interpreter response)": [
    "1.1.1"
  ],
  "number theory": [
    "1.2.6"
  ],
  "number(s)": [
    "1.1",
    "1.1.1",
    "1.1.6"
  ],
  "number(s) (comparison of)": [
    "1.1.6"
  ],
  "number(s) (equality of)": [
    "1.1.6"
  ],
  "number(s) (integer vs. real number)": [
    "1.1"
  ],
  "numerical analysis": [
    "1.1"
  ],
  "numerical analyst": [
    "1.3.3"
  ],
  "numerical data": [
    "1.1"
  ],
  "numpy": [
    "1"
  ],
  "operands of a combination": [
    "1.1.1"
  ],
  "operator combination": [
    "1.1.1",
    "1.1.3"
  ],
  "operator combination (evaluation of)": [
    "1.1.3"
  ],
  "operator of a combination": [
    "1.1.1"
  ],
  "or (logical disjunction)": [
    "1.1.6"
  ],
  "or (logical disjunction) (evaluation of)": [
    "1.1.6"
  ],
  "or (logical disjunction) (why a syntactic form)": [
    "1.1.6"
  ],
  "order notation": [
    "1.2.3"
  ],
  "order of growth": [
    "1.2.3",
    "1.2.4"
  ],
  "order of growth (linear iterative process)": [
    "1.2.3"
  ],
  "order of growth (linear recursive process)": [
    "1.2.3"
  ],
  "order of growth (logarithmic)": [
    "1.2.4"
  ],
  "order of growth (tree recursive process)": [
    "1.2.3"
  ],
  "parameters": [
    "1.1.4",
    "1.1.8"
  ],
  "parameters (names of)": [
    "1.1.8"
  ],
  "parameters (scope of)": [
    "1.1.8"
  ],
  "parameters of": [
    "1.1.4"
  ],
  "parentheses": [
    "1.1.1",
    "1.1.4",
    "1.3.2"
  ],
  "pascal's triangle": [
    "1.2.2"
  ],
  "pi_sum": [
    "1.3.1",
    "1.3.2"
  ],
  "pingala, ch rya": [
    "1.2.4"
  ],
  "plr (python language reference)": [
    "1"
  ],
  "precedence": [
    "1.1.1",
    "1.1.6",
    "1.3.2"
  ],
  "precedence (of lambda expression)": [
    "1.3.2"
  ],
  "predicate": [
    "1.1.6",
    "1.1.7",
    "1.3.2"
  ],
  "predicate (naming convention for)": [
    "1.1.7"
  ],
  "prefix operator": [
    "1.1.6"
  ],
  "prime number(s)": [
    "1.2.6"
  ],
  "prime number(s) (cryptography and)": [
    "1.2.6"
  ],
  "prime number(s) (fermat test for)": [
    "1.2.6"
  ],
  "prime number(s) (miller – rabin test for)": [
    "1.2.6"
  ],
  "prime number(s) (testing for)": [
    "1.2.6"
  ],
  "primitive": [
    "1.1.4"
  ],
  "primitive expression": [
    "1.1",
    "1.1.1",
    "1.1.2",
    "1.1.3"
  ],
  "primitive expression (evaluation of)": [
    "1.1.3"
  ],
  "primitive expression (name of variable)": [
    "1.1.2"
  ],
  "primitive expression (number)": [
    "1.1.1"
  ],
  "primitive function": [
    "1.1.4"
  ],
  "print": [
    "1.2.6"
  ],
  "probabilistic algorithm": [
    "1.2.6"
  ],
  "process": [
    "1",
    "1.2",
    "1.2.1",
    "1.2.2",
    "1.2.3"
  ],
  "process (iterative)": [
    "1.2.1"
  ],
  "process (linear iterative)": [
    "1.2.1"
  ],
  "process (linear recursive)": [
    "1.2.1"
  ],
  "process (local evolution of)": [
    "1.2"
  ],
  "process (order of growth of)": [
    "1.2.3"
  ],
  "process (recursive)": [
    "1.2.1"
  ],
  "process (resources required by)": [
    "1.2.3"
  ],
  "process (shape of)": [
    "1.2.1"
  ],
  "process (tree recursive)": [
    "1.2.2"
  ],
  "product": [
    "1.3.1"
  ],
  "program": [
    "1",
    "1.1.2",
    "1.1.8"
  ],
  "program (incremental development of)": [
    "1.1.2"
  ],
  "program (structure of)": [
    "1.1.2",
    "1.1.8"
  ],
  "program environment": [
    "1.1.2"
  ],
  "programming": [
    "1.1"
  ],
  "programming (elements of)": [
    "1.1"
  ],
  "programming language": [
    "1",
    "1.1.7"
  ],
  "programming language (very high level)": [
    "1.1.7"
  ],
  "proof": [
    "1.2.6"
  ],
  "proving programs correct": [
    "1.1.7"
  ],
  "pypy": [
    "1"
  ],
  "python": [
    "1",
    "1.1.5",
    "1.2.1"
  ],
  "python (applicative order evaluation in)": [
    "1.1.5"
  ],
  "python (cpython as reference implementation)": [
    "1"
  ],
  "python (efficiency of)": [
    "1"
  ],
  "python (history of)": [
    "1"
  ],
  "python (tail recursion in)": [
    "1.2.1"
  ],
  "python (versions 2 and 3)": [
    "1"
  ],
  "python enhancement proposal (pep)": [
    "1"
  ],
  "python environment used in this book": [
    "1.1.4"
  ],
  "python language reference (plr)": [
    "1"
  ],
  "python software foundation": [
    "1"
  ],
  "python, recursive functions in": [
    "1.2.1"
  ],
  "rabin, michael o.": [
    "1.2.6"
  ],
  "radicand": [
    "1.1.7"
  ],
  "random number generator": [
    "1.2.6"
  ],
  "random_random": [
    "1.2.6"
  ],
  "read evaluate print loop": [
    "1.1.1"
  ],
  "real number": [
    "1.1"
  ],
  "recursion": [
    "1.1.3"
  ],
  "recursion (expressing complicated process)": [
    "1.1.3"
  ],
  "recursive function": [
    "1.1.8"
  ],
  "recursive function (recursive function definition)": [
    "1.1.8"
  ],
  "recursive procedurefunction": [
    "1.2.1"
  ],
  "recursive procedurefunction (recursive process vs.)": [
    "1.2.1"
  ],
  "recursive process": [
    "1.2.1",
    "1.2.2",
    "1.2.3"
  ],
  "recursive process (iterative process vs.)": [
    "1.2.1"
  ],
  "recursive process (linear)": [
    "1.2.1",
    "1.2.3"
  ],
  "recursive process (recursive procedurefunction vs.)": [
    "1.2.1"
  ],
  "recursive process (tree)": [
    "1.2.2",
    "1.2.3"
  ],
  "relatively prime": [
    "1.3.1"
  ],
  "remainder": [
    "1.2.4",
    "1.2.6"
  ],
  "remainder (modulo $n$)": [
    "1.2.6"
  ],
  "return": [
    "1.1.4"
  ],
  "return statement": [
    "1.1.4"
  ],
  "return value": [
    "1.1.4"
  ],
  "rhind papyrus": [
    "1.2.4"
  ],
  "right associative": [
    "1.1.6"
  ],
  "rivest, ronald l.": [
    "1.2.6"
  ],
  "roundoff error": [
    "1.1"
  ],
  "rsa algorithm": [
    "1.2.6"
  ],
  "russian peasant method of multiplication": [
    "1.2.4"
  ],
  "scheme": [
    "1",
    "1.2.1",
    "1.3.2"
  ],
  "scheme (dialect of lisp)": [
    "1"
  ],
  "scheme (tail recursion in)": [
    "1.2.1"
  ],
  "scheme (use of lambda in)": [
    "1.3.2"
  ],
  "scope of a name": [
    "1.1.8"
  ],
  "scope of a name (function's parameters)": [
    "1.1.8"
  ],
  "scope of parameters": [
    "1.1.8"
  ],
  "search": [
    "1.3.3"
  ],
  "sequence of statements": [
    "1.1.4",
    "1.3.2"
  ],
  "series, summation of": [
    "1.3.1"
  ],
  "shamir, adi": [
    "1.2.6"
  ],
  "shape of a process": [
    "1.2.1"
  ],
  "signal processing": [
    "1.3.4"
  ],
  "signal processing (smoothing a function)": [
    "1.3.4"
  ],
  "simpson's rule for numerical integration": [
    "1.3.1"
  ],
  "sine": [
    "1.2.3"
  ],
  "sine (approximation for small angle)": [
    "1.2.3"
  ],
  "smallest_divisor": [
    "1.2.6"
  ],
  "smallest_divisor (more efficient version)": [
    "1.2.6"
  ],
  "smoothing a function": [
    "1.3.4"
  ],
  "sqrt": [
    "1.1.7",
    "1.1.8",
    "1.3.3",
    "1.3.4"
  ],
  "sqrt (block structured)": [
    "1.1.8"
  ],
  "square": [
    "1.1.4"
  ],
  "square root": [
    "1.1.7"
  ],
  "stack": [
    "1.2.1"
  ],
  "state variable": [
    "1.2.1"
  ],
  "statement": [
    "1.1.1"
  ],
  "steele, guy lewis jr.": [
    "1.2.1"
  ],
  "stoy, joseph e.": [
    "1.1.5",
    "1.2.4"
  ],
  "strachey, christopher": [
    "1.3.4"
  ],
  "substitution model of function application": [
    "1.1.5",
    "1.2.1"
  ],
  "substitution model of function application (shape of process)": [
    "1.2.1"
  ],
  "substitution model of procedurefunction application": [
    "1.2.1"
  ],
  "substitution model of procedurefunction application (shape of process)": [
    "1.2.1"
  ],
  "successive squaring": [
    "1.2.4"
  ],
  "sum": [
    "1.3.1"
  ],
  "sum (iterative version)": [
    "1.3.1"
  ],
  "sum_cubes": [
    "1.3.1"
  ],
  "sum_integers": [
    "1.3.1"
  ],
  "sum_of_squares": [
    "1.1.4"
  ],
  "summation of a series": [
    "1.3.1"
  ],
  "sussman, gerald jay": [
    "1.2.1"
  ],
  "syntactic form": [
    "1.1.3",
    "1.1.7"
  ],
  "syntactic form (need for)": [
    "1.1.7"
  ],
  "syntactic forms": [
    "1.1.2",
    "1.1.4",
    "1.1.6",
    "1.1.8",
    "1.3.2"
  ],
  "syntactic forms (block)": [
    "1.1.8"
  ],
  "syntactic forms (conditional expression)": [
    "1.1.6"
  ],
  "syntactic forms (conditional statement)": [
    "1.3.2"
  ],
  "syntactic forms (declaration assignment)": [
    "1.1.2"
  ],
  "syntactic forms (function definition)": [
    "1.1.4"
  ],
  "syntactic forms (lambda expression)": [
    "1.3.2"
  ],
  "syntactic forms (logical conjunction ( and ))": [
    "1.1.6"
  ],
  "syntactic forms (logical disjunction ( or ))": [
    "1.1.6"
  ],
  "syntactic forms (return statement)": [
    "1.1.4"
  ],
  "syntactic sugar": [
    "1.1.6",
    "1.2.1"
  ],
  "syntactic sugar (looping constructs as)": [
    "1.2.1"
  ],
  "syntax": [
    "1.1.3",
    "1.1.4"
  ],
  "tabulation": [
    "1.2.2"
  ],
  "tail recursion": [
    "1.2.1"
  ],
  "tangent": [
    "1.3.3"
  ],
  "tangent (as continued fraction)": [
    "1.3.3"
  ],
  "terminal node of a tree": [
    "1.1.3"
  ],
  "timed_prime_test": [
    "1.2.6"
  ],
  "tree": [
    "1.1.3"
  ],
  "tree (combination viewed as)": [
    "1.1.3"
  ],
  "tree accumulation": [
    "1.1.3"
  ],
  "tree recursive process": [
    "1.2.2",
    "1.2.3"
  ],
  "tree recursive process (order of growth)": [
    "1.2.3"
  ],
  "true": [
    "1.1.6"
  ],
  "truncation error": [
    "1.1"
  ],
  "unary operator": [
    "1.1.6"
  ],
  "unix": [
    "1.2.6"
  ],
  "unix (epoch)": [
    "1.2.6"
  ],
  "value": [
    "1.1.1"
  ],
  "variable": [
    "1.1.2"
  ],
  "variable (value of)": [
    "1.1.2"
  ],
  "very high level language": [
    "1.1.7"
  ],
  "virtual machine, interpreting python": [
    "1"
  ],
  "wallis's formula for": [
    "1.3.1"
  ],
  "wallis, john": [
    "1.3.1"
  ],
  "wiles, andrew": [
    "1.2.6"
  ],
  "yang hui": [
    "1.2.2"
  ]
}