trivial diff: doc/reference_manual.texi: split up data-terms section

[Fergus Henderson]

Estimated hours taken: 0.25

doc/reference_manual.texi:
	Split the "Data-terms" section up into sub-sections,
	since it has grown long enough now to make that worthwhile.

Index: doc/reference_manual.texi
===================================================================
RCS file: /home/mercury1/repository/mercury/doc/reference_manual.texi,v
retrieving revision 1.134
diff -u -r1.134 reference_manual.texi
--- reference_manual.texi	1999/03/24 05:32:26	1.134
+++ reference_manual.texi	1999/03/24 05:49:32
@@ -692,8 +692,19 @@
 The second is that Mercury terms may contain function applications,
 higher-order function applications, and lambda expressions.
 
-A data-term is either a variable, a data-functor, a higher-order
-function application, a conditional expression, or a lambda expression.
+A data-term is either a variable, a data-functor,
+a conditional expression, a lambda expression,
+or a higher-order function application.
+
+ at menu
+* Data-functors::
+* Conditional expressions::
+* Lambda expressions::
+* Higher-order function applications::
+ at end menu
+
+ at node Data-functors
+ at subsection Data-functors
 
 A data-functor is an integer, a float, a string, a character literal
 (any single-character name), a name, or a compound data-term.
@@ -704,6 +715,9 @@
 must name a function, predicate, or data constructor declared
 in the program or in the interface of an imported module.
 
+ at node Conditional expressions
+ at subsection Conditional expressions
+
 A conditional expression is an expression of either of the two following
 forms
 
@@ -718,6 +732,9 @@
 if @var{Goal} is true, then the expression has the meaning of
 @var{Expression1}, else the expression has the meaning of @var{Expression2}.
 
+ at node Lambda expressions
+ at subsection Lambda expressions
+
 A lambda expression is a compound term of one of the following forms
 
 @example
@@ -740,7 +757,8 @@
 if it is not specified, then @samp{:- true} is assumed.
 A lambda expression denotes a higher-order predicate or function term
 whose value is the predicate or function of the specified arguments
-determined by the specified goal.  
+determined by the specified goal.  @xref{Higher-order}.
+
 A lambda expression introduces a new scope: any variables occuring in
 the arguments Arg1, Arg2, ... are locally quantified, i.e.
 any occurrences of variables with that name in the lambda
@@ -772,7 +790,9 @@
 where DCGVar0 and DCGVar1 are fresh variables,
 and Goal is the result of @samp{DCG-transform(DCGVar0, DCGVar1, DCGGoal)}
 where DCG-transform is the function specified in @ref{DCG-goals}.
- at xref{Higher-order}.
+
+ at node Higher-order function applications
+ at subsection Higher-order function applications
 
 A higher-order function application is a compound term of one
 of the following two forms

-- 
Fergus Henderson <fjh at cs.mu.oz.au>  |  "I have always known that the pursuit
WWW: <http://www.cs.mu.oz.au/~fjh>  |  of excellence is a lethal habit"
PGP: finger fjh at 128.250.37.3        |     -- the last words of T. S. Garp.