about summary refs log tree commit diff stats
Commit message (Expand)AuthorAgeFilesLines
* applied patch by Jukkaarg@mig292006-11-271-1/+1
* changing Key.func into Key.func[NFUNCS], this allows sequences execution of f...arg@mig292006-11-273-69/+72
* added man page entryarg@mig292006-11-272-1/+4
* added togglefloat to hg tip (i consider this useful for some cases), using MO...arg@mig292006-11-274-0/+11
* applied Jukka's patch preventing some cornercases and making the EOF error me...arg@mig292006-11-271-1/+2
* applied yet another proposal of Manuelarg@mig292006-11-261-2/+2
* applied Jukka's sizeof K&R compliance patch, applied Manuels' last-line print...arg@mig292006-11-265-14/+16
* applied Jukka's stdinread patcharg@mig292006-11-261-2/+3
* next version will be 2.4arg@mig292006-11-251-1/+1
* applied Manuels patch (thanks to Manuel!)arg@mig292006-11-252-15/+22
* small fix of man pagearg@mig292006-11-241-1/+1
* Added tag 2.3 for changeset 719b37b37b0df829d7cf017ac70e353088fe5849arg@mig292006-11-241-0/+1
* using the term 'indicated' instead of 'higlighted' 2.3arg@mig292006-11-231-3/+3
* updated man page with the bottom right corner indicatorarg@mig292006-11-231-2/+4
* fifififarg@mig292006-11-223-37/+1
* added a similiar patch to Daves solution to indicate if there are clients wit...arg@mig292006-11-221-8/+24
* returning to old bar colorization behavior, like sander proposed for consiste...arg@mig292006-11-211-1/+1
* applied Gottox patchesarg@mig292006-11-213-8/+6
* using iso10646 explicitely in arg's config.harg@mig292006-11-211-1/+1
* Added tag 2.2 for changeset 7e92f58754ae6edb3225f26d754bd89c1ff458cfarg@mig292006-11-211-0/+1
* nah reverting to my prev style, that's really the best 2.2arg@mig292006-11-181-6/+6
* applying aluminium style for arg's config.harg@mig292006-11-181-6/+6
* applied Gottox' windowarea patcharg@mig292006-11-164-32/+32
* using a more blue-ish color...arg@mig292006-11-081-2/+2
* making the selected color more lightningarg@mig292006-11-081-1/+1
* next release will be 2.2arg@mig292006-11-031-1/+1
* applied Jukkas patcharg@mig292006-11-031-3/+7
* Added tag 2.1 for changeset a2c465098a3b972bbed00feda9804b6aae1e9531arg@mig292006-11-021-0/+1
* renamed resizecol into resizemaster 2.1arg@mig292006-10-314-6/+6
* applied Gottox patch to simplify the resizing of col, instead of resizing the...arg@mig292006-10-313-20/+5
* Added tag 2.0 for changeset 12deea36603da407e3f32640048846a3bd74a9ecarg@mig292006-10-311-0/+1
* make sure that changing sx has no impact on snapping 2.0arg@mig292006-10-311-1/+1
* in a 1920x1200 setup 40 pixels of snap value are much better than 20arg@mig292006-10-301-1/+1
* fixed stupid bug of snap-to-screenarg@mig292006-10-301-4/+4
* changing snap priorityarg@mig292006-10-301-3/+3
* removed useless abs() callsarg@mig292006-10-301-2/+2
* added screen-border snapping in floating mode, feels quite wellarg@mig292006-10-303-0/+10
* and another fixarg@mig292006-10-272-3/+4
* applied sanders try2 patcharg@mig292006-10-274-7/+6
* applied sanders max size fixarg@mig292006-10-272-1/+5
* stupid urxvt needs bg to highlight selections in a sane way, though that make...arg@mig292006-10-271-1/+1
* reverting to originalarg@mig292006-10-261-1/+1
* applied sander's config.*h nitpick patcharg@mig292006-10-262-5/+5
* some other changearg@mig292006-10-261-3/+3
* apply small fix to prevent apps like mplayer wandering when toggling fullscreenarg@mig292006-10-261-2/+2
* forgot to use -tr, which actually prevents the ugly flicker (using xsetroot -...arg@mig292006-10-261-1/+1
* using MASTER 600 again, it is definately better, and using urxvtc for the mom...arg@mig292006-10-261-2/+2
* changing MASTER in config.arg.h from 600 to 550 per thousandarg@mig292006-10-261-1/+1
* my new 1920x1200 Z61p arrived, now I can use terminus in a sane way...arg@mig292006-10-261-1/+1
* moved MOUSEMASK into event.c (not used in other places)Anselm R. Garbe2006-10-162-1/+1
#fff0f0 } /* Literal.String.Interpol */ .highlight .sx { color: #22bb22; background-color: #f0fff0 } /* Literal.String.Other */ .highlight .sr { color: #008800; background-color: #fff0ff } /* Literal.String.Regex */ .highlight .s1 { color: #dd2200; background-color: #fff0f0 } /* Literal.String.Single */ .highlight .ss { color: #aa6600; background-color: #fff0f0 } /* Literal.String.Symbol */ .highlight .bp { color: #003388 } /* Name.Builtin.Pseudo */ .highlight .fm { color: #0066bb; font-weight: bold } /* Name.Function.Magic */ .highlight .vc { color: #336699 } /* Name.Variable.Class */ .highlight .vg { color: #dd7700 } /* Name.Variable.Global */ .highlight .vi { color: #3333bb } /* Name.Variable.Instance */ .highlight .vm { color: #336699 } /* Name.Variable.Magic */ .highlight .il { color: #0000DD; font-weight: bold } /* Literal.Number.Integer.Long */
<HTML>
<HEAD>
<TITLE>Simply Scheme: General Index</TITLE>
</HEAD>
<BODY>
<CITE>Simply Scheme</CITE>:
<CITE>Introducing Computer Science</CITE> 2/e Copyright (C) 1999 MIT
<H1>General Index</H1>

<TABLE width="100%"><TR><TD>
<IMG SRC="../simply.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"><CITE><A HREF="http://ccrma.stanford.edu/~matt">Matthew
Wright</A><BR>University of California, Santa Barbara</CITE>
<TR><TD align="right"><BR>
<TR><TD align="right"><A HREF="../pdf/ssch27.pdf">Download PDF version</A>
<TR><TD align="right"><A HREF="../ss-toc2.html">Back to Table of Contents</A>
<TR><TD align="right"><A HREF="appuindex.html"><STRONG>BACK</STRONG></A>
chapter thread <A HREF="category.html"><STRONG>NEXT</STRONG></A>
<TR><TD align="right"><A HREF="http://mitpress.mit.edu/0262082810">MIT
Press web page for <CITE>Simply Scheme</CITE></A>
</TABLE></TABLE>

<HR>


<P>This index contains technical terms and primitive procedures.  Other sources
of information are the index of defined procedures, which contains
procedures whose definitions are in the text and procedures that you are
asked to write as exercises; the glossary, which defines many technical
terms; and the Alphabetical Table of Scheme Primitives on page <A HREF="appendix-funlist.html#funlist">funlist</A>.

<P><BR>
<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> J <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> X Y Z

<P><BR>
<CODE>#f</CODE> <A HREF="../ssch6/true#g66">Ch6</A><BR>
<CODE>#t</CODE> <A HREF="../ssch6/true#g65">Ch6</A><BR>
<CODE>'</CODE> <A HREF="../ssch5/words#g5">Ch5</A><BR>
<CODE>*</CODE> <A HREF="appendix-funlist#g202">FunList</A><BR>
<CODE>+</CODE> <A HREF="appendix-funlist#g203">FunList</A><BR>
<CODE>-</CODE> <A HREF="../ssch6/true#g83">Ch6</A>, <A HREF="appendix-funlist#g204">FunList</A><BR>
<CODE>/</CODE> <A HREF="appendix-funlist#g205">FunList</A><BR>
<CODE>&lt;</CODE> <A HREF="../ssch6/true#g73">Ch6</A><BR>
<CODE>&lt;=</CODE> <A HREF="../ssch6/true#g75">Ch6</A><BR>
<CODE>=</CODE> <A HREF="../ssch6/true#g71">Ch6</A><BR>
<CODE>&gt;</CODE> <A HREF="../ssch6/true#g72">Ch6</A><BR>
<CODE>&gt;=</CODE> <A HREF="../ssch6/true#g74">Ch6</A><BR>
<A NAME="A"></A>
Abelson, Harold <A HREF="../ssch13/convince-recur#g2">Ch13</A>, <A HREF="../ssch26/preview#g2">Ch26</A><BR>
<CODE>abs</CODE> <A HREF="../ssch6/true#g84">Ch6</A><BR>
abstract data type <A HREF="../ssch16/match#g13">Ch16</A>, <A HREF="../ssch17/lists#g15">Ch17</A>, <A HREF="../ssch18/trees#g28">Ch18</A>, <A HREF="../ssch25/spread-implement#g3">Ch25</A><BR>
<CODE>accumulate</CODE> <A HREF="../ssch8/higher#g20">Ch8</A>, <A HREF="../ssch8/higher#g29">Ch8</A>, <A HREF="../ssch19/implement-hof#g14">Ch19</A><BR>
actual argument <A HREF="../ssch4/defining#g10">Ch4</A><BR>
actual argument expression <A HREF="../ssch4/defining#g12">Ch4</A><BR>
actual argument value <A HREF="../ssch4/defining#g14">Ch4</A><BR>
ADT <A HREF="../ssch16/match#g16">Ch16</A>, <A HREF="../ssch18/trees#g31">Ch18</A>, <A HREF="../ssch25/spread-implement#g2">Ch25</A><BR>
<CODE>align</CODE> <A HREF="../ssch20/io#g44">Ch20</A><BR>
<CODE>and</CODE> <A HREF="../ssch6/true#g87">Ch6</A>, <A HREF="../ssch6/true#g96">Ch6</A><BR>
<CODE>append</CODE> <A HREF="../ssch17/lists#g9">Ch17</A><BR>
<CODE>apply</CODE> <A HREF="../ssch17/lists#g38">Ch17</A><BR>
argument, actual <A HREF="../ssch4/defining#g11">Ch4</A><BR>
arguments, variable number of <A HREF="../ssch17/lists#g36">Ch17</A><BR>
arithmetic function <A HREF="../ssch2/functions#g3">Ch2</A><BR>
<CODE>assoc</CODE> <A HREF="../ssch17/lists#g33">Ch17</A><BR>
association list <A HREF="../ssch17/lists#g31">Ch17</A><BR>
atomic expression <A HREF="../ssch3/people#g1">Ch3</A><BR>
<A NAME="B"></A>
base case <A HREF="../ssch11/recursion#g5">Ch11</A><BR>
base cases, simplifying <A HREF="../ssch12/leap#g5">Ch12</A><BR>
<CODE>before?</CODE> <A HREF="../ssch6/true#g76">Ch6</A><BR>
<CODE>begin</CODE> <A HREF="../ssch20/io#g18">Ch20</A><BR>
<CODE>bf</CODE> <A HREF="../ssch5/words#g20">Ch5</A><BR>
binary number <A HREF="../ssch15/adv-recur#g4">Ch15</A><BR>
<CODE>bl</CODE> <A HREF="../ssch5/words#g21">Ch5</A><BR>
Bonne, Rose <A HREF="credits#g39">Credits</A><BR>
<CODE>boolean?</CODE> <A HREF="../ssch6/true#g79">Ch6</A><BR>
Boole, George <A HREF="../ssch2/functions#g5">Ch2</A><BR>
branch node <A HREF="../ssch18/trees#g3">Ch18</A><BR>
bridge points <A HREF="../ssch9/bridge#g1">ProjBridge</A><BR>
<CODE>butfirst</CODE> <A HREF="../ssch5/words#g10">Ch5</A><BR>
<CODE>butlast</CODE> <A HREF="../ssch5/words#g12">Ch5</A><BR>
<A NAME="C"></A>
<CODE>cadr</CODE> <A HREF="../ssch17/lists#g14">Ch17</A><BR>
<CODE>car</CODE> <A HREF="../ssch17/lists#g4">Ch17</A><BR>
Carroll, Lewis <A HREF="../ssch4/defining#g7">Ch4</A>, <A HREF="credits#g37">Credits</A><BR>
case, base <A HREF="../ssch11/recursion#g6">Ch11</A><BR>
case, recursive <A HREF="../ssch11/recursion#g4">Ch11</A><BR>
<CODE>cdr</CODE> <A HREF="../ssch17/lists#g5">Ch17</A><BR>
<CODE>ceiling</CODE> <A HREF="appendix-funlist#g206">FunList</A><BR>
chalkboard model <A HREF="../ssch7/variables#g8">Ch7</A><BR>
child (in spreadsheet program) <A HREF="../ssch25/spread-implement#g22">Ch25</A><BR>
<CODE>children</CODE> <A HREF="../ssch18/trees#g9">Ch18</A><BR>
clause, cond <A HREF="../ssch6/true#g105">Ch6</A><BR>
Clinger, William <A HREF="../ssch22/files#g26">Ch22</A><BR>
<CODE>close-all-ports</CODE> <A HREF="../ssch22/files#g39">Ch22</A><BR>
<CODE>close-input-port</CODE> <A HREF="../ssch22/files#g13">Ch22</A><BR>
<CODE>close-output-port</CODE> <A HREF="../ssch22/files#g11">Ch22</A><BR>
complexity, control of <A HREF="../ssch1/showing#g2">Ch1</A><BR>
composition of functions <A HREF="../ssch3/part2#g1">Part2</A>, <A HREF="../ssch4/defining#g18">Ch4</A><BR>
compound expression <A HREF="../ssch3/people#g3">Ch3</A>, <A HREF="../ssch3/people#g7">Ch3</A><BR>
compound procedure <A HREF="../ssch1/showing#g9">Ch1</A><BR>
computing, symbolic <A HREF="../ssch1/showing#g22">Ch1</A><BR>
cond clause <A HREF="../ssch6/true#g104">Ch6</A><BR>
<CODE>cond</CODE> <A HREF="../ssch6/true#g101">Ch6</A>, <A HREF="../ssch10/ttt#g10">Ch10</A>, <A HREF="../ssch20/io#g15">Ch20</A><BR>
<CODE>cons</CODE> <A HREF="../ssch17/lists#g8">Ch17</A><BR>
constant, named <A HREF="../ssch7/variables#g3">Ch7</A><BR>
control of complexity <A HREF="../ssch1/showing#g1">Ch1</A><BR>
conversational program <A HREF="../ssch20/io#g1">Ch20</A><BR>
<CODE>cos</CODE> <A HREF="appendix-funlist#g207">FunList</A><BR>
<CODE>count</CODE> <A HREF="../ssch8/higher#g23">Ch8</A><BR>
<CODE>c...r</CODE> <A HREF="../ssch17/lists#g13">Ch17</A><BR>
<A NAME="D"></A>
data file <A HREF="../ssch22/files#g7">Ch22</A><BR>
data structure <A HREF="../ssch10/ttt#g2">Ch10</A><BR>
data type, abstract <A HREF="../ssch16/match#g14">Ch16</A>, <A HREF="../ssch17/lists#g16">Ch17</A>, <A HREF="../ssch18/trees#g29">Ch18</A>, <A HREF="../ssch25/spread-implement#g4">Ch25</A><BR>
<CODE>datum</CODE> <A HREF="../ssch18/trees#g8">Ch18</A><BR>
<CODE>define</CODE> <A HREF="../ssch4/defining#g2">Ch4</A>, <A HREF="../ssch9/lambda#g10">Ch9</A><BR>
definition, global <A HREF="../ssch9/lambda#g14">Ch9</A><BR>
diagram, plumbing <A HREF="../ssch3/people#g15">Ch3</A>, <A HREF="../ssch3/people#g19">Ch3</A><BR>
<CODE>display</CODE> <A HREF="../ssch20/io#g21">Ch20</A>, <A HREF="../ssch22/files#g3">Ch22</A><BR>
Dodgson, Charles <A HREF="credits#g38">Credits</A><BR>
<A NAME="E"></A>
effect, side <A HREF="../ssch20/io#g10">Ch20</A><BR>
<CODE>else</CODE> <A HREF="../ssch6/true#g106">Ch6</A><BR>
<CODE>empty?</CODE> <A HREF="../ssch6/true#g77">Ch6</A><BR>
empty sentence <A HREF="../ssch5/words#g14">Ch5</A>, <A HREF="../ssch6/true#g67">Ch6</A><BR>
end-of-file object <A HREF="../ssch22/files#g16">Ch22</A><BR>
<CODE>eof-object?</CODE> <A HREF="../ssch22/files#g19">Ch22</A><BR>
<CODE>equal?</CODE> <A HREF="../ssch6/true#g69">Ch6</A><BR>
<CODE>error</CODE> <A HREF="appendix-funlist#g208">FunList</A><BR>
error messages <A HREF="../ssch1/showing#g4">Ch1</A><BR>
<CODE>eval</CODE> <A HREF="../ssch25/spread-implement#g28">Ch25</A><BR>
evaluation, order of <A HREF="../ssch3/people#g8">Ch3</A>, <A HREF="../ssch3/people#g12">Ch3</A><BR>
<CODE>even?</CODE> <A HREF="appendix-funlist#g209">FunList</A><BR>
<CODE>every</CODE> <A HREF="../ssch8/higher#g3">Ch8</A>, <A HREF="../ssch8/higher#g27">Ch8</A><BR>
exclusive, mutually <A HREF="../ssch6/true#g109">Ch6</A><BR>
<CODE>exit</CODE> <A HREF="../ssch1/showing#g5">Ch1</A><BR>
expression, actual argument <A HREF="../ssch4/defining#g13">Ch4</A><BR>
expression, atomic <A HREF="../ssch3/people#g2">Ch3</A>, <A HREF="../ssch3/people#g6">Ch3</A><BR>
expression, compound <A HREF="../ssch3/people#g4">Ch3</A>, <A HREF="../ssch3/people#g8">Ch3</A><BR>
expression, self-evaluating <A HREF="../ssch3/people#g5">Ch3</A>, <A HREF="../ssch3/people#g9">Ch3</A>, <A HREF="../ssch5/words#g17">Ch5</A>, <A HREF="../ssch5/words#g26">Ch5</A><BR>
<CODE>expt</CODE> <A HREF="appendix-funlist#g210">FunList</A><BR>
extensions to Scheme <A HREF="../ssch5/words#g8">Ch5</A>, <A HREF="appendix-simply#g16">InitFile</A><BR>
<A NAME="F"></A>
Fibonacci numbers <A HREF="../ssch13/convince-recur#g12">Ch13</A><BR>
file, data <A HREF="../ssch22/files#g8">Ch22</A><BR>
<CODE>file-map</CODE> <A HREF="../ssch22/files#g20">Ch22</A><BR>
<CODE>filter</CODE> <A HREF="../ssch17/lists#g25">Ch17</A>, <A HREF="../ssch19/implement-hof#g12">Ch19</A><BR>
<CODE>first</CODE> <A HREF="../ssch5/words#g9">Ch5</A><BR>
<CODE>floor</CODE> <A HREF="appendix-funlist#g211">FunList</A><BR>
<CODE>for-each</CODE> <A HREF="../ssch20/io#g26">Ch20</A><BR>
formal parameter <A HREF="../ssch4/defining#g8">Ch4</A><BR>
form, special <A HREF="../ssch4/defining#g4">Ch4</A>, <A HREF="../ssch5/words#g4">Ch5</A>, <A HREF="../ssch6/true#g100">Ch6</A>, <A HREF="../ssch6/true#g92">Ch6</A>, <A HREF="../ssch6/true#g95">Ch6</A>, <A HREF="../ssch7/variables#g15">Ch7</A>, <A HREF="../ssch9/lambda#g5">Ch9</A>, <A HREF="../ssch13/convince-recur#g17">Ch13</A>, <A HREF="../ssch20/io#g17">Ch20</A><BR>
Freud, Sigmund <A HREF="../ssch26/preview#g5">Ch26</A><BR>
Friedman, Daniel P. <A HREF="../ssch23/vectors#g1">Ch23</A><BR>
functional programming <A HREF="../ssch2/functions#g1">Ch2</A>, <A HREF="../ssch3/part2#g3">Part2</A>, <A HREF="../ssch7/variables#g4">Ch7</A>, <A HREF="../ssch20/io#g19">Ch20</A><BR>
function, arithmetic <A HREF="../ssch2/functions#g4">Ch2</A><BR>
function as argument <A HREF="../ssch8/higher#g5">Ch8</A><BR>
function as data <A HREF="../ssch2/functions#g6">Ch2</A><BR>
function composition <A HREF="../ssch3/part2#g2">Part2</A>, <A HREF="../ssch4/defining#g19">Ch4</A><BR>
function, higher-order <A HREF="../ssch2/functions#g8">Ch2</A>, <A HREF="../ssch8/higher#g13">Ch8</A>, <A HREF="../ssch17/lists#g23">Ch17</A>, <A HREF="../ssch19/implement-hof#g3">Ch19</A><BR>
function machine <A HREF="../ssch3/people#g12">Ch3</A>, <A HREF="../ssch3/people#g16">Ch3</A>, <A HREF="../ssch8/higher#g14">Ch8</A><BR>
<CODE>functions</CODE> <A HREF="../ssch21/functions-implement#g1">Ch21</A><BR>
function, unnamed <A HREF="../ssch9/lambda#g17">Ch9</A><BR>
function vs. procedure <A HREF="../ssch4/defining#g6">Ch4</A>, <A HREF="../ssch8/higher#g8">Ch8</A><BR>
<A NAME="G"></A>
generalization <A HREF="../ssch4/defining#g16">Ch4</A>, <A HREF="../ssch19/implement-hof#g4">Ch19</A>, <A HREF="../ssch22/files#g23">Ch22</A><BR>
global variable <A HREF="../ssch9/lambda#g12">Ch9</A><BR>
<A NAME="H"></A>
Harvey, Brian <A HREF="../ssch13/convince-recur#g5">Ch13</A><BR>
helper procedure <A HREF="../ssch14/recur-patterns#g15">Ch14</A><BR>
higher-order function <A HREF="../ssch2/functions#g7">Ch2</A>, <A HREF="../ssch8/higher#g12">Ch8</A>, <A HREF="../ssch17/lists#g22">Ch17</A>, <A HREF="../ssch19/implement-hof#g2">Ch19</A><BR>
<A NAME="I"></A>
<CODE>if</CODE> <A HREF="../ssch6/true#g64">Ch6</A>, <A HREF="../ssch6/true#g90">Ch6</A><BR>
imperative programming <A HREF="../ssch23/vectors#g18">Ch23</A><BR>
indentation <A HREF="../ssch1/showing#g17">Ch1</A>, <A HREF="../ssch3/people#g16">Ch3</A><BR>
infix notation <A HREF="../ssch18/trees#g33">Ch18</A><BR>
initialization procedure <A HREF="../ssch14/recur-patterns#g19">Ch14</A><BR>
<CODE>integer?</CODE> <A HREF="appendix-funlist#g212">FunList</A><BR>
interactive programming <A HREF="../ssch20/io#g3">Ch20</A><BR>
interface, user <A HREF="../ssch20/io#g47">Ch20</A><BR>
<CODE>item</CODE> <A HREF="../ssch8/higher#g32">Ch8</A><BR>
<A NAME="K"></A>
<CODE>keep</CODE> <A HREF="../ssch8/higher#g16">Ch8</A>, <A HREF="../ssch8/higher#g28">Ch8</A><BR>
<CODE>keep</CODE> pattern <A HREF="../ssch14/recur-patterns#g5">Ch14</A><BR>
<A NAME="L"></A>
<CODE>lambda</CODE> <A HREF="../ssch9/lambda#g1">Ch9</A><BR>
<CODE>last</CODE> <A HREF="../ssch5/words#g11">Ch5</A><BR>
Latin, Pig <A HREF="../ssch1/showing#g14">Ch1</A>, <A HREF="../ssch11/recursion#g8">Ch11</A><BR>
leaf node <A HREF="../ssch18/trees#g5">Ch18</A><BR>
<CODE>length</CODE> <A HREF="../ssch17/lists#g30">Ch17</A><BR>
<CODE>let</CODE> <A HREF="../ssch7/variables#g13">Ch7</A><BR>
lines of a program <A HREF="../ssch1/showing#g16">Ch1</A><BR>
list, association <A HREF="../ssch17/lists#g32">Ch17</A><BR>
<CODE>list</CODE> <A HREF="../ssch17/lists#g7">Ch17</A><BR>
<CODE>list?</CODE> <A HREF="../ssch17/lists#g27">Ch17</A><BR>
<CODE>list-&gt;vector</CODE> <A HREF="../ssch23/vectors#g9">Ch23</A><BR>
<CODE>list-ref</CODE> <A HREF="../ssch17/lists#g29">Ch17</A><BR>
list, structured <A HREF="../ssch17/lists#g2">Ch17</A>, <A HREF="../ssch19/implement-hof#g20">Ch19</A><BR>
little people <A HREF="../ssch7/variables#g6">Ch7</A>, <A HREF="../ssch13/convince-recur#g1">Ch13</A><BR>
<CODE>load</CODE> <A HREF="appendix-funlist#g213">FunList</A><BR>
local variable <A HREF="../ssch7/variables#g10">Ch7</A><BR>
<CODE>log</CODE> <A HREF="appendix-funlist#g214">FunList</A><BR>
<A NAME="M"></A>
machine, function <A HREF="../ssch3/people#g13">Ch3</A>, <A HREF="../ssch3/people#g17">Ch3</A>, <A HREF="../ssch8/higher#g15">Ch8</A><BR>
<CODE>make-node</CODE> <A HREF="../ssch18/trees#g7">Ch18</A><BR>
<CODE>make-vector</CODE> <A HREF="../ssch23/vectors#g2">Ch23</A><BR>
Manilow, Barry <A HREF="../ssch5/words#g1">Ch5</A><BR>
<CODE>map</CODE> <A HREF="../ssch17/lists#g24">Ch17</A><BR>
Marx, Karl <A HREF="../ssch26/preview#g6">Ch26</A><BR>
matcher, pattern <A HREF="../ssch16/match#g2">Ch16</A><BR>
<CODE>max</CODE> <A HREF="appendix-funlist#g215">FunList</A><BR>
<CODE>member</CODE> <A HREF="../ssch17/lists#g28">Ch17</A><BR>
<CODE>member?</CODE> <A HREF="../ssch6/true#g70">Ch6</A>, <A HREF="../ssch6/true#g110">Ch6</A><BR>
Mills, Alan <A HREF="credits#g40">Credits</A><BR>
<CODE>min</CODE> <A HREF="appendix-funlist#g216">FunList</A><BR>
model, chalkboard <A HREF="../ssch7/variables#g9">Ch7</A><BR>
moon, phase of the <A HREF="../ssch13/convince-recur#g11">Ch13</A><BR>
mutually exclusive <A HREF="../ssch6/true#g108">Ch6</A><BR>
mutual recursion <A HREF="../ssch18/trees#g16">Ch18</A><BR>
<A NAME="N"></A>
named constant <A HREF="../ssch7/variables#g2">Ch7</A><BR>
naming a value <A HREF="../ssch7/variables#g1">Ch7</A>, <A HREF="../ssch9/lambda#g9">Ch9</A><BR>
<CODE>newline</CODE> <A HREF="../ssch20/io#g23">Ch20</A>, <A HREF="../ssch22/files#g6">Ch22</A><BR>
node, branch <A HREF="../ssch18/trees#g4">Ch18</A><BR>
node, leaf <A HREF="../ssch18/trees#g6">Ch18</A><BR>
node, root <A HREF="../ssch18/trees#g2">Ch18</A><BR>
<CODE>not</CODE> <A HREF="../ssch6/true#g88">Ch6</A><BR>
<CODE>null?</CODE> <A HREF="../ssch17/lists#g6">Ch17</A><BR>
number, binary <A HREF="../ssch15/adv-recur#g5">Ch15</A><BR>
<CODE>number?</CODE> <A HREF="../ssch6/true#g78">Ch6</A><BR>
numbers, Fibonacci <A HREF="../ssch13/convince-recur#g13">Ch13</A><BR>
<A NAME="O"></A>
object, end-of-file <A HREF="../ssch22/files#g17">Ch22</A><BR>
<CODE>odd?</CODE> <A HREF="appendix-funlist#g217">FunList</A><BR>
<CODE>open-input-file</CODE> <A HREF="../ssch22/files#g12">Ch22</A><BR>
<CODE>open-output-file</CODE> <A HREF="../ssch22/files#g9">Ch22</A><BR>
<CODE>or</CODE> <A HREF="../ssch6/true#g93">Ch6</A><BR>
order of evaluation <A HREF="../ssch3/people#g7">Ch3</A>, <A HREF="../ssch3/people#g11">Ch3</A><BR>
<A NAME="P"></A>
parameter, formal <A HREF="../ssch4/defining#g9">Ch4</A><BR>
parameter, rest <A HREF="../ssch17/lists#g40">Ch17</A><BR>
parentheses, for cond clauses <A HREF="../ssch6/true#g103">Ch6</A><BR>
parentheses, for let variables <A HREF="../ssch7/variables#g17">Ch7</A><BR>
parentheses, for procedure invocation <A HREF="../ssch1/showing#g3">Ch1</A>, <A HREF="../ssch3/people#g9">Ch3</A>, <A HREF="../ssch3/people#g13">Ch3</A>, <A HREF="../ssch8/higher#g37">Ch8</A><BR>
parent (in spreadsheet program) <A HREF="../ssch25/spread-implement#g21">Ch25</A><BR>
pattern: <CODE>keep</CODE> <A HREF="../ssch14/recur-patterns#g6">Ch14</A><BR>
pattern matcher <A HREF="../ssch16/match#g1">Ch16</A><BR>
pattern, recursive <A HREF="../ssch14/recur-patterns#g2">Ch14</A><BR>
phase of the moon <A HREF="../ssch13/convince-recur#g10">Ch13</A><BR>
Pig Latin <A HREF="../ssch1/showing#g13">Ch1</A>, <A HREF="../ssch11/recursion#g7">Ch11</A><BR>
Pisano, Leonardo <A HREF="../ssch13/convince-recur#g14">Ch13</A><BR>
plumbing diagram <A HREF="../ssch3/people#g14">Ch3</A>, <A HREF="../ssch3/people#g18">Ch3</A><BR>
points, bridge <A HREF="../ssch9/bridge#g2">ProjBridge</A><BR>
prefix notation <A HREF="../ssch18/trees#g32">Ch18</A><BR>
primitive procedure <A HREF="../ssch1/showing#g7">Ch1</A><BR>
printed twice, return value <A HREF="../ssch13/convince-recur#g8">Ch13</A><BR>
printing <A HREF="../ssch20/io#g5">Ch20</A>, <A HREF="../ssch20/io#g50">Ch20</A><BR>
procedure as argument <A HREF="../ssch8/higher#g6">Ch8</A><BR>
procedure, compound <A HREF="../ssch1/showing#g8">Ch1</A><BR>
procedure, helper <A HREF="../ssch14/recur-patterns#g16">Ch14</A><BR>
procedure, higher-order <A HREF="../ssch19/implement-hof#g1">Ch19</A><BR>
procedure, initialization <A HREF="../ssch14/recur-patterns#g20">Ch14</A><BR>
procedure, primitive <A HREF="../ssch1/showing#g6">Ch1</A><BR>
<CODE>procedure?</CODE> <A HREF="appendix-funlist#g218">FunList</A><BR>
procedure vs. function <A HREF="../ssch4/defining#g5">Ch4</A>, <A HREF="../ssch8/higher#g7">Ch8</A><BR>
program, conversational <A HREF="../ssch20/io#g2">Ch20</A><BR>
programming, functional <A HREF="../ssch2/functions#g2">Ch2</A>, <A HREF="../ssch3/part2#g4">Part2</A>, <A HREF="../ssch7/variables#g5">Ch7</A>, <A HREF="../ssch20/io#g20">Ch20</A><BR>
programming, imperative <A HREF="../ssch23/vectors#g19">Ch23</A><BR>
programming, interactive <A HREF="../ssch20/io#g4">Ch20</A><BR>
programming, symbolic <A HREF="../ssch1/showing#g24">Ch1</A><BR>
<A NAME="Q"></A>
quotation marks, double <A HREF="../ssch5/words#g6">Ch5</A><BR>
<CODE>quote</CODE> <A HREF="../ssch5/words#g2">Ch5</A><BR>
<CODE>quotient</CODE> <A HREF="appendix-funlist#g219">FunList</A><BR>
<A NAME="R"></A>
<CODE>random</CODE> <A HREF="../ssch23/vectors#g7">Ch23</A>, <A HREF="appendix-funlist#g220">FunList</A><BR>
<CODE>read</CODE> <A HREF="../ssch20/io#g35">Ch20</A>, <A HREF="../ssch22/files#g1">Ch22</A><BR>
<CODE>read-line</CODE> <A HREF="../ssch20/io#g41">Ch20</A>, <A HREF="../ssch22/files#g2">Ch22</A><BR>
<CODE>read-string</CODE> <A HREF="../ssch22/files#g33">Ch22</A><BR>
recursion&nbsp;&nbsp;&nbsp;<EM>see</EM> recursion<BR>
recursion, mutual <A HREF="../ssch18/trees#g17">Ch18</A><BR>
recursion, tree <A HREF="../ssch18/trees#g19">Ch18</A><BR>
recursive case <A HREF="../ssch11/recursion#g3">Ch11</A><BR>
recursive pattern <A HREF="../ssch14/recur-patterns#g1">Ch14</A><BR>
<CODE>reduce</CODE> <A HREF="../ssch17/lists#g26">Ch17</A>, <A HREF="../ssch19/implement-hof#g15">Ch19</A><BR>
Rees, Jonathan <A HREF="../ssch22/files#g27">Ch22</A><BR>
<CODE>remainder</CODE> <A HREF="appendix-funlist#g221">FunList</A><BR>
<CODE>repeated</CODE> <A HREF="../ssch8/higher#g30">Ch8</A><BR>
replacement, result <A HREF="../ssch3/people#g11">Ch3</A>, <A HREF="../ssch3/people#g15">Ch3</A><BR>
rest parameter <A HREF="../ssch17/lists#g39">Ch17</A><BR>
result replacement <A HREF="../ssch3/people#g10">Ch3</A>, <A HREF="../ssch3/people#g14">Ch3</A><BR>
root node <A HREF="../ssch18/trees#g1">Ch18</A><BR>
<CODE>round</CODE> <A HREF="appendix-funlist#g222">FunList</A><BR>
<A NAME="S"></A>
Scheme, extensions to <A HREF="../ssch5/words#g7">Ch5</A>, <A HREF="appendix-simply#g15">InitFile</A><BR>
<CODE>se</CODE> <A HREF="../ssch5/words#g24">Ch5</A><BR>
self-evaluating expression <A HREF="../ssch3/people#g6">Ch3</A>, <A HREF="../ssch3/people#g10">Ch3</A>, <A HREF="../ssch5/words#g18">Ch5</A>, <A HREF="../ssch5/words#g25">Ch5</A><BR>
<CODE>sentence</CODE> <A HREF="../ssch5/words#g23">Ch5</A><BR>
<CODE>sentence?</CODE> <A HREF="../ssch6/true#g81">Ch6</A><BR>
sentence, empty <A HREF="../ssch5/words#g15">Ch5</A>, <A HREF="../ssch6/true#g68">Ch6</A><BR>
<CODE>show</CODE> <A HREF="../ssch20/io#g6">Ch20</A>, <A HREF="../ssch22/files#g4">Ch22</A>, <A HREF="../ssch22/files#g10">Ch22</A><BR>
<CODE>show-line</CODE> <A HREF="../ssch20/io#g42">Ch20</A>, <A HREF="../ssch22/files#g5">Ch22</A><BR>
side effect <A HREF="../ssch20/io#g9">Ch20</A><BR>
simplifying base cases <A HREF="../ssch12/leap#g4">Ch12</A><BR>
<CODE>sin</CODE> <A HREF="appendix-funlist#g223">FunList</A><BR>
special form <A HREF="../ssch4/defining#g3">Ch4</A>, <A HREF="../ssch5/words#g3">Ch5</A>, <A HREF="../ssch6/true#g91">Ch6</A>, <A HREF="../ssch6/true#g94">Ch6</A>, <A HREF="../ssch6/true#g99">Ch6</A>, <A HREF="../ssch7/variables#g14">Ch7</A>, <A HREF="../ssch9/lambda#g4">Ch9</A>, <A HREF="../ssch13/convince-recur#g16">Ch13</A>, <A HREF="../ssch20/io#g16">Ch20</A><BR>
<CODE>sqrt</CODE> <A HREF="appendix-funlist#g224">FunList</A><BR>
string <A HREF="../ssch5/words#g19">Ch5</A><BR>
<EM>Structure and Interpretation of Computer Programs</EM> <A HREF="../ssch26/preview#g1">Ch26</A><BR>
structure, data <A HREF="../ssch10/ttt#g3">Ch10</A><BR>
structured list <A HREF="../ssch17/lists#g3">Ch17</A>, <A HREF="../ssch19/implement-hof#g19">Ch19</A><BR>
substitution <A HREF="../ssch7/variables#g12">Ch7</A><BR>
substitution model and global variables <A HREF="../ssch9/lambda#g11">Ch9</A><BR>
Sussman, Gerald Jay <A HREF="../ssch13/convince-recur#g3">Ch13</A>, <A HREF="../ssch26/preview#g3">Ch26</A><BR>
Sussman, Julie <A HREF="../ssch13/convince-recur#g4">Ch13</A>, <A HREF="../ssch26/preview#g4">Ch26</A><BR>
symbolic programming <A HREF="../ssch1/showing#g23">Ch1</A><BR>
<A NAME="T"></A>
<CODE>trace</CODE> <A HREF="../ssch13/convince-recur#g7">Ch13</A><BR>
tree recursion <A HREF="../ssch18/trees#g18">Ch18</A><BR>
type, abstract <A HREF="../ssch16/match#g15">Ch16</A>, <A HREF="../ssch17/lists#g17">Ch17</A>, <A HREF="../ssch18/trees#g30">Ch18</A>, <A HREF="../ssch25/spread-implement#g1">Ch25</A><BR>
<A NAME="U"></A>
unnamed function <A HREF="../ssch9/lambda#g18">Ch9</A><BR>
<CODE>untrace</CODE> <A HREF="../ssch13/convince-recur#g9">Ch13</A><BR>
user interface <A HREF="../ssch20/io#g46">Ch20</A><BR>
<A NAME="V"></A>
value, actual argument <A HREF="../ssch4/defining#g15">Ch4</A><BR>
variable, global <A HREF="../ssch9/lambda#g13">Ch9</A><BR>
variable, local <A HREF="../ssch7/variables#g11">Ch7</A><BR>
variable number of arguments <A HREF="../ssch17/lists#g35">Ch17</A><BR>
<CODE>vector</CODE> <A HREF="../ssch23/vectors#g14">Ch23</A><BR>
<CODE>vector?</CODE> <A HREF="../ssch23/vectors#g16">Ch23</A><BR>
<CODE>vector-fill!</CODE> <A HREF="../ssch23/vectors#g21">Ch23</A><BR>
<CODE>vector-&gt;list</CODE> <A HREF="../ssch23/vectors#g10">Ch23</A><BR>
<CODE>vector-length</CODE> <A HREF="../ssch23/vectors#g15">Ch23</A><BR>
<CODE>vector-ref</CODE> <A HREF="../ssch23/vectors#g4">Ch23</A><BR>
<CODE>vector-set!</CODE> <A HREF="../ssch23/vectors#g3">Ch23</A><BR>
<A NAME="W"></A>
<CODE>word</CODE> <A HREF="../ssch5/words#g22">Ch5</A><BR>
<CODE>word?</CODE> <A HREF="../ssch6/true#g80">Ch6</A><BR>
word, empty <A HREF="../ssch5/words#g16">Ch5</A><BR>
Wright, Matthew <A HREF="../ssch13/convince-recur#g6">Ch13</A><BR>
<CODE>write</CODE> <A HREF="../ssch22/files#g38">Ch22</A>


<HR>
<P><A HREF="../ss-toc2.html">(back to Table of Contents)</A><P>
<A HREF="appuindex.html"><STRONG>BACK</STRONG></A>
chapter thread <A HREF="category.html"><STRONG>NEXT</STRONG></A>

<P>
<ADDRESS>
<A HREF="../index.html">Brian Harvey</A>, 
<CODE>bh@cs.berkeley.edu</CODE>
</ADDRESS>
</BODY>
</HTML>