fixes #612 (#752)

Co-authored-by: martin-henz <martin.henz@gmail.com>

Author: martin-henz

xml/chapter1/section1/subsection2.xml

@@ -295,9 +295,9 @@ circumference;
  </SPLITINLINE>
  since we will see later that a
  computation may involve a number of different
- environments).<FOOTNOTE>Chapter<SPACE/>3 will show that this notion of
+ environments).<FOOTNOTE>Chapter<SPACE/><REF NAME="chap:state"></REF> will show that this notion of
  environment is crucial for understanding how the interpreter works.
- Chapter<SPACE/>4 will use environments for implementing
+ Chapter<SPACE/><REF NAME="chap:meta"></REF> will use environments for implementing
  interpreters.</FOOTNOTE>
  </TEXT>
 </SUBSECTION>

xml/chapter1/section1/subsection5.xml

@@ -385,15 +385,15 @@ square(6) + square(10)
  Over the course of this book, we will present a sequence of
 increasingly elaborate models of how interpreters work, culminating
  with a complete implementation of an interpreter and compiler in
- chapter<SPACE/>5. The substitution model is only the first of
+ chapter<SPACE/><REF NAME="chap:reg"></REF>. The substitution model is only the first of
 these models<EMDASH/>a way to get started thinking formally
 about the evaluation process. In general, when 
  <INDEX>modeling<SUBINDEX>in science and engineering</SUBINDEX></INDEX>
  modeling phenomena in science and engineering, we begin with
 simplified, incomplete models. As we examine things in greater detail,
 these simple models become inadequate and must be replaced by more
 refined models. The substitution model is no exception. In particular,
-when we address in chapter<SPACE/>3 the use of 
+when we address in chapter<SPACE/><REF NAME="chap:state"></REF> the use of
  <SPLITINLINE>
  <SCHEME>procedures</SCHEME>
  <JAVASCRIPT>functions</JAVASCRIPT>

xml/chapter1/section1/subsection7.xml

