<HTML>
<HEAD>
<TITLE>Computer Science Logo Style vol 1: General Index</TITLE>
</HEAD>
<BODY>
<CITE>Computer Science Logo Style</CITE> volume 1:
<CITE>Symbolic Computing</CITE> 2/e Copyright (C) 1997 MIT
<H1>General Index</H1>
<TABLE width="100%"><TR><TD>
<IMG SRC="../csls1.jpg" ALT="cover photo">
<TD><TABLE>
<TR><TD align="right"><CITE><A HREF="http://www.cs.berkeley.edu/~bh/">Brian
Harvey</A><BR>University of California, Berkeley</CITE>
<TR><TD align="right"><BR>
<TR><TD align="right"><A HREF="../pdf/v1ch16.pdf">Download PDF version</A>
<TR><TD align="right"><A HREF="../v1-toc2.html">Back to Table of Contents</A>
<TR><TD align="right"><A HREF="appuindex.html"><STRONG>BACK</STRONG></A>
chapter thread [no next]
<TR><TD align="right"><A HREF="https://mitpress.mit.edu/books/computer-science-logo-style-second-edition-volume-1">MIT
Press web page for Computer Science Logo Style</A>
</TABLE></TABLE>
<HR>
<P>This index lists technical terms and primitive procedures. There is also an
<A HREF="appuindex.html">index of defined procedures</A>, which
lists procedures whose definitions are in
the text and procedures that you are asked to write.
<P>(The HTML version doesn't tell you book page numbers; instead it directs
you to the Web page(s) containing the references. Once you get to the page,
ask your browser to find the text you want in that page.)
<P><A HREF="appindex.html#A">A</A> <A HREF="appindex.html#B">B</A> <A HREF="appindex.html#C">C</A> <A HREF="appindex.html#D">D</A> <A HREF="appindex.html#E">E</A> <A HREF="appindex.html#F">F</A> <A HREF="appindex.html#G">G</A> <A HREF="appindex.html#H">H</A> <A HREF="appindex.html#I">I</A> <A HREF="appindex.html#J">J</A> <A HREF="appindex.html#K">K</A> <A HREF="appindex.html#L">L</A> <A HREF="appindex.html#M">M</A> <A HREF="appindex.html#N">N</A> <A HREF="appindex.html#O">O</A> <A HREF="appindex.html#P">P</A> <A HREF="appindex.html#Q">Q</A> <A HREF="appindex.html#R">R</A> <A HREF="appindex.html#S">S</A> <A HREF="appindex.html#T">T</A> U <A HREF="appindex.html#V">V</A> <A HREF="appindex.html#W">W</A> <A HREF="appindex.html#X">X</A> <A HREF="appindex.html#Y">Y</A> Z
<P><A NAME="A"></A>
<P><BR>
abbreviation <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
Abelson, Hal <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
absolute value <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
abstract data type <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
actual argument <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
algebraic equation <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
algorithm <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
allocation, storage <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
analytic geometry <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>and</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
APL <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
apprenticeship <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
Arabic numeral <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
argument <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
argument, actual <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
array <A HREF="../v1ch0/preface.html">Pref</A>
, <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
<CODE>array</CODE> <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
<CODE>arraytolist</CODE> <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
artificial intelligence <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
assignment, indirect <A HREF="../v1ch3/variab.html">Ch3</A>
<P><A NAME="B"></A>
<BR>
<CODE>back</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
BASIC <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch3/variab.html">Ch3</A>
, <A HREF="../v1ch9/recur3.html">Ch9</A>
, <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>bf</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
Birch, Alison <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
<CODE>bk</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
bottom-up <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
bracket, square <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
breadth-first search <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
<CODE>butfirst</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>butlast</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<P><A NAME="C"></A>
<BR>
C++ <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
Carter, Cindy <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
Cartesian coordinates <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>cascade</CODE> <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
character <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
character string <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
cipher, Playfair <A HREF="../v1ch12/playfair.html">Ch12</A>
<BR>
cipher, simple substitution <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
Clancy, Michael <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
<CODE>clearscreen</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>cleartext</CODE> <A HREF="../v1ch1/explor.html">Ch1</A>
<BR>
cognitive psychology <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
colon <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
combiner <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
command <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
compass heading <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
composition of functions <A HREF="../v1ch0/preface.html">Pref</A>
, <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch12/playfair.html">Ch12</A>
<BR>
computer graphics <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
computer literacy <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
computer science <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
conditional evaluation <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
connective, logical <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
constructor <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
context <A HREF="../v1ch13/plan.html">Ch13</A>
, <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
<CODE>continue</CODE> <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
conversational front end <A HREF="../v1ch12/playfair.html">Ch12</A>
<BR>
coordinates <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
coordinates, Cartesian <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>count</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
Courant, Richard <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
<CODE>cs</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>ct</CODE> <A HREF="../v1ch1/explor.html">Ch1</A>
<P><A NAME="D"></A>
<BR>
Dahl, O. J. <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
Dao, Khang <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
data redundancy <A HREF="../v1ch12/playfair.html">Ch12</A>
<BR>
data representation <A HREF="../v1ch6/ttt.html">Ch6</A>
, <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
data structure <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
data type, abstract <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
datum <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
Davidson, Larry <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
Davis, Jim <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
debugging <A HREF="../v1ch13/plan.html">Ch13</A>
, <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
defensive programming <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
defining a procedure <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
depth-first search <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
Descartes, René <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
describe a procedure, how to <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
Deutsch, Freeman <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
diagram, plumbing <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
Dijkstra, Edsger <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
Diophantine equation <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
domain <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
dots <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
dynamic scope <A HREF="../v1ch3/variab.html">Ch3</A>
<P><A NAME="E"></A>
<BR>
<CODE>edit</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
editor <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
effect <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
efficiency <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
elves <A HREF="../v1ch3/variab.html">Ch3</A>
, <A HREF="../v1ch9/recur3.html">Ch9</A>
<BR>
Elvish <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
empty list <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
empty word <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>emptyp</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
<CODE>end</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
environment, programming <A HREF="../v1ch1/explor.html">Ch1</A>
<BR>
equal sign <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
<CODE>equalp</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
equation, algebraic <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
equation, Diophantine <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
error message <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
evaluation <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
expression <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
expression, logical <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
extra inputs <A HREF="../v1ch2/proced.html">Ch2</A>
<P><A NAME="F"></A>
<BR>
factorial <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
faith <A HREF="../v1ch8/recur2.html">Ch8</A>
<BR>
<CODE>false</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
<CODE>fd</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
Fibonacci sequence <A HREF="../v1ch5/hof.html">Ch5</A>
, <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
<CODE>filter</CODE> <A HREF="../v1ch5/hof.html">Ch5</A>
, <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
<CODE>find</CODE> <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
<CODE>first</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
flag variable <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
flat list <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>for</CODE> <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
<CODE>foreach</CODE> <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
<CODE>forever</CODE> <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
formal parameter <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
Fortran <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
<CODE>forward</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>fput</CODE> <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
fractal <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
frame <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
Free Software Foundation <A HREF="appendix-gpl.html">GPL</A>
<BR>
Friedman, Batya <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
front end, conversational <A HREF="../v1ch12/playfair.html">Ch12</A>
<BR>
function <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
function notation <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
function, higher order <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
functions, composition of <A HREF="../v1ch0/preface.html">Pref</A>
, <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch12/playfair.html">Ch12</A>
<P><A NAME="G"></A>
<BR>
geometry, analytic <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
geometry, turtle <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
Gilham, Fred <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
global variable <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
Goldenberg, Paul <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
Goodman, Paul <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
graph <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
graphics, computer <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
graphics, turtle <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>greaterp</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<P><A NAME="H"></A>
<BR>
Hanoi, Tower of <A HREF="../v1ch8/recur2.html">Ch8</A>
<BR>
Harvey, Tessa <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
<EM>Have His Carcase</EM> <A HREF="../v1ch12/playfair.html">Ch12</A>
<BR>
heading <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>heading</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
heading, compass <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
hierarchy of levels <A HREF="../v1ch9/recur3.html">Ch9</A>
<BR>
higher order function <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
Hoare, C. A. R. <A HREF="../v1ch13/plan.html">Ch13</A>
<P><A NAME="I"></A>
<BR>
<CODE>if</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
<CODE>ifelse</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
, <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
<CODE>iff</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
<CODE>iffalse</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
<CODE>ift</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
<CODE>iftrue</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
increment <A HREF="../v1ch3/variab.html">Ch3</A>
, <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
index variable <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
indirect assignment <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
infix arithmetic <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
initialization procedure <A HREF="../v1ch7/recur1.html">Ch7</A>
, <A HREF="../v1ch8/recur2.html">Ch8</A>
, <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
input <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
inputs, extra <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
instruction <A HREF="../v1ch1/explor.html">Ch1</A>
, <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
instruction line <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
instruction list <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
intelligence, artificial <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
interaction <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
invocation <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch3/variab.html">Ch3</A>
, <A HREF="../v1ch9/recur3.html">Ch9</A>
<BR>
IQ tests <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
<CODE>item</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
iteration, numeric <A HREF="../v1ch5/hof.html">Ch5</A>
<P><A NAME="J"></A>
<BR>
joke <A HREF="../v1ch1/explor.html">Ch1</A>
, <A HREF="../v1ch3/variab.html">Ch3</A>
<P><A NAME="K"></A>
<BR>
Katz, Michael <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
Katz, Yehuda <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
kludge <A HREF="../v1ch2/proced.html">Ch2</A>
<P><A NAME="L"></A>
<BR>
<CODE>last</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
Latin, Pig <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
<CODE>left</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
Lennon, John <A HREF="../v1ch1/explor.html">Ch1</A>
, <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
<CODE>lessp</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
levels of recursion <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
levels, hierarchy of <A HREF="../v1ch9/recur3.html">Ch9</A>
<BR>
Levington, David <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
Lewis, Phil <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
limit value <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
Lisp <A HREF="../v1ch0/preface.html">Pref</A>
, <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
list <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>list</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
list, empty <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
list, flat <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>listp</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
<CODE>listtoarray</CODE> <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
literacy, computer <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
little person metaphor <A HREF="../v1ch3/variab.html">Ch3</A>
, <A HREF="../v1ch9/recur3.html">Ch9</A>
<BR>
<CODE>local</CODE> <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
local variable <A HREF="../v1ch3/variab.html">Ch3</A>
, <A HREF="../v1ch7/recur1.html">Ch7</A>
, <A HREF="../v1ch9/recur3.html">Ch9</A>
<BR>
locality <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
logic, mathematical <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
logical connective <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
logical expression <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
Logo <A HREF="../v1ch0/preface.html">Pref</A>
, <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
<CODE>lput</CODE> <A HREF="../v1ch11/recops.html">Ch11</A>
, <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
<CODE>lt</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<P><A NAME="M"></A>
<BR>
<CODE>make</CODE> <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
<CODE>map</CODE> <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
<CODE>map.se</CODE> <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
mathematical logic <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
mathematics <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
matrix <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
member <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>memberp</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
metaphor <A HREF="../v1ch1/explor.html">Ch1</A>
, <A HREF="../v1ch3/variab.html">Ch3</A>
, <A HREF="../v1ch9/recur3.html">Ch9</A>
<BR>
Mills, George <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
Minsky, Margaret <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
modularity <A HREF="../v1ch3/variab.html">Ch3</A>
, <A HREF="../v1ch6/ttt.html">Ch6</A>
, <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
most restrictive test <A HREF="../v1ch13/plan.html">Ch13</A>
<P><A NAME="N"></A>
<BR>
name <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
<CODE>not</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
number <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
number, telephone <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
<CODE>numberp</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
numeral, Arabic <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
numeral, Roman <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
numeric iteration <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
numerical operation <A HREF="../v1ch11/recops.html">Ch11</A>
<P><A NAME="O"></A>
<BR>
operation <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch3/variab.html">Ch3</A>
, <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
operation, numerical <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
operation, recursive <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
operation, selection <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
<CODE>or</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
origin <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
Orleans, Doug <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
output <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
<CODE>output</CODE> <A HREF="../v1ch3/variab.html">Ch3</A>
, <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
Owings, Sanford <A HREF="../v1ch0/ack.html">Ack</A>
<P><A NAME="P"></A>
<BR>
parallel processing <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
parameter, formal <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
parentheses <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
Pascal <A HREF="../v1ch0/preface.html">Pref</A>
, <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
pattern <A HREF="../v1ch8/recur2.html">Ch8</A>
, <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
pattern, procedure <A HREF="../v1ch8/recur2.html">Ch8</A>
<BR>
<CODE>pause</CODE> <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
pausing <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
<CODE>pd</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
pen <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>pendown</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>penup</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
Pig Latin <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
planning, style of <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
Playfair cipher <A HREF="../v1ch12/playfair.html">Ch12</A>
<BR>
plumbing diagram <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>po</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
pocket <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
<CODE>pons</CODE> <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
<CODE>pops</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>pos</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
position <A HREF="../v1ch6/ttt.html">Ch6</A>
, <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>pots</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>pr</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
predicate <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
predicate calculus <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
predicate, recursive <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
prefix arithmetic <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
primitive <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>print</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
procedure <A HREF="../v1ch1/explor.html">Ch1</A>
, <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
procedure pattern <A HREF="../v1ch8/recur2.html">Ch8</A>
<BR>
procedure, defining <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
procedure, initialization <A HREF="../v1ch7/recur1.html">Ch7</A>
, <A HREF="../v1ch8/recur2.html">Ch8</A>
, <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
procedure, top-level <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
processing, parallel <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
<CODE>product</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
program <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
programming environment <A HREF="../v1ch1/explor.html">Ch1</A>
<BR>
programming, structured <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
Prolog <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
prompt <A HREF="../v1ch1/explor.html">Ch1</A>
<BR>
psychology, cognitive <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
<CODE>pu</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<P><A NAME="Q"></A>
<BR>
question <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
question, yes-or-no <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
queue <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
quotation mark <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
quote <A HREF="../v1ch2/proced.html">Ch2</A>
<P><A NAME="R"></A>
<BR>
<CODE>random</CODE> <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
range <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
<CODE>readchar</CODE> <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
<CODE>readlist</CODE> <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
recursion <A HREF="../v1ch7/recur1.html">Ch7</A>
<BR>
recursion, levels of <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
recursive call <A HREF="../v1ch7/recur1.html">Ch7</A>
, <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
recursive operation <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
<CODE>reduce</CODE> <A HREF="../v1ch5/hof.html">Ch5</A>
, <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
redundancy, data <A HREF="../v1ch12/playfair.html">Ch12</A>
<BR>
<CODE>remainder</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>repeat</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
representation, data <A HREF="../v1ch6/ttt.html">Ch6</A>
, <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
restrictive test <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
<CODE>right</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
right to left <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
Robbins, Herbert <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
robot <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
Roman numeral <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
<CODE>rt</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>run</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<P><A NAME="S"></A>
<BR>
Sargent, Randy <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
Sayers, Dorothy L. <A HREF="../v1ch12/playfair.html">Ch12</A>
<BR>
scope of variables <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
scope, dynamic <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
search, breadth-first <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
search, depth-first <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
search, tree <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
selection operation <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
selector <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
semantics <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
sentence <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>sentence</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
sequence of instructions <A HREF="../v1ch9/recur3.html">Ch9</A>
<BR>
<CODE>seth</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>setheading</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
<CODE>setitem</CODE> <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
<CODE>setpos</CODE> <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
simple substitution cipher <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
Solomon, Cynthia <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
space/time tradeoff <A HREF="../v1ch12/playfair.html">Ch12</A>
<BR>
square bracket <A HREF="../v1ch2/proced.html">Ch2</A>
, <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
stack <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
starting value <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
state, turtle <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
state-invariant <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
statement types <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>step</CODE> <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
step, turtle <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
stepping <A HREF="../v1ch9/recur3.html">Ch9</A>
, <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
<CODE>stop</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
, <A HREF="../v1ch9/recur3.html">Ch9</A>
<BR>
stop rule <A HREF="../v1ch7/recur1.html">Ch7</A>
, <A HREF="../v1ch8/recur2.html">Ch8</A>
, <A HREF="../v1ch11/recops.html">Ch11</A>
, <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
storage allocation <A HREF="../v1ch0/preface.html">Pref</A>
<BR>
string, character <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
structure, data <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
structured programming <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
style of planning <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
subprocedure <A HREF="../v1ch3/variab.html">Ch3</A>
, <A HREF="../v1ch7/recur1.html">Ch7</A>
<BR>
subprocedure/superprocedure diagram <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
<CODE>subsets</CODE> <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
substitution cipher, simple <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
<CODE>sum</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
superprocedure <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
symmetry <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
syntax <A HREF="../v1ch0/preface.html">Pref</A>
, <A HREF="../v1ch2/proced.html">Ch2</A>
<P><A NAME="T"></A>
<BR>
tail recursion <A HREF="../v1ch7/recur1.html">Ch7</A>
, <A HREF="../v1ch11/recops.html">Ch11</A>
<BR>
telephone number <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
template <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
<CODE>test</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
test, most restrictive <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
tests, IQ <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
<CODE>thing</CODE> <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
<CODE>throw</CODE> <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
tic-tac-toe <A HREF="../v1ch3/variab.html">Ch3</A>
, <A HREF="../v1ch6/ttt.html">Ch6</A>
, <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
title line <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>to</CODE> <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
top-down <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
top-level procedure <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
Tower of Hanoi <A HREF="../v1ch8/recur2.html">Ch8</A>
<BR>
trace <A HREF="../v1ch9/recur3.html">Ch9</A>
<BR>
<CODE>trace</CODE> <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
tracing <A HREF="../v1ch9/recur3.html">Ch9</A>
, <A HREF="../v1ch15/debug.html">Ch15</A>
<BR>
tree <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
tree search <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
<CODE>true</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
turtle graphics <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
turtle step <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
turtle-relative <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
Twenty Questions <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
<CODE>type</CODE> <A HREF="../v1ch7/recur1.html">Ch7</A>
<P><A NAME="V"></A>
<BR>
value, limit <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
value, starting <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
van Blerkom, Dan <A HREF="../v1ch0/ack.html">Ack</A>
<BR>
variable <A HREF="../v1ch3/variab.html">Ch3</A>
<BR>
variable, flag <A HREF="../v1ch6/ttt.html">Ch6</A>
<BR>
variable, index <A HREF="../v1ch5/hof.html">Ch5</A>
<BR>
variable, local <A HREF="../v1ch9/recur3.html">Ch9</A>
<BR>
variables in the workspace <A HREF="../v1ch6/ttt.html">Ch6</A>
<P><A NAME="W"></A>
<BR>
Washington, George <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
<EM>What Is Mathematics?</EM> <A HREF="../v1ch14/pour.html">Ch14</A>
<BR>
Wirth, Niklaus <A HREF="../v1ch13/plan.html">Ch13</A>
<BR>
word <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>word</CODE> <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
word, empty <A HREF="../v1ch2/proced.html">Ch2</A>
<BR>
<CODE>wordp</CODE> <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
Wright, Matthew <A HREF="../v1ch0/ack.html">Ack</A>
, <A HREF="../v1ch6/ttt.html">Ch6</A>
<P><A NAME="X"></A>
<BR>
x-coordinate <A HREF="../v1ch10/turtle.html">Ch10</A>
<P><A NAME="Y"></A>
<BR>
y-coordinate <A HREF="../v1ch10/turtle.html">Ch10</A>
<BR>
yes-or-no question <A HREF="../v1ch4/predic.html">Ch4</A>
<BR>
Yoder, Sharon <A HREF="../v1ch0/ack.html">Ack</A>
<P><A HREF="../v1-toc2.html">(back to Table of Contents)</A>
<P><A HREF="appuindex.html"><STRONG>BACK</STRONG></A>
chapter thread [no next]
<P>
<ADDRESS>
<A HREF="../index.html">Brian Harvey</A>,
<CODE>bh@cs.berkeley.edu</CODE>
</ADDRESS>
</BODY>
</HTML>