diff options
Diffstat (limited to 'js/games/nluqo.github.io/~bh/v3ch7')
| -rw-r--r-- | js/games/nluqo.github.io/~bh/v3ch7/appindex.html | 1435 | ||||
| -rw-r--r-- | js/games/nluqo.github.io/~bh/v3ch7/appuindex.html | 1038 | ||||
| -rw-r--r-- | js/games/nluqo.github.io/~bh/v3ch7/biblio.html | 341 | ||||
| -rw-r--r-- | js/games/nluqo.github.io/~bh/v3ch7/permissions.html | 73 |
4 files changed, 2887 insertions, 0 deletions
diff --git a/js/games/nluqo.github.io/~bh/v3ch7/appindex.html b/js/games/nluqo.github.io/~bh/v3ch7/appindex.html new file mode 100644 index 0000000..50f3944 --- /dev/null +++ b/js/games/nluqo.github.io/~bh/v3ch7/appindex.html @@ -0,0 +1,1435 @@ + +<P><HTML> +<HEAD> +<TITLE>Computer Science Logo Style vol 3: General Index</TITLE> +</HEAD> +<BODY> +<CITE>Computer Science Logo Style</CITE> volume 3: +<CITE>Beyond Programming</CITE> 2/e Copyright (C) 1997 MIT +<H1>General Index</H1> + +<TABLE width="100%"><TR><TD> +<IMG SRC="../csls3.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/v3ch07.pdf">Download PDF version</A> +<TR><TD align="right"><A HREF="../v3-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-3">MIT +Press web page for <CITE>Computer Science Logo Style</CITE></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> <A HREF="appindex.html#U">U</A> <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> <A HREF="appindex.html#Z">Z</A> + + +<P><BR> +∀ <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +∧ <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +¬ <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +∨ <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +⊗ <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +Σ <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +→ <A HREF="../v3ch2/math.html">Ch2</A> +<P><A NAME="A"></A> +<BR> +Abelson, Harold <A HREF="../v3ch0/preface.html">Pref</A> +, <A HREF="../v3ch0/ack.html">Ack</A> +, <A HREF="biblio.html">Biblio</A> +<BR> +accepting state <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +access, random <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +actual argument <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +adder <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +adder, finite-state <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +address <A HREF="../v3ch3/algs.html">Ch3</A> +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +age problem <A HREF="../v3ch6/ai.html">Ch6</A> + +<BR> +aggregate type <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +algebra word problems <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +algorithm <A HREF="../v3ch1/fsm.html">Ch1</A> +, <A HREF="../v3ch3/algs.html">Ch3</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +algorithm, two-stack <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +algorithms, analysis of <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +allocation, dynamic <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +alphabet rule <A HREF="../v3ch1/fsm.html">Ch1</A> + +<BR> +alternatives rule <A HREF="../v3ch1/fsm.html">Ch1</A> + +<BR> +ambiguous <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +analysis of algorithms <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +analysis, lexical <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +Anderson, Chris <A HREF="../v3ch0/ack.html">Ack</A> +<BR> +APL <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +apprenticeship <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +argument, actual <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +array <A HREF="../v3ch4/langd.html">Ch4</A> + + +<BR> +array, packed <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +artificial intelligence <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +assembly language <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +assignment statement <A HREF="../v3ch4/langd.html">Ch4</A> + + +<BR> +Association for Computing Machinery <A HREF="biblio.html">Biblio</A> +<BR> +association list <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +ATN <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +augmented transition network <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +automata theory <A HREF="../v3ch1/fsm.html">Ch1</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<P><A NAME="B"></A> +<BR> +background <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +backtracking <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +balanced tree <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +balancing parentheses <A HREF="../v3ch1/fsm.html">Ch1</A> + +<BR> +Baldwin, Diane C. <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +BASIC <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +Beatles <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>begin</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +Bentley, Jon <A HREF="biblio.html">Biblio</A> +<BR> +bibliography <A HREF="biblio.html">Biblio</A> +<BR> +binary computer <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +binary number <A HREF="../v3ch1/fsm.html">Ch1</A> +, <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +binary operator <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +binary search algorithm <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +binary tree <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +binding, call by <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +binomial coefficient <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +bit <A HREF="../v3ch1/fsm.html">Ch1</A> + +, <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +block structure <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +Bobrow, Daniel G. <A HREF="../v3ch0/ack.html">Ack</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>Boolean</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +bottom-up <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +bound reference <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +branch node <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +byte <A HREF="../v3ch3/algs.html">Ch3</A> +, <A HREF="../v3ch4/langd.html">Ch4</A> +<P><A NAME="C"></A> +<BR> +C <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +CAI, intelligent <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +call by binding <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +call by reference <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +call by value <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +call, procedure <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +category <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>char</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +checking, compile-time <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +Chinese food <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +circuit, integrated <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +Clancy, Michael <A HREF="../v3ch0/ack.html">Ack</A> +<BR> +closed form definition <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +code generation <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +coefficient, binomial <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +coefficient, multinomial <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +cognitive science <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +Colby, Kenneth <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +combination <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +combination lock <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +combinatorics <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +common subexpression elimination <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +community <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +compile-time checking <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +compiler <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +compiler compiler <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +compiler, incremental <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +compiler, optimizing <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +compiler, Pascal <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +complexity <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +composition of functions <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +compound proposition <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +compound statement <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +computer assisted instruction <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +computer center <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +computer hardware <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +computer logic <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +computer science <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +computer, binary <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +concatenation rule <A HREF="../v3ch1/fsm.html">Ch1</A> + +<BR> +conditional statement <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +constant string <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +constructor <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +context, limited <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +context-free language <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +continuous function <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +contradiction, proof by <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +contrapositive rule <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +correctness <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +correspondence, one-to-one <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +counting problem <A HREF="../v3ch2/math.html">Ch2</A> +<P><A NAME="D"></A> +<BR> +data structure <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +data type <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +Davis, Jim <A HREF="../v3ch0/ack.html">Ack</A> +<BR> +declaration part <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +declarative knowledge <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +declarative programming <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +declarative programming languages <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +declarative representation <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +definition, closed form <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +definition, formal <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +definition, inductive <A HREF="../v3ch2/math.html">Ch2</A> + + +, <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +definition, recursive <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +descent, recursive <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +deterministic grammar <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +directed graph <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +discrete mathematics <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +Dreyfus, Hubert L. <A HREF="biblio.html">Biblio</A> +<BR> +dyadic <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +dynamic allocation <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +dynamic environment <A HREF="../v3ch4/langd.html">Ch4</A> +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +dynamic programming <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +dynamic scope <A HREF="../v3ch4/langd.html">Ch4</A> + + + +, <A HREF="../v3ch5/langi.html">Ch5</A> +<P><A NAME="E"></A> +<BR> +economics <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +editor, text <A HREF="../v3ch1/fsm.html">Ch1</A> +, <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +education <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +effective procedure <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +efficiency <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +elementary function <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +elimination rule <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +embedding <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>end</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +engineering, knowledge <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +English <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +Ennals, Richard <A HREF="biblio.html">Biblio</A> +<BR> +enumerated type <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +environment, dynamic <A HREF="../v3ch4/langd.html">Ch4</A> +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +environment, lexical <A HREF="../v3ch4/langd.html">Ch4</A> + +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +equation <A HREF="../v3ch6/ai.html">Ch6</A> + +<BR> +equivalence relation <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +ethics <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +exclusive or <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +expansion, multinomial <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +experimental method <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +expert system <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +exponential <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +expression <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +expression, regular <A HREF="../v3ch1/fsm.html">Ch1</A> + +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +extensibility <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +external memory <A HREF="../v3ch1/fsm.html">Ch1</A> +<P><A NAME="F"></A> +<BR> +factorial <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +fence <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +Fermat, Pierre de <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +finite-state adder <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +finite-state machine <A HREF="../v3ch1/fsm.html">Ch1</A> + +, <A HREF="../v3ch5/langi.html">Ch5</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>first</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +food, Chinese <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +forest <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +formal definition <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +formal parameter <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +formal thinking <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +<CODE>for</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> + + +<BR> +frame pointer <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +frame, stack <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +free reference <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +Friedman, Daniel P. <A HREF="biblio.html">Biblio</A> +<BR> +function, continuous <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +function, elementary <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +function, generating <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +function, predicate <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +function, sine <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +function, truth-valued <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +functional programming <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +functions, composition of <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>function</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> +<P><A NAME="G"></A> +<BR> +gate <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +general knowledge <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +generated symbol <A HREF="../v3ch3/algs.html">Ch3</A> +, <A HREF="../v3ch5/langi.html">Ch5</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> + +<BR> +generating function <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +generation, code <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +global optimization <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +global pointer <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +Goldenberg, Paul <A HREF="../v3ch0/ack.html">Ack</A> +<BR> +grammar, deterministic <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +grammar, predictive <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +graph <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +graph, directed <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +graphics <A HREF="../v3ch0/preface.html">Pref</A> +<P><A NAME="H"></A> +<BR> +half-adder <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +halting state <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +halting theorem <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +Hanoi, Tower of <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +hardware, computer <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +Harnadek, Anita <A HREF="../v3ch0/ack.html">Ack</A> +, <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +hash table <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +Haynes, Christopher T. <A HREF="biblio.html">Biblio</A> +<BR> +heap <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +heapsort <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +heuristic <A HREF="../v3ch6/ai.html">Ch6</A> + +<BR> +hierarchy <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +hierarchy, syntactic <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +Hilfinger, Paul <A HREF="../v3ch0/ack.html">Ack</A> +<BR> +Hoare, C. A. R. <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +Hofstadter, Douglas R. <A HREF="biblio.html">Biblio</A> +<P><A NAME="I"></A> +<BR> +<CODE>if</CODE> (Pascal) <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +immediate <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +implication rule <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +incremental compiler <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +independent <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +index register <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +index variable <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +individual <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +induction, mathematical <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +inductive definition <A HREF="../v3ch2/math.html">Ch2</A> + + +, <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +inference system <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +inference, rules of <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +infinite loop <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +infinite set <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +insertion sort <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +instruction, computer assisted <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +integers, sum of the <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +<CODE>integer</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +integrated circuit <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +intellectual property <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +intelligence, artificial <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +intelligent CAI <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +interactive language <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +intermediate language <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +internal state <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +interpreter <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +intractable <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +inverter <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +Iverson, Kenneth E. <A HREF="../v3ch5/langi.html">Ch5</A> +<P><A NAME="J"></A> +<BR> +Jensen, Kathleen <A HREF="biblio.html">Biblio</A> +<BR> +joke <A HREF="../v3ch3/algs.html">Ch3</A> +<P><A NAME="K"></A> +<BR> +keyword <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +Kleene, Stephen C. <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +knowledge engineering <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +knowledge representation <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +knowledge, declarative <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +knowledge, general <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +knowledge, procedural <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +Knuth, Donald E. <A HREF="../v3ch3/algs.html">Ch3</A> +<P><A NAME="L"></A> +<BR> +label <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +language, context-free <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +language, interactive <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +language, intermediate <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +language, machine <A HREF="../v3ch4/langd.html">Ch4</A> +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +language, non-interactive <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>last</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +leaf node <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +lexical analysis <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +lexical environment <A HREF="../v3ch4/langd.html">Ch4</A> + +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +lexical scope <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +limited context <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +linear <A HREF="../v3ch3/algs.html">Ch3</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +linear search algorithm <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +Lisp <A HREF="../v3ch4/langd.html">Ch4</A> + +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +list, association <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +list, property <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +list, sorted <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +Liu, Chung Laung <A HREF="biblio.html">Biblio</A> +<BR> +<CODE>load</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +local optimization <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +local procedure <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +lock, combination <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +lock, Simplex <A HREF="../v3ch2/math.html">Ch2</A> +, <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +logarithm <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +logic problem <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +logic programming <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +logic, computer <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +logic, predicate <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +logic, propositional <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +logic, ternary <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +Logo <A HREF="../v3ch4/langd.html">Ch4</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +Logo pattern matcher <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +Logo variable <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +lookahead <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +lookahead, one-character <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +loop, infinite <A HREF="../v3ch1/fsm.html">Ch1</A> +<P><A NAME="M"></A> +<BR> +machine language <A HREF="../v3ch4/langd.html">Ch4</A> +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +machine, finite-state <A HREF="../v3ch1/fsm.html">Ch1</A> + +, <A HREF="../v3ch5/langi.html">Ch5</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +machine, nondeterministic <A HREF="../v3ch1/fsm.html">Ch1</A> + +<BR> +machine, theoretical <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +mandatory substitution <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +matching, pattern <A HREF="../v3ch6/ai.html">Ch6</A> + +<BR> +mathematical induction <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +mathematical model <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +mathematics, discrete <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +memoization <A HREF="../v3ch3/algs.html">Ch3</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +memory <A HREF="../v3ch3/algs.html">Ch3</A> +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +memory, computer <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +memory, external <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +mergesort <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +Meteor <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +microworld <A HREF="../v3ch6/ai.html">Ch6</A> + +<BR> +Minsky, Marvin <A HREF="biblio.html">Biblio</A> + +<BR> +model, mathematical <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +modification, tree <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +monadic <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +multinomial coefficient <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +multinomial expansion <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +multiplication rule <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +mutator <A HREF="../v3ch3/algs.html">Ch3</A> +<P><A NAME="N"></A> +<BR> +nand <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +network, augmented transition <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +network, recursive transition <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +Newell, Allen <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +node, branch <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +node, leaf <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +node, root <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +non-interactive language <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +nondeterministic machine <A HREF="../v3ch1/fsm.html">Ch1</A> + +<BR> +nor <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +null pointer <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +number, binary <A HREF="../v3ch1/fsm.html">Ch1</A> +, <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +number, random <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +numerical analysis <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +<CODE>numof</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> + +<P><A NAME="O"></A> +<BR> +object-oriented programming <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +offset <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +one-character lookahead <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +one-to-one correspondence <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +operating systems <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +operator precedence <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +operator, binary <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +operator, relational <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +operator, unary <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +optimization, global <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +optimization, local <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +optimizing compiler <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +optional substitution <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +ordered subset <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +ordering <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +ordering relation <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +ordinal type <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +overflow signal <A HREF="../v3ch2/math.html">Ch2</A> +<P><A NAME="P"></A> +<BR> +P-\kern 0.05pt code <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +packed array <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +pair <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +Papert, Seymour <A HREF="../v3ch0/preface.html">Pref</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +paradigm, programming <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +parameter, formal <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +parameter, value <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +parameter, variable <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +parentheses <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +parentheses, balancing <A HREF="../v3ch1/fsm.html">Ch1</A> + +<BR> +Parry <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +parser <A HREF="../v3ch5/langi.html">Ch5</A> + + +<BR> +parser generator <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +partition sort <A HREF="../v3ch3/algs.html">Ch3</A> +, <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +Pascal <A HREF="../v3ch4/langd.html">Ch4</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +, <A HREF="biblio.html">Biblio</A> +<BR> +Pascal compiler <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +Pascal program <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +Pascal variable <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +Pascal's Triangle <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +Pascal, Blaise <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +pattern matcher, Logo <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +pattern matching <A HREF="../v3ch6/ai.html">Ch6</A> + +<BR> +periodic <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +Perlis, Alan J. <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +permutation <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +philosophy <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +Piaget, Jean <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +piracy, software <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +pointer <A HREF="../v3ch3/algs.html">Ch3</A> +, <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +pointer, frame <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +pointer, global <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +pointer, null <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +pointer, stack <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +portable <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +precedence <A HREF="../v3ch5/langi.html">Ch5</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +precedence, operator <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +predicate function <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +predicate logic <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +predictive grammar <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +probability <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +problem, logic <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +procedural knowledge <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +procedural representation <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +procedure call <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +procedure, effective <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +procedure, local <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +procedure, recursive <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>procedure</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +process <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +processor <A HREF="../v3ch3/algs.html">Ch3</A> +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +production rule <A HREF="../v3ch1/fsm.html">Ch1</A> +, <A HREF="../v3ch5/langi.html">Ch5</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +program verification <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +program, Pascal <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +programming languages, declarative <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +programming paradigm <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +programming, declarative <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +programming, dynamic <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +programming, functional <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +programming, logic <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +programming, object-oriented <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +programming, sequential <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>program</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +Prolog <A HREF="../v3ch1/fsm.html">Ch1</A> +, <A HREF="../v3ch2/math.html">Ch2</A> +, <A HREF="biblio.html">Biblio</A> +<BR> +proof by contradiction <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +property list <A HREF="../v3ch2/math.html">Ch2</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +property, intellectual <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +proposition, compound <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +proposition, simple <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +propositional logic <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +psychology <A HREF="../v3ch0/preface.html">Pref</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<P><A NAME="Q"></A> +<BR> +quadratic <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +quadratic formula <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +quantifier <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +quicksort <A HREF="../v3ch3/algs.html">Ch3</A> +<P><A NAME="R"></A> +<BR> +random access <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +random number <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +range <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>real</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +record <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +recursive definition <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +recursive descent <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +recursive procedure <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +recursive transition network <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +reference, bound <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +reference, call by <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +reference, free <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +Reggini, Horacio <A HREF="../v3ch0/ack.html">Ack</A> +<BR> +register <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +register, index <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +regular expression <A HREF="../v3ch1/fsm.html">Ch1</A> + +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +reject state <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +relation <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +relation, equivalence <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +relation, ordering <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +relational operator <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>repeat</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +repetition rule <A HREF="../v3ch1/fsm.html">Ch1</A> + +<BR> +reserved word <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +retrieval time <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +robust <A HREF="../v3ch3/algs.html">Ch3</A> + +, <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +root node <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +<CODE>round</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +RTN <A HREF="../v3ch5/langi.html">Ch5</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +rule, production <A HREF="../v3ch1/fsm.html">Ch1</A> +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +rules of inference <A HREF="../v3ch2/math.html">Ch2</A> +<P><A NAME="S"></A> +<BR> +scalar type <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +science, cognitive <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +scope <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +scope, dynamic <A HREF="../v3ch4/langd.html">Ch4</A> + + + +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +scope, lexical <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +search algorithm, binary <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +search algorithm, linear <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +searching <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +selection sort <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +selector <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +self-reference <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +semantics <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +sentence, simple <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +sentinel <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +sequential programming <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +set theory <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +set, infinite <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +sharable <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +sigma <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +Simon, Herbert A. <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +simple proposition <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +simple sentence <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +simple statement <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +Simplex lock <A HREF="../v3ch2/math.html">Ch2</A> +, <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +simulation <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +sine function <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +Smullyan, Raymond <A HREF="biblio.html">Biblio</A> +<BR> +sociology <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +software engineering <A HREF="../v3ch0/preface.html">Pref</A> +, <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +software piracy <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +Somos, Michael <A HREF="../v3ch0/ack.html">Ack</A> +<BR> +sort, insertion <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +sort, partition <A HREF="../v3ch3/algs.html">Ch3</A> +, <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +sort, selection <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +sorted list <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +sorting <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +source file <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +space, time and <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +Spock, Mr. <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +spreadsheet <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +stack frame <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +stack pointer <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +start state <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +state <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +state, accepting <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +state, halting <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +state, internal <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +statement part <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +statement, assignment <A HREF="../v3ch4/langd.html">Ch4</A> + + +<BR> +statement, compound <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +statement, conditional <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +statement, simple <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +statement, structured <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +storage time <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +<CODE>store</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +string, constant <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +structure, block <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +structured statement <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +Student <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +subrange type <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +subset, ordered <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +substitution technique <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +substitution, mandatory <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +substitution, optional <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +sum of several terms <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +sum of the integers <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +Sussman, Gerald Jay <A HREF="../v3ch0/preface.html">Pref</A> +, <A HREF="biblio.html">Biblio</A> +<BR> +Sussman, Julie <A HREF="biblio.html">Biblio</A> +<BR> +symbol, generated <A HREF="../v3ch3/algs.html">Ch3</A> +, <A HREF="../v3ch5/langi.html">Ch5</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> + +<BR> +symmetric <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +syntactic hierarchy <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +syntax <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +system, expert <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +system, inference <A HREF="../v3ch2/math.html">Ch2</A> +<P><A NAME="T"></A> +<BR> +table of values <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +table, hash <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +ternary logic <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +text editor <A HREF="../v3ch1/fsm.html">Ch1</A> +, <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +theoretical machine <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +thinking, formal <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +time and space <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +time, retrieval <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +time, storage <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +timesharing systems <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +token <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +tokenization <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +top-down <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +Tower of Hanoi <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +tractable <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +tradeoff <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +transition network, augmented <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +transition network, recursive <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +transitive <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +transitive rules <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +tree <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +tree modification <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +tree, balanced <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +tree, binary <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +<CODE>trunc</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +truth-valued function <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +Turing machine <A HREF="../v3ch1/fsm.html">Ch1</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +Turing machine, universal <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +Turing's thesis <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +Turing, Alan M. <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +Turkle, Sherry <A HREF="../v3ch0/preface.html">Pref</A> +, <A HREF="../v3ch0/ack.html">Ack</A> +, <A HREF="biblio.html">Biblio</A> +<BR> +two-stack algorithm <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +type, aggregate <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +type, data <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +type, enumerated <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +type, ordinal <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +type, scalar <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +type, subrange <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +type, user-defined <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +typed variable <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>type</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> +<P><A NAME="U"></A> +<BR> +unambiguous <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +unary operator <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +uniqueness rule <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +unit <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +universal Turing machine <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +Unix <A HREF="../v3ch0/preface.html">Pref</A> + +, <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +user-defined type <A HREF="../v3ch4/langd.html">Ch4</A> +<P><A NAME="V"></A> +<BR> +value parameter <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +value, call by <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +variable parameter <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +variable, index <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +variable, Logo <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +variable, Pascal <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +variable, typed <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>var</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> + + +<BR> +verification, program <A HREF="../v3ch3/algs.html">Ch3</A> +<P><A NAME="W"></A> +<BR> +Wand, Mitchell <A HREF="biblio.html">Biblio</A> +<BR> +Weinberg, Gerald M. <A HREF="biblio.html">Biblio</A> +<BR> +Weizenbaum, Joseph <A HREF="biblio.html">Biblio</A> +<BR> +<CODE>while</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +White, Dick <A HREF="../v3ch0/ack.html">Ack</A> +<BR> +Winograd, Terry <A HREF="../v3ch0/ack.html">Ack</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +, <A HREF="biblio.html">Biblio</A> +<BR> +Wirth, Niklaus <A HREF="biblio.html">Biblio</A> +<BR> +word <A HREF="../v3ch3/algs.html">Ch3</A> +, <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +word problems, algebra <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +word, reserved <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +workspace <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +workstations <A HREF="../v3ch0/preface.html">Pref</A> +<BR> +<CODE>writeln</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>write</CODE> (Pascal) <A HREF="../v3ch4/langd.html">Ch4</A> +<P><A NAME="Y"></A> +<BR> +YACC <A HREF="../v3ch5/langi.html">Ch5</A> + +<P><A HREF="../v3-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> diff --git a/js/games/nluqo.github.io/~bh/v3ch7/appuindex.html b/js/games/nluqo.github.io/~bh/v3ch7/appuindex.html new file mode 100644 index 0000000..c6635c7 --- /dev/null +++ b/js/games/nluqo.github.io/~bh/v3ch7/appuindex.html @@ -0,0 +1,1038 @@ + +<P><HTML> +<HEAD> +<TITLE>Computer Science Logo Style vol 3: Index of Defined Procedures</TITLE> +</HEAD> +<BODY> +<CITE>Computer Science Logo Style</CITE> volume 3: +<CITE>Beyond Programming</CITE> 2/e Copyright (C) 1997 MIT +<H1>Index of Defined Procedures</H1> + +<TABLE width="100%"><TR><TD> +<IMG SRC="../csls3.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/v3ch07.pdf">Download PDF version</A> +<TR><TD align="right"><A HREF="../v3-toc2.html">Back to Table of Contents</A> +<TR><TD align="right"><A HREF="permissions.html"><STRONG>BACK</STRONG></A> +chapter thread <A HREF="appindex.html"><STRONG>NEXT</STRONG></A> +<TR><TD align="right"><A HREF="https://mitpress.mit.edu/books/computer-science-logo-style-second-edition-volume-3">MIT +Press web page for <CITE>Computer Science Logo Style</CITE></A> +</TABLE></TABLE> + +<HR> + +<P>This index lists example procedures whose definitions are in the text and +procedures that you are asked to write in the text. The +<A HREF="appindex.html">general index</A> +lists technical terms and primitive procedures. + +<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="appuindex.html#A">A</A> <A HREF="appuindex.html#B">B</A> <A HREF="appuindex.html#C">C</A> <A HREF="appuindex.html#D">D</A> <A HREF="appuindex.html#E">E</A> <A HREF="appuindex.html#F">F</A> <A HREF="appuindex.html#G">G</A> <A HREF="appuindex.html#H">H</A> <A HREF="appuindex.html#I">I</A> <A HREF="appuindex.html#J">J</A> <A HREF="appuindex.html#K">K</A> <A HREF="appuindex.html#L">L</A> <A HREF="appuindex.html#M">M</A> <A HREF="appuindex.html#N">N</A> <A HREF="appuindex.html#O">O</A> <A HREF="appuindex.html#P">P</A> <A HREF="appuindex.html#Q">Q</A> <A HREF="appuindex.html#R">R</A> <A HREF="appuindex.html#S">S</A> <A HREF="appuindex.html#T">T</A> <A HREF="appuindex.html#U">U</A> <A HREF="appuindex.html#V">V</A> <A HREF="appuindex.html#W">W</A> <A HREF="appuindex.html#X">X</A> <A HREF="appuindex.html#Y">Y</A> <A HREF="appuindex.html#Z">Z</A> + + +<P><BR> +<CODE>#gather</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>#test</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>#test2</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>&test</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>@test</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>@test2</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>@try.pred</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>^test</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<P><A NAME="A"></A> +<BR> +<CODE>abs</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>accept</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>acceptpart</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>addchild</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + + +<BR> +<CODE>addnumbers</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>ageify</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>ageprob</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>agepron</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>agesen</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>agewhen</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>always</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>anyof</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>anyof1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>areacode</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +<CODE>arglist</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>array.save</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>arraysize</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>arraytype</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>arrow.stub</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>arrowhead</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>arrows.from.start</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>arrowtail</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>arrowtext</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>article</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<P><A NAME="B"></A> +<BR> +<CODE>balance</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +<CODE>balance1</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +<CODE>bkt1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>blank</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>blockbody</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>bracket</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<P><A NAME="C"></A> +<BR> +<CODE>cap</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>cards</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>category</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>change.head</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>changeone</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>changes</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>changes1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>changes2</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>changes3</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>check.nd</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>check.type</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>children</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + + +<BR> +<CODE>choose</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>cities</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + + + +<BR> +<CODE>cities1</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +<CODE>city</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +<CODE>cleanup</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>code</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>codeload</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>codestore</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>combs</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + + +<BR> +<CODE>commalist</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>compound</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>copy.to.accepts</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>copyarray</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>cub.reporter</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<P><A NAME="D"></A> +<BR> +<CODE>datum</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + + +<BR> +<CODE>deck</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>denom</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>depunct</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>determine</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>differ</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>differ1</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>display</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>distribtimes</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>distribx</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>divterm</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>dlm</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<P><A NAME="E"></A> +<BR> +<CODE>equiv</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>exch</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>exit</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>exp.mode</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>exp.type</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>exp.value</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>expand</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>expression</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>expt</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<P><A NAME="F"></A> +<BR> +<CODE>f</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +, <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>fact</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +, <A HREF="../v3ch4/langd.html">Ch4</A> + + +<BR> +<CODE>fact.seq</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>factor</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>factor1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>factor2</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>falses</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>falsify</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>female</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>finddatum</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +<CODE>finddelim</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>finddelim1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>findfalse</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>findkey</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>findtrue</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>fix.arrows</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>foote.family</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>frame.outerframe</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>frame.prevframe</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>frame.retaddr</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>frame.save.newfp</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>fsm</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>fsm1</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>fsmnext</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>fsmtest</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>function</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<P><A NAME="G"></A> +<BR> +<CODE>game</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>get</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>getchar</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>geteqns</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>getid</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>gettype</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>guess.middle.value</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<P><A NAME="H"></A> +<BR> +<CODE>haltp</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>hanoi</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +<CODE>haspair</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +<CODE>highbranch</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +<CODE>howmany</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +<P><A NAME="I"></A> +<BR> +<CODE>id</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>id.lname</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>id.pointer</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>id.type</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>idioms</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>ifbe</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>ifbeelse</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>implies</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + + +<BR> +<CODE>implies1</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>in</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>increment</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +<CODE>insert</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>IntSquare</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<P><A NAME="J"></A> +<BR> +<CODE>jal</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>jr</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>jump</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>jumpf</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>jumpt</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>justbefore</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>justbefore1</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +<P><A NAME="L"></A> +<BR> +<CODE>last2</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>leaf</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +<CODE>leafp</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +<CODE>leaves</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +<CODE>lessthanp</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +<CODE>letter.join</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>letterp</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>lindex</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>lindex1</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>listcity</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +<CODE>lsay</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>lname</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>locate</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + + + +<BR> +<CODE>locate.in.forest</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + + + +<BR> +<CODE>locate1</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +<CODE>lock</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>lock1</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>lock2</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>lowbranch</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +<P><A NAME="M"></A> +<BR> +<CODE>machine</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>make.arrow</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>make.machine</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>make.stub</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>male</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>match</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>match!</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>match#</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>match&</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>match?</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>match@</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>match^</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>maybeadd</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>maybemul</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>median</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>memaddr</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>memsetup</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>minusin</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>movedisk</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> + +<BR> +<CODE>movepart</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>multi</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>mustbe</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<P><A NAME="N"></A> +<BR> +<CODE>nd.traverse</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>ndconcat</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>ndletter</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>ndmany</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>ndor</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>newarg</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>newline</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>newlname</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>newregister</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>newstate</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>newtail</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>newvar</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>nextindex</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>nextrow</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +, <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>nmtest</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>nocap</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>noimmediate</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>nondet</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> + +<BR> +<CODE>number</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>numtype</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<P><A NAME="O"></A> +<BR> +<CODE>occvar</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>offset</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>op.instr</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>op.nargs</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>op0</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>op1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>op2</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>opdiff</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>operatorp</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>opform</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>oprem</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>opsetup</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>optest</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>optimize</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>optimize.state</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>or.splice</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<P><A NAME="P"></A> +<BR> +<CODE>parrayassign</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>parse.special</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>passign</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>passign1</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>pboolean</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>pchar</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pchardata</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pchecktype</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pclose</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>pdata</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>peers</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>perms</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + + +<BR> +<CODE>personp</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>pexpr</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>pexpr1</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pexprop</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>pfor</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pfuncall</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pfunset</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pgetbinary</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pgetunary</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pif</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + + + +<BR> +<CODE>pinteger</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>plibrary</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>plural</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>pnewtype</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>popen</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>posspro</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>ppopop</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>pproccall</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pproccall1</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>prans</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>pranswers</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>preal</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>prematch</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>prepeat</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>proc1</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>procarg</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>procargs</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>procarrayarg</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>procedure</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>procvararg</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>program</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>program1</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pronoun</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>prun</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>prun1</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>psort</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + + + +, <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>psort1</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +<CODE>pstringassign</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pstringassign1</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>putch</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>putint</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>putreal</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>putstr</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>puttf</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pwhile</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pwrite</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pwrite1</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pwrite2</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pwrite3</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>pwriteln</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<P><A NAME="Q"></A> +<BR> +<CODE>qset</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>quadratic</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + + +<BR> +<CODE>quoted</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>qword</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<P><A NAME="R"></A> +<BR> +<CODE>range</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>range1</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>rc1</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>readnumber</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>RealSquare</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>realt</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +, <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>reg.globalptr</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>reg.retaddr</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>reg.stackptr</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>reg.zero</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>regfree</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>reject</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>remfactor</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>remfactor1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>remop</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>remove.once</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +<CODE>reservedp</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>reverse</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +<CODE>rload</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>rmatch</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>roundoff</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>runsetup</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<P><A NAME="S"></A> +<BR> +<CODE>say</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>says</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>senform</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>senform1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>set.in</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>set.special</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>setindex</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>setminus</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>settruth</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>settruth1</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>showdata</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>showdeck</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>shuffle</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>simdiv</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>simone</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>simp</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>simplex</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +, <A HREF="../v3ch3/algs.html">Ch3</A> + +, <A HREF="../v3ch4/langd.html">Ch4</A> + + +<BR> +<CODE>simplex.seq</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>simplus</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>simplus1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>simplus2</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>simtimes</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>simtimes1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>singular</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>skipcomment</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>slowsort</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +<CODE>socks</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + + +<BR> +<CODE>socktest</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>solution</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +<BR> +<CODE>solve</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>solve.reduce</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>solve1</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>solveq</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>solveq.minus</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>solveq.product</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>solveq.product1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>solveq.quotient</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>solveq.rplus</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>solveq.sum</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>solveq.sum1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>solveq.sum2</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>solveq1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>solveqboth</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>solver</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>sort</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +, <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>spaces</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>special</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>splice</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>square</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +, <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>ssort</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + + +<BR> +<CODE>ssort1</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +<CODE>startpart</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>statement</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>store</CODE> <A HREF="../v3ch2/math.html">Ch2</A> +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>string</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +, <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>stringa</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>stringlose</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>stub.add</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>stub.arrow</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>stub.head</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>stub.text</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>student1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>student2</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>subord</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>subord1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>substop</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>subterm</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>sumprods</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +, <A HREF="../v3ch4/langd.html">Ch4</A> +<P><A NAME="T"></A> +<BR> +<CODE>t</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +, <A HREF="../v3ch3/algs.html">Ch3</A> + + +, <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>targetaddr</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>this</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tobool</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>token</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>token1</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>tower</CODE> <A HREF="../v3ch4/langd.html">Ch4</A> +<BR> +<CODE>tree</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + + +<BR> +<CODE>treecity</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + +<BR> +<CODE>treecity1</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> +<BR> +<CODE>try</CODE> <A HREF="../v3ch1/fsm.html">Ch1</A> +<BR> +<CODE>try.pred</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tryidiom</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tryprocpart</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>trysolve</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.difference</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.divby</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.lessthan</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.minus</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.minuss</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.numof</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.per</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.percent</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.perless</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.plus</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.pluss</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.square</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.squared</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.sum</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.times</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>tst.tothepower</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>twochar</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> + +<BR> +<CODE>twoto</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<BR> +<CODE>typecheck</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<P><A NAME="U"></A> +<BR> +<CODE>unitstring</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<P><A NAME="V"></A> +<BR> +<CODE>varequal</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>vargroup</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>varkey</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>varpart</CODE> <A HREF="../v3ch5/langi.html">Ch5</A> +<BR> +<CODE>varterms</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>vartest</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>vartest1</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>verb</CODE> <A HREF="../v3ch6/ai.html">Ch6</A> +<BR> +<CODE>verify</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + +<P><A NAME="W"></A> +<BR> +<CODE>worldtree</CODE> <A HREF="../v3ch3/algs.html">Ch3</A> + + + + +<P><A NAME="X"></A> +<BR> +<CODE>xor</CODE> <A HREF="../v3ch2/math.html">Ch2</A> + + +<P><A HREF="../v3-toc2.html">(back to Table of Contents)</A> +<P><A HREF="permissions.html"><STRONG>BACK</STRONG></A> +chapter thread <A HREF="appindex.html"><STRONG>NEXT</STRONG></A> + +<P> +<ADDRESS> +<A HREF="../index.html">Brian Harvey</A>, +<CODE>bh@cs.berkeley.edu</CODE> +</ADDRESS> +</BODY> +</HTML> diff --git a/js/games/nluqo.github.io/~bh/v3ch7/biblio.html b/js/games/nluqo.github.io/~bh/v3ch7/biblio.html new file mode 100644 index 0000000..190fe18 --- /dev/null +++ b/js/games/nluqo.github.io/~bh/v3ch7/biblio.html @@ -0,0 +1,341 @@ +<HTML> +<HEAD> +<TITLE>Computer Science Logo Style vol 3: Bibliography</TITLE> +</HEAD> +<BODY> +<CITE>Computer Science Logo Style</CITE> volume 3: +<CITE>Beyond Programming</CITE> 2/e Copyright (C) 1997 MIT +<H1>Bibliography</H1> + +<TABLE width="100%"><TR><TD> +<IMG SRC="../csls3.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/v3ch07.pdf">Download PDF version</A> +<TR><TD align="right"><A HREF="../v3-toc2.html">Back to Table of Contents</A> +<TR><TD align="right"><A HREF="../v3ch6/v3ch6.html"><STRONG>BACK</STRONG></A> +chapter thread <A HREF="permissions.html"><STRONG>NEXT</STRONG></A> +<TR><TD align="right"><A HREF="https://mitpress.mit.edu/books/computer-science-logo-style-second-edition-volume-3">MIT +Press web page for <CITE>Computer Science Logo Style</CITE></A> +</TABLE></TABLE> + +<HR> + + +<P>This book is a little like the previews of coming attractions at the movies; +it's meant to whet your appetite in several directions, without giving you +the complete story about anything. To find out more, you'll have to consult +more specialized books on each topic. + +<P>There are a lot of books on computer programming and computer science, +and whichever I chose to list here would be out of date by the time +you read this. Instead of trying to give current references in every +area, in this edition I'm listing only the few most important and +timeless books, plus an indication of the sources I used for each +chapter. + +<P>Computer science is a fast-changing field; if you want to know what the +current hot issues are, you have to read the journals. The way to start is +to join the Association for Computing Machinery, 1515 Broadway, New +York, NY 10036. If you are a full-time student you are eligible for a +special rate for dues, which as I write this is 25 per year. (But you +should write for a membership application with the current rates.) The +Association publishes about 20 monthly or quarterly periodicals, plus the +newsletters of about 40 Special Interest Groups in particular fields. + +<P><H2>Read These!</H2> + +<P> +If you read no other books about computer science, you must read these two. +One is an introductory text for college computer science students; the other +is intended for a nonspecialist audience. + +<P>Abelson, Harold, and Gerald Jay Sussman with +Julie Sussman, +<EM>Structure and Interpretation of Computer Programs,</EM> MIT Press, +Second Edition, 1996. + +<P><BLOCKQUOTE> +The introductory computer science text at MIT, this book uses Lisp as the +vehicle for an intense study of everything from data structures to machine +architecture. Although it's not a book about artificial intelligence as +such, this is the definitive presentation of the artificial intelligence +view of what computer science in general is about, and the best computer +science book ever written. + +<P></BLOCKQUOTE> + +<P>Hofstadter, Douglas R., <EM>Godel, Escher, Bach: an Eternal +Golden Braid,</EM> Basic Books, 1979. + +<P><BLOCKQUOTE> +This book won the Pulitzer Prize for its success in explaining to readers +who aren't computer scientists some of the deepest ideas of computer +science, and it makes a strong case for the view that those ideas also have +a lot to teach us about human intelligence. + +<P></BLOCKQUOTE> + +<P><H2>Chapter 1: Automata Theory</H2> + +<P>The reference I used in thinking about this chapter was + +<P>Minsky, Marvin, <EM>Computation: Finite and Infinite +Machines,</EM> Prentice-Hall, 1967. + +<P><BLOCKQUOTE> +Part of the interest of this particular text is that its author is a leading +figure in artificial intelligence research, and so the question of whether +the insights of automata theory apply also to human intelligence is always +visible as a motivating force in the presentation of the theory. Minsky's +bibliography will refer you to the original papers by Turing, Kleene, +Church, and so on as well as some left-field references to biological +information processing from people like Lettvin and McCulloch. + +<P></BLOCKQUOTE> + +<P> + +<P><H2>Chapter 2: Discrete Mathematics</H2> + +<P>This chapter touches on several topics. An overall introduction for +computer scientists is + +<P>Liu, Chung Laung, <EM>Elements of Discrete Mathematics,</EM> +McGraw-Hill, Second Edition, 1985. + +<P><BLOCKQUOTE> +This book requires no advanced mathematical background, but it does require +that the reader feel comfortable with mathematical notation and the notion +of formal proof. The topics include both purely mathematical ones, like set +theory, combinatorics, and modern algebra, and related computer science ones +like computability, formal languages, automata theory, analysis of +algorithms, and recursion. This list is not unlike the one in the book +you're reading now, and in fact Professor Liu expresses a goal similar to +mine: to show computer science undergraduates the relevance of mathematics +to their work. The difference is that I use actual programs to illustrate +the ideas whenever possible, whereas his is a "straight" math book. (Of +course another difference is that he treats all these topics in much more +depth. But don't be scared away; he starts simply.) + +<P></BLOCKQUOTE> + +<P>On the topic of mathematical logic, there is a range of books that vary in +accessibility. Among the most pleasant are + +<P> +<P>Smullyan, Raymond, <EM>What Is the Name of This Book?</EM> Prentice-Hall, 1978 +<P>--, <EM>The Lady or the Tiger?</EM> Knopf, 1982 +<P>--, <EM>5000 B.C. and Other Philosophical Fantasies,</EM> St. Martin's, 1984 +<P>--, <EM>Alice in Puzzle-Land,</EM> Penguin, 1984. +<P> + +<P><BLOCKQUOTE> +These are books of puzzles based on logic, but they go beyond the simple +propositional inference puzzles like the one in the text. Smullyan starts +with some of the classic puzzle categories, like the Liars and Truth-Tellers +puzzle, and builds up to an exposition in puzzle form of topics like +self-reference, modal logic, and Godel's Theorem. + +<P></BLOCKQUOTE> + +<P>"Logic programming" is the use of mathematical logic formalisms as a +programming language. It is also called "declarative programming" because +instead of issuing commands to the computer, the programmer makes statements +about things known to be true. The algorithm by which the programming +system makes inferences from these statements is not explicitly provided by +the programmer, but is built into the language. The most widely known +logic programming language, although not the only one, is Prolog. An +accessible introductory text is + +<P>Ennals, Richard, <EM>Beginning Micro-Prolog,</EM> Harper & Row, +Second Edition, 1984. + +<P><BLOCKQUOTE> +I list this book here because it's a Prolog text and therefore relevant +to mathematical logic, but for me the main interest of the book is that +it argues for the use of Prolog in teaching kids, as an alternative to Logo. +The book gives examples of logic programming at work in various curriculum +areas. + +<P></BLOCKQUOTE> + +<P><H2>Chapter 3: Algorithms and Data Structures</H2> + +<P>To a software engineer, the issues in this chapter are among the central ones in +computer science. That's not my own way of thinking, so it's possible that +my presentation doesn't give the field all the pizazz that an enthusiast +would manage. To compensate for that, you should read + +<P>Bentley, Jon, <EM>Programming Pearls,</EM> Addison-Wesley, 1986. + +<P><BLOCKQUOTE> +This is a collection of monthly articles written by Bentley for the +<EM>Communications</EM> of the Association for Computing Machinery. It +requires virtually no formal mathematics and is extremely readable. +If the book has a moral, it's "Think first, program later." It makes +its case with a number of true-to-life examples of projects in which orders +of magnitude were saved in the execution time of a program by rethinking its +fundamental structure. + +<P></BLOCKQUOTE> + +<P> + +<P><H2>Chapter 4: Programming Language Design</H2> + +<P>There are textbooks in "comparative programming languages," but I'm going +to stick to the strategy of the chapter by using Pascal as the example. +<EM>Structure and Interpretation of Computer Programs,</EM> one of my +must-reads, will be useful as a contrast here, giving the Lisp point of view. + +<P>Jensen, Kathleen, and Niklaus Wirth, <EM> +Pascal User Manual and Report,</EM> Springer-Verlag, Third Edition, 1985. + +<P><BLOCKQUOTE> +This is the official report of the international committee responsible for +the design of the language. The book has two parts, a reference manual and +the committee report itself. The latter includes some explicit discussion +of the design decisions in the language. + +<P></BLOCKQUOTE> + +<P><H2>Chapter 5: Programming Language Implementation</H2> + +<P>I really didn't have a reference for this chapter; I just sort of +forged ahead on my own! But here's the book I <EM>should</EM> have +read first: + +<P>Friedman, Daniel P., Mitchell Wand, and +Christopher T. Haynes, <EM>Essentials of Programming Languages,</EM> +MIT Press, 1992. + +<P><BLOCKQUOTE> +This book uses the Scheme dialect of Lisp as the basis for a +study of programming language interpreters. It's harder reading +than most of the books in this bibliography, but it encourages the +reader to think very deeply about how programming languages work. + +<P></BLOCKQUOTE> + +<P><H2>Chapter 6: Artificial Intelligence</H2> + +<P>I'll list two references here; one on language understanding in +general and one that contains a paper about the Student program +specifically. + +<P>Winograd, Terry, <EM>Language as a Cognitive Process, Volume 1: +Syntax,</EM> Addison-Wesley, 1983. + +<P><BLOCKQUOTE> +A planned second volume on semantics was not published. This is a +technically meaty book, but considering its depth it is quite readable. +The book strikes a good balance among technical programming issues, +psychological issues, and the ideas of mainstream linguistics. It includes +an extensive bibliography. When I attended Terry's course at Stanford in +which he first presented the material that became this book, it was the +first time I experienced a course that ended with a standing ovation for the +instructor. The book shows the same clarity of explanation and the same +enthusiasm. + +<P></BLOCKQUOTE> + +<P>Minsky, Marvin L., <EM>Semantic Information Processing,</EM> MIT +Press, 1969. + +<P><BLOCKQUOTE> +This is a collection of early research reports. I include it here because +one of its chapters is a paper by Bobrow on STUDENT, and you won't be able +to find the more complete description in Bobrow's unpublished thesis. +Other chapters describe similar microworld-strategy projects of the same +vintage. + +<P></BLOCKQUOTE> + +<P><H2>Computers and People</H2> + +<P>Last but far from least, some of the most fascinating reading connected with +computer science is found outside of the technical literature, in the +reactions of psychologists, philosophers, and sociologists to the computer +as a social force. You owe it to yourself to understand the human context +of your work; you owe it to everyone else to be strongly aware of the +social implications of what you do. + +<P>Turkle, Sherry, <EM>The Second Self: Computers and the Human +Spirit,</EM> Simon and Schuster, 1984. + +<P><BLOCKQUOTE> +A sociologist's view of the computer culture, this book explores both the +psychology of computer experts and the ways in which a computer-rich +environment has changed the thinking of non-experts not only about +technology but about what it means to be human. + +<P></BLOCKQUOTE> + +<P>Weizenbaum, Joseph, <EM>Computer Power and Human Reason: From +Judgment to Calculation,</EM> W. H. Freeman, 1976. + +<P><BLOCKQUOTE> +Weizenbaum is a computer scientist, and this book is in part a technical +argument about the limitations of what computers can do. But it is more +importantly a call to computer scientists to take responsibility for the +uses to which their inventions are put. Weizenbaum argues that there are +things we <EM>shouldn't</EM> do with computers, even if we <EM>can</EM> learn +how to overcome the technical obstacles. Computer-based weapons of war are +an obvious example, but Weizenbaum is also worried about things like +automated psychotherapy, which was just a daydream when the book appeared +but has since become a reality to a limited extent. Many computer +scientists find this book offensive, and it is certainly possible to find +flaws in the details. But the critics rarely present an alternative with +an equally strong social conscience. + +<P></BLOCKQUOTE> + +<P>Dreyfus, Hubert L., <EM>What Computers Still Can't Do: A +Critique of Artificial Reason,</EM> MIT Press, 1992. + +<P><BLOCKQUOTE> +Dreyfus is a philosopher who uses the phenomenological ideas of Heidegger +and others to suggest a fundamental flaw in the assumptions AI researchers +make about human intelligence. To try to sum it up in one sentence, the +sort of thinking that people do in solving a puzzle is very different from +the much more profound intelligence we use in carrying out our more customary +activities. AI programs mimic the former but not the latter. This is a +revision of an earlier book, taking into account more recent developments +in AI research. + +<P></BLOCKQUOTE> + +<P>Weinberg, Gerald M., <EM>The Psychology of Computer +Programming,</EM> +Van Nostrand Reinholt, 1971. + +<P><BLOCKQUOTE> +This book studies programming as a social activity, programming as an +individual activity, and the programming environment. In my opinion, its +main contribution is the idea of "egoless programming," which means more +or less that when your friend finds that impossible bug in your program for +you, you should feel happy rather than threatened. Weinberg offers several +good ideas for how to act as part of a programming community. On the other +hand, I'm less enthusiastic about his manager's-eye view of the programmer +as a cog in the machine, rather than as a creative artist. But overall I +think this book is well worth reading; it's also entertainingly written. + +<P></BLOCKQUOTE> + +<P> + + +<P><A HREF="../v3-toc2.html">(back to Table of Contents)</A> +<P><A HREF="../v3ch6/v3ch6.html"><STRONG>BACK</STRONG></A> +chapter thread <A HREF="permissions.html"><STRONG>NEXT</STRONG></A> + +<P> +<ADDRESS> +<A HREF="../index.html">Brian Harvey</A>, +<CODE>bh@cs.berkeley.edu</CODE> +</ADDRESS> +</BODY> +</HTML> diff --git a/js/games/nluqo.github.io/~bh/v3ch7/permissions.html b/js/games/nluqo.github.io/~bh/v3ch7/permissions.html new file mode 100644 index 0000000..8658876 --- /dev/null +++ b/js/games/nluqo.github.io/~bh/v3ch7/permissions.html @@ -0,0 +1,73 @@ +<HTML> +<HEAD> +<TITLE>Computer Science Logo Style vol 3: Credits</TITLE> +</HEAD> +<BODY> +<CITE>Computer Science Logo Style</CITE> volume 3: +<CITE>Beyond Programming</CITE> 2/e Copyright (C) 1997 MIT +<H1>Credits</H1> + +<TABLE width="100%"><TR><TD> +<IMG SRC="../csls3.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/v3ch07.pdf">Download PDF version</A> +<TR><TD align="right"><A HREF="../v3-toc2.html">Back to Table of Contents</A> +<TR><TD align="right"><A HREF="biblio.html"><STRONG>BACK</STRONG></A> +chapter thread <A HREF="appuindex.html"><STRONG>NEXT</STRONG></A> +<TR><TD align="right"><A HREF="https://mitpress.mit.edu/books/computer-science-logo-style-second-edition-volume-3">MIT +Press web page for <CITE>Computer Science Logo Style</CITE></A> +</TABLE></TABLE> + +<HR> + +<P><A HREF="../v3ch0/preface.html#turkle">This +socio-philosophical research</A> quoted from <EM>The Second Self: +Computers and the Human Spirit</EM> by Sherry Turkle. Copyright © +1984 by Sherry Turkle. Reprinted by permission of Simon & Schuster, Inc. + +<P><A HREF="../v3ch2/math.html#harnadek">The reporter +logic puzzle</A> quoted from <EM>Mind Benders B-2</EM> +by Anita Harnadek. Copyright © 1978 by Midwest Publications (now +called Critical Thinking Press, Box +448, Pacific Grove, CA 93950). Reprinted by permission of the publisher. + +<P><A HREF="../v3ch2/math.html#baldwin">The Foote family +logic puzzle</A> by Diane C. Baldwin quoted from +<EM>The Dell Book of Logic Problems #4.</EM> Copyright © 1989 +by Dell Publishing, a division of Bantam Doubleday Dell Publishing Group, +Inc., reprinted by permission of Dell Magazines. + +<P><A HREF="../v3ch6/ai.html#bobrow1">This quote</A> and +<A HREF="../v3ch6/ai.html#bobrow2">this one</A> from <EM>Natural +Language Input for a Computer Problem Solving Program</EM> by Daniel +G. Bobrow (unpublished Ph.D. thesis). Copyright © 1964 by +Daniel G. Bobrow. Reprinted by permission of the author. + +<P><A HREF="../v3ch6/ai.html#papert">These ideas about +computers and kids</A> quoted from <EM>Mindstorms: Children, +Computers, and Powerful Ideas</EM> by Seymour Papert. Copyright © +1984 by Basic Books, Inc., publishers. Reprinted by permission of the +publisher. + +<P><A HREF="../v3ch6/ai.html#winograd">This ATN diagram</A> quoted +from <EM>Language as a +Cognitive Process, Volume 1: Syntax</EM> by Terry Winograd. Copyright +© 1983 by Addison-Wesley Publishing Company, Inc. Reprinted by +permission of the publisher. + +<P> + +<P><A HREF="../v3-toc2.html">(back to Table of Contents)</A> +<P><A HREF="biblio.html"><STRONG>BACK</STRONG></A> +chapter thread <A HREF="appuindex.html"><STRONG>NEXT</STRONG></A> + +<P> +<ADDRESS> +<A HREF="../index.html">Brian Harvey</A>, +<CODE>bh@cs.berkeley.edu</CODE> +</ADDRESS> +</BODY> +</HTML> |