@@ -127,7 +127,7 @@ function sqrt(x) {
  enough so that, given <QUOTE>what is</QUOTE> knowledge specified by the
  programmer, they can generate <QUOTE>how to</QUOTE> knowledge automatically.
  This cannot be done in general, but there are important areas where progress
- has been made. We shall revisit this idea in chapter<SPACE/>4.</FOOTNOTE>
+ has been made. We shall revisit this idea in chapter<SPACE/><REF NAME="chap:meta"></REF>.</FOOTNOTE>
  <SPLITINLINE>
  <SCHEME>
 <INDEX>procedure<SUBINDEX>mathematical function vs.<CLOSE/></SUBINDEX></INDEX>

xml/chapter1/section1/subsection8.xml

@@ -1176,7 +1176,7 @@ function sqrt(x) {
  function was declared.
  </JAVASCRIPT>
  </SPLITINLINE>
- We will see how this works in detail in chapter<SPACE/>3 when we
+ We will see how this works in detail in chapter<SPACE/><REF NAME="chap:state"></REF> when we
  study environments and the detailed behavior of the interpreter.</FOOTNOTE>
  <SNIPPET>
  <INDEX><DECLARATION>sqrt</DECLARATION><SUBINDEX>block structured</SUBINDEX></INDEX>

xml/chapter1/section2/subsection1.xml

@@ -318,7 +318,7 @@ function fact_iter(product, counter, max_count) {
  <SCHEME>procedures</SCHEME>
  <JAVASCRIPT>functions</JAVASCRIPT>
  </SPLITINLINE> 
- on register machines in chapter<SPACE/>5, we will see that any iterative
+ on register machines in chapter<SPACE/><REF NAME="chap:reg"></REF>, we will see that any iterative
  process can be realized <QUOTE>in hardware</QUOTE> as a machine that has a
  fixed set of registers and no auxiliary memory. In contrast, realizing a
  recursive process requires a machine that uses an
@@ -435,7 +435,7 @@ function fact_iter(product, counter, max_count) {
  <SCHEME>Scheme</SCHEME>
  <JAVASCRIPT>JavaScript</JAVASCRIPT>
  </SPLITINLINE>
- we shall consider in chapter<SPACE/>5 does not share this defect. It will
+ we shall consider in chapter<SPACE/><REF NAME="chap:reg"></REF> does not share this defect. It will
  execute an iterative process in constant space, even if the iterative
  process is described by a recursive
  <SPLITINLINE>
@@ -458,7 +458,7 @@ function fact_iter(product, counter, max_count) {
 Carl <CITATION>Hewitt (1977)</CITATION>, who explained it in
 <INDEX>message passing<SUBINDEX>tail recursion and</SUBINDEX></INDEX>
 terms of the <QUOTE>message-passing</QUOTE> model of computation that we
-shall discuss in chapter<SPACE/>3. Inspired by this, Gerald Jay Sussman
+shall discuss in chapter<SPACE/><REF NAME="chap:state"></REF>. Inspired by this, Gerald Jay Sussman
 and
 <INDEX>Steele, Guy Lewis Jr.</INDEX>
 Guy Lewis Steele Jr.<SPACE/>(see <CITATION>Steele 1975</CITATION>) 
@@ -481,7 +481,7 @@ function fact_iter(product, counter, max_count) {
 Carl Hewitt (1977), who explained it in
 <INDEX>message passing<SUBINDEX>tail recursion and</SUBINDEX></INDEX>
 terms of the <QUOTE>message-passing</QUOTE> model of computation that we
-shall discuss in chapter<SPACE/>3. Inspired by this, Gerald Jay Sussman
+shall discuss in chapter<SPACE/><REF NAME="chap:state"></REF>. Inspired by this, Gerald Jay Sussman
 and
 <INDEX>Steele, Guy Lewis Jr.</INDEX>
 Guy Lewis Steele Jr.<SPACE/>(see <CITATION>Steele 1975</CITATION>) 

xml/chapter1/section2/subsection5.xml

@@ -9,7 +9,7 @@
  <LATEXINLINE>$a$</LATEXINLINE> and <LATEXINLINE>$b$</LATEXINLINE> is defined
  to be the largest integer that divides both <LATEXINLINE>$a$</LATEXINLINE>
  and <LATEXINLINE>$b$</LATEXINLINE> with no remainder. For example, the GCD
- of 16 and 28 is 4. In chapter<SPACE/>2, when we investigate how to
+ of 16 and 28 is 4. In chapter<SPACE/><REF NAME="chap:data"></REF>, when we investigate how to
  implement rational-number arithmetic, we will need to be able to compute
  GCDs in order to reduce rational numbers to lowest terms. (To reduce a
  rational number to lowest terms, we must divide both the numerator and the

xml/chapter1/section3/subsection4.xml

@@ -732,7 +732,7 @@ sqrt(6);
  <LI>
 They may be included in data structures.<FOOTNOTE>We<APOS/>ll see
 examples of this after we introduce data structures in
-chapter<SPACE/>2.</FOOTNOTE>
+chapter<SPACE/><REF NAME="chap:data"></REF>.</FOOTNOTE>
  </LI>
  </UL>
  <SPLITINLINE>

xml/chapter2/chapter2.xml

@@ -63,7 +63,7 @@
  <INDEX>compound data, need for<OPEN/></INDEX>
  <INDEX>data<SUBINDEX>compound</SUBINDEX><OPEN/></INDEX>
  <NOINDENT/>
- We concentrated in chapter<SPACE/>1 on computational processes and on the 
+ We concentrated in chapter<SPACE/><REF NAME="chap:fun"></REF> on computational processes and on the
  role of
  <SPLITINLINE>
  <SCHEME>procedures</SCHEME>
@@ -119,12 +119,12 @@
  <SCHEME>procedures</SCHEME>
  <JAVASCRIPT>functions</JAVASCRIPT>
  </SPLITINLINE>
- in chapter<SPACE/>1 operate on simple numerical data, and simple data are
+ in chapter<SPACE/><REF NAME="chap:fun"></REF> operate on simple numerical data, and simple data are
  not sufficient for many of the problems we wish to address using
  computation. Programs are typically designed to model complex phenomena,
  and more often than not one must construct computational objects that have
  several parts in order to model real-world phenomena that have several
- aspects. Thus, whereas our focus in chapter<SPACE/>1 was on building
+ aspects. Thus, whereas our focus in chapter<SPACE/><REF NAME="chap:fun"></REF> was on building
  abstractions by combining
  <SPLITINLINE>
  <SCHEME>procedures</SCHEME>
@@ -394,7 +394,7 @@ function linear_combination(a, b, x, y) {
  <JAVASCRIPT><QUOTE>function</QUOTE></JAVASCRIPT>
  </SPLITINLINE>
  and <QUOTE>data,</QUOTE> which was already becoming tenuous toward the end
- of chapter<SPACE/>1. We will also explore some conventional techniques for
+ of chapter<SPACE/><REF NAME="chap:fun"></REF>. We will also explore some conventional techniques for
  representing sequences and trees. One key idea in dealing with compound
  data is the notion of 
  <INDEX>closure</INDEX>

xml/chapter2/section1/subsection3.xml

@@ -479,7 +479,7 @@ head(x);
  repertoire. This style of programming is often called 
  <INDEX>message passing</INDEX>
  <EM>message passing</EM>, and we will be using it as a basic tool in
- chapter<SPACE/>3 when we address the issues of modeling and simulation.
+ chapter<SPACE/><REF NAME="chap:state"></REF> when we address the issues of modeling and simulation.
  </TEXT>
  <EXERCISE> 
  Here is an alternative 

xml/chapter2/section2/section2.xml

@@ -152,7 +152,7 @@
  themselves are made up of parts, and so on.
  </TEXT>
  <TEXT>
- From the outset of chapter<SPACE/>1, we<APOS/>ve made essential use of
+ From the outset of chapter<SPACE/><REF NAME="chap:fun"></REF>, we<APOS/>ve made essential use of
  closure in dealing with
  <SPLITINLINE>
  <SCHEME>procedures,</SCHEME>