\start
Date: Mon, 12 Jan 2009 09:27:04 -0600
From: Tim Daly
To: list
Subject: 20090112.01.tpd.patch (bookvol10.3 add dotabb chunks)

Chunks for graphviz abbreviation graphs were added to each domain.
These chunks show the domain that directly supports the current domain,
that is, the domain that immediately precedes it in the build order.
===================================================================
diff --git a/books/bookvol10.3.pamphlet b/books/bookvol10.3.pamphlet
index 453e0e2..5493f91 100644
--- a/books/bookvol10.3.pamphlet
+++ b/books/bookvol10.3.pamphlet
@@ -290,6 +290,13 @@ November 10, 2003 ((iHy))
 \eject
 \pagenumbering{arabic}
 \setcounter{chapter}{0} % Chapter 1
+\chapter{Chapter Overview}
+This book contains the domains in Axiom, in alphabetical order.
+
+Each domain has an associated 'dotpic' chunk which only lists the
+domains, categories, and packages that are in the layer immediately
+below in the build order. For the full list see the algebra Makefile
+where this information is maintained.
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 %\pagehead{Domain}{ABB}
 %\pagepic{ps/v103domain.ps}{ABB}{1.00}
@@ -688,6 +695,11 @@ AlgebraGivenByStructuralConstants(R:Field, n : PositiveInteger,_
       true
 
 @
+<<ALGSC.dotabb>>=
+"ALGSC" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ALGSC"]
+"ALGSC" -> "FRNAALG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ALGFF AlgebraicFunctionField}
 \pagehead{AlgebraicFunctionField}{ALGFF}
@@ -833,28 +845,13 @@ AlgebraicFunctionField(F, UP, UPUP, modulus): Exports == Impl where
       not ground? gcd(retract(discriminant())@UP, p)
 
 @
+<<ALGFF.dotabb>>=
+"ALGFF" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ALGFF"]
+"ALGFF" -> "FFCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain AN AlgebraicNumber}
-<<dot>>=
-"AN" -> "ES"
-"AlgebraicNumber()" -> "ExpressionSpace()"
-"AN" -> "ACF"
-"AlgebraicNumber()" -> "AlgebraicallyClosedField()"
-"AN" -> "RETRACT"
-"AlgebraicNumber()" -> "RetractableTo(Integer)"
-"AlgebraicNumber()" -> "RetractableTo(Fraction(Integer))"
-"AN" -> "LINEXP"
-"AlgebraicNumber()" -> "LinearlyExplicitRingOver(Integer)"
-"AlgebraicNumber()" -> "LinearlyExplicitRingOver(Fraction(Integer))"
-"AN" -> "REAL"
-"AlgebraicNumber()" -> "RealConstant()"
-"AN" -> "CHARZ"
-"AlgebraicNumber()" -> "CharacteristicZero()"
-"AN" -> "KONVERT"
-"AlgebraicNumber()" -> "ConvertibleTo(Complex(Float))"
-"AN" -> "DIFRING"
-"AlgebraicNumber()" -> "DifferentialRing()"
-@
 \pagehead{AlgebraicNumber}{AN}
 \pagepic{ps/v103algebraicnumber.ps}{AN}{1.00}
 See also:\\
@@ -909,6 +906,11 @@ AlgebraicNumber(): Exports == Implementation where
     a=b == trueEqual((a-b)::Rep,0::Rep)
 
 @
+<<AN.dotabb>>=
+"AN" [color="#88FF44",href="bookvol10.3.pdf#nameddest=AN"]
+"AN" -> "ACF"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ANON AnonymousFunction}
 \pagehead{AnonymousFunction}{ANON}
@@ -921,6 +923,12 @@ AnonymousFunction():SetCategory == add
   coerce(x:%):OutputForm == x pretend OutputForm
 
 @
+<<ANON.dotabb>>=
+"ANON" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ANON"]
+"ANON" -> "BASTYPE"
+"ANON" -> "KOERCE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ANTISYM AntiSymm}
 \pagehead{AntiSymm}{ANTISYM}
@@ -1126,12 +1134,13 @@ AntiSymm(R:Ring, lVar:List Symbol): Export == Implement where
         reduce(_+,[makeTerm(t.coef,t.base) for t in (a @ Rep)])$L(O)
 
 @
+<<ANTISYM.dotabb>>=
+"ANTISYM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ANTISYM"]
+"ANTISYM" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ANY Any}
-<<dot>>=
-"ANY" -> "SETCAT"
-"Any()" -> "SetCategory()"
-@
 \pagehead{Any}{ANY}
 \pagepic{ps/v103any.ps}{ANY}{1.00}
 See also:\\
@@ -1216,12 +1225,13 @@ Any(): SetCategory with
        error "function any must have a domain as first argument"
 
 @
+<<ANY.dotabb>>=
+"ANY" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ANY"]
+"ANY" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASTACK ArrayStack}
-<<dot>>=
-"ASTACK" -> "STACK"
-"ArrayStack(a:SetCategory)" -> "Stack(a:SetCategory)"
-@
 \pagehead{ArrayStack}{ASTACK}
 \pagepic{ps/v103arraystack.ps}{ASTACK}{1.00}
 See also:\\
@@ -1281,6 +1291,11 @@ ArrayStack(S:SetCategory): StackAggregate(S) with
     empty() == new(0,0 pretend S)
 
 @
+<<ASTACK.dotabb>>=
+"ASTACK" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASTACK"]
+"ASTACK" -> "A1AGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP1 Asp1}
 \pagehead{Asp1}{ASP1}
@@ -1392,6 +1407,11 @@ Asp1(name): Exports == Implementation where
       p => restorePrecision()$NAGLinkSupportPackage
 
 @
+<<ASP1.dotabb>>=
+"ASP1" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP1"]
+"ASP1" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP10 Asp10}
 \pagehead{Asp10}{ASP10}
@@ -1533,6 +1553,11 @@ Asp10(name): Exports == Implementation where
       p => restorePrecision()$NAGLinkSupportPackage
 
 @
+<<ASP10.dotabb>>=
+"ASP10" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP10"]
+"ASP10" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP12 Asp12}
 \pagehead{Asp12}{ASP12}
@@ -1603,6 +1628,11 @@ Asp12(name): Exports == Implementation where
     outputAsFortran():Void == outputAsFortran(code)$Rep  
 
 @
+<<ASP12.dotabb>>=
+"ASP12" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP12"]
+"ASP12" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP19 Asp19}
 \pagehead{Asp19}{ASP19}
@@ -1878,6 +1908,11 @@ Asp19(name): Exports == Implementation where
       (v::VEC FEXPR)::$
 
 @
+<<ASP19.dotabb>>=
+"ASP19" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP19"]
+"ASP19" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP20 Asp20}
 \pagehead{Asp20}{ASP20}
@@ -2045,6 +2080,11 @@ Asp20(name): Exports == Implementation where
       p => restorePrecision()$NAGLinkSupportPackage
 
 @
+<<ASP20.dotabb>>=
+"ASP20" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP20"]
+"ASP20" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP24 Asp24}
 \pagehead{Asp24}{ASP24}
@@ -2163,6 +2203,11 @@ Asp24(name): Exports == Implementation where
       p => restorePrecision()$NAGLinkSupportPackage
 
 @
+<<ASP24.dotabb>>=
+"ASP24" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP24"]
+"ASP24" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP27 Asp27}
 \pagehead{Asp27}{ASP27}
@@ -2263,6 +2308,11 @@ Asp27(name): Exports == Implementation where
       p => restorePrecision()$NAGLinkSupportPackage
 
 @
+<<ASP27.dotabb>>=
+"ASP27" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP27"]
+"ASP27" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP28 Asp28}
 \pagehead{Asp28}{ASP28}
@@ -2474,6 +2524,11 @@ Asp28(name): Exports == Implementation where
       p => restorePrecision()$NAGLinkSupportPackage
 
 @
+<<ASP28.dotabb>>=
+"ASP28" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP28"]
+"ASP28" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP29 Asp29}
 \pagehead{Asp29}{ASP29}
@@ -2548,6 +2603,11 @@ Asp29(name): Exports == Implementation where
       outputAsFortran(coerce(code)@Rep)$Rep
 
 @
+<<ASP29.dotabb>>=
+"ASP29" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP29"]
+"ASP29" -> "FORTCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP30 Asp30}
 \pagehead{Asp30}{ASP30}
@@ -2678,6 +2738,11 @@ Asp30(name): Exports == Implementation where
       p => restorePrecision()$NAGLinkSupportPackage
 
 @
+<<ASP30.dotabb>>=
+"ASP30" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP30"]
+"ASP30" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP31 Asp31}
 \pagehead{Asp31}{ASP31}
@@ -2842,6 +2907,11 @@ Asp31(name): Exports == Implementation where
       p => restorePrecision()$NAGLinkSupportPackage
 
 @
+<<ASP31.dotabb>>=
+"ASP31" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP31"]
+"ASP31" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP33 Asp33}
 \pagehead{Asp33}{ASP33}
@@ -2896,6 +2966,11 @@ Asp33(name): Exports == Implementation where
     coerce(u:$):OutputForm == coerce(u)$Rep
 
 @
+<<ASP33.dotabb>>=
+"ASP33" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP33"]
+"ASP33" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP34 Asp34}
 \pagehead{Asp34}{ASP34}
@@ -2996,6 +3071,12 @@ Asp34(name): Exports == Implementation where
       p => restorePrecision()$NAGLinkSupportPackage
 
 @
+<<ASP34.dotabb>>=
+"ASP34" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP34"]
+"ASP34" -> "FIELD"
+"ASP34" -> "RADCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP35 Asp35}
 \pagehead{Asp35}{ASP35}
@@ -3170,6 +3251,11 @@ Asp35(name): Exports == Implementation where
       (v::VEC FEXPR)::$
 
 @
+<<ASP35.dotabb>>=
+"ASP35" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP35"]
+"ASP35" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP4 Asp4}
 \pagehead{Asp4}{ASP4}
@@ -3282,6 +3368,11 @@ Asp4(name): Exports == Implementation where
       p => restorePrecision()$NAGLinkSupportPackage
 
 @
+<<ASP4.dotabb>>=
+"ASP4" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP4"]
+"ASP4" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP41 Asp41}
 \pagehead{Asp41}{ASP41}
@@ -3295,7 +3386,8 @@ Asp4(name): Exports == Implementation where
 ++ Related Constructors: FortranFunctionCategory, FortranProgramCategory.
 ++ Description:
 ++\spadtype{Asp41} produces Fortran for Type 41 ASPs, needed for NAG
-++routines \axiomOpFrom{d02raf}{d02Package} and \axiomOpFrom{d02saf}{d02Package}
+++routines \axiomOpFrom{d02raf}{d02Package} and 
+++\axiomOpFrom{d02saf}{d02Package}
 ++in particular.  These ASPs are in fact 
 ++three Fortran routines which return a vector of functions, and their
 ++derivatives wrt Y(i) and also a continuation parameter EPS, for example:
@@ -3503,6 +3595,11 @@ Asp41(nameOne,nameTwo,nameThree): Exports == Implementation where
       (v::VEC FEXPR)::$
 
 @
+<<ASP41.dotabb>>=
+"ASP41" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP41"]
+"ASP41" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP42 Asp42}
 \pagehead{Asp42}{ASP42}
@@ -3745,6 +3842,11 @@ Asp42(nameOne,nameTwo,nameThree): Exports == Implementation where
       (v::VEC FEXPR)::$
 
 @
+<<ASP42.dotabb>>=
+"ASP42" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP42"]
+"ASP42" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP49 Asp49}
 \pagehead{Asp49}{ASP49}
@@ -3893,6 +3995,11 @@ Asp49(name): Exports == Implementation where
       (foo::FEXPR)::$
 
 @
+<<ASP49.dotabb>>=
+"ASP49" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP49"]
+"ASP49" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP50 Asp50}
 \pagehead{Asp50}{ASP50}
@@ -4057,6 +4164,11 @@ Asp50(name): Exports == Implementation where
       p => restorePrecision()$NAGLinkSupportPackage
 
 @
+<<ASP50.dotabb>>=
+"ASP50" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP50"]
+"ASP50" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP55 Asp55}
 \pagehead{Asp55}{ASP55}
@@ -4264,6 +4376,11 @@ Asp55(name): Exports == Implementation where
       (v::VEC FEXPR)::$
 
 @
+<<ASP55.dotabb>>=
+"ASP55" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP55"]
+"ASP55" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP6 Asp6}
 \pagehead{Asp6}{ASP6}
@@ -4414,6 +4531,11 @@ Asp6(name): Exports == Implementation where
       p => restorePrecision()$NAGLinkSupportPackage
 
 @
+<<ASP6.dotabb>>=
+"ASP6" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP6"]
+"ASP6" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP7 Asp7}
 \pagehead{Asp7}{ASP7}
@@ -4550,6 +4672,11 @@ Asp7(name): Exports == Implementation where
       p => restorePrecision()$NAGLinkSupportPackage
 
 @
+<<ASP7.dotabb>>=
+"ASP7" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP7"]
+"ASP7" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP73 Asp73}
 \pagehead{Asp73}{ASP73}
@@ -4698,6 +4825,11 @@ Asp73(name): Exports == Implementation where
       (v::VEC FEXPR)::$
 
 @
+<<ASP73.dotabb>>=
+"ASP73" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP73"]
+"ASP73" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP74 Asp74}
 \pagehead{Asp74}{ASP74}
@@ -4887,6 +5019,11 @@ Asp74(name): Exports == Implementation where
       (v::MAT FEXPR)::$
 
 @
+<<ASP74.dotabb>>=
+"ASP74" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP74"]
+"ASP74" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP77 Asp77}
 \pagehead{Asp77}{ASP77}
@@ -5041,6 +5178,11 @@ Asp77(name): Exports == Implementation where
       (v::MAT FEXPR)::$
 
 @
+<<ASP77.dotabb>>=
+"ASP77" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP77"]
+"ASP77" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP78 Asp78}
 \pagehead{Asp78}{ASP78}
@@ -5170,6 +5312,11 @@ Asp78(name): Exports == Implementation where
       (v::VEC FEXPR)::$
 
 @
+<<ASP78.dotabb>>=
+"ASP78" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP78"]
+"ASP78" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP8 Asp8}
 \pagehead{Asp8}{ASP8}
@@ -5300,6 +5447,11 @@ Asp8(name): Exports == Implementation where
       ([locals,code]$RSFC)::%
 
 @
+<<ASP8.dotabb>>=
+"ASP8" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP8"]
+"ASP8" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP80 Asp80}
 \pagehead{Asp80}{ASP80}
@@ -5452,6 +5604,11 @@ Asp80(name): Exports == Implementation where
       (v::MAT FEXPR)::$
 
 @
+<<ASP80.dotabb>>=
+"ASP80" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP80"]
+"ASP80" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ASP9 Asp9}
 \pagehead{Asp9}{ASP9}
@@ -5583,6 +5740,11 @@ Asp9(name): Exports == Implementation where
       p => restorePrecision()$NAGLinkSupportPackage
 
 @
+<<ASP9.dotabb>>=
+"ASP9" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ASP9"]
+"ASP9" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain JORDAN AssociatedJordanAlgebra}
 \pagehead{AssociatedJordanAlgebra}{JORDAN}
@@ -5649,6 +5811,11 @@ AssociatedJordanAlgebra(R:CommutativeRing,A:NonAssociativeAlgebra R):
     (a:%) ** (n:PositiveInteger) == a
 
 @
+<<JORDAN.dotabb>>=
+"JORDAN" [color="#88FF44",href="bookvol10.3.pdf#nameddest=JORDAN"]
+"JORDAN" -> "FRNAALG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain LIE AssociatedLieAlgebra}
 \pagehead{AssociatedLieAlgebra}{LIE}
@@ -5711,6 +5878,11 @@ AssociatedLieAlgebra(R:CommutativeRing,A:NonAssociativeAlgebra R):
       0
 
 @
+<<LIE.dotabb>>=
+"LIE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LIE"]
+"LIE" -> "FRNAALG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ALIST AssociationList}
 <<AssociationList.input>>=
@@ -5898,7 +6070,6 @@ See Also:
 o )help Table
 o )help List
 o )show AssociationList
-o $AXIOM/doc/src/algebra/list.spad.dvi
 
 @
 \pagehead{AssociationList}{ALIST}
@@ -5988,6 +6159,11 @@ AssociationList(Key:SetCategory, Entry:SetCategory):
           first(curr).entry
 
 @
+<<ALIST.dotabb>>=
+"ALIST" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ALIST"]
+"ALIST" -> "TBAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ATTRBUT AttributeButtons}
 \pagehead{AttributeButtons}{ATTRBUT}
@@ -6204,6 +6380,11 @@ AttributeButtons(): E == I where
               " not found for routine " routineName)$ErrorFunctions
 
 @
+<<ATTRBUT.dotabb>>=
+"ATTRBUT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ATTRBUT"]
+"ATTRBUT" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain AUTOMOR Automorphism}
 \pagehead{Automorphism}{AUTOMOR}
@@ -6265,6 +6446,11 @@ Automorphism(R:Ring): Join(Group, Eltable(R, R)) with
         iterat(f g #1, (inv g)(inv f) #1, #2, #1)
 
 @
+<<AUTOMOR.dotabb>>=
+"AUTOMOR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=AUTOMOR"]
+"AUTOMOR" -> "GROUP"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter B}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -6458,7 +6644,6 @@ Call the Chinese Remainder Algorithm to get the answer for 12^2.
 
 See Also:
 o )show BalancedBinaryTree
-o $AXIOM/doc/src/algebra/tree.spad.dvi
 
 @
 \pagehead{BalancedBinaryTree}{BBTREE}
@@ -6622,6 +6807,11 @@ BalancedBinaryTree(S: SetCategory): Exports == Implementation where
       x
 
 @
+<<BBTREE.dotabb>>=
+"BBTREE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=BBTREE"]
+"BBTREE" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain BPADIC BalancedPAdicInteger}
 \pagehead{BalancedPAdicInteger}{BPADIC}
@@ -6650,6 +6840,11 @@ See also:\\
 BalancedPAdicInteger(p:Integer) == InnerPAdicInteger(p,false$Boolean)
 
 @
+<<BPADIC.dotabb>>=
+"BPADIC" [color="#88FF44",href="bookvol10.3.pdf#nameddest=BPADIC"]
+"BPADIC" -> "PADICCT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain BPADICRT BalancedPAdicRational}
 \pagehead{BalancedPAdicRational}{BPADICRT}
@@ -6680,6 +6875,11 @@ BalancedPAdicRational(p:Integer) ==
   PAdicRationalConstructor(p,BalancedPAdicInteger p)
 
 @
+<<BPADICRT.dotabb>>=
+"BPADICRT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=BPADICRT"]
+"BPADICRT" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain BFUNCT BasicFunctions}
 \pagehead{BasicFunctions}{BFUNCT}
@@ -6749,6 +6949,11 @@ BasicFunctions():  E == I where
     bfEntry(k:Symbol):RS == qelt(bf(),k)$Rep
 
 @
+<<BFUNCT.dotabb>>=
+"BFUNCT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=BFUNCT"]
+"BFUNCT" -> "FIELD-"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain BOP BasicOperator}
 <<BasicOperator.input>>=
@@ -7052,7 +7257,6 @@ See Also
 o )help Expression
 o )help Kernel
 o )show BasicOperator
-o $AXIOM/doc/src/algebra/op.spad.dvi
 
 @
 \pagehead{BasicOperator}{BOP}
@@ -7237,6 +7441,11 @@ BasicOperator(): Exports == Implementation where
       false
 
 @
+<<BOP.dotabb>>=
+"BOP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=BOP"]
+"BOP" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain BINARY BinaryExpansion}
 <<BinaryExpansion.input>>=
@@ -7398,7 +7607,6 @@ See Also:
 o )help DecimalExpansion
 o )help HexadecimalExpansion
 o )show BinaryExpansion
-o $AXIOM/doc/src/algebra/radix.spad.dvi
 
 @
 \pagehead{BinaryExpansion}{BINARY}
@@ -7441,6 +7649,11 @@ BinaryExpansion(): Exports == Implementation where
     coerce(x:%): RadixExpansion(2) == x pretend RadixExpansion(2)
 
 @
+<<BINARY.dotabb>>=
+"BINARY" [color="#88FF44",href="bookvol10.3.pdf#nameddest=BINARY"]
+"BINARY" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain BINFILE BinaryFile}
 \pagehead{BinaryFile}{BINFILE}
@@ -7555,6 +7768,11 @@ BinaryFile: Cat == Def where
            (FILE_-POSITION(f.fileState,i)$Lisp ; i) 
 
 @
+<<BINFILE.dotabb>>=
+"BINFILE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=BINFILE"]
+"BINFILE" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain BSTREE BinarySearchTree}
 <<BinarySearchTree.input>>=
@@ -7758,7 +7976,6 @@ Have Axiom check that these are equal.
 
 See Also:
 o )show BinarySearchTree
-o $AXIOM/doc/src/algebra/tree.spad.dvi
 
 @
 \pagehead{BinarySearchTree}{BSTREE}
@@ -7831,6 +8048,11 @@ BinarySearchTree(S: OrderedSet): Exports == Implementation where
       node(a.less, x, a.greater)
 
 @
+<<BSTREE.dotabb>>=
+"BSTREE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=BSTREE"]
+"BSTREE" -> "BTCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain BTOURN BinaryTournament}
 A BinaryTournament(S) is the domain of binary trees where elements are
@@ -7880,6 +8102,11 @@ BinaryTournament(S: OrderedSet): Exports == Implementation where
       t
 
 @
+<<BTOURN.dotabb>>=
+"BTOURN" [color="#88FF44",href="bookvol10.3.pdf#nameddest=BTOURN"]
+"BTOURN" -> "BTCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain BTREE BinaryTree}
 \pagehead{BinaryTree}{BTREE}
@@ -7944,12 +8171,13 @@ BinaryTree(S: SetCategory): Exports == Implementation where
        setrest_!(t1:List Tree S,t2)
 
 @
+<<BTREE.dotabb>>=
+"BTREE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=BTREE"]
+"BTREE" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain BITS Bits}
-<<dot>>=
-"BITS" -> "BTAGG"
-"Bits()" -> "BitAggregate()"
-@
 \pagehead{Bits}{BITS}
 \pagepic{ps/v103bits.ps}{BITS}{1.00}
 See also:\\
@@ -7974,18 +8202,13 @@ Bits(): Exports == Implementation where
     bits(n,b)    == new(n,b)
 
 @
+<<BITS.dotabb>>=
+"BITS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=BITS"]
+"BITS" -> "BTAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain BOOLEAN Boolean}
-<<dot>>=
-"BOOLEAN" -> "ORDSET"
-"Boolean()" -> "OrderedSet()"
-"BOOLEAN" -> "FINITE"
-"Boolean()" -> "Finite()"
-"BOOLEAN" -> "LOGIC"
-"Boolean()" -> "Logic()"
-"BOOLEAN" -> "KONVERT"
-"Boolean()" -> "ConvertibleTo(InputForm)"
-@
 \pagehead{Boolean}{BOOLEAN}
 \pagepic{ps/v103boolean.ps}{BOOLEAN}{1.00}
 See also:\\
@@ -8073,6 +8296,12 @@ Boolean(): Join(OrderedSet, Finite, Logic, ConvertibleTo InputForm) with
       message "false"
 
 @
+<<BOOLEAN.dotabb>>=
+"BOOLEAN" [color="#88FF44",href="bookvol10.3.pdf#nameddest=BOOLEAN",
+           shape=ellipse]
+"BOOLEAN" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter C}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -8392,19 +8621,8 @@ continuum hypothesis in this way.
 
 See Also:
 o )show CardinalNumber
-o $AXIOM/doc/src/algebra/card.spad.dvi
 
 @
-<<dot>>=
-"CARD" -> "ORDSET"
-"CardinalNumber()" -> "OrderedSet()"
-"CARD" -> "ABELMON"
-"CardinalNumber()" -> "AbelianMonoid()"
-"CARD" -> "MONOID"
-"CardinalNumber()" -> "Monoid()" 
-"CARD" -> "RETRACT"
-"CardinalNumber()" -> "RetractableTo(NonNegativeInteger)"
-@
 \pagehead{CardinalNumber}{CARD}
 \pagepic{ps/v103cardinalnumber.ps}{CARD}{1.00}
 <<domain CARD CardinalNumber>>=
@@ -8592,6 +8810,11 @@ CardinalNumber: Join(OrderedSet, AbelianMonoid, Monoid,
         generalizedContinuumHypothesisAssumed b == (GCHypothesis() := b)
 
 @
+<<CARD.dotabb>>=
+"CARD" [color="#88FF44",href="bookvol10.3.pdf#nameddest=CARD"]
+"CARD" -> "ALGEBRA-"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain CARTEN CartesianTensor}
 <<CartesianTensor.input>>=
@@ -9539,17 +9762,8 @@ interpretation.
 
 See Also
 o )show CartesianTensor
-o $AXIOM/doc/src/algebra/carten.spad.dvi
 
 @
-<<dot>>=
-"CARTEN" -> "GRALG"
-"CartesianTensor(a:Integer,b:NonNegativeInteger,c:CommutativeRing)" ->
-    "GradedAlgebra(a:CommutativeRing,b:NonNegativeInteger)"
-"CARTEN" -> "GRMOD"
-"CartesianTensor(a:Integer,b:NonNegativeInteger,c:CommutativeRing)" ->
-    "GradedModule(a:Integer,b:NonNegativeInteger)"
-@
 \pagehead{CartesianTensor}{CARTEN}
 \pagepic{ps/v103cartesiantensor.ps}{CARTEN}{1.00}
 <<domain CARTEN CartesianTensor>>=
@@ -10158,6 +10372,11 @@ CartesianTensor(minix, dim, R): Exports == Implementation where
             z
 
 @
+<<CARTEN.dotabb>>=
+"CARTEN" [color="#88FF44",href="bookvol10.3.pdf#nameddest=CARTEN"]
+"CARTEN" -> "IVECTOR"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain CHAR Character}
 <<Character.input>>=
@@ -10359,7 +10578,6 @@ See Also:
 o )help CharacterClass
 o )help String
 o )show Character
-o $AXIOM/doc/src/algebra/string.spad.dvi
 
 @
 \pagehead{Character}{CHAR}
@@ -10510,6 +10728,12 @@ Character: OrderedFinite() with
     QENUM(PNAME(DOWNCASE(NUM2CHAR(ord c)$Lisp)$Lisp)$Lisp,0$Lisp)$Lisp
 
 @
+<<CHAR.dotabb>>=
+"CHAR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=CHAR",
+        shape=ellipse]
+"CHAR" -> "FSAGG" 
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain CCLASS CharacterClass}
 <<CharacterClass.input>>=
@@ -10736,7 +10960,6 @@ See Also:
 o )help Character
 o )help String
 o )show CharacterClass
-o $AXIOM/doc/src/algebra/string.spad.dvi
 
 @
 \pagehead{CharacterClass}{CCLASS}
@@ -10860,6 +11083,11 @@ CharacterClass: Join(SetCategory, ConvertibleTo String,
 	    [char i for i in 0..N-1 | a.i]
 
 @
+<<CCLASS.dotabb>>=
+"CCLASS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=CCLASS"]
+"CCLASS" -> "FSAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain CLIF CliffordAlgebra\cite{7,12}}
 \subsection{Vector (linear) spaces}
@@ -11662,17 +11890,6 @@ o )show CliffordAlgebra
 o $AXIOM/doc/src/algebra/clifford.spad
 
 @
-<<dot>>=
-"CLIF" -> "RING"
-"CliffordAlgebra(a:PositiveInteger,b:Field,c:QuadraticForm(a,b))" ->
-    "Ring()"
-"CLIF" -> "ALGEBRA"
-"CliffordAlgebra(a:PositiveInteger,b:Field,c:QuadraticForm(a,b))" ->
-    "Algebra(a:Field)"
-"CLIF" -> "VSPACE"
-"CliffordAlgebra(a:PositiveInteger,b:Field,c:QuadraticForm(a,b))" ->
-    "VectorSpace(a:Field)"
-@
 \pagehead{CliffordAlgebra}{CLIF}
 \pagepic{ps/v103cliffordalgebra.ps}{CLIF}{1.00}
 See also:\\
@@ -11883,10 +12100,6 @@ CliffordAlgebra(n, K, Q): T == Impl where
 @
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain COLOR Color}
-<<dot>>=
-"COLOR" -> "ABELSG"
-"Color()" -> "AbelianSemiGroup()"
-@
 \pagehead{Color}{COLOR}
 \pagepic{ps/v103color.ps}{COLOR}{1.00}
 See also:\\
@@ -11983,6 +12196,11 @@ Color(): Exports == Implementation where
                "  Weight: "::OutputForm, (c.weight)::OutputForm]
 
 @
+<<COLOR.dotabb>>=
+"COLOR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=COLOR"]
+"COLOR" -> "BASTYPE/KOERCE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain COMM Commutator}
 \pagehead{Commutator}{COMM}
@@ -12030,6 +12248,11 @@ Commutator: Export == Implement where
         bracket([xx.left::O,xx.right::O])$O
 
 @
+<<COMM.dotabb>>=
+"COMM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=COMM"]
+"COMM" -> "BASTYPE/KOERCE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain COMPLEX Complex}
 <<Complex.input>>=
@@ -12309,7 +12532,6 @@ You can factor Gaussian integers.
 
 See Also
 o )show Complex
-o $AXIOM/doc/src/algebra/gaussian.spad.dvi 
 
 @
 \pagehead{Complex}{COMPLEX}
@@ -12400,6 +12622,11 @@ Complex(R:CommutativeRing): ComplexCategory(R) with
            x * conjugate(y) exquo norm(y)
 
 @
+<<COMPLEX.dotabb>>=
+"COMPLEX" [color="#88FF44",href="bookvol10.3.pdf#nameddest=COMPLEX"]
+"COMPLEX" -> "COMPCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain CONTFRAC ContinuedFraction}
 <<ContinuedFraction.input>>=
@@ -12943,17 +13170,8 @@ is the expansion of sqrt(11).
 See Also:
 o )help Stream
 o )show ContinuedFraction
-o $AXIOM/doc/src/algebra/contrac.spad.dvi
 
 @
-<<dot>>=
-"CONTFRAC" -> "ALGEBRA"
-"ContinuedFraction(a:EuclideanDomain)" -> "Algebra(a:EuclideanDomain)"
-"ContinuedFraction(a:EuclideanDomain)" ->
-    "Algebra(a:Fraction(EuclideanDomain))"
-"CONTFRAC" -> "FIELD"
-"ContinuedFraction(a:EuclideanDomain)" -> "Field()"
-@
 \pagehead{ContinuedFraction}{CONTFRAC}
 \pagepic{ps/v103continuedfraction.ps}{CONTFRAC}{1.00}
 <<domain CONTFRAC ContinuedFraction>>=
@@ -13281,14 +13499,15 @@ ContinuedFraction(R): Exports == Implementation where
       (wh :: OUT) + e
 
 @
+<<CONTFRAC.dotabb>>=
+"CONTFRAC" [color="#88FF44",href="bookvol10.3.pdf#nameddest=CONTFRAC"]
+"CONTFRAC" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter D}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain DBASE Database}
-<<dot>>=
-"DBASE" -> "SETCAT"
-"Database(a:OrderedSet)" -> "SetCategory()"
-@
 \pagehead{Database}{DBASE}
 \pagepic{ps/v103database.ps}{DBASE}{1.00}
 See also:\\
@@ -13344,12 +13563,13 @@ Database(S): Exports == Implementation where
       if i >= n then fullDisplay x
 
 @
+<<DBASE.dotabb>>=
+"DBASE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=DBASE"]
+"DBASE" -> "STRICAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain DLIST DataList}
-<<dot>>=
-"DLIST" -> "LSAGG"
-"DataList(a:OrderedSet)" -> "ListAggregate(a:Type)"
-@
 \pagehead{DataList}{DLIST}
 \pagepic{ps/v103datalist.ps}{DLIST}{1.00}
 See also:\\
@@ -13385,6 +13605,11 @@ DataList(S:OrderedSet) : Exports == Implementation where
     datalist(x:List S) == x::%
 
 @
+<<DLIST.dotabb>>=
+"DLIST" [color="#88FF44",href="bookvol10.3.pdf#nameddest=DLIST"]
+"DLIST" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain DECIMAL DecimalExpansion}
 <<DecimalExpansion.input>>=
@@ -13535,7 +13760,6 @@ o )help RadixExpansion
 o )help BinaryExpansion
 o )help HexadecimalExpansion
 o )show DecimalExpansion
-o $AXIOM/doc/src/algebra/radix.spad.dvi
 
 @
 \pagehead{DecimalExpansion}{DECIMAL}
@@ -13576,6 +13800,11 @@ DecimalExpansion(): Exports == Implementation where
     coerce(x:%): RadixExpansion(10) == x pretend RadixExpansion(10)
 
 @
+<<DECIMAL.dotabb>>=
+"DECIMAL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=DECIMAL"]
+"DECIMAL" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{Denavit-Hartenberg Matrices}
 \subsection{Homogeneous Transformations}
@@ -15258,12 +15487,13 @@ DenavitHartenbergMatrix(R): Exports == Implementation where
 <<translate>>
  
 @
+<<DHMATRIX.dotabb>>=
+"DHMATRIX" [color="#88FF44",href="bookvol10.3.pdf#nameddest=DHMATRIX"]
+"DHMATRIX" -> "IVECTOR"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain DEQUEUE Dequeue}
-<<dot>>=
-"DEQUEUE" -> "DQAGG"
-"Dequeue(a:SetCategory)" -> "DequeueAggregate(a:SetCategory)"
-@
 \pagehead{Dequeue}{DEQUEUE}
 \pagepic{ps/v103dequeue.ps}{DEQUEUE}{1.00}
 See also:\\
@@ -15327,6 +15557,12 @@ Dequeue(S:SetCategory): DequeueAggregate S with
     reverse_! d == (setref(d,reverse deref d); d)
 
 @
+<<DEQUEUE.dotabb>>=
+"DEQUEUE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=DEQUEUE"]
+"DEQUEUE" -> "FLAGG-"
+"DEQUEUE" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain DERHAM DeRhamComplex}
 <<DeRhamComplex.input>>=
@@ -15904,7 +16140,6 @@ consists of the eight forms: 1, dx, dy, dz, dx*dy, dx*dz, dy*dz, and dx*dy*dz.
 See Also:
 o )help Operator
 o )show DeRhamComplex
-o $AXIOM/doc/src/algebra/derham.spad.dvi
 
 @
 \pagehead{DeRhamComplex}{DERHAM}
@@ -16025,6 +16260,11 @@ DeRhamComplex(CoefRing,listIndVar:List Symbol): Export == Implement where
         reduce(_+,[makeTerm(t.c,t.k) for t in ta])$L(O)
 
 @
+<<DERHAM.dotabb>>=
+"DERHAM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=DERHAM"]
+"DERHAM" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain DSMP DifferentialSparseMultivariatePolynomial}
 \pagehead{DifferentialSparseMultivariatePolynomial}{DSMP}
@@ -16080,6 +16320,11 @@ DifferentialSparseMultivariatePolynomial(R, S, V):
       map(#1::V::$, #1::$, p)$PCL(IndexedExponents S, S, R, SMP, $)
 
 @
+<<DSMP.dotabb>>=
+"DSMP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=DSMP"]
+"DSMP" -> "DPOLCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain DIRPROD DirectProduct}
 \pagehead{DirectProduct}{DIRPROD}
@@ -16185,6 +16430,11 @@ DirectProduct(dim:NonNegativeInteger, R:Type):
 --)bo $noSubsumption := false
 
 @
+<<DIRPROD.dotabb>>=
+"DIRPROD" [color="#88FF44",href="bookvol10.3.pdf#nameddest=DIRPROD"]
+"DIRPROD" -> "DIRPCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain DPMM DirectProductMatrixModule}
 \pagehead{DirectProductMatrixModule}{DPMM}
@@ -16224,6 +16474,11 @@ DirectProductMatrixModule(n, R, M, S): DPcategory == DPcapsule where
         m:M * x:$ == [ +/[m(i,j)*x.j for j in 1..n] for i in 1..n]
 
 @
+<<DPMM.dotabb>>=
+"DPMM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=DPMM"]
+"DPMM" -> "SMATCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain DPMO DirectProductModule}
 \pagehead{DirectProductModule}{DPMO}
@@ -16262,6 +16517,11 @@ DirectProductModule(n, R, S): DPcategory == DPcapsule where
         r:R * x:$ == [r * x.i for i in 1..n]
 
 @
+<<DPMO.dotabb>>=
+"DPMO" [color="#88FF44",href="bookvol10.3.pdf#nameddest=DPMO"]
+"DPMO" -> "DIRPCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain DMP DistributedMultivariatePolynomial}
 <<DistributedMultivariatePolynomial.input>>=
@@ -16471,7 +16731,6 @@ o )help MultivariatePolynomial
 o )help HomogeneousDistributedMultivariatePolynomial
 o )help GeneralDistributedMultivariatePolynomial
 o )show DistributedMultivariatePolynomial
-o $AXIOM/doc/src/algebra/gdpoly.spad.dvi
 
 @
 \pagehead{DistributedMultivariatePolynomial}{DMP}
@@ -16513,6 +16772,12 @@ DistributedMultivariatePolynomial(vl,R): public == private where
     GeneralDistributedMultivariatePolynomial(vl,R,E)
 
 @
+<<DMP.dotabb>>=
+"DMP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=DMP"]
+"DMP" -> "PFECAT"
+"DMP" -> "DIRPCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain DFLOAT DoubleFloat}
 Greg Vanuxem has added some functionality to allow the user to modify
@@ -16831,22 +17096,7 @@ graphed.
 See Also:
 0 )help Float
 o )show DoubleFloat
-o $AXIOM/doc/src/algebra/sf.spad.dvi
-
-@
-<<dot>>=
-"DFLOAT" -> "FPS"
-"DoubleFloat()" -> "FloatingPointSystem()"
-"DFLOAT" -> "DIFRING"
-"DoubleFloat()" -> "DifferentialRing()"
-"DFLOAT" -> "OM"
-"DoubleFloat()" -> "OpenMath()"
-"DFLOAT" -> "TRANFUN"
-"DoubleFloat()" -> "TranscendentalFunctionCategory()"
-"DFLOAT" -> "SPFCAT"
-"DoubleFloat()" -> "SpecialFunctionCategory()"
-"DFLOAT" -> "KONVERT"
-"DoubleFloat()" -> "ConvertibleTo(InputForm)"
+
 @
 \pagehead{DoubleFloat}{DFLOAT}
 \pagepic{ps/v103doublefloat.ps}{DFLOAT}{1.00}
@@ -17171,6 +17421,12 @@ DoubleFloat(): Join(FloatingPointSystem, DifferentialRing, OpenMath,
       x ** (n::% / d::%)
 
 @
+<<DFLOAT.dotabb>>=
+"DFLOAT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=DFLOAT",
+          shape=ellipse]
+"DFLOAT" -> "FRAC"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain DROPT DrawOption}
 \pagehead{DrawOption}{DROPT}
@@ -17387,6 +17643,11 @@ DrawOption(): Exports == Implementation where
     "failed"
 
 @
+<<DROPT.dotabb>>=
+"DROPT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=DROPT"]
+"DROPT" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D01AJFA d01ajfAnnaType}
 \pagehead{d01ajfAnnaType}{D01AJFA}
@@ -17446,6 +17707,11 @@ d01ajfAnnaType(): NumericalIntegrationCategory == Result add
            args.relerr,4*iw,iw,-1,f)
 
 @
+<<D01AJFA.dotabb>>=
+"D01AJFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D01AJFA"]
+"D01AJFA" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D01AKFA d01akfAnnaType}
 \pagehead{d01akfAnnaType}{D01AKFA}
@@ -17510,6 +17776,11 @@ d01akfAnnaType(): NumericalIntegrationCategory == Result add
            args.relerr,4*iw,iw,-1,f)
 
 @
+<<D01AKFA.dotabb>>=
+"D01AKFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D01AKFA"]
+"D01AKFA" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D01ALFA d01alfAnnaType}
 \pagehead{d01alfAnnaType}{D01ALFA}
@@ -17586,6 +17857,11 @@ d01alfAnnaType(): NumericalIntegrationCategory == Result add
            args.abserr,args.relerr,2*n*iw,n*iw,-1,f)
 
 @
+<<D01ALFA.dotabb>>=
+"D01ALFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D01ALFA"]
+"D01ALFA" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D01AMFA d01amfAnnaType}
 \pagehead{d01amfAnnaType}{D01AMFA}
@@ -17658,6 +17934,11 @@ d01amfAnnaType(): NumericalIntegrationCategory == Result add
     d01amf(bound,r,args.abserr,args.relerr,4*iw,iw,-1,f)
 
 @
+<<D01AMFA.dotabb>>=
+"D01AMFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D01AMFA"]
+"D01AMFA" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D01ANFA d01anfAnnaType}
 \pagehead{d01anfAnnaType}{D01ANFA}
@@ -17732,6 +18013,11 @@ d01anfAnnaType(): NumericalIntegrationCategory == Result add
            args.abserr,args.relerr,4*iw,iw,-1,f)
 
 @
+<<D01ANFA.dotabb>>=
+"D01ANFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D01ANFA"]
+"D01ANFA" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D01APFA d01apfAnnaType}
 \pagehead{d01apfAnnaType}{D01APFA}
@@ -17819,6 +18105,13 @@ d01apfAnnaType(): NumericalIntegrationCategory == Result add
            args.abserr,args.relerr,4*iw,iw,-1,f)
 
 @
+<<D01APFA.dotabb>>=
+"D01APFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D01APFA"]
+/*"D01APFA" -> {"NUMINT"; "SETCAT"; "BASTYPE"; "KOERCE"; "DFLOAT"; "INT"}*/
+/*"D01APFA" -> {"LIST"; "ILIST"; "LSAGG-"; "STAGG-"; "PI"; "NNI"}*/
+"D01APFA" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D01AQFA d01aqfAnnaType}
 \pagehead{d01aqfAnnaType}{D01AQFA}
@@ -17900,6 +18193,12 @@ d01aqfAnnaType(): NumericalIntegrationCategory == Result add
            Args.abserr,Args.relerr,4*iw,iw,-1,f)
 
 @
+<<D01AQFA.dotabb>>=
+"D01AQFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D01AQFA"]
+"D01AQFA" -> "STRING"
+"D01AQFA" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D01ASFA d01asfAnnaType}
 \pagehead{d01asfAnnaType}{D01ASFA}
@@ -17980,6 +18279,11 @@ d01asfAnnaType(): NumericalIntegrationCategory == Result add
     d01asf(getlo(args.range),rec.w,i,err,50,4*iw,2*iw,-1,f)
 
 @
+<<D01ASFA.dotabb>>=
+"D01ASFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D01ASFA"]
+"D01ASFA" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D01FCFA d01fcfAnnaType}
 \pagehead{d01fcfAnnaType}{D01FCFA}
@@ -18050,6 +18354,11 @@ d01fcfAnnaType(): NumericalIntegrationCategory == Result add
     changeName(finval@Symbol,result@Symbol,out)
 
 @
+<<D01FCFA.dotabb>>=
+"D01FCFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D01FCFA"]
+"D01FCFA" -> "TRANFUN"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D01GBFA d01gbfAnnaType}
 \pagehead{d01gbfAnnaType}{D01GBFA}
@@ -18122,6 +18431,13 @@ d01gbfAnnaType(): NumericalIntegrationCategory == Result add
     changeName(finest@Symbol,result@Symbol,out)
 
 @
+<<D01GBFA.dotabb>>=
+"D01GBFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D01GBFA"]
+"D01GBFA" -> "FIELD"
+"D01GBFA" -> "RADCAT"
+"D01GBFA" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D01TRNS d01TransformFunctionType}
 \pagehead{d01TransformFunctionType}{D01TRNS}
@@ -18283,6 +18599,11 @@ d01TransformFunctionType():NumericalIntegrationCategory == Result add
     insert!(recAbserr,insert!(recResult,ans))$Result
 
 @
+<<D01TRNS.dotabb>>=
+"D01TRNS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D01TRNS"]
+"D01TRNS" -> "FS" 
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D02BBFA d02bbfAnnaType}
 \pagehead{d02bbfAnnaType}{D02BBFA}
@@ -18379,6 +18700,11 @@ d02bbfAnnaType():OrdinaryDifferentialEquationsSolverCategory == Result add
              tol,-1,asp7,asp8)
 
 @
+<<D02BBFA.dotabb>>=
+"D02BBFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D02BBFA"]
+"D02BBFA" -> "IVECTOR"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D02BHFA d02bhfAnnaType}
 \pagehead{d02bhfAnnaType}{D02BHFA}
@@ -18471,6 +18797,11 @@ d02bhfAnnaType():OrdinaryDifferentialEquationsSolverCategory == Result add
              tol,-1,asp9,asp7)
 
 @
+<<D02BHFA.dotabb>>=
+"D02BHFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D02BHFA"]
+"D02BHFA" -> "IVECTOR"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D02CJFA d02cjfAnnaType}
 \pagehead{d02cjfAnnaType}{D02CJFA}
@@ -18556,6 +18887,11 @@ d02cjfAnnaType():OrdinaryDifferentialEquationsSolverCategory == Result add
              -1,asp9,asp7,asp8)
 
 @
+<<D02CJFA.dotabb>>=
+"D02CJFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D02CJFA"]
+"D02CJFA" -> "IVECTOR"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D02EJFA d02ejfAnnaType}
 \pagehead{d02ejfAnnaType}{D02EJFA}
@@ -18666,6 +19002,14 @@ d02ejfAnnaType():OrdinaryDifferentialEquationsSolverCategory == Result add
              tol,-1,asp9,asp7,asp31,asp8)
 
 @
+<<D02EJFA.dotabb>>=
+"D02EJFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D02EJFA"]
+"D02EJFA" -> "FLAGG"
+"D02EJFA" -> "FIELD-"
+"D02EJFA" -> "FIELD"
+"D02EJFA" -> "RADCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D03EEFA d03eefAnnaType}
 \pagehead{d03eefAnnaType}{D03EEFA}
@@ -18741,6 +19085,11 @@ d03eefAnnaType():PartialDifferentialEquationsSolverCategory == Result add
     d03edf(nx,ny,lda,15,args.tol,0,fdea,fderhs,ub,-1)
 
 @
+<<D03EEFA.dotabb>>=
+"D03EEFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D03EEFA"]
+"D03EEFA" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain D03FAFA d03fafAnnaType}
 \pagehead{d03fafAnnaType}{D03FAFA}
@@ -18783,6 +19132,11 @@ d03fafAnnaType():PartialDifferentialEquationsSolverCategory == Result add
     [0$F,"d03faf isn't finished"]
 
 @
+<<D03FAFAs.dotabb>>=
+"D03FAFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=D03FAFA"]
+"D03FAFA" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter E}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -18974,7 +19328,6 @@ do is ask!
 
 See Also:
 o )show Equation
-o $AXIOM/doc/src/algebra/equation2.spad.dvi
 
 @
 \pagehead{Equation}{EQ}
@@ -19192,6 +19545,11 @@ Equation(S: Type): public == private where
             [subst(lhs eq1,eq3),subst(rhs eq1,eq3)]
 
 @
+<<EQ.dotabb>>=
+"EQ" [color="#88FF44",href="bookvol10.3.pdf#nameddest=EQ"]
+"EQ" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain EQTBL EqTable}
 <<EqTable.input>>=
@@ -19294,7 +19652,6 @@ each.
 See Also:
 o )help Table
 o )show EqTable
-o $AXIOM/doc/src/algebra/table.spad.dvi
 
 @
 \pagehead{EqTable}{EQTBL}
@@ -19326,6 +19683,11 @@ EqTable(Key: SetCategory, Entry: SetCategory) ==
       HashTable(Key, Entry, "EQ")
 
 @
+<<EQTBL.dotabb>>=
+"EQTBL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=EQTBL"]
+"EQTBL" -> "TBAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain EMR EuclideanModularRing}
 \pagehead{EuclideanModularRing}{EMR}
@@ -19437,6 +19799,11 @@ EuclideanModularRing(S,R,Mod,reduction:(R,Mod) -> R,
       elt(x : %,s : R) : R == reduction(elt(x.val,s),x.modulo)
 
 @
+<<EMR.dotabb>>=
+"EMR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=EMR"]
+"EMR" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain EXIT Exit}
 <<Exit.input>>=
@@ -19537,7 +19904,6 @@ resolved to be Integer.
 
 See Also:
 o )show Exit
-o $AXIOM/doc/src/algebra/void.spad.dvi
 
 @
 \pagehead{Exit}{EXIT}
@@ -19566,6 +19932,12 @@ Exit: SetCategory == add
         n1 = n2     == error "Cannot use an Exit value."
 
 @
+<<EXIT.dotabb>>=
+"EXIT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=EXIT"]
+"EXIT" -> "BASTYPE"
+"EXIT" -> "KOERCE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain EXPEXPAN ExponentialExpansion}
 \pagehead{ExponentialExpansion}{EXPEXPAN}
@@ -19719,6 +20091,12 @@ ExponentialExpansion(R,FE,var,cen): Exports == Implementation where
       seriesQuotientInfinity(numCoef,denCoef)
 
 @
+<<EXPEXPAN.dotabb>>=
+"EXPEXPAN" [color="#88FF44",href="bookvol10.3.pdf#nameddest=EXPEXPAN"]
+"EXPEXPAN" -> "ACF"
+"EXPEXPAN" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain EXPR Expression}
 <<Expression.input>>=
@@ -20093,7 +20471,6 @@ simplify.
 See Also:
 o )show Kernel
 o )show Expression
-o $AXIOM/doc/src/algebra/void.spad.dvi
 
 @
 \pagehead{Expression}{EXPR}
@@ -20620,6 +20997,11 @@ Expression(R:OrderedSet): Exports == Implementation where
 --              patternMatch(x pretend K, p, l)$PatternMatchKernel(Float, %)
 
 @
+<<EXPR.dotabb>>=
+"EXPR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=EXPR"]
+"EXPR" -> "ACFS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain EXPUPXS ExponentialOfUnivariatePuiseuxSeries}
 \pagehead{ExponentialOfUnivariatePuiseuxSeries}{EXPUPXS}
@@ -20698,6 +21080,11 @@ ExponentialOfUnivariatePuiseuxSeries(FE,var,cen):_
       ("%e" :: OutputForm) ** ((coerce$Rep)(complete f)@OutputForm)
 
 @
+<<EXPUPXS.dotabb>>=
+"EXPUPXS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=EXPUPXS"]
+"EXPUPXS" -> "UPXSCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain EAB ExtAlgBasis}
 \pagehead{ExtAlgBasis}{EAB}
@@ -20786,6 +21173,11 @@ ExtAlgBasis(): Export == Implement where
      coerce x         == coerce(x @ Rep)$(L I)
 
 @
+<<EAB.dotabb>>=
+"EAB" [color="#88FF44",href="bookvol10.3.pdf#nameddest=EAB"]
+"EAB" -> "PID/OAGROUP"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain E04DGFA e04dgfAnnaType}
 \pagehead{e04dgfAnnaType}{E04DGFA}
@@ -20867,6 +21259,11 @@ e04dgfAnnaType(): NumericalOptimizationCategory == Result add
     e04dgf(n,1$DF,fu,it,lin,true,ma,op,1,1,n,0,x,-1,f)
 
 @
+<<E04DGFA.dotabb>>=
+"E04DGFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=E04DGFA"]
+"E04DGFA" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain E04FDFA e04fdfAnnaType}
 \pagehead{e04fdfAnnaType}{E04FDFA}
@@ -20973,6 +21370,11 @@ e04fdfAnnaType(): NumericalOptimizationCategory == Result add
     changeNameToObjf(fsumsq@Symbol,out)
 
 @
+<<E04FDFA.dotabb>>=
+"E04FDFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=E04FDFA"]
+"E04FDFA" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain E04GCFA e04gcfAnnaType}
 \pagehead{e04gcfAnnaType}{E04GCFA}
@@ -21095,6 +21497,11 @@ e04gcfAnnaType(): NumericalOptimizationCategory == Result add
     changeNameToObjf(fsumsq@Symbol,out)
 
 @
+<<E04GCFA.dotabb>>=
+"E04GCFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=E04GCFA"]
+"E04GCFA" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain E04JAFA e04jafAnnaType}
 \pagehead{e04jafAnnaType}{E04JAFA}
@@ -21192,6 +21599,11 @@ e04jafAnnaType(): NumericalOptimizationCategory == Result add
     changeNameToObjf(f@Symbol,out)
 
 @
+<<E04JAFA.dotabb>>=
+"E04JAFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=E04JAFA"]
+"E04JAFA" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain E04MBFA e04mbfAnnaType}
 \pagehead{e04mbfAnnaType}{E04MBFA}
@@ -21275,6 +21687,11 @@ e04mbfAnnaType(): NumericalOptimizationCategory == Result add
     changeNameToObjf(objlp@Symbol,out)
 
 @
+<<E04MBFA.dotabb>>=
+"E04MBFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=E04MBFA"]
+"E04MBFA" -> "TRANFUN"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain E04NAFA e04nafAnnaType}
 \pagehead{e04nafAnnaType}{E04NAFA}
@@ -21373,6 +21790,11 @@ e04nafAnnaType(): NumericalOptimizationCategory == Result add
     changeNameToObjf(obj@Symbol,out)
 
 @
+<<E04NAFA.dotabb>>=
+"E04NAFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=E04NAFA"]
+"E04NAFA" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain E04UCFA e04ucfAnnaType}
 \pagehead{e04ucfAnnaType}{E04UCFA}
@@ -21487,6 +21909,11 @@ e04ucfAnnaType(): NumericalOptimizationCategory == Result add
              1,n,n,3,istate,cjac,clambda,r,x,-1,casp,fasp)
 
 @
+<<E04UCFA.dotabb>>=
+"E04UCFA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=E04UCFA"]
+"E04UCFA" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter F}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -22106,7 +22533,6 @@ You can differentiate with respect to a variable.
 See Also:
 o )help FactoredFunctions2
 o )show Factored
-o $AXIOM/doc/src/algebra/fr.spad.dvi
 
 @
 \pagehead{Factored}{FR}
@@ -22661,6 +23087,11 @@ Factored(R: IntegralDomain): Exports == Implementation where
                        ((l.first.xpnt) = 1) and (l.first.flg case "prime")
 
 @
+<<FR.dotabb>>=
+"FR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FR"]
+"FR" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FILE File}
 <<File.input>>=
@@ -22857,7 +23288,6 @@ o )help KeyedAccessFile
 o )help Library
 o )help Filename
 o )show File
-o $AXIOM/doc/src/algebra/files.spad.dvi
 
 @
 \pagehead{File}{FILE}
@@ -22949,6 +23379,11 @@ File(S:SetCategory): FileCategory(FileName, S) with
             x
 
 @
+<<FILE.dotabb>>=
+"FILE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FILE"]
+"FILE" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FNAME FileName}
 <<FileName.input>>=
@@ -23227,7 +23662,6 @@ extension, and the same defaults are used.
 
 See Also:
 o )show FileName
-o $AXIOM/doc/src/algebra/fname.spad.dvi
 
 @
 \pagehead{FileName}{FNAME}
@@ -23268,6 +23702,11 @@ FileName(): FileNameCategory == add
         new(d,pref,e)            == fnameNew(d,pref,e)$Lisp
 
 @
+<<FNAME.dotabb>>=
+"FNAME" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FNAME"]
+"FNAME" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FDIV FiniteDivisor}
 \pagehead{FiniteDivisor}{FDIV}
@@ -23405,6 +23844,11 @@ FiniteDivisor(F, UP, UPUP, R): Exports == Implementation where
         divisor ideal [b::RF::R, h]$Vector(R)
 
 @
+<<FDIV.dotabb>>=
+"FDIV" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FDIV"]
+"FDIV" -> "FDIVCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FF FiniteField}
 \pagehead{FiniteField}{FF}
@@ -23442,6 +23886,11 @@ FiniteField(p:PositiveInteger, n:PositiveInteger): _
   -- generateIrredPoly(n)$IrredPolyOverFiniteField(GF))
 
 @
+<<FF.dotabb>>=
+"FF" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FF"]
+"FF" -> "FAXF"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FFCG FiniteFieldCyclicGroup}
 \pagehead{FiniteFieldCyclicGroup}{FFCG}
@@ -23489,6 +23938,11 @@ FiniteFieldCyclicGroup(p,extdeg):_
                           createPrimitivePoly(extdeg)$FFPOLY)
 
 @
+<<FFCG.dotabb>>=
+"FFCG" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FFCG"]
+"FFCG" -> "FAXF"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FFCGX FiniteFieldCyclicGroupExtension}
 \pagehead{FiniteFieldCyclicGroupExtension}{FFCGX}
@@ -23539,6 +23993,11 @@ FiniteFieldCyclicGroupExtension(GF,extdeg):_
                           createPrimitivePoly(extdeg)$FFPOLY)
 
 @
+<<FFCGX.dotabb>>=
+"FFCGX" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FFCGX"]
+"FFCGX" -> "FAXF"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FFCGP FiniteFieldCyclicGroupExtensionByPolynomial}
 \pagehead{FiniteFieldCyclicGroupExtensionByPolynomial}{FFCGP}
@@ -23855,6 +24314,11 @@ FiniteFieldCyclicGroupExtensionByPolynomial(GF,defpol):_
       mulmod(m,x,sizeCG::Rep)$Rep
 
 @
+<<FFCGP.dotabb>>=
+"FFCGP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FFCGP"]
+"FFCGP" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FFX FiniteFieldExtension}
 \pagehead{FiniteFieldExtension}{FFX}
@@ -23899,6 +24363,11 @@ FiniteFieldExtension(GF, n): Exports == Implementation where
   -- generateIrredPoly(n)$IrredPolyOverFiniteField(GF))
 
 @
+<<FFX.dotabb>>=
+"FFX" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FFX"]
+"FFX" -> "FAXF"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FFP FiniteFieldExtensionByPolynomial}
 \pagehead{FiniteFieldExtensionByPolynomial}{FFP}
@@ -24140,6 +24609,11 @@ FiniteFieldExtensionByPolynomial(GF:FiniteFieldCategory,_
     characteristic() == characteristic()$GF
 
 @
+<<FFP.dotabb>>=
+"FFP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FFP"]
+"FFP" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FFNB FiniteFieldNormalBasis}
 \pagehead{FiniteFieldNormalBasis}{FFNB}
@@ -24196,6 +24670,11 @@ FiniteFieldNormalBasis(p,extdeg):_
                     createLowComplexityNormalBasis(extdeg)$FFF)
 
 @
+<<FFNB.dotabb>>=
+"FFNB" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FFNB"]
+"FFNB" -> "FAXF"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FFNBX FiniteFieldNormalBasisExtension}
 \pagehead{FiniteFieldNormalBasisExtension}{FFNBX}
@@ -24252,6 +24731,11 @@ FiniteFieldNormalBasisExtension(GF,extdeg):_
                     createLowComplexityNormalBasis(extdeg)$FFF)
 
 @
+<<FFNBX.dotabb>>=
+"FFNBX" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FFNBX"]
+"FFNBX" -> "FAXF"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FFNBP FiniteFieldNormalBasisExtensionByPolynomial}
 \pagehead{FiniteFieldNormalBasisExtensionByPolynomial}{FFNBP}
@@ -24618,6 +25102,11 @@ divisor of the order of the multiplicative group"
     normalElement() == normalElement(extdeg)$INBFF
 
 @
+<<FFNBP.dotabb>>=
+"FFNBP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FFNBP"]
+"FFNBP" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FARRAY FlexibleArray}
 <<FlexibleArray.input>>=
@@ -24883,13 +25372,8 @@ o )help OneDimensionalArray
 o )help Vector
 o )help ExtensibleLinearAggregate
 o )show FlexibleArray
-o $AXIOM/doc/src/algebra/array1.spad.dvi
 
 @
-<<dot>>=
-"FARRAY" -> "IFARRAY"
-"FlexibleArray(a:Type)" -> "IndexedFlexibleArray(a:Type,1)"
-@
 \pagehead{FlexibleArray}{FARRAY}
 \pagepic{ps/v103flexiblearray.ps}{FARRAY}{1.00}
 See also:\\
@@ -24921,6 +25405,11 @@ FlexibleArray(S: Type) == Implementation where
 -- Join(OneDimensionalArrayAggregate S, ExtensibleLinearAggregate S)
 
 @
+<<FARRAY.dotabb>>=
+"FARRAY" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FARRAY"]
+"FARRAY" -> "A1AGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FLOAT Float}
 As reported in bug number 4733 (rounding of negative numbers)
@@ -25758,7 +26247,6 @@ Reset digits to its default value.
 See Also:
 o )help DoubleFloat
 o )show Float
-o $AXIOM/doc/src/algebra/float.spad.dvi 
 
 @
 \pagehead{Float}{FLOAT}
@@ -26744,6 +27232,11 @@ Float():
          (s,t) := (t,r)
 
 @
+<<FLOAT.dotabb>>=
+"FLOAT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FLOAT"]
+"FLOAT" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FC FortranCode}
 \pagehead{FortranCode}{FC}
@@ -27347,6 +27840,12 @@ FortranCode(): public == private where
       [["call"]$OP,[s]$OPREC]$Rep
 
 @
+<<FC.dotabb>>=
+"FC" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FC"]
+"FC" -> "COMPCAT"
+"FC" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FEXPR FortranExpression}
 \pagehead{FortranExpression}{FEXPR}
@@ -27703,6 +28202,11 @@ FortranExpression(basicSymbols,subscriptedSymbols,R):
       res::$
 
 @
+<<FEXPR.dotabb>>=
+"FEXPR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FEXPR"]
+"FEXPR" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FORTRAN FortranProgram}
 \pagehead{FortranProgram}{FORTRAN}
@@ -27939,6 +28443,11 @@ FortranProgram(name,returnType,arguments,symbols): Exports == Implement where
       (subst(rhs u,eList))::$
 
 @
+<<FORTRAN.dotabb>>=
+"FORTRAN" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FORTRAN"]
+"FORTRAN" -> "COMPCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FST FortranScalarType}
 \pagehead{FortranScalarType}{FST}
@@ -28100,6 +28609,11 @@ FortranScalarType() : exports == implementation where
     doubleComplex?(t:$):Boolean == t case DoubleComplexThing
 
 @
+<<FST.dotabb>>=
+"FST" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FST"]
+"FST" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FTEM FortranTemplate}
 \pagehead{FortranTemplate}{FTEM}
@@ -28203,6 +28717,11 @@ FortranTemplate() : specification == implementation where
       string(_$fortranOutputFile$Lisp)::FileName
 
 @
+<<FTEM.dotabb>>=
+"FTEM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FTEM"]
+"FTEM" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FT FortranType}
 \pagehead{FortranType}{FT}
@@ -28317,6 +28836,11 @@ FortranType() : exports == implementation where
     fortranLogical():$ == ("logical"::FST)::$
 
 @
+<<FT.dotabb>>=
+"FT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FT"]
+"FT" -> "PID/OAGROUP"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FCOMP FourierComponent}
 \pagehead{FourierComponent}{FCOMP}
@@ -28365,6 +28889,11 @@ FourierComponent(E:OrderedSet):
      y.SinIfTrue
 
 @
+<<FCOMP.dotabb>>=
+"FCOMP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FCOMP"]
+"FCOMP" -> "ORDSET"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FSERIES FourierSeries}
 \pagehead{FourierSeries}{FSERIES}
@@ -28441,6 +28970,11 @@ FourierSeries(R:Join(CommutativeRing,Algebra(Fraction Integer)),
       [[sin a,r]]
 
 @
+<<FSERIES.dotabb>>=
+"FSERIES" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FSERIES"]
+"FSERIES" -> "PID/OAGROUP"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FRAC Fraction}
 <<Fraction.input>>=
@@ -28694,7 +29228,6 @@ o )help ContinuedFraction
 o )help PartialFraction
 o )help Integer
 o )show Fraction
-o $AXIOM/doc/src/algebra/fraction.spad.dvi
 
 @
 \pagehead{Fraction}{FRAC}
@@ -29029,6 +29562,11 @@ Fraction(S: IntegralDomain): QuotientFieldCategory S with
           makeFR(map(#1::%/den1,unit(ff)),lfact)
 
 @
+<<FRAC.dotabb>>=
+"FRAC" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FRAC"]
+"FRAC" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FRIDEAL FractionalIdeal}
 \pagehead{FractionalIdeal}{FRIDEAL}
@@ -29205,6 +29743,11 @@ FractionalIdeal(R, F, UP, A): Exports == Implementation where
       i
 
 @
+<<FRIDEAL.dotabb>>=
+"FRIDEAL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FRIDEAL"]
+"FRIDEAL" -> "FRAMALG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FRMOD FramedModule}
 \pagehead{FramedModule}{FRMOD}
@@ -29318,6 +29861,11 @@ FramedModule(R, F, UP, A, ibasis): Exports == Implementation where
         module(basis i) * module(ibasis)
 
 @
+<<FRMOD.dotabb>>=
+"FRMOD" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FRMOD"]
+"FRMOD" -> "FRAMALG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FAGROUP FreeAbelianGroup}
 \pagehead{FreeAbelianGroup}{FAGROUP}
@@ -29371,6 +29919,11 @@ FreeAbelianGroup(S:SetCategory): Exports == Implementation where
         (a - lc) < (b - lc)
 
 @
+<<FAGROUP.dotabb>>=
+"FAGROUP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FAGROUP"]
+"FAGROUP" -> "PID/OAGROUP"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FAMONOID FreeAbelianMonoid}
 \pagehead{FreeAbelianMonoid}{FAMONOID}
@@ -29396,6 +29949,11 @@ FreeAbelianMonoid(S: SetCategory):
     == InnerFreeAbelianMonoid(S, NonNegativeInteger, 1)
 
 @
+<<FAMONOID.dotabb>>=
+"FAMONOID" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FAMONOID"]
+"FAMONOID" -> "OAMONS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FGROUP FreeGroup}
 \pagehead{FreeGroup}{FGROUP}
@@ -29467,6 +30025,12 @@ FreeGroup(S: SetCategory): Join(Group, RetractableTo S) with
             makeMulti concat_!(reverse_! r, q)
 
 @
+<<FGROUP.dotabb>>=
+"FGROUP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FGROUP"]
+"FGROUP" -> "FLAGG"
+"FGROUP" -> "FLAGG-"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FM FreeModule}
 \pagehead{FreeModule}{FM}
@@ -29544,6 +30108,11 @@ FreeModule(R:Ring,S:OrderedSet):
          reduce("+",le)
 
 @
+<<FM.dotabb>>=
+"FM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FM"]
+"FM" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FM1 FreeModule1}
 \pagehead{FreeModule1}{FM1}
@@ -29649,6 +30218,11 @@ FreeModule1(R:Ring,S:OrderedSet): FMcat == FMdef where
          0$R
 
 @
+<<FM1.dotabb>>=
+"FM1" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FM1"]
+"FM1" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FMONOID FreeMonoid}
 \pagehead{FreeMonoid}{FMONOID}
@@ -29841,6 +30415,12 @@ FreeMonoid(S: SetCategory): FMcategory == FMdefinition where
             empty? la and not empty? lb
 
 @
+<<FMONOID.dotabb>>=
+"FMONOID" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FMONOID"]
+"FMONOID" -> "FLAGG-"
+"FMONOID" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FNLA FreeNilpotentLie}
 \pagehead{FreeNilpotentLie}{FNLA}
@@ -29965,6 +30545,11 @@ FreeNilpotentLie(n:NNI,class:NNI,R: CommutativeRing): Export == Implement where
        lC(f)::O * Fac(value(lS f))::O + deepExpand(reductum f)
 
 @
+<<FNLA.dotabb>>=
+"FNLA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FNLA"]
+"FNLA" -> "IVECTOR"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FPARFRAC FullPartialFractionExpansion}
 <<FullPartialFractionExpansion.input>>=
@@ -30438,7 +31023,6 @@ Proceedings of ISSAC'93, Kiev, ACM Press.
 See Also:
 o )help PartialFraction
 o )show FullPartialFractionExpansion
-o $AXIOM/doc/src/algebra/fparfrac.spad.dvi
 
 @
 \pagehead{FullPartialFractionExpansion}{FPARFRAC}
@@ -30620,6 +31204,11 @@ FullPartialFractionExpansion(F, UP): Exports == Implementation where
       f ** (n::O)
 
 @
+<<FPARFRAC.dotabb>>=
+"FPARFRAC" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FPARFRAC"]
+"FPARFRAC" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain FUNCTION FunctionCalled}
 \pagehead{FunctionCalled}{FUNCTION}
@@ -30638,6 +31227,11 @@ FunctionCalled(f:Symbol): SetCategory with
    latex(x:%):String      == latex f
 
 @
+<<FUNCTION.dotabb>>=
+"FUNCTION" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FUNCTION"]
+"FUNCTION" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter G}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -30849,7 +31443,6 @@ o )help MultivariatePolynomial
 o )help HomogeneousDistributedMultivariatePolynomial
 o )help DistributedMultivariatePolynomial
 o )show GeneralDistributedMultivariatePolynomial
-o $AXIOM/doc/src/algebra/gdpoly.spad.dvi
 
 @
 \pagehead{GeneralDistributedMultivariatePolynomial}{GDMP}
@@ -31108,6 +31701,11 @@ GeneralDistributedMultivariatePolynomial(vl,R,E): public == private where
         reduce("+",lt)
 
 @
+<<GDMP.dotabb>>=
+"GDMP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=GDMP"]
+"GDMP" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain GMODPOL GeneralModulePolynomial}
 \pagehead{GeneralModulePolynomial}{GMODPOL}
@@ -31184,6 +31782,12 @@ GeneralModulePolynomial(vl, R, IS, E, ff, P): public  ==  private where
                reductum(p) * mp
 
 @
+<<GMODPOL.dotabb>>=
+"GMODPOL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=GMODPOL"]
+"GMODPOL" -> "PFECAT"
+"GMODPOL" -> "DIRPCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain GCNAALG GenericNonAssociativeAlgebra}
 \pagehead{GenericNonAssociativeAlgebra}{GCNAALG}
@@ -31482,6 +32086,11 @@ GenericNonAssociativeAlgebra(R : CommutativeRing, n : PositiveInteger,_
       --le : List Equation PR := [equation(lh,rh) for lh in ls for rh in coefOfa]
 
 @
+<<GCNAALG.dotabb>>=
+"GCNAALG" [color="#88FF44",href="bookvol10.3.pdf#nameddest=GCNAALG"]
+"GCNAALG" -> "FRNAALG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain GPOLSET GeneralPolynomialSet}
 \pagehead{GeneralPolynomialSet}{GPOLSET}
@@ -31566,6 +32175,11 @@ GeneralPolynomialSet(R,E,VarSet,P) : Exports == Implementation where
        construct lp
 
 @
+<<GPOLSET.dotabb>>=
+"GPOLSET" [color="#88FF44",href="bookvol10.3.pdf#nameddest=GPOLSET"]
+"GPOLSET" -> "RPOLCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain GSTBL GeneralSparseTable}
 <<GeneralSparseTable.input>>=
@@ -31648,7 +32262,6 @@ So the project is cancelled and we can delete the data base:
 
 See Also:
 o )show GeneralSparseTable
-o $AXIOM/doc/src/algebra/table.spad.dvi
 
 @
 \pagehead{GeneralSparseTable}{GSTBL}
@@ -31697,6 +32310,11 @@ GeneralSparseTable(Key, Entry, Tbl, dent): TableAggregate(Key, Entry) == Impl
             u
 
 @
+<<GSTBL.dotabb>>=
+"GSTBL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=GSTBL"]
+"GSTBL" -> "TBAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain GTSET GeneralTriangularSet}
 \pagehead{GeneralTriangularSet}{GTSET}
@@ -31812,6 +32430,11 @@ GeneralTriangularSet(R,E,V,P) : Exports == Implementation where
        (per(cons(p,rep(ts))))::Union($,"failed")
 
 @
+<<GTSET.dotabb>>=
+"GTSET" [color="#88FF44",href="bookvol10.3.pdf#nameddest=GTSET"]
+"GTSET" -> "RPOLCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain GSERIES GeneralUnivariatePowerSeries}
 \pagehead{GeneralUnivariatePowerSeries}{GSERIES}
@@ -31926,6 +32549,11 @@ GeneralUnivariatePowerSeries(Coef,var,cen): Exports == Implementation where
           error "integrate: center is a function of variable of integration"
 
 @
+<<GSERIES.dotabb>>=
+"GSERIES" [color="#88FF44",href="bookvol10.3.pdf#nameddest=GSERIES"]
+"GSERIES" -> "ACFS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain GRIMAGE GraphImage}
 \pagehead{GraphImage}{GRIMAGE}
@@ -32336,6 +32964,11 @@ GraphImage (): Exports == Implementation where
          (p=1 => " point list"; " point lists") :: E])
 
 @
+<<GRIMAGE.dotabb>>=
+"GRIMAGE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=GRIMAGE"]
+"GRIMAGE" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain GOPT GuessOption}
 \pagehead{GuessOption}{GOPT}
@@ -32481,6 +33114,11 @@ GuessOption(): Exports == Implementation where
         else error "GuessOption: Option specified twice"
 
 @
+<<GOPT.dotabb>>=
+"GOPT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=GOPT"]
+"GOPT" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter H}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -32544,6 +33182,11 @@ HashTable(Key, Entry, hashfn): Exports == Implementation where
             "failed"
 
 @
+<<HASHTBL.dotabb>>=
+"HASHTBL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=HASHTBL"]
+"HASHTBL" -> "TBAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain HEAP Heap}
 <<Heap.input>>=
@@ -32679,13 +33322,8 @@ Apply heapsort to present elements in order.
 See Also:
 o )help FlexibleArray
 o )show Heap
-o $AXIOM/doc/src/algebra/bags.spad.dvi
 
 @
-<<dot>>=
-"HEAP" -> "PRQAGG"
-"Heap(a:OrderedSet)" -> "PriorityQueueAggregate(a:OrderedSet)"
-@
 \pagehead{Heap}{HEAP}
 \pagepic{ps/v103heap.ps}{HEAP}{1.00}
 See also:\\
@@ -32772,6 +33410,11 @@ Heap(S:OrderedSet): Exports == Implementation where
     merge_!(a,b) == makeHeap concat_!(a,b)
 
 @
+<<HEAP.dotabb>>=
+"HEAP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=HEAP"]
+"HEAP" -> "A1AGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain HEXADEC HexadecimalExpansion}
 <<HexadecimalExpansion.input>>=
@@ -32915,7 +33558,6 @@ o )help RadixExpansion
 o )help BinaryExpansion
 o )help DecimalExpansion
 o )show HexadecimalExpansion
-o $AXIOM/doc/src/algebra/radix.spad.dvi
 
 @
 \pagehead{HexadecimalExpansion}{HEXADEC}
@@ -32957,6 +33599,11 @@ HexadecimalExpansion(): Exports == Implementation where
     coerce(x:%): RadixExpansion(16) == x pretend RadixExpansion(16)
 
 @
+<<HEXADEC.dotabb>>=
+"HEXADEC" [color="#88FF44",href="bookvol10.3.pdf#nameddest=HEXADEC"]
+"HEXADEC" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain HDP HomogeneousDirectProduct}
 \pagehead{HomogeneousDirectProduct}{HDP}
@@ -33004,6 +33651,11 @@ HomogeneousDirectProduct(dim,S) : T == C where
           false
 
 @
+<<HDP.dotabb>>=
+"HDP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=HDP"]
+"HDP" -> "DIRPCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain HDMP HomogeneousDistributedMultivariatePolynomial}
 <<HomogeneousDistributedMultivariatePolynomial.input>>=
@@ -33213,7 +33865,6 @@ o )help MultivariatePolynomial
 o )help DistributedMultivariatePolynomial
 o )help GeneralDistributedMultivariatePolynomial
 o )show HomogeneousDistributedMultivariatePolynomial
-o $AXIOM/doc/src/algebra/gdpoly.spad.dvi
 
 @
 \pagehead{HomogeneousDistributedMultivariatePolynomial}{HDMP}
@@ -33255,6 +33906,12 @@ HomogeneousDistributedMultivariatePolynomial(vl,R): public == private where
     GeneralDistributedMultivariatePolynomial(vl,R,E)
 
 @
+<<HDMP.dotabb>>=
+"HDMP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=HDMP"]
+"HDMP" -> "PFECAT"
+"HDMP" -> "DIRPCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain HELLFDIV HyperellipticFiniteDivisor}
 \pagehead{HyperellipticFiniteDivisor}{HELLFDIV}
@@ -33431,14 +34088,15 @@ HyperellipticFiniteDivisor(F, UP, UPUP, R): Exports == Implementation where
       reduce makeDivisor(a, bb, 1)
 
 @
+<<HELLFDIV.dotabb>>=
+"HELLFDIV" [color="#88FF44",href="bookvol10.3.pdf#nameddest=HELLFDIV"]
+"HELLFDIV" -> "FDIVCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter I}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ICARD IndexCard}
-<<dot>>=
-"ICARD" -> "ORDSET"
-"IndexCard()" -> "OrderedSet()"
-@
 \pagehead{IndexCard}{ICARD}
 \pagepic{ps/v103indexcard.ps}{ICARD}{1.00}
 See also:\\
@@ -33503,12 +34161,13 @@ IndexCard() : Exports == Implementation where
       error "unknown selector"
 
 @
+<<ICARD.dotabb>>=
+"ICARD" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ICARD"]
+"ICARD" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IBITS IndexedBits}
-<<dot>>=
-"IBITS" -> "BTAGG"
-"IndexedBits(a:Integer)" -> "BitAggregate()"
-@
 \pagehead{IndexedBits}{IBITS}
 \pagepic{ps/v103indexedbits.ps}{IBITS}{1.00}
 See also:\\
@@ -33576,6 +34235,11 @@ IndexedBits(mn:Integer): BitAggregate() with
         Or(u, v)        == (#v=#u => BVEC_-OR(v, u)$Lisp; map("or", v,u))
 
 @
+<<IBITS.dotabb>>=
+"IBITS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IBITS"]
+"IBITS" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IDPAG IndexedDirectProductAbelianGroup}
 \pagehead{IndexedDirectProductAbelianGroup}{IDPAG}
@@ -33652,6 +34316,12 @@ IndexedDirectProductAbelianGroup(A:AbelianGroup,S:OrderedSet):
 --          cons([x.first.k,r],(x.rest - y.rest))
 
 @
+<<IDPAG.dotabb>>=
+"IDPAG" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IDPAG"]
+"IDPAG" -> "IDPC"
+"IDPAG" -> "ORDSET"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IDPAM IndexedDirectProductAbelianMonoid}
 \pagehead{IndexedDirectProductAbelianMonoid}{IDPAM}
@@ -33739,6 +34409,12 @@ IndexedDirectProductAbelianMonoid(A:AbelianMonoid,S:OrderedSet):
        leadingCoefficient x  == (null x => 0; x.first.c)
 
 @
+<<IDPAM.dotabb>>=
+"IDPAM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IDPAM"]
+"IDPAM" -> "IDPC"
+"IDPAM" -> "ORDSET"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IDPO IndexedDirectProductObject}
 \pagehead{IndexedDirectProductObject}{IDPO}
@@ -33788,6 +34464,12 @@ IndexedDirectProductObject(A:SetCategory,S:OrderedSet): IndexedDirectProductCate
           x.first.k
 
 @
+<<IDPO.dotabb>>=
+"IDPO" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IDPO"]
+"IDPO" -> "IDPC"
+"IDPO" -> "ORDSET"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IDPOAM IndexedDirectProductOrderedAbelianMonoid}
 \pagehead{IndexedDirectProductOrderedAbelianMonoid}{IDPOAM}
@@ -33820,6 +34502,11 @@ IndexedDirectProductOrderedAbelianMonoid(A:OrderedAbelianMonoid,S:OrderedSet):
          x.rest < y.rest
 
 @
+<<IDPOAM.dotabb>>=
+"IDPOAM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IDPOAM"]
+"IDPOAM" -> "OAMON"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IDPOAMS IndexedDirectProductOrderedAbelianMonoidSup}
 \pagehead{IndexedDirectProductOrderedAbelianMonoidSup}{IDPOAMS}
@@ -33868,6 +34555,11 @@ IndexedDirectProductOrderedAbelianMonoidSup(A:OrderedAbelianMonoidSup,S:OrderedS
          cons([x.first.k,u],sup(x.rest,y.rest))
 
 @
+<<IDPOAMS.dotabb>>=
+"IDPOAMS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IDPOAMS"]
+"IDPOAMS" -> "OAMONS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain INDE IndexedExponents}
 \pagehead{IndexedExponents}{INDE}
@@ -33909,18 +34601,13 @@ IndexedExponents(Varset:OrderedSet): C == T where
          reduce("*",[coerceOF t for t in x])
 
 @
+<<INDE.dotabb>>=
+"INDE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=INDE"]
+"INDE" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IFARRAY IndexedFlexibleArray}
-<<dot>>=
-"IFARRAY" -> "A1AGG"
-"IndexedFlexibleArray(a:Type,b:Integer)" ->
-    "OneDimensionalArrayAggregate(a:Type)"
-"IndexedFlexibleArray(a:Type,1)" -> 
-    "IndexedFlexibleArray(a:Type,b:Integer)"
-"IFARRAY" -> "ELAGG"
-"IndexedFlexibleArray(a:Type,b:Integer)" ->
-    "ExtensibleLinearAggregate(a:Type)"
-@
 \pagehead{IndexedFlexibleArray}{IFARRAY}
 \pagepic{ps/v103indexedflexiblearray.ps}{IFARRAY}{1.00}
 See also:\\
@@ -34163,6 +34850,11 @@ IndexedFlexibleArray(S:Type, mn: Integer): Exports == Implementation where
          a
 
 @
+<<IFARRAY.dotabb>>=
+"IFARRAY" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IFARRAY"]
+"IFARRAY" -> "A1AGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ILIST IndexedList}
 \pagehead{IndexedList}{ILIST}
@@ -34360,6 +35052,12 @@ IndexedList(S:Type, mn:Integer): Exports == Implementation where
      merge_!(f, p, q)
 
 @
+<<ILIST.dotabb>>=
+"ILIST" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ILIST",
+          shape=ellipse]
+"ILIST" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IMATRIX IndexedMatrix}
 \pagehead{IndexedMatrix}{IMATRIX}
@@ -34435,13 +35133,14 @@ IndexedMatrix(R,mnRow,mnCol): Exports == Implementation where
         inverse     x == inverse(x)$MATLIN
 
 @
+<<IMATRIX.dotabb>>=
+"IMATRIX" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IMATRIX"]
+"IMATRIX" -> "MATCAT"
+"IMATRIX" -> "VECTCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IARRAY1 IndexedOneDimensionalArray}
-<<dot>>=
-"IARRAY1" -> "A1AGG"
-"IndexedOneDimensionalArray(a:Type,b:Integer)" ->
-    "OneDimensionalArrayAggregate(a:Type)"
-@
 \pagehead{IndexedOneDimensionalArray}{IARRAY1}
 \pagepic{ps/v103indexedonedimensionalarray.ps}{IARRAY1}{1.00}
 See also:\\
@@ -34537,6 +35236,11 @@ IndexedOneDimensionalArray(S:Type, mn:Integer):
          qsetelt_!(x, i, s)
 
 @
+<<IARRAY1.dotabb>>=
+"IARRAY1" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IARRAY1"]
+"IARRAY1" -> "A1AGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ISTRING IndexedString}
 \pagehead{IndexedString}{ISTRING}
@@ -34749,6 +35453,12 @@ the coercion.
 	true
 
 @
+<<ISTRING.dotabb>>=
+"ISTRING" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ISTRING",
+          shape=ellipse]
+"ISTRING" -> "FSAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IARRAY2 IndexedTwoDimensionalArray}
 An IndexedTwoDimensionalArray is a 2-dimensional array where
@@ -34760,14 +35470,6 @@ function 'minRowIndex'.  The index of the 'first' column may
 be obtained by calling the function 'minColIndex'.  The index of
 the first element of a 'Row' is the same as the index of the
 first column in an array and vice versa.
-<<dot>>=
-"IARRAY2" -> "ARR2CAT"
-"IndexedTwoDimensionalArray(a:Type,b:Integer,c:Integer)" ->
-"TwoDimensionalArrayCategory(a:Type,d:IndexedOneDimensionalArray(a,b),e:IndexedOneDimensionalArray(a,c))"
-"IARRAY2" -> "IIARRAY2"
-"IndexedTwoDimensionalArray(a:Type,b:Integer,c:Integer)" ->
-"InnerIndexedTwoDimensionalArray(a:Type,b:Integer,c:Integer,d:IndexedOneDimensionalArray(a,b),e:IndexedOneDimensionalArray(a,c))"
-@
 \pagehead{IndexedTwoDimensionalArray}{IARRAY2}
 \pagepic{ps/v103indexedtwodimensionalarray.ps}{IARRAY2}{1.00}
 See also:\\
@@ -34787,6 +35489,12 @@ IndexedTwoDimensionalArray(R,mnRow,mnCol):Exports == Implementation where
     InnerIndexedTwoDimensionalArray(R,mnRow,mnCol,Row,Col)
 
 @
+<<IARRAY2.dotabb>>=
+"IARRAY2" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IARRAY2"]
+"IARRAY2" -> "ARR2CAT"
+"IARRAY2" -> "A1AGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IVECTOR IndexedVector}
 \pagehead{IndexedVector}{IVECTOR}
@@ -34810,6 +35518,11 @@ IndexedVector(R:Type, mn:Integer):
   VectorCategory R == IndexedOneDimensionalArray(R, mn)
  
 @
+<<IVECTOR.dotabb>>=
+"IVECTOR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IVECTOR"]
+"IVECTOR" -> "VECTCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ITUPLE InfiniteTuple}
 \pagehead{InfiniteTuple}{ITUPLE}
@@ -34852,28 +35565,13 @@ InfiniteTuple(S:Type): Exports == Implementation where
 --      coerce(x)$Stream(S)
 
 @
+<<ITUPLE.dotabb>>=
+"ITUPLE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ITUPLE"]
+"ITUPLE" -> "TYPE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IAN InnerAlgebraicNumber}
-<<dot>>=
-"IAN" -> "ES"
-"InnerAlgebraicNumber()" -> "ExpressionSpace()"
-"IAN" -> "ACF"
-"InnerAlgebraicNumber()" -> "AlgebraicallyClosedField()"
-"IAN" -> "RETRACT"
-"InnerAlgebraicNumber()" -> "RetractableTo(Integer)"
-"InnerAlgebraicNumber()" -> "RetractableTo(Fraction(Integer))"
-"IAN" -> "LINEXP"
-"InnerAlgebraicNumber()" -> "LinearlyExplicitRingOver(Integer)"
-"InnerAlgebraicNumber()" -> "LinearlyExplicitRingOver(Fraction(Integer))"
-"IAN" -> "REAL"
-"InnerAlgebraicNumber()" -> "RealConstant()"
-"IAN" -> "CHARZ"
-"InnerAlgebraicNumber()" -> "CharacteristicZero()"
-"IAN" -> "KONVERT"
-"InnerAlgebraicNumber()" -> "ConvertibleTo(Complex(Float))"
-"IAN" -> "DIFRING"
-"InnerAlgebraicNumber()" -> "DifferentialRing()"
-@
 \pagehead{InnerAlgebraicNumber}{IAN}
 \pagepic{ps/v103inneralgebraicnumber.ps}{IAN}{1.00}
 See also:\\
@@ -35019,6 +35717,13 @@ InnerAlgebraicNumber(): Exports == Implementation where
                   x pretend FE)$ExpressionFunctions2(Z, Complex Float)
 
 @
+<<IAN.dotabb>>=
+"IAN" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IAN"]
+"IAN" -> "ACF"
+"IAN" -> "FS"
+"IAN" -> "COMPCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IFF InnerFiniteField}
 \pagehead{InnerFiniteField}{IFF}
@@ -35052,6 +35757,11 @@ InnerFiniteField(p:PositiveInteger, n:PositiveInteger) ==
      FiniteFieldExtension(InnerPrimeField p, n)
 
 @
+<<IFF.dotabb>>=
+"IFF" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IFF"]
+"IFF" -> "FAXF"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IFAMON InnerFreeAbelianMonoid}
 \pagehead{InnerFreeAbelianMonoid}{IFAMON}
@@ -35099,19 +35809,15 @@ InnerFreeAbelianMonoid(S: SetCategory, E:CancellationAbelianMonoid, un:E):
                                        (n := coefficient(x.gen, g)) > 0]
 
 @
+<<IFAMON.dotabb>>=
+"IFAMON" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IFAMON"]
+"IFAMON" -> "OAMON"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IIARRAY2 InnerIndexedTwoDimensionalArray}
 This is an internal type which provides an implementation of
 2-dimensional arrays as PrimitiveArray's of PrimitiveArray's.
-<<dot>>=
-"IIARRAY2" -> "ARR2CAT"
-"InnerIndexedTwoDimensionalArray(a:Type,b:Integer,c:Integer,d:FiniteLinearAggregate(a),e:FiniteLinearAggregate(a))"
--> "TwoDimensionalArrayCategory(a:Type,b:FiniteLinearAggregate(a),c:FiniteLinearAggregate(a))"
-"InnerIndexedTwoDimensionalArray(a:Type,b:Integer,c:Integer,d:IndexedOneDimensionalArray(a,b),e:IndexedOneDimensionalArray(a,c))"
--> "InnerIndexedTwoDimensionalArray(a:Type,b:Integer,c:Integer,d:FiniteLinearAggregate(a),e:FiniteLinearAggregate(a))"
-"InnerIndexedTwoDimensionalArray(a:Type,1,1,b:OneDimensionalArray(a),c:OneDimensionalArray(a))"
--> "InnerIndexedTwoDimensionalArray(a:Type,b:Integer,c:Integer,d:FiniteLinearAggregate(a),e:FiniteLinearAggregate(a))"
-@
 \pagehead{InnerIndexedTwoDimensionalArray}{IIARRAY2}
 \pagepic{ps/v103innerindexedtwodimensionalarray.ps}{IIARRAY2}{1.00}
 See also:\\
@@ -35201,6 +35907,11 @@ InnerIndexedTwoDimensionalArray(R,mnRow,mnCol,Row,Col):_
           concat(s, "\end{array} \right]")$String
 
 @
+<<IIARRAY2.dotabb>>=
+"IIARRAY2" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IIARRAY2"]
+"IIARRAY2" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IPADIC InnerPAdicInteger}
 \pagehead{InnerPAdicInteger}{IPADIC}
@@ -35461,6 +36172,12 @@ InnerPAdicInteger(p,unBalanced?): Exports == Implementation where
       reduce("+",reverse_! l)
 
 @
+<<IPADIC.dotabb>>=
+"IPADIC" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IPADIC"]
+"IPADIC" -> "PADICCT"
+"IPADIC" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IPF InnerPrimeField}
 \pagehead{InnerPrimeField}{IPF}
@@ -35649,6 +36366,11 @@ InnerPrimeField(p:PositiveInteger): Exports == Implementation where
     charthRoot x == x
 
 @
+<<IPF.dotabb>>=
+"IPF" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IPF"]
+"IPF" -> "TBAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ISUPS InnerSparseUnivariatePowerSeries}
 \pagehead{InnerSparseUnivariatePowerSeries}{ISUPS}
@@ -36712,6 +37434,11 @@ InnerSparseUnivariatePowerSeries(Coef): Exports == Implementation where
       reduce("+",reverse_! l)
 
 @
+<<ISUPS.dotabb>>=
+"ISUPS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ISUPS"]
+"ISUPS" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain INTABL InnerTable}
 \pagehead{InnerTable}{INTABL}
@@ -36747,6 +37474,11 @@ InnerTable(Key: SetCategory, Entry: SetCategory, addDom):Exports == Implementati
     Implementation ==> addDom
 
 @
+<<INTABL.dotabb>>=
+"INTABL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=INTABL"]
+"INTABL" -> "TBAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ITAYLOR InnerTaylorSeries}
 \pagehead{InnerTaylorSeries}{ITAYLOR}
@@ -36889,6 +37621,11 @@ InnerTaylorSeries(Coef): Exports == Implementation where
     order x == iOrder2(stream x,0)
 
 @
+<<ITAYLOR.dotabb>>=
+"ITAYLOR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ITAYLOR"]
+"ITAYLOR" -> "ALGEBRA"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain INFORM InputForm}
 \pagehead{InputForm}{INFORM}
@@ -37081,6 +37818,11 @@ InputForm():
       conv [convert("/"::Symbol), s1, s2]$List(%)
 
 @
+<<INFORM.dotabb>>=
+"INFORM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=INFORM"]
+"INFORM" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain INT Integer}
 The function {\bf one?} has been rewritten back to its original form.
@@ -37744,7 +38486,6 @@ o )help DecimalExpansion
 o )help IntegerNumberTheoryFunctions
 o )help RomanNumeral
 o )show Integer
-o $AXIOM/doc/src/algebra/integer.spad.dvi
 
 @
 \pagehead{Integer}{INT}
@@ -37932,6 +38673,13 @@ Integer: Join(IntegerNumberSystem, ConvertibleTo String, OpenMath) with
 --    gcdPolynomial(p,q) == modularGcd(p,q)$TT
 
 @
+<<INT.dotabb>>=
+"INT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=INT",
+          shape=ellipse]
+"INT" -> "STRING"
+"INT" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ZMOD IntegerMod}
 \pagehead{IntegerMod}{ZMOD}
@@ -38024,6 +38772,11 @@ IntegerMod(p:PositiveInteger):
        positiveRemainder(c1, p)
 
 @
+<<ZMOD.dotabb>>=
+"ZMOD" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ZMOD"]
+"ZMOD" -> "BMODULE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain INTFTBL IntegrationFunctionsTable}
 \pagehead{IntegrationFunctionsTable}{INTFTBL}
@@ -38126,6 +38879,11 @@ IntegrationFunctionsTable(): E == I where
       qelt(theFTable,k)$Rep
 
 @
+<<INTFTBL.dotabb>>=
+"INTFTBL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=INTFTBL"]
+"INTFTBL" -> "TBAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IR IntegrationResult}
 \pagehead{IntegrationResult}{IR}
@@ -38302,6 +39060,11 @@ IntegrationResult(F:Field): Exports == Implementation where
       int((ne.integrand)::O * hconcat ["d"::Symbol::O, (ne.intvar)::O])
 
 @
+<<IR.dotabb>>=
+"IR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IR"]
+"IR" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain INTRVL Interval}
 \pagehead{Interval}{INTRVL}
@@ -38749,6 +39512,11 @@ Interval(R:Join(FloatingPointSystem,TranscendentalFunctionCategory)): IntervalCa
   _*_* (u:%,n:Fraction Integer):% == interval(inf(u)**n,sup(u)**n)
   
 @
+<<INTRVL.dotabb>>=
+"INTRVL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=INTRVL"]
+"INTRVL" -> "INTCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter J}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -39060,7 +39828,6 @@ See Also:
 o )help Expression
 o )help BasicOperator
 o )show Kernel
-o $AXIOM/doc/src/algebra/kl.spad.dvi
 
 @
 \pagehead{Kernel}{KERNEL}
@@ -39211,6 +39978,11 @@ Kernel(S:OrderedSet): Exports == Implementation where
         o [convert x for x in k.arg]$List(Pattern Float)
 
 @
+<<KERNEL.dotabb>>=
+"KERNEL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=KERNEL"]
+"KERNEL" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain KAFILE KeyedAccessFile}
 <<KeyedAccessFile.input>>=
@@ -39337,7 +40109,6 @@ o )help File
 o )help TextFile
 o )help Library
 o )show KeyedAccessFile
-o $AXIOM/doc/src/algebra/files.spad.dvi
 
 @
 \pagehead{KeyedAccessFile}{KAFILE}
@@ -39476,6 +40247,11 @@ KeyedAccessFile(Entry): KAFcategory == KAFcapsule where
             f
 
 @
+<<KAFILE.dotabb>>=
+"KAFILE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=KAFILE"]
+"KAFILE" -> "TBAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter L}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -39641,6 +40417,11 @@ LaurentPolynomial(R, UP): Exports == Implementation where
                                      mkgpol(order c - order b, bc.coef2)]
 
 @
+<<LAUPOL.dotabb>>=
+"LAUPOL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LAUPOL"]
+"LAUPOL" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain LIB Library}
 <<Library.input>>=
@@ -39704,7 +40485,6 @@ o )help File
 o )help TextFile
 o )help KeyedAccessFile
 o )show Library
-o $AXIOM/doc/src/algebra/files.spad.dvi
 
 @
 \pagehead{Library}{LIB}
@@ -39736,8 +40516,8 @@ Library(): TableAggregate(String, Any) with
              ++ unused space.
 
          elt : (%, Symbol) -> Any
-             ++ elt(lib,k) or lib.k  extracts the value corresponding to the key \spad{k}
-             ++ from the library \spad{lib}.
+             ++ elt(lib,k) or lib.k  extracts the value corresponding to 
+             ++ the key \spad{k} from the library \spad{lib}.
 
          setelt : (%, Symbol, Any) -> Any
              ++ \spad{lib.k := v} saves the value \spad{v} in the library
@@ -39753,6 +40533,11 @@ Library(): TableAggregate(String, Any) with
          setelt(f:%, v:Symbol, val:Any) == setelt(f, string v, val)
 
 @
+<<LIB.dotabb>>=
+"LIB" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LIB"]
+"LIB" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain LEXP LieExponentials}
 <<LieExponentials.input>>=
@@ -39971,7 +40756,6 @@ Calculations
 
 See Also:
 o )show LieExponentials
-o $AXIOM/doc/src/algebra/xlpoly.spad.dvi
 
 @
 \pagehead{LieExponentials}{LEXP}
@@ -40111,6 +40895,12 @@ LieExponentials(VarSet, R, Order): XDPcat == XDPdef where
          lt pretend $
 
 @
+<<LEXP.dotabb>>=
+"LEXP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LEXP"]
+"LEXP" -> "FLAGG-"
+"LEXP" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain LPOLY LiePolynomial}
 <<LiePolynomial.input>>=
@@ -40510,7 +41300,6 @@ See Also:
 o )help LyndonWord
 o )help XDistributedPolynomial
 o )show LiePolynomial
-o $AXIOM/doc/src/algebra/xlpoly.spad.dvi 
 
 @
 \pagehead{LiePolynomial}{LPOLY}
@@ -40709,6 +41498,11 @@ LiePolynomial(VarSet:OrderedSet, R:CommutativeRing) : Public == Private where
 --           mkNary("+" :: EX,le)
 
 @
+<<LPOLY.dotabb>>=
+"LPOLY" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LPOLY"]
+"LPOLY" -> "FLALG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain LSQM LieSquareMatrix}
 \pagehead{LieSquareMatrix}{LSQM}
@@ -40802,6 +41596,11 @@ LieSquareMatrix(n,R): Exports == Implementation where
 --    if R has commutative("*") and R has unitsKnown then unitsKnown
 
 @
+<<LSQM.dotabb>>=
+"LSQM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LSQM"]
+"LSQM" -> "FRNAALG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain LODO LinearOrdinaryDifferentialOperator}
 <<LinearOrdinaryDifferentialOperator.input>>=
@@ -41289,7 +42088,6 @@ Evaluate this for several values of n.
 
 See Also:
 o )show LinearOrdinaryDifferentialOperator
-o $AXIOM/doc/src/algebra/lodo.spad.dvi
 
 @
 \pagehead{LinearOrdinaryDifferentialOperator}{LODO}
@@ -41327,6 +42125,11 @@ LinearOrdinaryDifferentialOperator(A:Ring, diff: A -> A):
             directSum(a, b)        == directSum(a, b, diff)
 
 @
+<<LODO.dotabb>>=
+"LODO" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LODO"]
+"LODO" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain LODO1 LinearOrdinaryDifferentialOperator1}
 <<LinearOrdinaryDifferentialOperator1.input>>=
@@ -41718,7 +42521,6 @@ both sides.
 
 See Also:
 o )show LinearOrdinaryDifferentialOperator1
-o $AXIOM/doc/src/algebra/lodo.spad.dvi
 
 @
 \pagehead{LinearOrdinaryDifferentialOperator1}{LODO1}
@@ -41741,6 +42543,11 @@ LinearOrdinaryDifferentialOperator1(A:DifferentialRing) ==
   LinearOrdinaryDifferentialOperator(A, differentiate$A)
 
 @
+<<LODO1.dotabb>>=
+"LODO1" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LODO1"]
+"LODO1" -> "LODOCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain LODO2 LinearOrdinaryDifferentialOperator2}
 <<LinearOrdinaryDifferentialOperator2.input>>=
@@ -42261,7 +43068,6 @@ These operators can be applied to vector values.
 
 See Also:
 o )show LinearOrdinaryDifferentialOperator2
-o $AXIOM/doc/src/algebra/lodo.spad.dvi
 
 @
 \pagehead{LinearOrdinaryDifferentialOperator2}{LODO2}
@@ -42294,6 +43100,11 @@ LinearOrdinaryDifferentialOperator2(A, M): Exports == Implementation where
         apply(p, differentiate, m)$ApplyUnivariateSkewPolynomial(A, M, %)
 
 @
+<<LODO2.dotabb>>=
+"LODO2" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LODO2"]
+"LODO2" -> "LODOCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain LIST List}
 <<List.input>>=
@@ -42852,7 +43663,6 @@ a list.
 See Also:
 o )help Stream
 o )show List
-o $AXIOM/doc/src/algebra/list.spad.dvi
 
 @
 \pagehead{List}{LIST}
@@ -42995,6 +43805,12 @@ List(S:Type): Exports == Implementation where
                 [convert a for a in (x pretend List S)]$List(InputForm))
 
 @
+<<LIST.dotabb>>=
+"LIST" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LIST",
+          shape=ellipse]
+"LIST" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain LMOPS ListMonoidOps}
 \pagehead{ListMonoidOps}{LMOPS}
@@ -43159,6 +43975,12 @@ ListMonoidOps(S, E, un): Exports == Implementation where
       g
 
 @
+<<LMOPS.dotabb>>=
+"LMOPS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LMOPS"]
+"LMOPS" -> "FLAGG"
+"LMOPS" -> "FLAGG-"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain LMDICT ListMultiDictionary}
 \pagehead{ListMultiDictionary}{LMDICT}
@@ -43308,6 +44130,11 @@ ListMultiDictionary(S:SetCategory): MultiDictionary(S) with
          s
 
 @
+<<LMDICT.dotabb>>=
+"LMDICT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LMDICT"]
+"LMDICT" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain LA LocalAlgebra}
 \pagehead{LocalAlgebra}{LA}
@@ -43346,6 +44173,11 @@ LocalAlgebra(A: Algebra R,
         characteristic() == characteristic()$A
 
 @
+<<LA.dotabb>>=
+"LA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LA"]
+"LA" -> "OAGROUP"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain LO Localize}
 \pagehead{Localize}{LO}
@@ -43420,6 +44252,11 @@ Localize(M:Module R,
         concat("{ ", concat(nl, concat(" \over ", concat(dl, " }")$String)$String)$String)$String
 
 @
+<<LO.dotabb>>=
+"LO" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LO"]
+"LO" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain LWORD LyndonWord}
 <<LyndonWord.input>>=
@@ -43758,7 +44595,6 @@ Checks and coercions
 
 See Also:
 o )show LyndonWord
-o $AXIOM/doc/src/algebra/xlpoly.spad.dvi
 
 @
 \pagehead{LyndonWord}{LWORD}
@@ -43924,6 +44760,11 @@ LyndonWord(VarSet:OrderedSet):Public == Private where
            "append"/ [v.i for i in 1..n] 
 
 @
+<<LWORD.dotabb>>=
+"LWORD" [color="#88FF44",href="bookvol10.3.pdf#nameddest=LWORD"]
+"LWORD" -> "A1AGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter M}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -43980,6 +44821,11 @@ MachineComplex():Exports == Implementation where
       complex(real(u)::Float,imag(u)::Float)
 
 @
+<<MCMPLX.dotabb>>=
+"MCMPLX" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MCMPLX"]
+"MCMPLX" -> "COMPCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MFLOAT MachineFloat}
 \pagehead{MachineFloat}{MFLOAT}
@@ -44289,6 +45135,11 @@ MachineFloat(): Exports == Implementation where
     characteristic():NNI == 0
 
 @
+<<MFLOAT.dotabb>>=
+"MFLOAT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MFLOAT"]
+"MFLOAT" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MINT MachineInteger}
 \pagehead{MachineInteger}{MINT}
@@ -44349,6 +45200,11 @@ MachineInteger(): Exports == Implementation where
     retractIfCan(u:$):Union(Integer,"failed") == u pretend Integer
 
 @
+<<MINT.dotabb>>=
+"MINT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MINT"]
+"MINT" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MAGMA Magma}
 <<Magma.input>>=
@@ -44646,7 +45502,6 @@ Check ordering
 
 See Also:
 o )show Magma
-o $AXIOM/doc/src/algebra/xlpoly.spad.dvi
 
 @
 \pagehead{Magma}{MAGMA}
@@ -44793,6 +45648,12 @@ Magma(VarSet:OrderedSet):Public == Private where
          lx < ly 
 
 @
+<<MAGMA.dotabb>>=
+"MAGMA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MAGMA"]
+"MAGMA" -> "FLAGG"
+"MAGMA" -> "FLAGG-"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MKCHSET MakeCachableSet}
 \pagehead{MakeCachableSet}{MKCHSET}
@@ -44836,6 +45697,11 @@ MakeCachableSet(S:SetCategory): Exports == Implementation where
       position(x) = position(y)
 
 @
+<<MKCHSET.dotabb>>=
+"MKCHSET" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MKCHSET"]
+"MKCHSET" -> "CACHSET"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MATRIX Matrix}
 <<Matrix.input>>=
@@ -45747,7 +46613,6 @@ o )help TwoDimensionalArray
 o )help Vector
 o )help Permanent
 o )show Matrix
-o $AXIOM/doc/src/algebra/matrix.spad.dvi
 
 @
 \pagehead{Matrix}{MATRIX}
@@ -45931,6 +46796,11 @@ Matrix(R): Exports == Implementation where
                   convert listOfLists x]$List(InputForm)
 
 @
+<<MATRIX.dotabb>>=
+"MATRIX" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MATRIX"]
+"MATRIX" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MODMON ModMonic}
 \pagehead{ModMonic}{MODMON}
@@ -46104,6 +46974,11 @@ ModMonic(R,Rep): C == T
 --       ans
 
 @
+<<MODMON.dotabb>>=
+"MODMON" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MODMON"]
+"MODMON" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MODFIELD ModularField}
 \pagehead{ModularField}{MODFIELD}
@@ -46137,6 +47012,11 @@ ModularField(R,Mod,reduction:(R,Mod) -> R,
   T == ModularRing(R,Mod,reduction,merge,exactQuo)
 
 @
+<<MODFIELD.dotabb>>=
+"MODFIELD" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MODFIELD"]
+"MODFIELD" -> "FIELD"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MODRING ModularRing}
 \pagehead{ModularRing}{MODRING}
@@ -46235,6 +47115,11 @@ ModularRing(R,Mod,reduction:(R,Mod) -> R,
         else u::%
 
 @
+<<MODRING.dotabb>>=
+"MODRING" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MODRING"]
+"MODRING" -> "BMODULE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MODMONOM ModuleMonomial}
 \pagehead{ModuleMonomial}{MODMONOM}
@@ -46272,6 +47157,11 @@ ModuleMonomial(IS: OrderedSet,
         construct(i:IS, e:E):$ == [i, e]$MM::Rep::$
 
 @
+<<MODMONOM.dotabb>>=
+"MODMONOM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MODMONOM"]
+"MODMONOM" -> "ORDSET"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MODOP ModuleOperator}
 \pagehead{ModuleOperator}{MODOP}
@@ -46505,6 +47395,12 @@ ModuleOperator(R: Ring, M:LeftModule(R)): Exports == Implementation where
       if R has conjugate:R -> R then conjug r == conjugate r else conjug r == r
 
 @
+<<MODOP.dotabb>>=
+"MODOP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MODOP"]
+"MODOP" -> "FLAGG"
+"MODOP" -> "FLAGG-"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MOEBIUS MoebiusTransform}
 \pagehead{MoebiusTransform}{MOEBIUS}
@@ -46608,6 +47504,12 @@ MoebiusTransform(F): Exports == Implementation where
       proportional?(list1,list2)
 
 @
+<<MOEBIUS.dotabb>>=
+"MOEBIUS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MOEBIUS"]
+"MOEBIUS" -> "FIELD"
+"MOEBIUS" -> "FLAGG-"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MRING MonoidRing}
 \pagehead{MonoidRing}{MRING}
@@ -46929,6 +47831,12 @@ MonoidRing(R: Ring, M: Monoid): MRcategory == MRdefinition where
               [[Tabl.m, m]$Term for m in keys Tabl]
 
 @
+<<MRING.dotabb>>=
+"MRING" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MRING"]
+"MRING" -> "FLAGG"
+"MRING" -> "FLAGG-"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MSET Multiset}
 <<Multiset.input>>=
@@ -47143,7 +48051,6 @@ Check some inclusion relations.
 
 See Also:
 o )show Multiset
-o $AXIOM/doc/src/algebra/mset.spad.dvi
 
 @
 \pagehead{Multiset}{MSET}
@@ -47432,6 +48339,11 @@ Multiset(S: SetCategory): MultisetAggregate S with
             true
 
 @
+<<MSET.dotabb>>=
+"MSET" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MSET"]
+"MSET" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MPOLY MultivariatePolynomial}
 <<MultivariatePolynomial.input>>=
@@ -47630,7 +48542,6 @@ o )help DistributedMultivariatePolynomial
 o )help UnivariatePolynomial
 o )help Polynomial
 o )show MultivariatePolynomial
-o $AXIOM/doc/src/algebra/multpoly.spad.dvi
 
 @
 \pagehead{MultivariatePolynomial}{MPOLY}
@@ -47663,6 +48574,11 @@ MultivariatePolynomial(vl:List Symbol, R:Ring)
            R, OrderedVariableList vl)
 
 @
+<<MPOLY.dotabb>>=
+"MPOLY" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MPOLY"]
+"MPOLY" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MYEXPR MyExpression}
 \pagehead{MyExpression}{MYEXPR}
@@ -47720,6 +48636,11 @@ MyExpression(q: Symbol, R): Exports == Implementation where
        quot::(Expression R)
 
 @
+<<MYEXPR.dotabb>>=
+"MYEXPR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MYEXPR"]
+"MYEXPR" -> "MYUP"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain MYUP MyUnivariatePolynomial}
 \pagehead{MyUnivariatePolynomial}{MYUP}
@@ -47757,6 +48678,11 @@ MyUnivariatePolynomial(x:Symbol, R:Ring):
                     R, %)
 
 @
+<<MYUP.dotabb>>=
+"MYUP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=MYUP"]
+"MYUP" -> "MYEXPR"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter N}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -48169,6 +49095,11 @@ NewSparseMultivariatePolynomial(R,VarSet) : Exports == Implementation where
          p
 
 @
+<<NSMP.dotabb>>=
+"NSMP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=NSMP"]
+"NSMP" -> "RPOLCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain NSUP NewSparseUnivariatePolynomial}
 Based on the {\bf PseudoRemainderSequence} package, the domain
@@ -48433,6 +49364,11 @@ NewSparseUnivariatePolynomial(R): Exports == Implementation where
                 (co ** pow) * (per reverse qq)
 
 @
+<<NSUP.dotabb>>=
+"NSUP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=NSUP"]
+"NSUP" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain NONE None}
 <<None.input>>=
@@ -48498,13 +49434,8 @@ such as List NonNegativeInteger, do it this way.
 
 See Also:
 o )show None
-o $AXIOM/doc/src/algebra/any.spad.dvi
 
 @
-<<dot>>=
-"NONE" -> "SETCAT"
-"None()" -> "SetCategory()"
-@
 \pagehead{None}{NONE}
 \pagepic{ps/v103none.ps}{NONE}{1.00}
 See also:\\
@@ -48530,6 +49461,12 @@ None():SetCategory == add
     x:% = y:% == EQ(x,y)$Lisp
 
 @
+<<NONE.dotabb>>=
+"NONE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=NONE"]
+"NONE" -> "BASTYPE"
+"NONE" -> "KOERCE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain NNI NonNegativeInteger}
 \pagehead{NonNegativeInteger}{NNI}
@@ -48580,6 +49517,11 @@ NonNegativeInteger: Join(OrderedAbelianMonoidSup,Monoid) with
         c pretend %
 
 @
+<<NNI.dotabb>>=
+"NNI" [color="#88FF44",href="bookvol10.3.pdf#nameddest=NNI",shape=ellipse]
+"NNI" -> "OAMONS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain NIPROB NumericalIntegrationProblem}
 \pagehead{NumericalIntegrationProblem}{NIPROB}
@@ -48647,6 +49589,12 @@ NumericalIntegrationProblem():SetCategory with
         [x.mdnia]
 
 @
+<<NIPROB.dotabb>>=
+"NIPROB" [color="#88FF44",href="bookvol10.3.pdf#nameddest=NIPROB"]
+"NIPROB" -> "BASTYPE"
+"NIPROB" -> "KOERCE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ODEPROB NumericalODEProblem}
 \pagehead{NumericalODEProblem}{ODEPROB}
@@ -48698,6 +49646,12 @@ NumericalODEProblem():SetCategory with
       retract(x:%):ODEAB == x :: Rep
 
 @
+<<ODEPROB.dotabb>>=
+"ODEPROB" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ODEPROB"]
+"ODEPROB" -> "BASTYPE"
+"ODEPROB" -> "KOERCE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain OPTPROB NumericalOptimizationProblem}
 \pagehead{NumericalOptimizationProblem}{OPTPROB}
@@ -48767,6 +49721,12 @@ NumericalOptimizationProblem():SetCategory with
         [x.lsa]
 
 @
+<<OPTPROB.dotabb>>=
+"OPTPROB" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OPTPROB"]
+"OPTPROB" -> "BASTYPE"
+"OPTPROB" -> "KOERCE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PDEPROB NumericalPDEProblem}
 \pagehead{NumericalPDEProblem}{PDEPROB}
@@ -48830,6 +49790,12 @@ NumericalPDEProblem():SetCategory with
       retract(x:%):PDEBC == x :: Rep
 
 @
+<<PDEPROB.dotabb>>=
+"PDEPROB" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PDEPROB"]
+"PDEPROB" -> "BASTYPE"
+"PDEPROB" -> "KOERCE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter O}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -49111,7 +50077,6 @@ Since the result is 0, the norm is multiplicative.
 See Also:
 o )help Quaternion
 o )show Octonion
-o $AXIOM/doc/src/algebra/oct.spad.dvi
 
 @
 \pagehead{Octonion}{OCT}
@@ -49181,6 +50146,12 @@ Octonion(R:CommutativeRing): export == impl where
     x * y == [x.e*y.e-(conjugate y.E)*x.E, y.E*x.e + x.E*(conjugate y.e)]
 
 @
+<<OCT.dotabb>>=
+"OCT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OCT"]
+"OCT" -> "OC"
+"OCT" -> "QUATCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ODEIFTBL ODEIntensityFunctionsTable}
 \pagehead{ODEIntensityFunctionsTable}{ODEIFTBL}
@@ -49263,6 +50234,11 @@ ODEIntensityFunctionsTable(): E == I where
       search(k,theIFTable)$Rep
 
 @
+<<ODEIFTBL.dotabb>>=
+"ODEIFTBL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ODEIFTBL"]
+"ODEIFTBL" -> "Domain"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ARRAY1 OneDimensionalArray}
 <<OneDimensionalArray.input>>=
@@ -49418,13 +50394,8 @@ See Also:
 o )help Vector
 o )help FlexibleArray
 o )show OneDimensionalArray
-o $AXIOM/doc/src/algebra/array1.spad.dvi
 
 @
-<<dot>>=
-"ARRAY1" -> "A1AGG"
-"OneDimensionalArray(a:Type)" -> "OneDimensionalArrayAggregate(a:Type)"
-@
 \pagehead{OneDimensionalArray}{ARRAY1}
 \pagepic{ps/v103onedimensionalarray.ps}{ARRAY1}{1.00}
 See also:\\
@@ -49460,14 +50431,13 @@ OneDimensionalArray(S:Type): Exports == Implementation where
     oneDimensionalArray(n,s) == new(n,s)
 
 @
+<<ARRAY1.dotabb>>=
+"ARRAY1" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ARRAY1"]
+"ARRAY1" -> "A1AGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ONECOMP OnePointCompletion}
-<<dot>>=
-"ONECOMP" -> "SETCAT"
-"OnePointCompletion(a:SetCategory)" -> "SetCategory()"
-"ONECOMP" -> "FRETRCT"
-"OnePointCompletion(a:SetCategory)" -> "FullyRetractableTo(a:SetCategory)"
-@
 \pagehead{OnePointCompletion}{ONECOMP}
 \pagepic{ps/v103onepointcompletion.ps}{ONECOMP}{1.00}
 See also:\\
@@ -49575,6 +50545,11 @@ OnePointCompletion(R:SetCategory): Exports == Implementation where
         rational(r::R)
 
 @
+<<ONECOMP.dotabb>>=
+"ONECOMP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ONECOMP"]
+"ONECOMP" -> "FRETRCT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain OMCONN OpenMathConnection}
 \pagehead{OpenMathConnection}{OMCONN}
@@ -49619,6 +50594,11 @@ OpenMathConnection(): with
     OM_-BINDTCP(conn, port)$Lisp
 
 @
+<<OMCONN.dotabb>>=
+"OMCONN" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OMCONN"]
+"OMCONN" -> "Domain"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain OMDEV OpenMathDevice}
 \pagehead{OpenMathDevice}{OMDEV}
@@ -49792,6 +50772,11 @@ OpenMathDevice(): with
   OMgetType(dev: %): Symbol == OM_-GETTYPE(dev)$Lisp
 
 @
+<<OMDEV.dotabb>>=
+"OMDEV" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OMDEV"]
+"OMDEV" -> "Domain"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain OMENC OpenMathEncoding}
 \pagehead{OpenMathEncoding}{OMENC}
@@ -49843,6 +50828,12 @@ OpenMathEncoding(): SetCategory with
   OMencodingSGML(): % == 3::Rep
 
 @
+<<OMENC.dotabb>>=
+"OMENC" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OMENC"]
+"OMENC" -> "BASTYPE"
+"OMENC" -> "KOERCE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain OMERR OpenMathError}
 \pagehead{OpenMathError}{OMERR}
@@ -49894,6 +50885,11 @@ OpenMathError() : SetCategory with
   errorInfo(e:%):List Symbol == e.info
 
 @
+<<OMERR.dotabb>>=
+"OMERR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OMERR"]
+"OMERR" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain OMERRK OpenMathErrorKind}
 \pagehead{OpenMathErrorKind}{OMERRK}
@@ -49949,6 +50945,11 @@ OpenMathErrorKind() : SetCategory with
   coerce(e:%):OutputForm == coerce(e)$Rep
 
 @
+<<OMERRK.dotabb>>=
+"OMERRK" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OMERRK"]
+"OMERRK" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain OP Operator}
 <<Operator.input>>=
@@ -50334,7 +51335,6 @@ Here is the evaluation.
 
 See Also:
 o )show Operator
-o $AXIOM/doc/src/algebra/opalg.spad.dvi
 
 @
 \pagehead{Operator}{OP}
@@ -50351,6 +51351,11 @@ See also:\\
 Operator(R: Ring) == ModuleOperator(R,R)
 
 @
+<<OP.dotabb>>=
+"OP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OP"]
+"OP" -> "ALGEBRA"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain OMLO OppositeMonogenicLinearOperator}
 \pagehead{OppositeMonogenicLinearOperator}{OMLO}
@@ -50396,14 +51401,13 @@ OppositeMonogenicLinearOperator(P, R): OPRcat == OPRdef where
         coerce(x): OutputForm == prefix(op::OutputForm, [coerce(x:P)$P])
 
 @
+<<OMLO.dotabb>>=
+"OMLO" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OMLO"]
+"OMLO" -> "MLO"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ORDCOMP OrderedCompletion}
-<<dot>>=
-"ORDCOMP" -> "SETCAT"
-"OrderedCompletion(a:SetCategory)" -> "SetCategory()"
-"ORDCOMP" -> "FRETRCT"
-"OrderedCompletion(a:SetCategory)" -> "FullyRetractableTo(a:SetCategory)"
-@
 \pagehead{OrderedCompletion}{ORDCOMP}
 \pagepic{ps/v103orderedcompletion.ps}{ORDCOMP}{1.00}
 See also:\\
@@ -50537,6 +51541,11 @@ OrderedCompletion(R:SetCategory): Exports == Implementation where
         rational(r::R)
 
 @
+<<ORDCOMP.dotabb>>=
+"ORDCOMP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ORDCOMP"]
+"ORDCOMP" -> "FRETRCT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ODP OrderedDirectProduct}
 \pagehead{OrderedDirectProduct}{ODP}
@@ -50576,6 +51585,11 @@ OrderedDirectProduct(dim:NonNegativeInteger,
         x:% < y:% == f(x::Rep,y::Rep)
 
 @
+<<ODP.dotabb>>=
+"ODP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ODP"]
+"ODP" -> "DIRPCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain OFMONOID OrderedFreeMonoid}
 \pagehead{OrderedFreeMonoid}{OFMONOID}
@@ -50732,6 +51746,12 @@ OrderedFreeMonoid(S: OrderedSet): OFMcategory == OFMdefinition where
         mirror x == reverse(x)$Rep
 
 @
+<<OFMONOID.dotabb>>=
+"OFMONOID" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OFMONOID"]
+"OFMONOID" -> "FLAGG"
+"OFMONOID" -> "FLAGG-"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain OVAR OrderedVariableList}
 <<OrderedVariableList.input>>=
@@ -50826,7 +51846,6 @@ Check that the ordering is right
 
 See Also:
 o )show OrderedVariableList
-o $AXIOM/doc/src/algebra/variable.spad.dvi
 
 @
 \pagehead{OrderedVariableList}{OVAR}
@@ -50861,6 +51880,11 @@ OrderedVariableList(VariableList:List Symbol):
        latex(x:%):String      == latex(convert(x)@Symbol)
 
 @
+<<OVAR.dotabb>>=
+"OVAR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OVAR"]
+"OVAR" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ODPOL OrderlyDifferentialPolynomial}
 See also:\\
@@ -51517,7 +52541,6 @@ obtain the (pseudo) remainder of f modulo g and its derivatives.
 
 See Also:
 o )show OrderlyDifferentialPolynomial
-o $AXIOM/doc/src/algebra/dpolcat.spad.dvi
 
 @
 \pagehead{OrderlyDifferentialPolynomial}{ODPOL}
@@ -51556,6 +52579,11 @@ OrderlyDifferentialPolynomial(R):
   Implementation ==> DifferentialSparseMultivariatePolynomial(R,S,V)
 
 @
+<<ODPOL.dotabb>>=
+"ODPOL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ODPOL"]
+"ODPOL" -> "DPOLCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ODVAR OrderlyDifferentialVariable}
 \pagehead{OrderlyDifferentialVariable}{ODVAR}
@@ -51598,6 +52626,12 @@ OrderlyDifferentialVariable(S:OrderedSet):DifferentialVariableCategory(S)
     order v        == v.ord
 
 @
+<<ODVAR.dotabb>>=
+"ODVAR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ODVAR"]
+"ODVAR" -> "ORDSET"
+"ODVAR" -> "RETRACT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ODR OrdinaryDifferentialRing}
 \pagehead{OrdinaryDifferentialRing}{ODR}
@@ -51645,6 +52679,11 @@ OrdinaryDifferentialRing(Kernels,R,var): DRcategory == DRcapsule where
             inv(p)    == (inv(p::R)$R)::$
 
 @
+<<ODR.dotabb>>=
+"ODR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ODR"]
+"ODR" -> "FIELD"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain OWP OrdinaryWeightedPolynomials}
 \pagehead{OrdinaryWeightedPolynomials}{OWP}
@@ -51688,6 +52727,11 @@ OrdinaryWeightedPolynomials(R:Ring,
                             vl,wl,wtlevel)
 
 @
+<<OWP.dotabb>>=
+"OWP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OWP"]
+"OWP" -> "FIELD"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain OSI OrdSetInts}
 \pagehead{OrdSetInts}{OSI}
@@ -51729,6 +52773,11 @@ OrdSetInts: Export == Implement where
        sub(e::Symbol::O, coerce(x)$Rep)$O
 
 @
+<<OSI.dotabb>>=
+"OSI" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OSI"]
+"OSI" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain OUTFORM OutputForm}
 \pagehead{OutputForm}{OUTFORM}
@@ -52186,6 +53235,12 @@ OutputForm(): SetCategory with
         int(a,b,c) == [eform INTSIGN,b, c, a]
 
 @
+<<OUTFORM.dotabb>>=
+"OUTFORM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OUTFORM",
+          shape=ellipse]
+"OUTFORM" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter P}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -52217,6 +53272,11 @@ See also:\\
 PAdicInteger(p:Integer) == InnerPAdicInteger(p,true$Boolean)
 
 @
+<<PADIC.dotabb>>=
+"PADIC" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PADIC"]
+"PADIC" -> "PADICCT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PADICRAT PAdicRational}
 \pagehead{PAdicRational}{PADICRAT}
@@ -52246,6 +53306,11 @@ See also:\\
 PAdicRational(p:Integer) == PAdicRationalConstructor(p,PAdicInteger p)
 
 @
+<<PADICRAT.dotabb>>=
+"PADICRAT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PADICRAT"]
+"PADICRAT" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PADICRC PAdicRationalConstructor}
 \pagehead{PAdicRationalConstructor}{PADICRC}
@@ -52438,12 +53503,13 @@ PAdicRationalConstructor(p,PADIC): Exports == Implementation where
       reduce("+",reverse_! l)
 
 @
+<<PADICRC.dotabb>>=
+"PADICRC" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PADICRC"]
+"PADICRC" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PALETTE Palette}
-<<dot>>=
-"PALETTE" -> "SETCAT"
-"Palette()" -> "SetCategory()"
-@
 \pagehead{Palette}{PALETTE}
 \pagepic{ps/v103palette.ps}{PALETTE}{1.00}
 See also:\\
@@ -52502,6 +53568,12 @@ Palette(): Exports == Implementation where
                SHADE.(p.shadeField)," palette"]
 
 @
+<<PALETTE.dotabb>>=
+"PALETTE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PALETTE"]
+"PALETTE" -> "BASTYPE"
+"PALETTE" -> "KOERCE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PARPCURV ParametricPlaneCurve}
 \pagehead{ParametricPlaneCurve}{PARPCURV}
@@ -52547,6 +53619,11 @@ ParametricPlaneCurve(ComponentFunction): Exports == Implementation where
       error "coordinate: index out of bounds"
 
 @
+<<PARPCURV.dotabb>>=
+"PARPCURV" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PARPCURV"]
+"PARPCURV" -> "TYPE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PARSCURV ParametricSpaceCurve}
 \pagehead{ParametricSpaceCurve}{PARSCURV}
@@ -52595,6 +53672,11 @@ ParametricSpaceCurve(ComponentFunction): Exports == Implementation where
       error "coordinate: index out of bounds"
 
 @
+<<PARSCURV.dotabb>>=
+"PARSCURV" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PARSCURV"]
+"PARSCURV" -> "TYPE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PARSURF ParametricSurface}
 \pagehead{ParametricSurface}{PARSURF}
@@ -52643,6 +53725,11 @@ ParametricSurface(ComponentFunction): Exports == Implementation where
       error "coordinate: index out of bounds"
 
 @
+<<PARSURF.dotabb>>=
+"PARSURF" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PARSURF"]
+"PARSURF" -> "TYPE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PFR PartialFraction}
 <<PartialFraction.input>>=
@@ -52915,7 +54002,6 @@ o )help Factored
 o )help Complex
 o )help FullPartialFractionExpansionXmpPage
 o )show PartialFraction
-o $AXIOM/doc/src/algebra/pfr.spad.dvi
 
 @
 \pagehead{PartialFraction}{PFR}
@@ -53248,6 +54334,13 @@ PartialFraction(R: EuclideanDomain): Cat == Capsule where
       reduce("+", reverse l)
 
 @
+<<PFR.dotabb>>=
+"PFR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PFR"]
+"PFR" -> "FIELD"
+"PFR" -> "FLAGG-"
+"PFR" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PRTITION Partition}
 \pagehead{Partition}{PRTITION}
@@ -53381,14 +54474,14 @@ Partition: Exports == Implementation where
                  for a in powers(x pretend Rep)]
 
 @
+<<PRTITION.dotabb>>=
+"PRTITION" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PRTITION"]
+"PRTITION" -> "FLAGG-"
+"PRTITION" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PATTERN Pattern}
-<<dot>>=
-"RETRACT" -> "CATEGORY"
-"RetractableTo(a:Type)" -> "Category"
-"RetractableTo(SetCategory)" -> "RetractableTo(a:Type)"
-"RetractableTo(Symbol)" -> "RetractableTo(a:Type)"
-@
 \pagehead{Pattern}{PATTERN}
 \pagepic{ps/v103pattern.ps}{PATTERN}{1.00}
 <<domain PATTERN Pattern>>=
@@ -53766,13 +54859,13 @@ Pattern(R:SetCategory): Exports == Implementation where
       mkPat(zero?(rsy.tag), [rsy], 0)
 
 @
+<<PATTERN.dotabb>>=
+"PATTERN" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PATTERN"]
+"PATTERN" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PATLRES PatternMatchListResult}
-<<dot>>=
-"PATLRES" -> "SETCAT"
-"PatternMatchListResult(a:SETCAT,b:SETCAT,c:LSAGG(SETCAT))"
-  -> "SetCategory()"
-@
 \pagehead{PatternMatchListResult}{PATLRES}
 \pagepic{ps/v103patternmatchlistresult.ps}{PATLRES}{1.00}
 See also:\\
@@ -53824,12 +54917,13 @@ PatternMatchListResult(R:SetCategory, S:SetCategory, L:ListAggregate S):
     RecordPrint(r, Rep)$Lisp
 
 @
+<<PATLRES.dotabb>>=
+"PATLRES" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PATLRES"]
+"PATLRES" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PATRES PatternMatchResult}
-<<dot>>=
-"PATRES" -> "SETCAT"
-"PatternMatchResult(a:SetCategory, b:SetCategory)" -> "SetCategory()"
-@
 \pagehead{PatternMatchResult}{PATRES}
 \pagepic{ps/v103patternmatchresult.ps}{PATRES}{1.00}
 See also:\\
@@ -53936,6 +55030,11 @@ PatternMatchResult(R:SetCategory, S:SetCategory): SetCategory with
     search(retract(p)@Symbol, l::LR)
 
 @
+<<PATRES.dotabb>>=
+"PATRES" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PATRES"]
+"PATRES" -> "TBAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PENDTREE PendantTree}
 A PendantTree(S)is either a leaf? and is an S or has
@@ -53992,6 +55091,11 @@ PendantTree(S: SetCategory): T == C where
        paren blankSeparate [left b::OutputForm,right b ::OutputForm]
 
 @
+<<PENDTREE.dotabb>>=
+"PENDTREE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PENDTREE"]
+"PENDTREE" -> "FLAGG-"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PERM Permutation}
 \pagehead{Permutation}{PERM}
@@ -54226,7 +55330,6 @@ Permutation Examples
 
 See Also:
 o )show Permutation
-o $AXIOM/doc/src/algebra/perm.spad.dvi
 
 @
 <<domain PERM Permutation>>=
@@ -54530,6 +55633,11 @@ Up to [[patch--50]] we did not check for duplicates.
         pt +$PT conjugate(partition([#fixedPoints(p)])$PT)$PT
 
 @
+<<PERM.dotabb>>=
+"PERM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PERM"]
+"PERM" -> "FSAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PERMGRP PermutationGroup}
 \pagehead{PermutationGroup}{PERMGRP}
@@ -55292,6 +56400,11 @@ PermutationGroup(S:SetCategory): public == private where
     initializeGroupForWordProblem ( gp ) == initializeGroupForWordProblem ( gp , 0 , 1 )
 
 @
+<<PERMGRP.dotabb>>=
+"PERMGRP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PERMGRP"]
+"PERMGRP" -> "FSAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain HACKPI Pi}
 \pagehead{Pi}{HACKPI}
@@ -55362,6 +56475,11 @@ Pi(): Exports == Implementation where
         Integer, Float) (pi()$Float)
 
 @
+<<HACKPI.dotabb>>=
+"HACKPI" [color="#88FF44",href="bookvol10.3.pdf#nameddest=HACKPI"]
+"HACKPI" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ACPLOT PlaneAlgebraicCurvePlot}
 <<PlaneAlgebraicCurvePlot.input>>=
@@ -55392,13 +56510,8 @@ PlaneAlgebraicCurvePlot examples
 
 See Also:
 o )show PlaneAlgebraicCurvePlot
-o $AXIOM/doc/src/algebra/acplot.spad.dvi 
 
 @
-<<dot>>=
-"ACPLOT" -> "PPCURVE"
-"PlaneAlgebraicCurvePlot()" -> "PlottablePlaneCurveCategory()"
-@
 \pagehead{PlaneAlgebraicCurvePlot}{ACPLOT}
 \pagepic{ps/v103planealgebraiccurveplot.ps}{ACPLOT}{1.00}
 <<domain ACPLOT PlaneAlgebraicCurvePlot>>=
@@ -56614,6 +57727,11 @@ PlaneAlgebraicCurvePlot(): PlottablePlaneCurveCategory _
     vconcat(message "ACPLOT",ff)
 
 @
+<<ACPLOT.dotabb>>=
+"ACPLOT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ACPLOT"]
+"ACPLOT" -> "ALIST" 
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PLOT Plot}
 <<Plot.input>>=
@@ -56708,7 +57826,6 @@ and then feed it to the plot function with a Segment DoubleFloat
 
 See Also:
 o )show Plot
-o $AXIOM/doc/src/algebra/plot.spad.dvi
 
 @
 \pagehead{Plot}{PLOT}
@@ -57276,6 +58393,11 @@ Plot(): Exports == Implementation where
       prefix("PLOT" :: OUT, reverse_! f)
 
 @
+<<PLOT.dotabb>>=
+"PLOT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PLOT"]
+"PLOT" -> "FRAC"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PLOT3D Plot3D}
 \pagehead{Plot3D}{PLOT3D}
@@ -57766,6 +58888,11 @@ Plot3D(): Exports == Implementation where
       outList
 
 @
+<<PLOT3D.dotabb>>=
+"PLOT3D" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PLOT3D"]
+"PLOT3D" -> "TRANFUN"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PBWLB PoincareBirkhoffWittLyndonBasis}
 \pagehead{PoincareBirkhoffWittLyndonBasis}{PBWLB}
@@ -57880,6 +59007,11 @@ PoincareBirkhoffWittLyndonBasis(VarSet: OrderedSet): Public == Private where
        lx < ly
 
 @
+<<PBWLB.dotabb>>=
+"PBWLB" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PBWLB"]
+"PBWLB" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain POINT Point}
 \pagehead{Point}{POINT}
@@ -57916,6 +59048,11 @@ Point(R:Ring) : Exports == Implementation where
     extend(p,l) == concat(p,point l)
 
 @
+<<POINT.dotabb>>=
+"POINT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=POINT"]
+"POINT" -> "PTCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain POLY Polynomial}
 <<Polynomial.input>>=
@@ -58707,7 +59844,6 @@ o )help MultivariatePolynomial
 o )help DistributedMultivariatePolynomial
 o )help NewDistributedMultivariatePolynomial
 o )show Polynomial
-o $AXIOM/doc/src/algebra/multpoly.spad.dvi
 
 @
 \pagehead{Polynomial}{POLY}
@@ -58756,6 +59892,11 @@ Polynomial(R:Ring):
       integrate(p, x) == (integrate univariate(p, x)) (x::%)
 
 @
+<<POLY.dotabb>>=
+"POLY" [color="#88FF44",href="bookvol10.3.pdf#nameddest=POLY"]
+"POLY" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain IDEAL PolynomialIdeals}
 \pagehead{PolynomialIdeals}{IDEAL}
@@ -59179,6 +60320,11 @@ PolynomialIdeals(F,Expon,VarSet,DPoly) : C == T
      zero?(I:Ideal) : Boolean == empty? (groebner I).idl
 
 @
+<<IDEAL.dotabb>>=
+"IDEAL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IDEAL"]
+"IDEAL" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PR PolynomialRing}
 \pagehead{PolynomialRing}{PR}
@@ -59493,6 +60639,11 @@ PolynomialRing(R:Ring,E:OrderedAbelianMonoid): T == C
           x/r == inv(r)*x
 
 @
+<<PR.dotabb>>=
+"PR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PR"]
+"PR" -> "FAMR"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PI PositiveInteger}
 \pagehead{PositiveInteger}{PI}
@@ -59522,6 +60673,12 @@ PositiveInteger: Join(AbelianSemiGroup,OrderedSet,Monoid) with
      y:%
 
 @
+<<PI.dotabb>>=
+"PI" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PI",shape=ellipse]
+"PI" -> "ORDSET"
+"PI" -> "SGROUP"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PF PrimeField}
 \pagehead{PrimeField}{PF}
@@ -59555,12 +60712,13 @@ PrimeField(p:PositiveInteger): Exp == Impl where
       error "Argument to prime field must be a prime"
 
 @
+<<PF.dotabb>>=
+"PF" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PF"]
+"PF" -> "FAXF"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PRIMARR PrimitiveArray}
-<<dot>>=
-"PRIMARR" -> "A1AGG"
-"PrimitiveArray(a:Type)" -> "OneDimensionalArrayAggregate(a:Type)"
-@
 \pagehead{PrimitiveArray}{PRIMARR}
 \pagepic{ps/v103primitivearray.ps}{PRIMARR}{1.00}
 See also:\\
@@ -59593,6 +60751,12 @@ PrimitiveArray(S:Type): OneDimensionalArrayAggregate S == add
    fill_!(x, s)       == (for i in 0..Qmax x repeat Qsetelt(x, i, s); x)
 
 @
+<<PRIMARR.dotabb>>=
+"PRIMARR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PRIMARR",
+          shape=ellipse]
+"PRIMARR" -> "A1AGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain PRODUCT Product}
 \pagehead{Product}{PRODUCT}
@@ -59693,14 +60857,15 @@ Product (A:SetCategory,B:SetCategory) : C == T
 --      formList([x.acomp::Expression,x.bcomp::Expression])$PrintableForm
 
 @
+<<PRODUCT.dotabb>>=
+"PRODUCT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=PRODUCT"]
+"PRODUCT" -> "OAMONS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter Q}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain QFORM QuadraticForm}
-<<dot>>=
-"QFORM" -> "ABELGRP"
-"QuadraticForm(a:PositiveInteger,b:Field)" -> "AbelianGroup()"
-@
 \pagehead{QuadraticForm}{QFORM}
 \pagepic{ps/v103quadraticform.ps}{QFORM}{1.00}
 See also:\\
@@ -59747,6 +60912,11 @@ QuadraticForm(n, K): T == Impl where
         elt(q,v) == dot(v, (matrix q * v))
 
 @
+<<QFORM.dotabb>>=
+"QFORM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=QFORM"]
+"QFORM" -> "FIELD"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain QALGSET QuasiAlgebraicSet}
 \pagehead{QuasiAlgebraicSet}{QALGSET}
@@ -59937,6 +61107,11 @@ QuasiAlgebraicSet(R, Var,Expon,Dpoly) : C == T
        or/[(brace$(Set Dpoly) q) <$(Set Dpoly) (brace$(Set Dpoly) p) for q in qlist]
 
 @
+<<QALGSET.dotabb>>=
+"QALGSET" [color="#88FF44",href="bookvol10.3.pdf#nameddest=QALGSET"]
+"QALGSET" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain QUAT Quaternion}
 <<Quaternion.input>>=
@@ -60175,7 +61350,6 @@ o )help Octonion
 o )help Complex
 o )help CliffordAlgebra
 o )show Quaternion
-o $AXIOM/doc/src/algebra/quat.spad.dvi
 
 @
 \pagehead{Quaternion}{QUAT}
@@ -60220,12 +61394,13 @@ Quaternion(R:CommutativeRing): QuaternionCategory(R) == add
                    x.r*y.k+x.k*y.r+x.i*y.j-x.j*y.i]
 
 @
+<<QUAT.dotabb>>=
+"QUAT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=QUAT"]
+"QUAT" -> "QUATCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain QEQUAT QueryEquation}
-<<dot>>=
-"QEQUAT" -> "KOERCE"
-"QueryEquation()" -> "CoercibleTo(OutputForm)"
-@
 \pagehead{QueryEquation}{QEQUAT}
 \pagepic{ps/v103queryequation.ps}{QEQUAT}{1.00}
 See also:\\
@@ -60251,12 +61426,13 @@ QueryEquation(): Exports == Implementation where
     value q == q.val
 
 @
+<<QEQUAT.dotabb>>=
+"QEQUAT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=QEQUAT"]
+"QEQUAT" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain QUEUE Queue}
-<<dot>>=
-"QUEUE" -> "QUAGG"
-"Queue(a:SetCategory)" -> "QueueAggregate(a:SetCategory)"
-@
 \pagehead{Queue}{QUEUE}
 \pagepic{ps/v103queue.ps}{QUEUE}{1.00}
 See also:\\
@@ -60310,19 +61486,16 @@ Queue(S:SetCategory): QueueAggregate S with
     queue q == ref copy q
 
 @
+<<QUEUE.dotabb>>=
+"QUEUE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=QUEUE"]
+"QUEUE" -> "FLAGG"
+"QUEUE" -> "FLAGG-"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter R}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain RADFF RadicalFunctionField}
-<<dot>>=
-"RADFF" -> "FFCAT"
-"RadicalFunctionField(a:UFD,b:UPOLYC(a),c:UPOLYC(FRAC(b)),d:FRAC(b))"
-   -> "FunctionFieldCategory(a:UFD,b:UPOLYC(a),c:UPOLYC(FRAC(b)))"
-"RADFF" -> "SAE"
-"RadicalFunctionField(a:UFD,b:UPOLYC(a),c:UPOLYC(FRAC(b)),d:FRAC(b))"
-   -> 
-"SimpleAlgebraicExtension(a:FRAC(UPOLYC(UFD)),b:UPOLYC(FRAC(UPOLYC(UFD))))"
-@
 \pagehead{RadicalFunctionField}{RADFF}
 \pagepic{ps/v103radicalfunctionfield.ps}{RADFF}{1.00}
 See also:\\
@@ -60527,6 +61700,11 @@ RadicalFunctionField(F, UP, UPUP, radicnd, n): Exports == Impl where
         zero?(((radcand() exquo (monomial(1,1)$UP-point::UP))::UP) point)
 
 @
+<<RADFF.dotabb>>=
+"RADFF" [color="#88FF44",href="bookvol10.3.pdf#nameddest=RADFF"]
+"RADFF" -> "FFCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain RADIX RadixExpansion}
 <<RadixExpansion.input>>=
@@ -60806,7 +61984,6 @@ o )help DecimalExpansion
 o )help BinaryExpansion
 o )help HexadecimalExpansion
 o )show RadixExpansion
-o $AXIOM/doc/src/algebra/radix.spad.dvi
 
 @
 \pagehead{RadixExpansion}{RADIX}
@@ -61059,6 +62236,12 @@ RadixExpansion(bb): Exports == Implementation where
       [reverse_! ritspfx, reverse_! ritscyc]
 
 @
+<<RADIX.dotabb>>=
+"RADIX" [color="#88FF44",href="bookvol10.3.pdf#nameddest=RADIX"]
+"RADIX" -> "PFECAT"
+"RADIX" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain RECLOS RealClosure}
 The domain constructore {\bf RealClosure} by Renaud Rioboo (University
@@ -62284,7 +63467,6 @@ o )help UnivariatePolynomialCategory
 o )help Field
 o )help RealPolynomialUtilitiesPackage
 o )show RealClosure
-o $AXIOM/doc/src/algebra/reclos.spad.dvi
 
 @
 \pagehead{RealClosure}{RECLOS}
@@ -62603,6 +63785,11 @@ RealClosure(TheField): PUB == PRIV where
        coerce(rn:TheField):$ == rn :: $
 
 @
+<<RECLOS.dotabb>>=
+"RECLOS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=RECLOS"]
+"RECLOS" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain RMATRIX RectangularMatrix}
 \pagehead{RectangularMatrix}{RMATRIX}
@@ -62700,12 +63887,13 @@ RectangularMatrix(m,n,R): Exports == Implementation where
                   convert(x::Matrix(R))]$List(InputForm)
 
 @
+<<RMATRIX.dotabb>>=
+"RMATRIX" [color="#88FF44",href="bookvol10.3.pdf#nameddest=RMATRIX"]
+"RMATRIX" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain REF Reference}
-<<dot>>=
-"REF" -> "TYPE"
-"Reference(a:Type)" -> "Type()"
-@
 \pagehead{Reference}{REF}
 \pagepic{ps/v103reference.ps}{REF}{1.00}
 See also:\\
@@ -62754,6 +63942,13 @@ Reference(S:Type): Type with
             prefix(message("ref"@String), [p.value::OutputForm])
 
 @
+<<REF.dotabb>>=
+"REF" [color="#88FF44",href="bookvol10.3.pdf#nameddest=REF",shape=ellipse]
+"REF" -> "TYPE"
+"REF" -> "BASTYPE"
+"REF" -> "KOERCE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain RGCHAIN RegularChain}
 \pagehead{RegularChain}{RGCHAIN}
@@ -62792,6 +63987,11 @@ RegularChain(R,ls): Exports == Implementation where
   Implementation == RegularTriangularSet(R,E,V,P) 
 
 @
+<<RGCHAIN.dotabb>>=
+"RGCHAIN" [color="#88FF44",href="bookvol10.3.pdf#nameddest=RGCHAIN"]
+"RGCHAIN" -> "RSETCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain REGSET RegularTriangularSet}
 Several domain constructors implement regular triangular sets (or regular
@@ -64167,7 +65367,6 @@ o )help LexTriangularPackage
 o )help LazardSetSolvingPackage
 o )help SquareFreeRegularTriangularSet
 o )show RegularTriangularSet
-o $AXIOM/doc/src/algebra/regset.spad.dvi
 
 @
 \pagehead{RegularTriangularSet}{REGSET}
@@ -64560,6 +65759,11 @@ RegularTriangularSet(R,E,V,P) : Exports == Implementation where
        return [lp2,lts]
 
 @
+<<REGSET.dotabb>>=
+"REGSET" [color="#88FF44",href="bookvol10.3.pdf#nameddest=REGSET"]
+"REGSET" -> "RSETCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain RESRING ResidueRing}
 \pagehead{ResidueRing}{RESRING}
@@ -64618,6 +65822,11 @@ ResidueRing(F,Expon,VarSet,FPol,LFPol) : Dom  == Body
       coerce(x) : OutputForm == coerce(x)$Rep
 
 @
+<<RESRING.dotabb>>=
+"RESRING" [color="#88FF44",href="bookvol10.3.pdf#nameddest=RESRING"]
+"RESRING" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain RESULT Result}
 \pagehead{Result}{RESULT}
@@ -64698,16 +65907,10 @@ Result():Exports==Implementation where
     showScalarValues(b:Boolean):Boolean == showScalarValuesFlag := b
 
 @
-<<RESULT.dotpic>>=
-digraph pic {
- fontsize=10;
- bgcolor="#FFFF66";
- node [shape=box, color=white, style=filled];
-
-"Result"
- [color=lightblue,href="bookvol10.3.pdf#nameddest=RESULT"];
+<<RESULT.dotabb>>=
+"RESULT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=RESULT"]
+"RESULT" -> "ALIST"
 
-}
 @
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain RULE RewriteRule}
@@ -64847,6 +66050,11 @@ RewriteRule(Base, R, F): Exports == Implementation where
             lhs(x)::OutputForm, rhs(x)::OutputForm)
 
 @
+<<RULE.dotabb>>=
+"RULE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=RULE"]
+"RULE" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ROIRC RightOpenIntervalRootCharacterization}
 The domain RightOpenIntervalRootCharacterization is the main code that
@@ -65348,6 +66556,11 @@ RightOpenIntervalRootCharacterization(TheField,ThePolDom) : PUB == PRIV where
 --      lsg := sg
 --     res
 @
+<<ROIRC.dotabb>>=
+"ROIRC" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ROIRC"]
+"ROIRC" -> "RRCC"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ROMAN RomanNumeral}
 <<RomanNumeral.input>>=
@@ -65629,7 +66842,6 @@ o )help BinaryExpansion
 o )help DecimalExpansion
 o )help IntegerNumberTheoryFunctions
 o )show RomanNumeral
-o $AXIOM/doc/src/algebra/integer.spad.dvi
 
 @
 \pagehead{RomanNumeral}{ROMAN}
@@ -65678,6 +66890,11 @@ RomanNumeral(): IntegerNumberSystem with
             FormatRoman(n::PositiveInteger)::Symbol::OutputForm
 
 @
+<<ROMAN.dotabb>>=
+"ROMAN" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ROMAN"]
+"ROMAN" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ROUTINE RoutinesTable}
 \pagehead{RoutinesTable}{ROUTINE}
@@ -66061,6 +67278,11 @@ RoutinesTable(): E == I where
       empty()$LST
 
 @
+<<ROUTINE.dotabb>>=
+"ROUTINE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ROUTINE"]
+"ROUTINE" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain RULECOLD RuleCalled}
 \pagehead{RuleCalled}{RULECOLD}
@@ -66079,6 +67301,11 @@ RuleCalled(f:Symbol): SetCategory with
   latex(x:%):String      == latex f
 
 @
+<<RULECOLD.dotabb>>=
+"RULECOLD" [color="#88FF44",href="bookvol10.3.pdf#nameddest=RULECOLD"]
+"RULECOLD" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain RULESET Ruleset}
 \pagehead{Ruleset}{RULESET}
@@ -66124,6 +67351,11 @@ Ruleset(Base, R, F): Exports == Implementation where
     rules x                          == parts(x)$Rep
 
 @
+<<RULESET.dotabb>>=
+"RULESET" [color="#88FF44",href="bookvol10.3.pdf#nameddest=RULESET"]
+"RULESET" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter S}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -66558,6 +67790,11 @@ ScriptFormulaFormat(): public == private where
       formatFunction(op,args,prec)
 
 @
+<<FORMULA.dotabb>>=
+"FORMULA" [color="#88FF44",href="bookvol10.3.pdf#nameddest=FORMULA"]
+"FORMULA" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SEG Segment}
 <<Segment.input>>=
@@ -66727,7 +67964,6 @@ See Also:
 o )help UniversalSegment
 o )help SegmentBinding
 o )show Segment
-o $AXIOM/doc/src/algebra/seg.spad.dvi
 
 @
 \pagehead{Segment}{SEG}
@@ -66812,6 +68048,11 @@ Segment(S:Type): SegmentCategory(S) with
         reverse_! lr
 
 @
+<<SEG.dotabb>>=
+"SEG" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SEG"]
+"SEG" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SEGBIND SegmentBinding}
 <<SegmentBinding.input>>=
@@ -66923,7 +68164,6 @@ See Also:
 o )help Segment
 o )help UniversalSegment
 o )show SegmentBinding
-o $AXIOM/doc/src/algebra/seg.spad.dvi
 
 @
 \pagehead{SegmentBinding}{SEGBIND}
@@ -66975,6 +68215,11 @@ SegmentBinding(S:Type): Type with
        variable(b)::OutputForm = segment(b)::OutputForm
 
 @
+<<SEGBIND.dotabb>>=
+"SEGBIND" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SEGBIND"]
+"SEGBIND" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SET Set}
 <<Set.input>>=
@@ -67282,7 +68527,6 @@ create new sets from old.
 See Also:
 o )help List
 o )show Set
-o $AXIOM/doc/src/algebra/sets.spad.dvi
 
 @
 \pagehead{Set}{SET}
@@ -67465,6 +68709,11 @@ Set(S:SetCategory): FiniteSetAggregate S == add
         s
 
 @
+<<SET.dotabb>>=
+"SET" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SET"]
+"SET" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SETMN SetOfMIntegersInOneToN}
 \pagehead{SetOfMIntegersInOneToN}{SETMN}
@@ -67615,6 +68864,11 @@ SetOfMIntegersInOneToN(m, n): Exports == Implementation where
       [newb, (i = p => s.pos; 0)]
 
 @
+<<SETMN.dotabb>>=
+"SETMN" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SETMN"]
+"SETMN" -> "IVECTOR"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SDPOL SequentialDifferentialPolynomial}
 \pagehead{SequentialDifferentialPolynomial}{SDPOL}
@@ -67657,6 +68911,11 @@ SequentialDifferentialPolynomial(R):
   Implementation ==> DifferentialSparseMultivariatePolynomial(R,S,V)
 
 @
+<<SDPOL.dotabb>>=
+"SDPOL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SDPOL"]
+"SDPOL" -> "DPOLCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SDVAR SequentialDifferentialVariable}
 \pagehead{SequentialDifferentialVariable}{SDVAR}
@@ -67702,6 +68961,12 @@ SequentialDifferentialVariable(S:OrderedSet):DifferentialVariableCategory(S)
       variable v < variable u
 
 @
+<<SDVAR.dotabb>>=
+"SDVAR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SDVAR"]
+"SDVAR" -> "ORDSET"
+"SDVAR" -> "RETRACT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SEX SExpression}
 \pagehead{SExpression}{SEX}
@@ -67720,6 +68985,11 @@ SExpression()
        == SExpressionOf(String, Symbol, Integer, DoubleFloat, OutputForm)
 
 @
+<<SEX.dotabb>>=
+"SEX" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SEX"]
+"SEX" -> "STRICAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SEXOF SExpressionOf}
 \pagehead{SExpressionOf}{SEXOF}
@@ -67795,18 +69065,14 @@ SExpressionOf(Str, Sym, Int, Flt, Expr): Decl == Body where
           b
 
 @
+<<SEXOF.dotabb>>=
+"SEXOF" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SEXOF"]
+"SEXOF" -> "FLAGG"
+"SEXOF" -> "FLAGG-"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SAE SimpleAlgebraicExtension}
-<<dot>>=
-"SimpleAlgebraicExtension(a:FRAC(UPOLYC(UFD)),b:UPOLYC(FRAC(UPOLYC(UFD))))"
-    [color=white,style=filled];
-"SAE" -> "MONOGEN"
-"SimpleAlgebraicExtension(a:CommutativeRing,b:UnivariatePolynomialCategory(a))"
- -> "MonogenicAlgebra(a:CommutativeRing,b:UnivariatePolynomialCategory(a))"
-"SimpleAlgebraicExtension(a:FRAC(UPOLYC(UFD)),b:UPOLYC(FRAC(UPOLYC(UFD))))"
--> 
-"SimpleAlgebraicExtension(a:CommutativeRing,b:UnivariatePolynomialCategory(a))"
-@
 \pagehead{SimpleAlgebraicExtension}{SAE}
 \pagepic{ps/v103simplealgebraicextension.ps}{SAE}{1.00}
 <<domain SAE SimpleAlgebraicExtension>>=
@@ -67989,6 +69255,11 @@ SimpleAlgebraicExtension(R:CommutativeRing,
 --      ffe.f
 
 @
+<<SAE.dotabb>>=
+"SAE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SAE"]
+"SAE" -> "MONOGEN"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SFORT SimpleFortranProgram}
 \pagehead{SimpleFortranProgram}{SFORT}
@@ -68064,6 +69335,11 @@ SimpleFortranProgram(R,FS): Exports == Implementation where
       void()$Void
 
 @
+<<SFORT.dotabb>>=
+"SFORT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SFORT"]
+"SFORT" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SINT SingleInteger}
 The definition of {\bf one?} has been rewritten 
@@ -68252,17 +69528,8 @@ of those provided for Integer.
 See Also:
 o )help Integer
 o )show SingleInteger
-o $AXIOM/doc/src/algebra/si.spad.dvi
 
 @
-<<dot>>=
-"SINT" -> "INS"
-"SingleInteger()" -> "IntegerNumberSystem()"
-"SINT" -> "LOGIC"
-"SingleInteger()" -> "Logic()"
-"SINT" -> "OM"
-"SingleInteger()" -> "OpenMath()"
-@
 \pagehead{SingleInteger}{SINT}
 \pagepic{ps/v103singleinteger.ps}{SINT}{1.00}
 <<domain SINT SingleInteger>>=
@@ -68463,12 +69730,13 @@ SingleInteger(): Join(IntegerNumberSystem,Logic,OpenMath) with
 )bo $noSubsets := false
 
 @
+<<SINT.dotabb>>=
+"SINT" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SINT",shape=ellipse]
+"SINT" -> "PID/OAGROUP"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SAOS SingletonAsOrderedSet}
-<<dot>>=
-"SAOS" -> "ORDSET"
-"SingletonAsOrderedSet()" -> "OrderedSet()"
-@
 \pagehead{SingletonAsOrderedSet}{SAOS}
 \pagepic{ps/v103singletonasorderedset.ps}{SAOS}{1.00}
 <<domain SAOS SingletonAsOrderedSet>>=
@@ -68488,6 +69756,11 @@ SingletonAsOrderedSet(): OrderedSet with
    convert a == coerce("?")
 
 @
+<<SAOS.dotabb>>=
+"SAOS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SAOS"]
+"SAOS" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SMP SparseMultivariatePolynomial}
 \pagehead{SparseMultivariatePolynomial}{SMP}
@@ -69070,6 +70343,11 @@ SparseMultivariatePolynomial(R: Ring,VarSet: OrderedSet): C == T where
 --           PSimp(p1.v, gcd(p1.ts, p2.ts))
 
 @
+<<SMP.dotabb>>=
+"SMP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SMP"]
+"SMP" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SMTS SparseMultivariateTaylorSeries}
 \pagehead{SparseMultivariateTaylorSeries}{SMTS}
@@ -69335,6 +70613,11 @@ SparseMultivariateTaylorSeries(Coef,Var,SMP):_
          p:% / r:Coef ==(map(#1/$SMP r,stream p)$SF2(SMP,SMP))pretend %
 
 @
+<<SMTS.dotabb>>=
+"SMTS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SMTS"]
+"SMTS" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain STBL SparseTable}
 <<SparseTable.input>>=
@@ -69456,7 +70739,6 @@ See Also:
 o )help Table
 o )help GeneralSparseTable
 o )show SparseTable
-o $AXIOM/doc/src/algebra/table.spad.dvi
 
 @
 \pagehead{SparseTable}{STBL}
@@ -69488,6 +70770,11 @@ SparseTable(Key:SetCategory, Ent:SetCategory, dent:Ent) ==
         GeneralSparseTable(Key, Ent, Table(Key, Ent), dent)
 
 @
+<<STBL.dotabb>>=
+"STBL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=STBL"]
+"STBL" -> "TBAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SULS SparseUnivariateLaurentSeries}
 \pagehead{SparseUnivariateLaurentSeries}{SULS}
@@ -69687,6 +70974,11 @@ SparseUnivariateLaurentSeries(Coef,var,cen): Exports == Implementation where
       seriesToOutputForm(st,getRef uls,variable uls,center uls,1)
 
 @
+<<SULS.dotabb>>=
+"SULS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SULS"]
+"SULS" -> "ULSCCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SUP SparseUnivariatePolynomial}
 \pagehead{SparseUnivariatePolynomial}{SUP}
@@ -70044,6 +71336,11 @@ SparseUnivariatePolynomial(R:Ring): UnivariatePolynomialCategory(R) with
      p / co == inv(co) * p
 
 @
+<<SUP.dotabb>>=
+"SUP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SUP"]
+"SUP" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SUPEXPR SparseUnivariatePolynomialExpressions}
 
@@ -70093,6 +71390,11 @@ SparseUnivariatePolynomialExpressions(R: Ring): Exports == Implementation where
                 output(hconcat("acos p for p= ", p::OutputForm))$OutputPackage
                 error "SUPTRAFUN: acos only defined for elements of the coefficient ring"
 @
+<<SUPEXPR.dotabb>>=
+"SUPEXPR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SUPEXPR"]
+"SUPEXPR" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SUPXS SparseUnivariatePuiseuxSeries}
 \pagehead{SparseUnivariatePuiseuxSeries}{SUPXS}
@@ -70184,6 +71486,11 @@ SparseUnivariatePuiseuxSeries(Coef,var,cen): Exports == Implementation where
       seriesToOutputForm(st,refer,variable x,center x,rationalPower x)
 
 @
+<<SUPXS.dotabb>>=
+"SUPXS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SUPXS"]
+"SUPXS" -> "ULSCCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ORESUP SparseUnivariateSkewPolynomial}
 \pagehead{SparseUnivariateSkewPolynomial}{ORESUP}
@@ -70220,6 +71527,11 @@ SparseUnivariateSkewPolynomial(R:Ring, sigma:Automorphism R, delta: R -> R):
           rightDivide(a, b) == rightDivide(a, b, sigma)
 
 @
+<<ORESUP.dotabb>>=
+"ORESUP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ORESUP"]
+"ORESUP" -> "OREPCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SUTS SparseUnivariateTaylorSeries}
 \pagehead{SparseUnivariateTaylorSeries}{SUTS}
@@ -70608,6 +71920,11 @@ SparseUnivariateTaylorSeries(Coef,var,cen): Exports == Implementation where
       seriesToOutputForm(getStream x,getRef x,variable x,center x,1)
 
 @
+<<SUTS.dotabb>>=
+"SUTS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SUTS"]
+"SUTS" -> "UTSCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SHDP SplitHomogeneousDirectProduct}
 \pagehead{SplitHomogeneousDirectProduct}{SHDP}
@@ -70664,6 +71981,11 @@ SplitHomogeneousDirectProduct(dimtot,dim1,S) : T == C where
 	  lessThanRlex(v1,v2,dim1+1,dimtot)
 
 @
+<<SHDP.dotabb>>=
+"SHDP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SHDP"]
+"SHDP" -> "DIRPCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SPLNODE SplittingNode}
 \pagehead{SplittingNode}{SPLNODE}
@@ -70821,6 +72143,13 @@ SplittingNode(V,C) : Exports == Implementation where
         bracket commaSeparate l
 
 @
+<<SPLNODE.dotabb>>=
+"SPLNODE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SPLNODE"]
+"SPLNODE" -> "BASTYPE"
+"SPLNODE" -> "KOERCE"
+"SPLNODE" -> "TYPE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SPLTREE SplittingTree}
 \pagehead{SplittingTree}{SPLTREE}
@@ -71134,6 +72463,11 @@ SplittingTree(V,C) : Exports == Implementation where
        updateStatus!(a)
 
 @
+<<SPLTREE.dotabb>>=
+"SPLTREE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SPLTREE"]
+"SPLTREE" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SREGSET SquareFreeRegularTriangularSet}
 <<SquareFreeRegularTriangularSet.input>>=
@@ -71604,7 +72938,6 @@ o )help LexTriangularPackage
 o )help LazardSetSolvingPackage
 o )help RegularTriangularSet
 o )show SquareFreeRegularTriangularSet
-o $AXIOM/doc/src/algebra/sregset.spad.dvi
 
 @
 \pagehead{SquareFreeRegularTriangularSet}{SREGSET}
@@ -72006,6 +73339,11 @@ SquareFreeRegularTriangularSet(R,E,V,P) : Exports == Implementation where
        return [lp2,lts]
 
 @
+<<SREGSET.dotabb>>=
+"SREGSET" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SREGSET"]
+"SREGSET" -> "SFRTCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SQMATRIX SquareMatrix}
 <<SquareMatrix.input>>=
@@ -72149,7 +73487,6 @@ This value can be converted to a square matrix with polynomial coefficients.
 See Also:
 o )help Matrix
 o )show SquareMatrix
-o $AXIOM/doc/src/algebra/matrix.spad.dvi
 
 @
 \pagehead{SquareMatrix}{SQMATRIX}
@@ -72296,12 +73633,13 @@ SquareMatrix(ndim,R): Exports == Implementation where
 
 
 @
+<<SQMATRIX.dotabb>>=
+"SQMATRIX" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SQMATRIX"]
+"SQMATRIX" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain STACK Stack}
-<<dot>>=
-"STACK" -> "SKAGG"
-"Stack(a:SetCategory)" -> "StackAggregate(a:SetCategory)"
-@
 \pagehead{Stack}{STACK}
 \pagepic{ps/v103stack.ps}{STACK}{1.00}
 See also:\\
@@ -72357,6 +73695,11 @@ Stack(S:SetCategory): StackAggregate S with
     stack s == ref copy s
 
 @
+<<STACK.dotabb>>=
+"STACK" [color="#88FF44",href="bookvol10.3.pdf#nameddest=STACK"]
+"STACK" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain STREAM Stream}
 <<Stream.input>>=
@@ -72538,7 +73881,6 @@ o )help StreamFunctions1
 o )help StreamFunctions2
 o )help StreamFunctions3
 o )show Stream
-o $AXIOM/doc/src/algebra/stream.spad.dvi
 
 @
 \pagehead{Stream}{STREAM}
@@ -73191,6 +74533,11 @@ Stream(S): Exports == Implementation where
 --      mapp(f,x,y,a)
 
 @
+<<STREAM.dotabb>>=
+"STREAM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=STREAM"]
+"STREAM" -> "LZSTAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain STRING String}
 <<String.input>>=
@@ -73694,7 +75041,6 @@ See Also:
 o )help Character
 o )help CharacterClass
 o )show String
-o $AXIOM/doc/src/algebra/string.spad.dvi
 
 @
 \pagehead{String}{STRING}
@@ -73749,6 +75095,11 @@ String(): StringCategory == IndexedString(MINSTRINGINDEX) add
         OMputEndObject(dev)
 
 @
+<<STRING.dotabb>>=
+"STRING" [color="#88FF44",href="bookvol10.3.pdf#nameddest=STRING"]
+"STRING" -> "STRICAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain STRTBL StringTable}
 <<StringTable.input>>=
@@ -73820,7 +75171,6 @@ for s in split("My name is Ian Watt.",char " ")
 See Also:
 o )help Table
 o )show StringTable
-o $AXIOM/doc/src/algebra/table.spad.dvi
 
 @
 \pagehead{StringTable}{STRTBL}
@@ -73851,6 +75201,11 @@ StringTable(Entry: SetCategory) ==
     HashTable(String, Entry, "CVEC")
 
 @
+<<STRTBL.dotabb>>=
+"STRTBL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=STRTBL"]
+"STRTBL" -> "TBAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SUBSPACE SubSpace}
 The first argument n is the dimension of the subSpace
@@ -74324,6 +75679,11 @@ SubSpace(n:PI,R:Ring) : Exports == Implementation where
               (s=1 => " component"::O;" components"::O)])
 
 @
+<<SUBSPACE.dotabb>>=
+"SUBSPACE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SUBSPACE"]
+"SUBSPACE" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain COMPPROP SubSpaceComponentProperty}
 \pagehead{SubSpaceComponentProperty}{COMPPROP}
@@ -74377,6 +75737,12 @@ SubSpaceComponentProperty() : Exports == Implementation where
               (solid? p => ""::O; "not "::O),"solid"::O ])
 
 @
+<<COMPPROP.dotabb>>=
+"COMPPROP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=COMPPROP"]
+"COMPPROP" -> "BASTYPE"
+"COMPPROP" -> "KOERCE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SUCH SuchThat}
 \pagehead{SuchThat}{SUCH}
@@ -74405,6 +75771,12 @@ SuchThat(S1, S2): Cat == Capsule where
         coerce(w):E == infix("|"::E, w.obj::E, w.cond::E)
 
 @
+<<SUCH.dotabb>>=
+"SUCH" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SUCH"]
+"SUCH" -> "BASTYPE"
+"SUCH" -> "KOERCE"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SWITCH Switch}
 \pagehead{Switch}{SWITCH}
@@ -74506,6 +75878,11 @@ Switch():public == private where
       [operator("EQ"::Symbol),[r1,r2]$List(EXPR)]$Rep
 
 @
+<<SWITCH.dotabb>>=
+"SWITCH" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SWITCH"]
+"SWITCH" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SYMBOL Symbol}
 <<Symbol.input>>=
@@ -74886,7 +76263,6 @@ If trailing lists of scripts are omitted, they are assumed to be empty.
 
 See Also:
 o )show Symbol
-o $AXIOM/doc/src/algebra/symbol.spad.dvi
 
 @
 \pagehead{Symbol}{SYMBOL}
@@ -75200,6 +76576,12 @@ Symbol(): Exports == Implementation where
     sample() == "aSymbol"::%
 
 @
+<<SYMBOL.dotabb>>=
+"SYMBOL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SYMBOL",
+          shape=ellipse]
+"SYMBOL" -> "STRICAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SYMTAB SymbolTable}
 \pagehead{SymbolTable}{SYMTAB}
@@ -75389,6 +76771,11 @@ SymbolTable() : exports == implementation where
       void()$Void
 
 @
+<<SYMTAB.dotabb>>=
+"SYMTAB" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SYMTAB"]
+"SYMTAB" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SYMPOLY SymmetricPolynomial}
 \pagehead{SymmetricPolynomial}{SYMPOLY}
@@ -75429,6 +76816,11 @@ SymmetricPolynomial(R:Ring) == PolynomialRing(R,Partition) add
                   -- reduces both time and space [Abbott/Bradford/Davenport]
 
 @
+<<SYMPOLY.dotabb>>=
+"SYMPOLY" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SYMPOLY"]
+"SYMPOLY" -> "FAMR"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter T}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -75731,7 +77123,6 @@ o )help SparseTable
 o )help GeneralSparseTable
 o )help KeyedAccessFile
 o )show Table
-o $AXIOM/doc/src/algebra/table.spad.dvi
 
 @
 \pagehead{Table}{TABLE}
@@ -75771,6 +77162,11 @@ Table(Key: SetCategory, Entry: SetCategory):Exports == Implementation where
           else AssociationList(Key, Entry))
 
 @
+<<TABLE.dotabb>>=
+"TABLE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=TABLE"]
+"TABLE" -> "TBAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain TABLEAU Tableau}
 \pagehead{Tableau}{TABLEAU}
@@ -75827,6 +77223,11 @@ Tableau(S:SetCategory):Exports == Implementation where
     coerce(x:%):OUT == maketab listOfLists x
 
 @
+<<TABLEAU.dotabb>>=
+"TABLEAU" [color="#88FF44",href="bookvol10.3.pdf#nameddest=TABLEAU"]
+"TABLEAU" -> "FLAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain TS TaylorSeries}
 \pagehead{TaylorSeries}{TS}
@@ -75884,6 +77285,12 @@ TaylorSeries(Coef): Exports == Implementation where
       sum
 
 @
+<<TS.dotabb>>=
+"TS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=TS"]
+"TS" -> "PSCAT"
+"TS" -> "TRANFUN"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain TEX TexFormat}
 \subsection{product(product(i*j,i=a..b),j=c..d) fix}
@@ -76512,6 +77919,11 @@ TexFormat(): public == private where
       formatFunction(op,args,prec)
 
 @
+<<TEX.dotabb>>=
+"TEX" [color="#88FF44",href="bookvol10.3.pdf#nameddest=TEX"]
+"TEX" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain TEXTFILE TextFile}
 <<TextFile.input>>=
@@ -76678,7 +78090,6 @@ o )help File
 o )help KeyedAccessFile
 o )help Library
 o )show TextFile
-o $AXIOM/doc/src/algebra/files.spad.dvi
 
 @
 \pagehead{TextFile}{TEXTFILE}
@@ -76775,6 +78186,11 @@ TextFile: Cat == Def where
           false
 
 @
+<<TEXTFILE.dotabb>>=
+"TEXTFILE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=TEXTFILE"]
+"TEXTFILE" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SYMS TheSymbolTable}
 \pagehead{TheSymbolTable}{SYMS}
@@ -76985,6 +78401,11 @@ TheSymbolTable() : Exports == Implementation where
       printTypes(elt(elt(theSymbolTable,u)$Rep,symtab)$Entry)$SymbolTable
 
 @
+<<SYMS.dotabb>>=
+"SYMS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SYMS"]
+"SYMS" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain M3D ThreeDimensionalMatrix}
 \pagehead{ThreeDimensionalMatrix}{M3D}
@@ -77245,6 +78666,11 @@ ThreeDimensionalMatrix(R) : Exports == Implementation where
       resultMatrix
 
 @
+<<M3D.dotabb>>=
+"M3D" [color="#88FF44",href="bookvol10.3.pdf#nameddest=M3D"]
+"M3D" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain VIEW3D ThreeDimensionalViewport}
 \pagehead{ThreeDimensionalViewport}{VIEW3D}
@@ -78196,6 +79622,11 @@ ThreeDimensionalViewport(): Exports == Implementation where
 --          getI(VIEW)$Lisp          -- acknowledge
 
 @
+<<VIEW3D.dotabb>>=
+"VIEW3D" [color="#88FF44",href="bookvol10.3.pdf#nameddest=VIEW3D"]
+"VIEW3D" -> "FSAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain SPACE3 ThreeSpace}
 \pagehead{ThreeSpace}{SPACE3}
@@ -78548,6 +79979,11 @@ ThreeSpace(R:Ring):Exports == Implementation where
                (sizo=1=>" component"::O;" components"::O)])
 
 @
+<<SPACE3.dotabb>>=
+"SPACE3" [color="#88FF44",href="bookvol10.3.pdf#nameddest=SPACE3"]
+"SPACE3" -> "FSAGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain TREE Tree}
 \pagehead{Tree}{TREE}
@@ -78893,6 +80329,11 @@ Tree(S: SetCategory): T==C where
       eqUnion(rest u, newV)
 
 @
+<<TREE.dotabb>>=
+"TREE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=TREE"]
+"TREE" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain TUBE TubePlot}
 \pagehead{TubePlot}{TUBE}
@@ -78951,12 +80392,14 @@ TubePlot(Curve): Exports == Implementation where
     tube(curve,ll,b) == [curve,ll,b]
 
 @
+<<TUBE.dotabb>>=
+"TUBE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=TUBE"]
+"TUBE" -> "FIELD"
+"TUBE" -> "RADCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain TUPLE Tuple}
-<<dot>>=
-"TUPLE" -> "PRIMARR"
-"Tuple(a:Type)" -> "PrimitiveArray(a:Type)"
-@
 \pagehead{Tuple}{TUPLE}
 \pagepic{ps/v103tuple.ps}{TUPLE}{1.00}
 See also:\\
@@ -79010,6 +80453,12 @@ Tuple(S:Type): CoercibleTo(PrimitiveArray S) with
              for i in minIndex x.elts .. maxIndex x.elts]$List(OutputForm)
 
 @
+<<TUPLE.dotabb>>=
+"TUPLE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=TUPLE"]
+"TUPLE" -> "A1AGG"
+"TUPLE" -> "A1AGG-"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ARRAY2 TwoDimensionalArray}
 <<TwoDimensionalArray.input>>=
@@ -79455,17 +80904,8 @@ See Also:
 o )help Matrix
 o )help OneDimensionalArray
 o )show TwoDimensionalArray
-o $AXIOM/doc/src/algebra/array2.spad.dvi
 
 @
-<<dot>>=
-"ARRAY2" -> "ARR2CAT"
-"TwoDimensionalArray(a:Type)" ->
-"TwoDimensionalArrayCategory(a:Type,b:FiniteLinearAggregate(a),c:FiniteLinearAggregate(a))"
-"ARRAY2" -> "IIARRAY2"
-"TwoDimensionalArray(a:Type)" ->
-"InnerIndexedTwoDimensionalArray(a:Type,1,1,b:OneDimensionalArray(a),c:OneDimensionalArray(a))"
-@
 \pagehead{TwoDimensionalArray}{ARRAY2}
 \pagepic{ps/v103twodimensionalarray.ps}{ARRAY2}{1.00}
 See also:\\
@@ -79487,6 +80927,12 @@ TwoDimensionalArray(R):Exports == Implementation where
   Implementation ==> InnerIndexedTwoDimensionalArray(R,1,1,Row,Col)
 
 @
+<<ARRAY2.dotabb>>=
+"ARRAY2" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ARRAY2"]
+"ARRAY2" -> "ARR2CAT"
+"ARRAY2" -> "A1AGG"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain VIEW2D TwoDimensionalViewport}
 <<TwoDimensionalViewport.help>>=
@@ -79727,7 +81173,6 @@ Finally we show the combined result
 
 See Also:
 o )show TwoDimensionalViewport
-o $AXIOM/doc/src/algebra/view2d.spad.dvi
 
 @
 \pagehead{TwoDimensionalViewport}{VIEW2D}
@@ -80376,6 +81821,11 @@ TwoDimensionalViewport ():Exports == Implementation where
           Filename
 
 @
+<<VIEW2D.dotabb>>=
+"VIEW2D" [color="#88FF44",href="bookvol10.3.pdf#nameddest=VIEW2D"]
+"VIEW2D" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter U}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -80388,6 +81838,11 @@ UnivariateFormalPowerSeries(Coef: Ring) ==
     UnivariateTaylorSeries(Coef, 'x, 0$Coef)
 
 @
+<<UFPS.dotabb>>=
+"UFPS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=UFPS"]
+"UFPS" -> "UTSCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ULS UnivariateLaurentSeries}
 \pagehead{UnivariateLaurentSeries}{ULS}
@@ -80449,6 +81904,11 @@ UnivariateLaurentSeries(Coef,var,cen): Exports == Implementation where
       integrate(x:%,v:Variable(var)) == integrate x
 
 @
+<<ULS.dotabb>>=
+"ULS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ULS"]
+"ULS" -> "ULSCCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ULSCONS UnivariateLaurentSeriesConstructor}
 \pagehead{UnivariateLaurentSeriesConstructor}{ULSCONS}
@@ -80904,6 +82364,12 @@ UnivariateLaurentSeriesConstructor(Coef,UTS):_
       termsToOutputForm(m,p,xxx)
 
 @
+<<ULSCONS.dotabb>>=
+"ULSCONS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ULSCONS"]
+"ULSCONS" -> "ULSCCAT"
+"ULSCONS" -> "ACFS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain UP UnivariatePolynomial}
 <<UnivariatePolynomial.input>>=
@@ -81530,7 +82996,6 @@ See Also:
 o )help MultivariatePolynomial
 o )help DistributedMultivariatePolynomial
 o )show UnivariatePolynomial
-o $AXIOM/doc/src/algebra/poly.spad.dvi
 
 @
 \pagehead{UnivariatePolynomial}{UP}
@@ -81570,6 +83035,11 @@ UnivariatePolynomial(x:Symbol, R:Ring):
     coerce(v:Variable(x)):% == monomial(1, 1)
 
 @
+<<UP.dotabb>>=
+"UP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=UP"]
+"UP" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain UPXS UnivariatePuiseuxSeries}
 \pagehead{UnivariatePuiseuxSeries}{UPXS}
@@ -81735,6 +83205,11 @@ UnivariatePuiseuxSeries(Coef,var,cen): Exports == Implementation where
       termsToOutputForm(m,rat,p,xxx)
 
 @
+<<UPXS.dotabb>>=
+"UPXS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=UPXS"]
+"UPXS" -> "ULSCCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain UPXSCONS UnivariatePuiseuxSeriesConstructor}
 \pagehead{UnivariatePuiseuxSeriesConstructor}{UPXSCONS}
@@ -82088,6 +83563,11 @@ UnivariatePuiseuxSeriesConstructor(Coef,ULS):_
       acsch upxs == applyUnary(acsch,upxs)
 
 @
+<<UPXSCONS.dotabb>>=
+"UPXSCONS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=UPXSCONS"]
+"UPXSCONS" -> "ACFS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain UPXSSING UnivariatePuiseuxSeriesWithExponentialSingularity}
 \pagehead{UnivariatePuiseuxSeriesWithExponentialSingularity}{UPXSSING}
@@ -82374,6 +83854,12 @@ UnivariatePuiseuxSeriesWithExponentialSingularity(R,FE,var,cen):_
       minusInfinity()
 
 @
+<<UPXSSING.dotabb>>=
+"UPXSSING" [color="#88FF44",href="bookvol10.3.pdf#nameddest=UPXSSING"]
+"UPXSSING" -> "ACF"
+"UPXSSING" -> "FS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain OREUP UnivariateSkewPolynomial}
 \pagehead{UnivariateSkewPolynomial}{OREUP}
@@ -82400,6 +83886,11 @@ UnivariateSkewPolynomial(x:Symbol, R:Ring, sigma:Automorphism R, delta: R -> R):
      coerce(p:%):OutputForm  == outputForm(p, outputForm x)$Rep
 
 @
+<<OREUP.dotabb>>=
+"OREUP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OREUP"]
+"OREUP" -> "OREPCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain UTS UnivariateTaylorSeries}
 \pagehead{UnivariateTaylorSeries}{UTS}
@@ -82668,6 +84159,11 @@ UnivariateTaylorSeries(Coef,var,cen): Exports == Implementation where
 --  We use the default coerce: % -> OutputForm in UTSCAT&
 
 @
+<<UTS.dotabb>>=
+"UTS" [color="#88FF44",href="bookvol10.3.pdf#nameddest=UTS"]
+"UTS" -> "ACFS"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain UNISEG UniversalSegment}
 <<UniversalSegment.input>>=
@@ -82809,7 +84305,6 @@ o )help SegmentBinding
 o )help List
 o )help Stream
 o )show UniversalSegment
-o $AXIOM/doc/src/algebra/seg.spad.dvi
 
 @
 \pagehead{UniversalSegment}{UNISEG}
@@ -82943,6 +84438,11 @@ UniversalSegment(S: Type): SegmentCategory(S) with
         concat(construct expand(lb),  st)
 
 @
+<<UNISEG.dotabb>>=
+"UNISEG" [color="#88FF44",href="bookvol10.3.pdf#nameddest=UNISEG"]
+"UNISEG" -> "FLAGG-"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter V}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -82966,6 +84466,11 @@ Variable(sym:Symbol): Join(SetCategory, CoercibleTo Symbol) with
         latex(x:%):String      == latex sym
 
 @
+<<VARIABLE.dotabb>>=
+"VARIABLE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=VARIABLE"]
+"VARIABLE" -> "ALIST"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain VECTOR Vector}
 <<Vector.input>>=
@@ -83159,7 +84664,6 @@ o )help Set
 o )help Table
 o )help TwoDimensionalArray
 o )show Vector
-o $AXIOM/doc/src/algebra/vector.spad.dvi
 
 @
 \pagehead{Vector}{VECTOR}
@@ -83194,6 +84698,12 @@ Vector(R:Type): Exports == Implementation where
                           convert(parts x)@InputForm]
 
 @
+<<VECTOR.dotabb>>=
+"VECTOR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=VECTOR",
+          shape=ellipse]
+"VECTOR" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain VOID Void}
 <<Void.input>>=
@@ -83288,7 +84798,6 @@ Once a value has been converted to Void, it cannot be recovered.
 
 See Also:
 o )show Void
-o $AXIOM/doc/src/algebra/void.spad.dvi
 
 @
 \pagehead{Void}{VOID}
@@ -83324,6 +84833,11 @@ Void: with
         coerce(v:%) == coerce(v)$Rep
 
 @
+<<VOID.dotabb>>=
+"VOID" [color="#88FF44",href="bookvol10.3.pdf#nameddest=VOID"]
+"VOID" -> "STRING"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter W}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -83433,6 +84947,11 @@ WeightedPolynomials(R:Ring,VarSet: OrderedSet, E:OrderedAbelianMonoidSup,
      w
 
 @
+<<WP.dotabb>>=
+"WP" [color="#88FF44",href="bookvol10.3.pdf#nameddest=WP"]
+"WP" -> "PFECAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain WUTSET WuWenTsunTriangularSet}
 <<WuWenTsunTriangularSet.input>>=
@@ -83742,7 +85261,6 @@ o )help SquareFreeRegularTriangularSet
 o )help LazardSetSolvingPackage
 o )help ZeroDimensionalSolvePackage
 o )show WuWenTsunTriangularSet
-o $AXIOM/doc/src/algebra/triset.spad.dvi
 
 @
 \pagehead{WuWenTsunTriangularSet}{WUTSET}
@@ -83992,6 +85510,11 @@ WuWenTsunTriangularSet(R,E,V,P) : Exports == Implementation where
          sort(infRittWu?, removeDuplicates lts)
 
 @
+<<WUTSET.dotabb>>=
+"WUTSET" [color="#88FF44",href="bookvol10.3.pdf#nameddest=WUTSET"]
+"WUTSET" -> "RPOLCAT"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter X}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -84112,6 +85635,11 @@ XDistributedPolynomial(vl:OrderedSet,R:Ring): XDPcat == XDPdef where
          return p.first.c * q.first.c + coef(p.rest,q.rest)
 
 @
+<<XDPOLY.dotabb>>=
+"XDPOLY" [color="#88FF44",href="bookvol10.3.pdf#nameddest=XDPOLY"]
+"XDPOLY" -> "XPOLYC"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain XPBWPOLY XPBWPolynomial}
 <<XPBWPolynomial.input>>=
@@ -84949,7 +86477,6 @@ Calculations with verification in XRecursivePolynomial.
 
 See Also:
 o )show XPBWPolynomial
-o $AXIOM/doc/src/algebra/xlpoly.spad.dvi
 
 @
 \pagehead{XPBWPolynomial}{XPBWPOLY}
@@ -85186,6 +86713,11 @@ XPBWPolynomial(VarSet:OrderedSet,R:CommutativeRing): XDPcat == XDPdef where
          +/ [t.c * mirror1(t.k) for t in p]
 
 @
+<<XPBWPOLY.dotabb>>=
+"XPBWPOLY" [color="#88FF44",href="bookvol10.3.pdf#nameddest=XPBWPOLY"]
+"XPBWPOLY" -> "XPOLYC"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain XPOLY XPolynomial}
 <<XPolynomial.input>>=
@@ -85437,7 +86969,6 @@ o )help XDistributedPolynomial
 o )help XRecursivePolynomial
 o )help XPolynomialRing
 o )show XPolynomial
-o $AXIOM/doc/src/algebra/xpoly.spad.dvi
 
 @
 \pagehead{XPolynomial}{XPOLY}
@@ -85467,6 +86998,11 @@ o $AXIOM/doc/src/algebra/xpoly.spad.dvi
 XPolynomial(R:Ring) == XRecursivePolynomial(Symbol, R)
 
 @
+<<XPOLY.dotabb>>=
+"XPOLY" [color="#88FF44",href="bookvol10.3.pdf#nameddest=XPOLY"]
+"XPOLY" -> "XPOLYC"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain XPR XPolynomialRing}
 <<XPolynomialRing.input>>=
@@ -85849,7 +87385,6 @@ o )help XDistributedPolynomial
 o )help XRecursivePolynomial
 o )help XPolynomial
 o )show XPolynomialRing
-o $AXIOM/doc/src/algebra/xpoly.spad.dvi
 
 @
 \pagehead{XPolynomialRing}{XPR}
@@ -86012,6 +87547,13 @@ XPolynomialRing(R:Ring,E:OrderedMonoid): T == C where
           x/r == inv(r)*x
 
 @
+<<XPR.dotabb>>=
+"XPR" [color="#88FF44",href="bookvol10.3.pdf#nameddest=XPR"]
+"XPR" -> "FLAGG"
+"XPR" -> "FLAGG-"
+"XPR" -> "FIELD"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain XRPOLY XRecursivePolynomial}
 Polynomial arithmetic with non-commutative variables has been improved
@@ -86308,6 +87850,11 @@ XRecursivePolynomial(VarSet:OrderedSet,R:Ring):  Xcat == Xdef where
          sort_!(lv)
 
 @
+<<XRPOLY.dotabb>>=
+"XRPOLY" [color="#88FF44",href="bookvol10.3.pdf#nameddest=XRPOLY"]
+"XRPOLY" -> "XPOLYC"
+
+@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapter{Chapter Y}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
diff --git a/changelog b/changelog
index 3440db0..4598d8f 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20090110 tpd src/axiom-website/patches.html 20090110.01.tpd.patch
+20090110 tpd books/bookvol10.3 add dotabb chunks
 20090103 tpd src/axiom-website/patches.html 20090103.01.tpd.patch
 20090103 tpd src/algebra/Makefile merge layerpic graphviz data
 20081231 tpd src/axiom-website/patches.html 20081231.01.tpd.patch
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 5026b4d..b83e712 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -871,6 +871,8 @@ CATS Kamke test suite uploaded<br/>
 hp build order graph fixes<br/>
 <a href="patches/20090103.01.tpd.patch">20090103.01.tpd.patch</a>
 algebra/Makefile merge layerpic graphviz data<br/>
+<a href="patches/20090110.01.tpd.patch">20090110.01.tpd.patch</a>
+bookvol10.3 add dotabb chunks<br/>
 
  </body>
 </html>

\start
Date: Mon, 12 Jan 2009 22:10:13 -0600
From: Tim Daly
To: list
Subject: 20090112.02.tpd.patch (bookvol10.3 redraw graphs based on dotabb)

Documentation provided for graphs for each domain.

Patch is too large to post. See
http://axiom-developer.org/axiom-website/patches.html#latest

\start
Date: Tue, 13 Jan 2009 14:15:10 -0600
From: Tim Daly
To: list
Subject: 20090113.01.tpd.patch (bookvol10.3 begin adding exports)

Export information for each domain is being added.
=========================================================================
diff --git a/books/bookvol10.3.pamphlet b/books/bookvol10.3.pamphlet
index 7634b88..5073503 100644
--- a/books/bookvol10.3.pamphlet
+++ b/books/bookvol10.3.pamphlet
@@ -306,6 +306,82 @@ where this information is maintained.
 \section{domain ALGSC AlgebraGivenByStructuralConstants}
 \pagehead{AlgebraGivenByStructuralConstants}{ALGSC}
 \pagepic{ps/v103algebragivenbystructuralconstants.ps}{ALGSC}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{ALGSC}{0} &
+\cross{ALGSC}{alternative?} \\
+\cross{ALGSC}{antiAssociative?} &
+\cross{ALGSC}{antiCommutative?} \\
+\cross{ALGSC}{antiCommutator} &
+\cross{ALGSC}{apply} \\
+\cross{ALGSC}{associative?} &
+\cross{ALGSC}{associator} \\
+\cross{ALGSC}{associatorDependence} &
+\cross{ALGSC}{basis} \\
+\cross{ALGSC}{coerce} &
+\cross{ALGSC}{commutative?} \\
+\cross{ALGSC}{commutator} &
+\cross{ALGSC}{conditionsForIdempotents} \\
+\cross{ALGSC}{convert} &
+\cross{ALGSC}{coordinates} \\
+\cross{ALGSC}{flexible?} &
+\cross{ALGSC}{hash} \\
+\cross{ALGSC}{jacobiIdentity?} &
+\cross{ALGSC}{jordanAdmissible?} \\
+\cross{ALGSC}{jordanAlgebra?} &
+\cross{ALGSC}{latex} \\
+\cross{ALGSC}{leftAlternative?} &
+\cross{ALGSC}{leftCharacteristicPolynomial} \\
+\cross{ALGSC}{leftDiscriminant} &
+\cross{ALGSC}{leftMinimalPolynomial} \\
+\cross{ALGSC}{leftNorm} &
+\cross{ALGSC}{leftPower} \\
+\cross{ALGSC}{leftRankPolynomial} &
+\cross{ALGSC}{leftRecip} \\
+\cross{ALGSC}{leftRegularRepresentation} &
+\cross{ALGSC}{leftTrace} \\
+\cross{ALGSC}{leftTraceMatrix} &
+\cross{ALGSC}{leftUnit} \\
+\cross{ALGSC}{leftUnits} &
+\cross{ALGSC}{lieAdmissible?} \\
+\cross{ALGSC}{lieAlgebra?} &
+\cross{ALGSC}{noncommutativeJordanAlgebra?} \\
+\cross{ALGSC}{plenaryPower} &
+\cross{ALGSC}{powerAssociative?} \\
+\cross{ALGSC}{rank} &
+\cross{ALGSC}{recip} \\
+\cross{ALGSC}{represents} &
+\cross{ALGSC}{rightAlternative?} \\
+\cross{ALGSC}{rightCharacteristicPolynomial} &
+\cross{ALGSC}{rightDiscriminant} \\
+\cross{ALGSC}{rightMinimalPolynomial} &
+\cross{ALGSC}{rightNorm} \\
+\cross{ALGSC}{rightPower} &
+\cross{ALGSC}{rightRankPolynomial} \\
+\cross{ALGSC}{rightRecip} &
+\cross{ALGSC}{rightRegularRepresentation} \\
+\cross{ALGSC}{rightTrace} &
+\cross{ALGSC}{rightTraceMatrix} \\
+\cross{ALGSC}{rightUnit} &
+\cross{ALGSC}{rightUnits} \\
+\cross{ALGSC}{sample} &
+\cross{ALGSC}{someBasis} \\
+\cross{ALGSC}{structuralConstants} &
+\cross{ALGSC}{subtractIfCan} \\
+\cross{ALGSC}{unit} &
+\cross{ALGSC}{zero?} \\
+\cross{ALGSC}{?*?} &
+\cross{ALGSC}{?**?} \\
+\cross{ALGSC}{?+?} &
+\cross{ALGSC}{?-?} \\
+\cross{ALGSC}{-?} &
+\cross{ALGSC}{?=?} \\
+\cross{ALGSC}{?.?} &
+\cross{ALGSC}{?\~{}=?} \\
+\cross{ALGSC}{?*?} 
+\end{tabular}
+
 <<domain ALGSC AlgebraGivenByStructuralConstants>>=
 )abbrev domain ALGSC AlgebraGivenByStructuralConstants
 ++ Authors: J. Grabmeier, R. Wisbauer
@@ -705,8 +781,127 @@ AlgebraGivenByStructuralConstants(R:Field, n : PositiveInteger,_
 \section{domain ALGFF AlgebraicFunctionField}
 \pagehead{AlgebraicFunctionField}{ALGFF}
 \pagepic{ps/v103algebraicfunctionfield.ps}{ALGFF}{1.00}
-See also:\\
-\refto{RadicalFunctionField}{RADFF}
+{\bf See}\\
+\pageto{RadicalFunctionField}{RADFF}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{ALGFF}{1} &
+\cross{ALGFF}{0} &
+\cross{ALGFF}{absolutelyIrreducible?} \\
+\cross{ALGFF}{algSplitSimple} &
+\cross{ALGFF}{associates?} &
+\cross{ALGFF}{basis} \\
+\cross{ALGFF}{branchPoint?} &
+\cross{ALGFF}{branchPointAtInfinity?} &
+\cross{ALGFF}{characteristic} \\
+\cross{ALGFF}{characteristicPolynomial} &
+\cross{ALGFF}{charthRoot} &
+\cross{ALGFF}{coerce} \\
+\cross{ALGFF}{complementaryBasis} &
+\cross{ALGFF}{conditionP} &
+\cross{ALGFF}{convert} \\
+\cross{ALGFF}{coordinates} &
+\cross{ALGFF}{createPrimitiveElement} &
+\cross{ALGFF}{D} \\
+\cross{ALGFF}{definingPolynomial} &
+\cross{ALGFF}{derivationCoordinates} &
+\cross{ALGFF}{differentiate} \\
+\cross{ALGFF}{discreteLog} &
+\cross{ALGFF}{discriminant} &
+\cross{ALGFF}{divide} \\
+\cross{ALGFF}{elliptic} &
+\cross{ALGFF}{elt} &
+\cross{ALGFF}{euclideanSize} \\
+\cross{ALGFF}{expressIdealMember} &
+\cross{ALGFF}{exquo} &
+\cross{ALGFF}{extendedEuclidean} \\
+\cross{ALGFF}{factor} &
+\cross{ALGFF}{factorsOfCyclicGroupSize} &
+\cross{ALGFF}{gcd} \\
+\cross{ALGFF}{gcdPolynomial} &
+\cross{ALGFF}{generator} &
+\cross{ALGFF}{genus} \\
+\cross{ALGFF}{hash} &
+\cross{ALGFF}{hyperelliptic} &
+\cross{ALGFF}{index} \\
+\cross{ALGFF}{init} &
+\cross{ALGFF}{integral?} &
+\cross{ALGFF}{integralAtInfinity?} \\
+\cross{ALGFF}{integralBasis} &
+\cross{ALGFF}{integralBasisAtInfinity} &
+\cross{ALGFF}{integralCoordinates} \\
+\cross{ALGFF}{integralDerivationMatrix} &
+\cross{ALGFF}{integralMatrix} &
+\cross{ALGFF}{integralMatrixAtInfinity} \\
+\cross{ALGFF}{integralRepresents} &
+\cross{ALGFF}{inv} &
+\cross{ALGFF}{inverseIntegralMatrix} \\
+\cross{ALGFF}{inverseIntegralMatrixAtInfinity} &
+\cross{ALGFF}{knownInfBasis} &
+\cross{ALGFF}{latex} \\
+\cross{ALGFF}{lcm} &
+\cross{ALGFF}{lift} &
+\cross{ALGFF}{lookup} \\
+\cross{ALGFF}{minimalPolynomial} &
+\cross{ALGFF}{multiEuclidean} &
+\cross{ALGFF}{nextItem} \\
+\cross{ALGFF}{nonSingularModel} &
+\cross{ALGFF}{norm} &
+\cross{ALGFF}{normalizeAtInfinity} \\
+\cross{ALGFF}{numberOfComponents} &
+\cross{ALGFF}{one?} &
+\cross{ALGFF}{order} \\
+\cross{ALGFF}{prime?} &
+\cross{ALGFF}{primeFrobenius} &
+\cross{ALGFF}{primitive?} \\
+\cross{ALGFF}{primitiveElement} &
+\cross{ALGFF}{primitivePart} &
+\cross{ALGFF}{principalIdeal} \\
+\cross{ALGFF}{ramified?} &
+\cross{ALGFF}{ramifiedAtInfinity?} &
+\cross{ALGFF}{random} \\
+\cross{ALGFF}{rank} &
+\cross{ALGFF}{rationalPoint?} &
+\cross{ALGFF}{rationalPoints} \\
+\cross{ALGFF}{recip} &
+\cross{ALGFF}{reduce} &
+\cross{ALGFF}{reduceBasisAtInfinity} \\
+\cross{ALGFF}{reducedSystem} &
+\cross{ALGFF}{regularRepresentation} &
+\cross{ALGFF}{representationType} \\
+\cross{ALGFF}{represents} &
+\cross{ALGFF}{retract} &
+\cross{ALGFF}{retractIfCan} \\
+\cross{ALGFF}{sample} &
+\cross{ALGFF}{singular?} &
+\cross{ALGFF}{singularAtInfinity?} \\
+\cross{ALGFF}{size} &
+\cross{ALGFF}{sizeLess?} &
+\cross{ALGFF}{squareFree} \\
+\cross{ALGFF}{squareFreePart} &
+\cross{ALGFF}{subtractIfCan} &
+\cross{ALGFF}{tableForDiscreteLogarithm} \\
+\cross{ALGFF}{trace} &
+\cross{ALGFF}{traceMatrix} &
+\cross{ALGFF}{unit?} \\
+\cross{ALGFF}{unitCanonical} &
+\cross{ALGFF}{unitNormal} &
+\cross{ALGFF}{yCoordinates} \\
+\cross{ALGFF}{zero?} &
+\cross{ALGFF}{?*?} &
+\cross{ALGFF}{?**?} \\
+\cross{ALGFF}{?+?} &
+\cross{ALGFF}{?-?} &
+\cross{ALGFF}{-?} \\
+\cross{ALGFF}{?=?} &
+\cross{ALGFF}{?\^{}?} &
+\cross{ALGFF}{?\~{}=?} \\
+\cross{ALGFF}{?/?} &
+\cross{ALGFF}{?quo?} &
+\cross{ALGFF}{?rem?} \\
+\end{tabular}
+
 <<domain ALGFF AlgebraicFunctionField>>=
 )abbrev domain ALGFF AlgebraicFunctionField
 ++ Function field defined by f(x, y) = 0
@@ -856,8 +1051,98 @@ AlgebraicFunctionField(F, UP, UPUP, modulus): Exports == Impl where
 \section{domain AN AlgebraicNumber}
 \pagehead{AlgebraicNumber}{AN}
 \pagepic{ps/v103algebraicnumber.ps}{AN}{1.00}
-See also:\\
-\refto{InnerAlgebraicNumber}{IAN}
+{\bf See}\\
+\pageto{InnerAlgebraicNumber}{IAN}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{AN}{1} &
+\cross{AN}{0} &
+\cross{AN}{associates?} &
+\cross{AN}{belong?} \\
+\cross{AN}{box} &
+\cross{AN}{characteristic} &
+\cross{AN}{coerce} &
+\cross{AN}{convert} \\
+\cross{AN}{D} &
+\cross{AN}{definingPolynomial} &
+\cross{AN}{denom} &
+\cross{AN}{differentiate} \\
+\cross{AN}{distribute} &
+\cross{AN}{divide} &
+\cross{AN}{elt} &
+\cross{AN}{euclideanSize} \\
+\cross{AN}{eval} &
+\cross{AN}{even?} &
+\cross{AN}{expressIdealMember} &
+\cross{AN}{exquo} \\
+\cross{AN}{extendedEuclidean} &
+\cross{AN}{factor} &
+\cross{AN}{freeOf?} &
+\cross{AN}{gcd} \\
+\cross{AN}{gcdPolynomial} &
+\cross{AN}{hash} &
+\cross{AN}{height} &
+\cross{AN}{inv} \\
+\cross{AN}{is?} &
+\cross{AN}{kernel} &
+\cross{AN}{kernels} &
+\cross{AN}{latex} \\
+\cross{AN}{lcm} &
+\cross{AN}{mainKernel} &
+\cross{AN}{map} &
+\cross{AN}{max} \\
+\cross{AN}{min} &
+\cross{AN}{minPoly} &
+\cross{AN}{multiEuclidean} &
+\cross{AN}{norm} \\
+\cross{AN}{nthRoot} &
+\cross{AN}{numer} &
+\cross{AN}{odd?} &
+\cross{AN}{one?} \\
+\cross{AN}{operator} &
+\cross{AN}{operators} &
+\cross{AN}{paren} &
+\cross{AN}{prime?} \\
+\cross{AN}{principalIdeal} &
+\cross{AN}{recip} &
+\cross{AN}{reduce} &
+\cross{AN}{reducedSystem} \\
+\cross{AN}{retract} &
+\cross{AN}{retractIfCan} &
+\cross{AN}{rootOf} &
+\cross{AN}{rootsOf} \\
+\cross{AN}{sample} &
+\cross{AN}{sizeLess?} &
+\cross{AN}{sqrt} &
+\cross{AN}{squareFree} \\
+\cross{AN}{squareFreePart} &
+\cross{AN}{subst} &
+\cross{AN}{subtractIfCan} &
+\cross{AN}{tower} \\
+\cross{AN}{unit?} &
+\cross{AN}{unitCanonical} &
+\cross{AN}{unitNormal} &
+\cross{AN}{zero?} \\
+\cross{AN}{zeroOf} &
+\cross{AN}{zerosOf} &
+\cross{AN}{?*?} &
+\cross{AN}{?**?} \\
+\cross{AN}{?+?} &
+\cross{AN}{-?} &
+\cross{AN}{?-?} &
+\cross{AN}{?/?} \\
+\cross{AN}{?$<$?} &
+\cross{AN}{?$<=$?} &
+\cross{AN}{?=?} &
+\cross{AN}{?$>$?} \\
+\cross{AN}{?$>=$?} &
+\cross{AN}{?\^{}?} &
+\cross{AN}{?quo?} &
+\cross{AN}{?rem?} \\
+\cross{AN}{?\~{}=?} &&&
+\end{tabular}
+
 <<domain AN AlgebraicNumber>>=
 )abbrev domain AN AlgebraicNumber
 ++ Algebraic closure of the rational numbers
@@ -918,6 +1203,16 @@ AlgebraicNumber(): Exports == Implementation where
 \section{domain ANON AnonymousFunction}
 \pagehead{AnonymousFunction}{ANON}
 \pagepic{ps/v103anonymousfunction.ps}{ANON}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ANON}{coerce} &
+\cross{ANON}{hash} &
+\cross{ANON}{latex} &
+\cross{ANON}{?=?} &
+\cross{ANON}{?\~{}=?} 
+\end{tabular}
+
 <<domain ANON AnonymousFunction>>=
 )abbrev domain ANON AnonymousFunction
 ++ Description:
@@ -938,9 +1233,47 @@ AnonymousFunction():SetCategory == add
 \section{domain ANTISYM AntiSymm}
 \pagehead{AntiSymm}{ANTISYM}
 \pagepic{ps/v103antisymm.ps}{ANTISYM}{1.00}
-See also:\\
-\refto{ExtAlgBasis}{EAB}
-\refto{DeRhamComplex}{DERHAM}
+{\bf See}\\
+\pageto{ExtAlgBasis}{EAB}
+\pageto{DeRhamComplex}{DERHAM}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ANTISYM}{1} &
+\cross{ANTISYM}{0} &
+\cross{ANTISYM}{coefficient} &
+\cross{ANTISYM}{coerce} &
+\cross{ANTISYM}{coerce} \\
+\cross{ANTISYM}{coerce} &
+\cross{ANTISYM}{degree} &
+\cross{ANTISYM}{exp} &
+\cross{ANTISYM}{hash} &
+\cross{ANTISYM}{homogeneous?} \\
+\cross{ANTISYM}{latex} &
+\cross{ANTISYM}{leadingBasisTerm} &
+\cross{ANTISYM}{leadingCoefficient} &
+\cross{ANTISYM}{map} &
+\cross{ANTISYM}{one?} \\
+\cross{ANTISYM}{recip} &
+\cross{ANTISYM}{reductum} &
+\cross{ANTISYM}{retract} &
+\cross{ANTISYM}{retractable?} &
+\cross{ANTISYM}{sample} \\
+\cross{ANTISYM}{zero?} &
+\cross{ANTISYM}{characteristic} &
+\cross{ANTISYM}{generator} &
+\cross{ANTISYM}{retractIfCan} &
+\cross{ANTISYM}{subtractIfCan} \\
+\cross{ANTISYM}{?*?} &
+\cross{ANTISYM}{?**?} &
+\cross{ANTISYM}{?+?} &
+\cross{ANTISYM}{?-?} &
+\cross{ANTISYM}{-?} \\
+\cross{ANTISYM}{?=?} &
+\cross{ANTISYM}{?\^{}?} &
+\cross{ANTISYM}{?\~{}=?} &&
+\end{tabular}
+
 <<domain ANTISYM AntiSymm>>=
 )abbrev domain ANTISYM AntiSymm
 ++   Author: Larry A. Lambe
@@ -1149,8 +1482,24 @@ AntiSymm(R:Ring, lVar:List Symbol): Export == Implement where
 \section{domain ANY Any}
 \pagehead{Any}{ANY}
 \pagepic{ps/v103any.ps}{ANY}{1.00}
-See also:\\
-\refto{None}{NONE}
+{\bf See}\\
+\pageto{None}{NONE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ANY}{any} &
+\cross{ANY}{coerce} &
+\cross{ANY}{dom} &
+\cross{ANY}{domainOf} &
+\cross{ANY}{hash} \\
+\cross{ANY}{latex} &
+\cross{ANY}{obj} &
+\cross{ANY}{objectOf} &
+\cross{ANY}{showTypeInOutput} &
+\cross{ANY}{?=?} \\
+\cross{ANY}{?\~{}=?} &&&&
+\end{tabular}
+
 <<domain ANY Any>>=
 )abbrev domain ANY Any
 ++ Author: Robert S. Sutor
@@ -1241,11 +1590,48 @@ Any(): SetCategory with
 \section{domain ASTACK ArrayStack}
 \pagehead{ArrayStack}{ASTACK}
 \pagepic{ps/v103arraystack.ps}{ASTACK}{1.00}
-See also:\\
-\refto{Stack}{STACK}
-\refto{Queue}{QUEUE}
-\refto{Dequeue}{DEQUEUE}
-\refto{Heap}{HEAP}
+{\bf See}\\
+\pageto{Stack}{STACK}
+\pageto{Queue}{QUEUE}
+\pageto{Dequeue}{DEQUEUE}
+\pageto{Heap}{HEAP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ASTACK}{any?} &
+\cross{ASTACK}{arrayStack} &
+\cross{ASTACK}{bag} &
+\cross{ASTACK}{coerce} &
+\cross{ASTACK}{copy} \\
+\cross{ASTACK}{count} &
+\cross{ASTACK}{depth} &
+\cross{ASTACK}{empty} &
+\cross{ASTACK}{empty?} &
+\cross{ASTACK}{eq?} \\
+\cross{ASTACK}{eval} &
+\cross{ASTACK}{every?} &
+\cross{ASTACK}{extract!} &
+\cross{ASTACK}{hash} &
+\cross{ASTACK}{insert!} \\
+\cross{ASTACK}{inspect} &
+\cross{ASTACK}{latex} &
+\cross{ASTACK}{less?} &
+\cross{ASTACK}{map} &
+\cross{ASTACK}{map!} \\
+\cross{ASTACK}{member?} &
+\cross{ASTACK}{members} &
+\cross{ASTACK}{more?} &
+\cross{ASTACK}{parts} &
+\cross{ASTACK}{pop!} \\
+\cross{ASTACK}{push!} &
+\cross{ASTACK}{sample} &
+\cross{ASTACK}{size?} &
+\cross{ASTACK}{top} &
+\cross{ASTACK}{\#{}?} \\
+\cross{ASTACK}{?\~{}=?} &
+\cross{ASTACK}{?=?} &&&
+\end{tabular}
+
 <<domain ASTACK ArrayStack>>=
 )abbrev domain ASTACK ArrayStack
 ++ Author: Michael Monagan and Stephen Watt
@@ -1308,6 +1694,15 @@ ArrayStack(S:SetCategory): StackAggregate(S) with
 \section{domain ASP1 Asp1}
 \pagehead{Asp1}{ASP1}
 \pagepic{ps/v103asp1.ps}{ASP1}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP1}{coerce} &
+\cross{ASP1}{outputAsFortran} &
+\cross{ASP1}{retract} &
+\cross{ASP1}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP1 Asp1>>=
 )abbrev domain ASP1 Asp1
 ++ Author: Mike Dewar, Grant Keady, Godfrey Nolan
@@ -1425,6 +1820,15 @@ Asp1(name): Exports == Implementation where
 \section{domain ASP10 Asp10}
 \pagehead{Asp10}{ASP10}
 \pagepic{ps/v103asp10.ps}{ASP10}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP10}{coerce} &
+\cross{ASP10}{outputAsFortran} &
+\cross{ASP10}{retract} &
+\cross{ASP10}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP10 Asp10>>=
 )abbrev domain ASP10 Asp10
 ++ Author: Mike Dewar and Godfrey Nolan
@@ -1572,6 +1976,13 @@ Asp10(name): Exports == Implementation where
 \section{domain ASP12 Asp12}
 \pagehead{Asp12}{ASP12}
 \pagepic{ps/v103asp12.ps}{ASP12}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{ASP12}{coerce} &
+\cross{ASP12}{outputAsFortran} 
+\end{tabular}
+
 <<domain ASP12 Asp12>>=
 )abbrev domain ASP12 Asp12
 ++ Author: Mike Dewar and Godfrey Nolan
@@ -1648,6 +2059,15 @@ Asp12(name): Exports == Implementation where
 \section{domain ASP19 Asp19}
 \pagehead{Asp19}{ASP19}
 \pagepic{ps/v103asp19.ps}{ASP19}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP19}{coerce} &
+\cross{ASP19}{outputAsFortran} &
+\cross{ASP19}{retract} &
+\cross{ASP19}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP19 Asp19>>=
 )abbrev domain ASP19 Asp19
 ++ Author: Mike Dewar, Godfrey Nolan, Grant Keady
@@ -1929,6 +2349,15 @@ Asp19(name): Exports == Implementation where
 \section{domain ASP20 Asp20}
 \pagehead{Asp20}{ASP20}
 \pagepic{ps/v103asp20.ps}{ASP20}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP20}{coerce} &
+\cross{ASP20}{outputAsFortran} &
+\cross{ASP20}{retract} &
+\cross{ASP20}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP20 Asp20>>=
 )abbrev domain ASP20 Asp20
 ++ Author: Mike Dewar and Godfrey Nolan and Grant Keady
@@ -2102,6 +2531,15 @@ Asp20(name): Exports == Implementation where
 \section{domain ASP24 Asp24}
 \pagehead{Asp24}{ASP24}
 \pagepic{ps/v103asp24.ps}{ASP24}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP20}{coerce} &
+\cross{ASP20}{outputAsFortran} &
+\cross{ASP20}{retract} &
+\cross{ASP20}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP24 Asp24>>=
 )abbrev domain ASP24 Asp24
 ++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
@@ -2226,6 +2664,13 @@ Asp24(name): Exports == Implementation where
 \section{domain ASP27 Asp27}
 \pagehead{Asp27}{ASP27}
 \pagepic{ps/v103asp27.ps}{ASP27}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{ASP27}{coerce} &
+\cross{ASP27}{outputAsFortran}
+\end{tabular}
+
 <<domain ASP27 Asp27>>=
 )abbrev domain ASP27 Asp27
 ++ Author: Mike Dewar and Godfrey Nolan
@@ -2332,6 +2777,13 @@ Asp27(name): Exports == Implementation where
 \section{domain ASP28 Asp28}
 \pagehead{Asp28}{ASP28}
 \pagepic{ps/v103asp28.ps}{ASP28}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ASP28}{coerce} &
+\cross{ASP28}{outputAsFortran}
+\end{tabular}
+
 <<domain ASP28 Asp28>>=
 )abbrev domain ASP28 Asp28
 ++ Author: Mike Dewar
@@ -2549,6 +3001,13 @@ Asp28(name): Exports == Implementation where
 \section{domain ASP29 Asp29}
 \pagehead{Asp29}{ASP29}
 \pagepic{ps/v103asp29.ps}{ASP29}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{ASP29}{coerce} &
+\cross{ASP29}{outputAsFortran}
+\end{tabular}
+
 <<domain ASP29 Asp29>>=
 )abbrev domain ASP29 Asp29
 ++ Author: Mike Dewar and Godfrey Nolan
@@ -2629,6 +3088,13 @@ Asp29(name): Exports == Implementation where
 \section{domain ASP30 Asp30}
 \pagehead{Asp30}{ASP30}
 \pagepic{ps/v103asp30.ps}{ASP30}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{ASP30}{coerce} &
+\cross{ASP30}{outputAsFortran}
+\end{tabular}
+
 <<domain ASP30 Asp30>>=
 )abbrev domain ASP30 Asp30
 ++ Author: Mike Dewar and Godfrey Nolan
@@ -2765,6 +3231,15 @@ Asp30(name): Exports == Implementation where
 \section{domain ASP31 Asp31}
 \pagehead{Asp31}{ASP31}
 \pagepic{ps/v103asp31.ps}{ASP31}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP31}{coerce} &
+\cross{ASP31}{outputAsFortran} &
+\cross{ASP31}{retract} &
+\cross{ASP31}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP31 Asp31>>=
 )abbrev domain ASP31 Asp31
 ++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
@@ -2935,6 +3410,13 @@ Asp31(name): Exports == Implementation where
 \section{domain ASP33 Asp33}
 \pagehead{Asp33}{ASP33}
 \pagepic{ps/v103asp33.ps}{ASP33}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{ASP33}{coerce} &
+\cross{ASP33}{outputAsFortran}
+\end{tabular}
+
 <<domain ASP33 Asp33>>=
 )abbrev domain ASP33 Asp33
 ++ Author: Mike Dewar and Godfrey Nolan
@@ -2995,6 +3477,13 @@ Asp33(name): Exports == Implementation where
 \section{domain ASP34 Asp34}
 \pagehead{Asp34}{ASP34}
 \pagepic{ps/v103asp34.ps}{ASP34}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{ASP34}{coerce} &
+\cross{ASP34}{outputAsFortran}
+\end{tabular}
+
 <<domain ASP34 Asp34>>=
 )abbrev domain ASP34 Asp34
 ++ Author: Mike Dewar and Godfrey Nolan
@@ -3103,6 +3592,15 @@ Asp34(name): Exports == Implementation where
 \section{domain ASP35 Asp35}
 \pagehead{Asp35}{ASP35}
 \pagepic{ps/v103asp35.ps}{ASP35}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP35}{coerce} &
+\cross{ASP35}{outputAsFortran} &
+\cross{ASP35}{retract} &
+\cross{ASP35}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP35 Asp35>>=
 )abbrev domain ASP35 Asp35
 ++ Author: Mike Dewar, Godfrey Nolan, Grant Keady
@@ -3283,6 +3781,15 @@ Asp35(name): Exports == Implementation where
 \section{domain ASP4 Asp4}
 \pagehead{Asp4}{ASP4}
 \pagepic{ps/v103asp4.ps}{ASP4}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ASP4}{coerce} &
+\cross{ASP4}{outputAsFortran} &
+\cross{ASP4}{retract} &
+\cross{ASP4}{retractIfCan} &
+\end{tabular}
+
 <<domain ASP4 Asp4>>=
 )abbrev domain ASP4 Asp4
 ++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
@@ -3401,6 +3908,15 @@ Asp4(name): Exports == Implementation where
 \section{domain ASP41 Asp41}
 \pagehead{Asp41}{ASP41}
 \pagepic{ps/v103asp41.ps}{ASP41}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP41}{coerce} &
+\cross{ASP41}{outputAsFortran} &
+\cross{ASP41}{retract} &
+\cross{ASP41}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP41 Asp41>>=
 )abbrev domain ASP41 Asp41
 ++ Author: Mike Dewar, Godfrey Nolan
@@ -3629,6 +4145,15 @@ Asp41(nameOne,nameTwo,nameThree): Exports == Implementation where
 \section{domain ASP42 Asp42}
 \pagehead{Asp42}{ASP42}
 \pagepic{ps/v103asp42.ps}{ASP42}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP42}{coerce} &
+\cross{ASP42}{outputAsFortran} &
+\cross{ASP42}{retract} &
+\cross{ASP42}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP42 Asp42>>=
 )abbrev domain ASP42 Asp42
 ++ Author: Mike Dewar, Godfrey Nolan
@@ -3877,6 +4402,15 @@ Asp42(nameOne,nameTwo,nameThree): Exports == Implementation where
 \section{domain ASP49 Asp49}
 \pagehead{Asp49}{ASP49}
 \pagepic{ps/v103asp49.ps}{ASP49}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP49}{coerce} &
+\cross{ASP49}{outputAsFortran} &
+\cross{ASP49}{retract} &
+\cross{ASP49}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP49 Asp49>>=
 )abbrev domain ASP49 Asp49
 ++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
@@ -4031,6 +4565,15 @@ Asp49(name): Exports == Implementation where
 \section{domain ASP50 Asp50}
 \pagehead{Asp50}{ASP50}
 \pagepic{ps/v103asp50.ps}{ASP50}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP50}{coerce} &
+\cross{ASP50}{outputAsFortran} &
+\cross{ASP50}{retract} &
+\cross{ASP50}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP50 Asp50>>=
 )abbrev domain ASP50 Asp50
 ++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
@@ -4201,6 +4744,15 @@ Asp50(name): Exports == Implementation where
 \section{domain ASP55 Asp55}
 \pagehead{Asp55}{ASP55}
 \pagepic{ps/v103asp55.ps}{ASP55}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP55}{coerce} &
+\cross{ASP55}{outputAsFortran} &
+\cross{ASP55}{retract} &
+\cross{ASP55}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP55 Asp55>>=
 )abbrev domain ASP55 Asp55
 ++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
@@ -4414,6 +4966,15 @@ Asp55(name): Exports == Implementation where
 \section{domain ASP6 Asp6}
 \pagehead{Asp6}{ASP6}
 \pagepic{ps/v103asp6.ps}{ASP6}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP6}{coerce} &
+\cross{ASP6}{outputAsFortran} &
+\cross{ASP6}{retract} &
+\cross{ASP6}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP6 Asp6>>=
 )abbrev domain ASP6 Asp6
 ++ Author: Mike Dewar and Godfrey Nolan and Grant Keady
@@ -4570,6 +5131,15 @@ Asp6(name): Exports == Implementation where
 \section{domain ASP7 Asp7}
 \pagehead{Asp7}{ASP7}
 \pagepic{ps/v103asp7.ps}{ASP7}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP7}{coerce} &
+\cross{ASP7}{outputAsFortran} &
+\cross{ASP7}{retract} &
+\cross{ASP7}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP7 Asp7>>=
 )abbrev domain ASP7 Asp7
 ++ Author: Mike Dewar and Godfrey Nolan and Grant Keady
@@ -4712,6 +5282,15 @@ Asp7(name): Exports == Implementation where
 \section{domain ASP73 Asp73}
 \pagehead{Asp73}{ASP73}
 \pagepic{ps/v103asp73.ps}{ASP73}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP73}{coerce} &
+\cross{ASP73}{outputAsFortran} &
+\cross{ASP73}{retract} &
+\cross{ASP73}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP73 Asp73>>=
 )abbrev domain ASP73 Asp73
 ++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
@@ -4866,6 +5445,15 @@ Asp73(name): Exports == Implementation where
 \section{domain ASP74 Asp74}
 \pagehead{Asp74}{ASP74}
 \pagepic{ps/v103asp74.ps}{ASP74}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP74}{coerce} &
+\cross{ASP74}{outputAsFortran} &
+\cross{ASP74}{retract} &
+\cross{ASP74}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP74 Asp74>>=
 )abbrev domain ASP74 Asp74
 ++ Author: Mike Dewar and Godfrey Nolan
@@ -5061,6 +5649,15 @@ Asp74(name): Exports == Implementation where
 \section{domain ASP77 Asp77}
 \pagehead{Asp77}{ASP77}
 \pagepic{ps/v103asp77.ps}{ASP77}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP77}{coerce} &
+\cross{ASP77}{outputAsFortran} &
+\cross{ASP77}{retract} &
+\cross{ASP77}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP77 Asp77>>=
 )abbrev domain ASP77 Asp77
 ++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
@@ -5221,6 +5818,15 @@ Asp77(name): Exports == Implementation where
 \section{domain ASP78 Asp78}
 \pagehead{Asp78}{ASP78}
 \pagepic{ps/v103asp78.ps}{ASP78}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP78}{coerce} &
+\cross{ASP78}{outputAsFortran} &
+\cross{ASP78}{retract} &
+\cross{ASP78}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP78 Asp78>>=
 )abbrev domain ASP78 Asp78
 ++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
@@ -5356,6 +5962,13 @@ Asp78(name): Exports == Implementation where
 \section{domain ASP8 Asp8}
 \pagehead{Asp8}{ASP8}
 \pagepic{ps/v103asp8.ps}{ASP8}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{ASP8}{coerce} &
+\cross{ASP8}{outputAsFortran} 
+\end{tabular}
+
 <<domain ASP8 Asp8>>=
 )abbrev domain ASP8 Asp8
 ++ Author: Godfrey Nolan and Mike Dewar
@@ -5492,6 +6105,15 @@ Asp8(name): Exports == Implementation where
 \section{domain ASP80 Asp80}
 \pagehead{Asp80}{ASP80}
 \pagepic{ps/v103asp80.ps}{ASP80}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP80}{coerce} &
+\cross{ASP80}{outputAsFortran} &
+\cross{ASP80}{retract} &
+\cross{ASP80}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP80 Asp80>>=
 )abbrev domain ASP80 Asp80
 ++ Author: Mike Dewar and Godfrey Nolan
@@ -5650,6 +6272,15 @@ Asp80(name): Exports == Implementation where
 \section{domain ASP9 Asp9}
 \pagehead{Asp9}{ASP9}
 \pagepic{ps/v103asp9.ps}{ASP9}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ASP9}{coerce} &
+\cross{ASP9}{outputAsFortran} &
+\cross{ASP9}{retract} &
+\cross{ASP9}{retractIfCan} 
+\end{tabular}
+
 <<domain ASP9 Asp9>>=
 )abbrev domain ASP9 Asp9
 ++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
@@ -5787,9 +6418,84 @@ Asp9(name): Exports == Implementation where
 \section{domain JORDAN AssociatedJordanAlgebra}
 \pagehead{AssociatedJordanAlgebra}{JORDAN}
 \pagepic{ps/v103associatedjordanalgebra.ps}{JORDAN}{1.00}
-See also:\\
-\refto{AssociatedLieAlgebra}{LIE}
-\refto{LieSquareMatrix}{LSQM}
+{\bf See}\\
+\pageto{AssociatedLieAlgebra}{LIE}
+\pageto{LieSquareMatrix}{LSQM}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{JORDAN}{0} &
+\cross{JORDAN}{alternative?} \\
+\cross{JORDAN}{antiAssociative?} &
+\cross{JORDAN}{antiCommutative?} \\
+\cross{JORDAN}{antiCommutator} &
+\cross{JORDAN}{apply} \\
+\cross{JORDAN}{associative?} &
+\cross{JORDAN}{associator} \\
+\cross{JORDAN}{associatorDependence} &
+\cross{JORDAN}{basis} \\
+\cross{JORDAN}{coerce} &
+\cross{JORDAN}{commutative?} \\
+\cross{JORDAN}{commutator} &
+\cross{JORDAN}{conditionsForIdempotents} \\
+\cross{JORDAN}{convert} &
+\cross{JORDAN}{coordinates} \\
+\cross{JORDAN}{flexible?} &
+\cross{JORDAN}{hash} \\
+\cross{JORDAN}{jacobiIdentity?} &
+\cross{JORDAN}{jordanAdmissible?} \\
+\cross{JORDAN}{jordanAlgebra?} &
+\cross{JORDAN}{latex} \\
+\cross{JORDAN}{leftAlternative?} &
+\cross{JORDAN}{leftCharacteristicPolynomial} \\
+\cross{JORDAN}{leftDiscriminant} &
+\cross{JORDAN}{leftMinimalPolynomial} \\
+\cross{JORDAN}{leftNorm} &
+\cross{JORDAN}{leftPower} \\
+\cross{JORDAN}{leftRankPolynomial} &
+\cross{JORDAN}{leftRecip} \\
+\cross{JORDAN}{leftRegularRepresentation} &
+\cross{JORDAN}{leftTrace} \\
+\cross{JORDAN}{leftTraceMatrix} &
+\cross{JORDAN}{leftUnit} \\
+\cross{JORDAN}{leftUnits} &
+\cross{JORDAN}{lieAdmissible?} \\
+\cross{JORDAN}{lieAlgebra?} &
+\cross{JORDAN}{noncommutativeJordanAlgebra?} \\
+\cross{JORDAN}{plenaryPower} &
+\cross{JORDAN}{powerAssociative?} \\
+\cross{JORDAN}{rank} &
+\cross{JORDAN}{recip} \\
+\cross{JORDAN}{represents} &
+\cross{JORDAN}{rightAlternative?} \\
+\cross{JORDAN}{rightCharacteristicPolynomial} &
+\cross{JORDAN}{rightDiscriminant} \\
+\cross{JORDAN}{rightMinimalPolynomial} &
+\cross{JORDAN}{rightNorm} \\
+\cross{JORDAN}{rightPower} &
+\cross{JORDAN}{rightRankPolynomial} \\
+\cross{JORDAN}{rightRecip} &
+\cross{JORDAN}{rightRegularRepresentation} \\
+\cross{JORDAN}{rightTrace} &
+\cross{JORDAN}{rightTraceMatrix} \\
+\cross{JORDAN}{rightUnit} &
+\cross{JORDAN}{rightUnits} \\
+\cross{JORDAN}{sample} &
+\cross{JORDAN}{someBasis} \\
+\cross{JORDAN}{structuralConstants} &
+\cross{JORDAN}{subtractIfCan} \\
+\cross{JORDAN}{unit} &
+\cross{JORDAN}{zero?} \\
+\cross{JORDAN}{?*?} &
+\cross{JORDAN}{?**?} \\
+\cross{JORDAN}{?+?} &
+\cross{JORDAN}{?-?} \\
+\cross{JORDAN}{-?} &
+\cross{JORDAN}{?=?} \\
+\cross{JORDAN}{?\~{}=?} &
+\cross{JORDAN}{?.?} 
+\end{tabular}
+
 <<domain JORDAN AssociatedJordanAlgebra>>=
 )abbrev domain JORDAN AssociatedJordanAlgebra
 ++ Author: J. Grabmeier
@@ -5859,9 +6565,86 @@ AssociatedJordanAlgebra(R:CommutativeRing,A:NonAssociativeAlgebra R):
 \section{domain LIE AssociatedLieAlgebra}
 \pagehead{AssociatedLieAlgebra}{LIE}
 \pagepic{ps/v103associatedliealgebra.ps}{LIE}{1.00}
-See also:\\
-\refto{AssociatedJordanAlgebra}{JORDAN}
-\refto{LieSquareMatrix}{LSQM}
+{\bf See}\\
+\pageto{AssociatedJordanAlgebra}{JORDAN}
+\pageto{LieSquareMatrix}{LSQM}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{LIE}{0} &
+\cross{LIE}{alternative?} &
+\cross{LIE}{antiAssociative?} \\
+\cross{LIE}{antiCommutative?} &
+\cross{LIE}{antiCommutator} &
+\cross{LIE}{apply} \\
+\cross{LIE}{associative?} &
+\cross{LIE}{associator} &
+\cross{LIE}{associatorDependence} \\
+\cross{LIE}{basis} &
+\cross{LIE}{coerce} &
+\cross{LIE}{commutative?} \\
+\cross{LIE}{commutator} &
+\cross{LIE}{conditionsForIdempotents} &
+\cross{LIE}{convert} \\
+\cross{LIE}{coordinates} &
+\cross{LIE}{flexible?} &
+\cross{LIE}{hash} \\
+\cross{LIE}{jacobiIdentity?} &
+\cross{LIE}{jordanAdmissible?} &
+\cross{LIE}{jordanAlgebra?} \\
+\cross{LIE}{latex} &
+\cross{LIE}{leftAlternative?} &
+\cross{LIE}{leftCharacteristicPolynomial} \\
+\cross{LIE}{leftDiscriminant} &
+\cross{LIE}{leftMinimalPolynomial} &
+\cross{LIE}{leftNorm} \\
+\cross{LIE}{leftPower} &
+\cross{LIE}{leftRankPolynomial} &
+\cross{LIE}{leftRecip} \\
+\cross{LIE}{leftRegularRepresentation} &
+\cross{LIE}{leftTrace} &
+\cross{LIE}{leftTraceMatrix} \\
+\cross{LIE}{leftUnit} &
+\cross{LIE}{leftUnits} &
+\cross{LIE}{lieAdmissible?} \\
+\cross{LIE}{lieAlgebra?} &
+\cross{LIE}{noncommutativeJordanAlgebra?} &
+\cross{LIE}{plenaryPower} \\
+\cross{LIE}{powerAssociative?} &
+\cross{LIE}{rank} &
+\cross{LIE}{recip} \\
+\cross{LIE}{represents} &
+\cross{LIE}{represents} &
+\cross{LIE}{rightAlternative?} \\
+\cross{LIE}{rightCharacteristicPolynomial} &
+\cross{LIE}{rightDiscriminant} &
+\cross{LIE}{rightMinimalPolynomial} \\
+\cross{LIE}{rightNorm} &
+\cross{LIE}{rightPower} &
+\cross{LIE}{rightRankPolynomial} \\
+\cross{LIE}{rightRecip} &
+\cross{LIE}{rightRegularRepresentation} &
+\cross{LIE}{rightTrace} \\
+\cross{LIE}{rightTraceMatrix} &
+\cross{LIE}{rightUnit} &
+\cross{LIE}{rightUnits} \\
+\cross{LIE}{sample} &
+\cross{LIE}{someBasis} &
+\cross{LIE}{structuralConstants} \\
+\cross{LIE}{structuralConstants} &
+\cross{LIE}{subtractIfCan} &
+\cross{LIE}{unit} \\
+\cross{LIE}{zero?} &
+\cross{LIE}{?*?} &
+\cross{LIE}{?**?} \\
+\cross{LIE}{?+?} &
+\cross{LIE}{?-?} &
+\cross{LIE}{-?} \\
+\cross{LIE}{?=?} &
+\cross{LIE}{?\~{}=?} &
+\cross{LIE}{?.?} 
+\end{tabular}
+
 <<domain LIE AssociatedLieAlgebra>>=
 )abbrev domain LIE AssociatedLieAlgebra
 ++ Author: J. Grabmeier
@@ -6114,9 +6897,123 @@ o )show AssociationList
 @
 \pagehead{AssociationList}{ALIST}
 \pagepic{ps/v103associationlist.ps}{ALIST}{1.00}
-See also:\\
-\refto{IndexedList}{ILIST}
-\refto{List}{LIST}
+{\bf See}\\
+\pageto{IndexedList}{ILIST}
+\pageto{List}{LIST}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ALIST}{any?} &
+\cross{ALIST}{assoc} &
+\cross{ALIST}{bag} &
+\cross{ALIST}{child?} &
+\cross{ALIST}{children} \\
+\cross{ALIST}{coerce} &
+\cross{ALIST}{concat} &
+\cross{ALIST}{concat!} &
+\cross{ALIST}{construct} &
+\cross{ALIST}{convert} \\
+\cross{ALIST}{copy} &
+\cross{ALIST}{copyInto!} &
+\cross{ALIST}{count} &
+\cross{ALIST}{cycleEntry} &
+\cross{ALIST}{cycleLength} \\
+\cross{ALIST}{cycleSplit!} &
+\cross{ALIST}{cycleTail} &
+\cross{ALIST}{cyclic?} &
+\cross{ALIST}{delete} &
+\cross{ALIST}{delete!} \\
+\cross{ALIST}{dictionary} &
+\cross{ALIST}{distance} &
+\cross{ALIST}{elt} &
+\cross{ALIST}{empty} &
+\cross{ALIST}{empty?} \\
+\cross{ALIST}{entries} &
+\cross{ALIST}{entry?} &
+\cross{ALIST}{eq?} &
+\cross{ALIST}{eval} &
+\cross{ALIST}{every?} \\
+\cross{ALIST}{explicitlyFinite?} &
+\cross{ALIST}{extract!} &
+\cross{ALIST}{fill!} &
+\cross{ALIST}{find} &
+\cross{ALIST}{first} \\
+\cross{ALIST}{hash} &
+\cross{ALIST}{index?} &
+\cross{ALIST}{indices} &
+\cross{ALIST}{insert} &
+\cross{ALIST}{insert!} \\
+\cross{ALIST}{inspect} &
+\cross{ALIST}{key?} &
+\cross{ALIST}{keys} &
+\cross{ALIST}{last} &
+\cross{ALIST}{latex} \\
+\cross{ALIST}{leaf?} &
+\cross{ALIST}{leaves} &
+\cross{ALIST}{less?} &
+\cross{ALIST}{list} &
+\cross{ALIST}{map} \\
+\cross{ALIST}{map!} &
+\cross{ALIST}{max} &
+\cross{ALIST}{maxIndex} &
+\cross{ALIST}{member?} &
+\cross{ALIST}{members} \\
+\cross{ALIST}{merge} &
+\cross{ALIST}{merge!} &
+\cross{ALIST}{min} &
+\cross{ALIST}{minIndex} &
+\cross{ALIST}{more?} \\
+\cross{ALIST}{new} &
+\cross{ALIST}{node?} &
+\cross{ALIST}{nodes} &
+\cross{ALIST}{parts} &
+\cross{ALIST}{position} \\
+\cross{ALIST}{possiblyInfinite?} &
+\cross{ALIST}{qelt} &
+\cross{ALIST}{qsetelt!} &
+\cross{ALIST}{reduce} &
+\cross{ALIST}{remove} \\
+\cross{ALIST}{remove!} &
+\cross{ALIST}{removeDuplicates} &
+\cross{ALIST}{removeDuplicates!} &
+\cross{ALIST}{rest} &
+\cross{ALIST}{reverse} \\
+\cross{ALIST}{reverse!} &
+\cross{ALIST}{sample} &
+\cross{ALIST}{search} &
+\cross{ALIST}{second} &
+\cross{ALIST}{select} \\
+\cross{ALIST}{select!} &
+\cross{ALIST}{setchildren!} &
+\cross{ALIST}{setelt} &
+\cross{ALIST}{setfirst!} &
+\cross{ALIST}{setlast!} \\
+\cross{ALIST}{setrest!} &
+\cross{ALIST}{setvalue!} &
+\cross{ALIST}{size?} &
+\cross{ALIST}{sort} &
+\cross{ALIST}{sort!} \\
+\cross{ALIST}{sorted?} &
+\cross{ALIST}{split!} &
+\cross{ALIST}{swap!} &
+\cross{ALIST}{table} &
+\cross{ALIST}{tail} \\
+\cross{ALIST}{third} &
+\cross{ALIST}{value} &
+\cross{ALIST}{\#{}?} &
+\cross{ALIST}{?$<$?} &
+\cross{ALIST}{?$<=$?} \\
+\cross{ALIST}{?=?} &
+\cross{ALIST}{?$>$?} &
+\cross{ALIST}{?$>=$?} &
+\cross{ALIST}{?\~{}=?} &
+\cross{ALIST}{?.rest} \\
+\cross{ALIST}{?.value} &
+\cross{ALIST}{?.first} &
+\cross{ALIST}{?.last} &
+\cross{ALIST}{?.?} &
+\end{tabular}
+
 <<domain ALIST AssociationList>>=
 )abbrev domain ALIST AssociationList
 ++ Author:
@@ -6209,6 +7106,22 @@ AssociationList(Key:SetCategory, Entry:SetCategory):
 \section{domain ATTRBUT AttributeButtons}
 \pagehead{AttributeButtons}{ATTRBUT}
 \pagepic{ps/v103attributebuttons.ps}{ATTRBUT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ATTRBUT}{coerce} &
+\cross{ATTRBUT}{decrease} &
+\cross{ATTRBUT}{getButtonValue} &
+\cross{ATTRBUT}{hash} \\
+\cross{ATTRBUT}{increase} &
+\cross{ATTRBUT}{latex} &
+\cross{ATTRBUT}{resetAttributeButtons} &
+\cross{ATTRBUT}{setAttributeButtonStep} \\
+\cross{ATTRBUT}{setButtonValue} &
+\cross{ATTRBUT}{?\~{}=?} &
+\cross{ATTRBUT}{?=?} 
+\end{tabular}
+
 <<domain ATTRBUT AttributeButtons>>=
 )abbrev domain ATTRBUT AttributeButtons
 ++ Author: Brian Dupee
@@ -6431,9 +7344,32 @@ AttributeButtons(): E == I where
 \section{domain AUTOMOR Automorphism}
 \pagehead{Automorphism}{AUTOMOR}
 \pagepic{ps/v103automorphism.ps}{AUTOMOR}{1.00}
-See also:\\
-\refto{SparseUnivariateSkewPolynomial}{ORESUP}
-\refto{UnivariateSkewPolynomial}{OREUP}
+{\bf See}\\
+\pageto{SparseUnivariateSkewPolynomial}{ORESUP}
+\pageto{UnivariateSkewPolynomial}{OREUP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{AUTOMOR}{1} &
+\cross{AUTOMOR}{coerce} &
+\cross{AUTOMOR}{commutator} &
+\cross{AUTOMOR}{conjugate} &
+\cross{AUTOMOR}{hash} \\
+\cross{AUTOMOR}{inv} &
+\cross{AUTOMOR}{latex} &
+\cross{AUTOMOR}{morphism} &
+\cross{AUTOMOR}{one?} &
+\cross{AUTOMOR}{recip} \\
+\cross{AUTOMOR}{sample} &
+\cross{AUTOMOR}{?\~{}=?} &
+\cross{AUTOMOR}{?**?} &
+\cross{AUTOMOR}{?\^{}?} &
+\cross{AUTOMOR}{?.?} \\
+\cross{AUTOMOR}{?*?} &
+\cross{AUTOMOR}{?/?} &
+\cross{AUTOMOR}{?=?} &&
+\end{tabular}
+
 <<domain AUTOMOR Automorphism>>=
 )abbrev domain AUTOMOR Automorphism
 ++ Author: Manuel Bronstein
@@ -6691,12 +7627,12 @@ o )show BalancedBinaryTree
 @
 \pagehead{BalancedBinaryTree}{BBTREE}
 \pagepic{ps/v103balancedbinarytree.ps}{BBTREE}{1.00}
-See also:\\
-\refto{Tree}{TREE}
-\refto{BinaryTree}{BTREE}
-\refto{BinarySearchTree}{BSTREE}
-\refto{BinaryTournament}{BTOURN}
-\refto{PendantTree}{PENDTREE}
+{\bf See}\\
+\pageto{Tree}{TREE}
+\pageto{BinaryTree}{BTREE}
+\pageto{BinarySearchTree}{BSTREE}
+\pageto{BinaryTournament}{BTOURN}
+\pageto{PendantTree}{PENDTREE}
 <<domain BBTREE BalancedBinaryTree>>=
 )abbrev domain BBTREE BalancedBinaryTree
 ++ Description: \spadtype{BalancedBinaryTree(S)} is the domain of balanced
@@ -6860,12 +7796,12 @@ BalancedBinaryTree(S: SetCategory): Exports == Implementation where
 \section{domain BPADIC BalancedPAdicInteger}
 \pagehead{BalancedPAdicInteger}{BPADIC}
 \pagepic{ps/v103balancedpadicinteger.ps}{BPADIC}{1.00}
-See also:\\
-\refto{InnerPAdicInteger}{IPADIC}
-\refto{PAdicInteger}{PADIC}
-\refto{PAdicRationalConstructor}{PADICRC}
-\refto{PAdicRational}{PADICRAT}
-\refto{BalancedPAdicRational}{BPADICRT}
+{\bf See}\\
+\pageto{InnerPAdicInteger}{IPADIC}
+\pageto{PAdicInteger}{PADIC}
+\pageto{PAdicRationalConstructor}{PADICRC}
+\pageto{PAdicRational}{PADICRAT}
+\pageto{BalancedPAdicRational}{BPADICRT}
 <<domain BPADIC BalancedPAdicInteger>>=
 )abbrev domain BPADIC BalancedPAdicInteger
 ++ Author: Clifton J. Williamson
@@ -6894,12 +7830,12 @@ BalancedPAdicInteger(p:Integer) == InnerPAdicInteger(p,false$Boolean)
 \section{domain BPADICRT BalancedPAdicRational}
 \pagehead{BalancedPAdicRational}{BPADICRT}
 \pagepic{ps/v103balancedpadicrational.ps}{BPADICRT}{1.00}
-See also:\\
-\refto{InnerPAdicInteger}{IPADIC}
-\refto{PAdicInteger}{PADIC}
-\refto{BalancedPAdicInteger}{BPADIC}
-\refto{PAdicRationalConstructor}{PADICRC}
-\refto{PAdicRational}{PADICRAT}
+{\bf See}\\
+\pageto{InnerPAdicInteger}{IPADIC}
+\pageto{PAdicInteger}{PADIC}
+\pageto{BalancedPAdicInteger}{BPADIC}
+\pageto{PAdicRationalConstructor}{PADICRC}
+\pageto{PAdicRational}{PADICRAT}
 <<domain BPADICRT BalancedPAdicRational>>=
 )abbrev domain BPADICRT BalancedPAdicRational
 ++ Author: Clifton J. Williamson
@@ -7659,10 +8595,10 @@ o )show BinaryExpansion
 @
 \pagehead{BinaryExpansion}{BINARY}
 \pagepic{ps/v103binaryexpansion.ps}{BINARY}{1.00}
-See also:\\
-\refto{RadixExpansion}{RADIX}
-\refto{DecimalExpansion}{DECIMAL}
-\refto{HexadecimalExpansion}{HEXADEC}
+{\bf See}\\
+\pageto{RadixExpansion}{RADIX}
+\pageto{DecimalExpansion}{DECIMAL}
+\pageto{HexadecimalExpansion}{HEXADEC}
 <<domain BINARY BinaryExpansion>>=
 )abbrev domain BINARY BinaryExpansion
 ++ Author: Clifton J. Williamson
@@ -7707,11 +8643,11 @@ BinaryExpansion(): Exports == Implementation where
 \section{domain BINFILE BinaryFile}
 \pagehead{BinaryFile}{BINFILE}
 \pagepic{ps/v103binaryfile.ps}{BINFILE}{1.00}
-See also:\\
-\refto{File}{FILE}
-\refto{TextFile}{TEXTFILE}
-\refto{KeyedAccessFile}{KAFILE}
-\refto{Library}{LIB}
+{\bf See}\\
+\pageto{File}{FILE}
+\pageto{TextFile}{TEXTFILE}
+\pageto{KeyedAccessFile}{KAFILE}
+\pageto{Library}{LIB}
 <<domain BINFILE BinaryFile>>=
 )abbrev domain BINFILE BinaryFile
 ++ Author: Barry M. Trager
@@ -8030,12 +8966,12 @@ o )show BinarySearchTree
 @
 \pagehead{BinarySearchTree}{BSTREE}
 \pagepic{ps/v103binarysearchtree.ps}{BSTREE}{1.00}
-See also:\\
-\refto{Tree}{TREE}
-\refto{BinaryTree}{BTREE}
-\refto{BinaryTournament}{BTOURN}
-\refto{BalancedBinaryTree}{BBTREE}
-\refto{PendantTree}{PENDTREE}
+{\bf See}\\
+\pageto{Tree}{TREE}
+\pageto{BinaryTree}{BTREE}
+\pageto{BinaryTournament}{BTOURN}
+\pageto{BalancedBinaryTree}{BBTREE}
+\pageto{PendantTree}{PENDTREE}
 <<domain BSTREE BinarySearchTree>>=
 )abbrev domain BSTREE BinarySearchTree
 ++ Description: BinarySearchTree(S) is the domain of
@@ -8112,12 +9048,12 @@ node containing a value of type S, and a right and a left which are
 both BinaryTree(S)
 \pagehead{BinaryTournament}{BTOURN}
 \pagepic{ps/v103binarytournament.ps}{BTOURN}{1.00}
-See also:\\
-\refto{Tree}{TREE}
-\refto{BinaryTree}{BTREE}
-\refto{BinarySearchTree}{BSTREE}
-\refto{BalancedBinaryTree}{BBTREE}
-\refto{PendantTree}{PENDTREE}
+{\bf See}\\
+\pageto{Tree}{TREE}
+\pageto{BinaryTree}{BTREE}
+\pageto{BinarySearchTree}{BSTREE}
+\pageto{BalancedBinaryTree}{BBTREE}
+\pageto{PendantTree}{PENDTREE}
 <<domain BTOURN BinaryTournament>>=
 )abbrev domain BTOURN BinaryTournament
 BinaryTournament(S: OrderedSet): Exports == Implementation where
@@ -8163,12 +9099,12 @@ BinaryTournament(S: OrderedSet): Exports == Implementation where
 \section{domain BTREE BinaryTree}
 \pagehead{BinaryTree}{BTREE}
 \pagepic{ps/v103binarytree.ps}{BTREE}{1.00}
-See also:\\
-\refto{Tree}{TREE}
-\refto{BinarySearchTree}{BSTREE}
-\refto{BinaryTournament}{BTOURN}
-\refto{BalancedBinaryTree}{BBTREE}
-\refto{PendantTree}{PENDTREE}
+{\bf See}\\
+\pageto{Tree}{TREE}
+\pageto{BinarySearchTree}{BSTREE}
+\pageto{BinaryTournament}{BTOURN}
+\pageto{BalancedBinaryTree}{BBTREE}
+\pageto{PendantTree}{PENDTREE}
 <<domain BTREE BinaryTree>>=
 )abbrev domain BTREE BinaryTree
 ++ Description: \spadtype{BinaryTree(S)} is the domain of all
@@ -8233,10 +9169,10 @@ BinaryTree(S: SetCategory): Exports == Implementation where
 \section{domain BITS Bits}
 \pagehead{Bits}{BITS}
 \pagepic{ps/v103bits.ps}{BITS}{1.00}
-See also:\\
-\refto{Reference}{REF}
-\refto{Boolean}{BOOLEAN}
-\refto{IndexedBits}{IBITS}
+{\bf See}\\
+\pageto{Reference}{REF}
+\pageto{Boolean}{BOOLEAN}
+\pageto{IndexedBits}{IBITS}
 <<domain BITS Bits>>=
 )abbrev domain BITS Bits
 ++ Author: Stephen M. Watt
@@ -8265,10 +9201,10 @@ Bits(): Exports == Implementation where
 \section{domain BOOLEAN Boolean}
 \pagehead{Boolean}{BOOLEAN}
 \pagepic{ps/v103boolean.ps}{BOOLEAN}{1.00}
-See also:\\
-\refto{Reference}{REF}
-\refto{IndexedBits}{IBITS}
-\refto{Bits}{BITS}
+{\bf See}\\
+\pageto{Reference}{REF}
+\pageto{IndexedBits}{IBITS}
+\pageto{Bits}{BITS}
 <<domain BOOLEAN Boolean>>=
 )abbrev domain BOOLEAN Boolean
 ++ Author: Stephen M. Watt
@@ -10639,10 +11575,10 @@ o )show Character
 @
 \pagehead{Character}{CHAR}
 \pagepic{ps/v103character.ps}{CHAR}{1.00}
-See also:\\
-\refto{CharacterClass}{CCLASS}
-\refto{IndexedString}{ISTRING}
-\refto{String}{STRING}
+{\bf See}\\
+\pageto{CharacterClass}{CCLASS}
+\pageto{IndexedString}{ISTRING}
+\pageto{String}{STRING}
 <<domain CHAR Character>>=
 )abbrev domain CHAR Character
 ++ Author: Stephen M. Watt
@@ -11021,10 +11957,10 @@ o )show CharacterClass
 @
 \pagehead{CharacterClass}{CCLASS}
 \pagepic{ps/v103characterclass.ps}{CCLASS}{1.00}
-See also:\\
-\refto{Character}{CHAR}
-\refto{IndexedString}{ISTRING}
-\refto{String}{STRING}
+{\bf See}\\
+\pageto{Character}{CHAR}
+\pageto{IndexedString}{ISTRING}
+\pageto{String}{STRING}
 <<domain CCLASS CharacterClass>>=
 )abbrev domain CCLASS CharacterClass
 ++ Author: Stephen M. Watt
@@ -11950,8 +12886,8 @@ o $AXIOM/doc/src/algebra/clifford.spad
 @
 \pagehead{CliffordAlgebra}{CLIF}
 \pagepic{ps/v103cliffordalgebra.ps}{CLIF}{1.00}
-See also:\\
-\refto{QuadraticForm}{QFORM}
+{\bf See}\\
+\pageto{QuadraticForm}{QFORM}
 <<domain CLIF CliffordAlgebra>>=
 )abbrev domain CLIF CliffordAlgebra
 ++ Author: Stephen M. Watt
@@ -12166,8 +13102,8 @@ CliffordAlgebra(n, K, Q): T == Impl where
 \section{domain COLOR Color}
 \pagehead{Color}{COLOR}
 \pagepic{ps/v103color.ps}{COLOR}{1.00}
-See also:\\
-\refto{Palette}{PALETTE}
+{\bf See}\\
+\pageto{Palette}{PALETTE}
 <<domain COLOR Color>>=
 )abbrev domain COLOR Color
 ++ Author: Jim Wen
@@ -12272,9 +13208,9 @@ Color(): Exports == Implementation where
 \section{domain COMM Commutator}
 \pagehead{Commutator}{COMM}
 \pagepic{ps/v103commutator.ps}{COMM}{1.00}
-See also:\\
-\refto{OrdSetInts}{OSI}
-\refto{FreeNilpotentLie}{FNLA}
+{\bf See}\\
+\pageto{OrdSetInts}{OSI}
+\pageto{FreeNilpotentLie}{FNLA}
 <<domain COMM Commutator>>=
 )abbrev domain COMM Commutator
 ++ Author : Larry Lambe
@@ -13582,10 +14518,10 @@ ContinuedFraction(R): Exports == Implementation where
 \section{domain DBASE Database}
 \pagehead{Database}{DBASE}
 \pagepic{ps/v103database.ps}{DBASE}{1.00}
-See also:\\
-\refto{DataList}{DLIST}
-\refto{IndexCard}{ICARD}
-\refto{QueryEquation}{QEQUAT}
+{\bf See}\\
+\pageto{DataList}{DLIST}
+\pageto{IndexCard}{ICARD}
+\pageto{QueryEquation}{QEQUAT}
 <<domain DBASE Database>>=
 )abbrev domain DBASE Database
 ++ This domain implements a simple view of a database whose fields are 
@@ -13645,10 +14581,10 @@ Database(S): Exports == Implementation where
 \section{domain DLIST DataList}
 \pagehead{DataList}{DLIST}
 \pagepic{ps/v103datalist.ps}{DLIST}{1.00}
-See also:\\
-\refto{IndexCard}{ICARD}
-\refto{Database}{DBASE}
-\refto{QueryEquation}{QEQUAT}
+{\bf See}\\
+\pageto{IndexCard}{ICARD}
+\pageto{Database}{DBASE}
+\pageto{QueryEquation}{QEQUAT}
 <<domain DLIST DataList>>=
 )abbrev domain DLIST DataList
 ++ This domain provides some nice functions on lists
@@ -13838,10 +14774,10 @@ o )show DecimalExpansion
 @
 \pagehead{DecimalExpansion}{DECIMAL}
 \pagepic{ps/v103decimalexpansion.ps}{DECIMAL}{1.00}
-See also:\\
-\refto{RadixExpansion}{RADIX}
-\refto{BinaryExpansion}{BINARY}
-\refto{HexadecimalExpansion}{HEXADEC}
+{\bf See}\\
+\pageto{RadixExpansion}{RADIX}
+\pageto{BinaryExpansion}{BINARY}
+\pageto{HexadecimalExpansion}{HEXADEC}
 <<domain DECIMAL DecimalExpansion>>=
 )abbrev domain DECIMAL DecimalExpansion
 ++ Author: Stephen M. Watt
@@ -15572,11 +16508,11 @@ DenavitHartenbergMatrix(R): Exports == Implementation where
 \section{domain DEQUEUE Dequeue}
 \pagehead{Dequeue}{DEQUEUE}
 \pagepic{ps/v103dequeue.ps}{DEQUEUE}{1.00}
-See also:\\
-\refto{Stack}{STACK}
-\refto{ArrayStack}{ASTACK}
-\refto{Queue}{QUEUE}
-\refto{Heap}{HEAP}
+{\bf See}\\
+\pageto{Stack}{STACK}
+\pageto{ArrayStack}{ASTACK}
+\pageto{Queue}{QUEUE}
+\pageto{Heap}{HEAP}
 <<domain DEQUEUE Dequeue>>=
 )abbrev domain DEQUEUE Dequeue
 ++ Author: Michael Monagan and Stephen Watt
@@ -16222,9 +17158,9 @@ o )show DeRhamComplex
 @
 \pagehead{DeRhamComplex}{DERHAM}
 \pagepic{ps/v103derhamcomplex.ps}{DERHAM}{1.00}
-See also:\\
-\refto{ExtAlgBasis}{EAB}
-\refto{AntiSymm}{ANTISYM}
+{\bf See}\\
+\pageto{ExtAlgBasis}{EAB}
+\pageto{AntiSymm}{ANTISYM}
 <<domain DERHAM DeRhamComplex>>=
 )abbrev domain DERHAM DeRhamComplex
 ++ Author: Larry A. Lambe
@@ -16348,11 +17284,11 @@ DeRhamComplex(CoefRing,listIndVar:List Symbol): Export == Implement where
 \section{domain DSMP DifferentialSparseMultivariatePolynomial}
 \pagehead{DifferentialSparseMultivariatePolynomial}{DSMP}
 \pagepic{ps/v103differentialsparsemultivariatepolynomial.ps}{DSMP}{1.00}
-See also:\\
-\refto{OrderlyDifferentialVariable}{ODVAR}
-\refto{SequentialDifferentialVariable}{SDVAR}
-\refto{OrderlyDifferentialPolynomial}{ODPOL}
-\refto{SequentialDifferentialPolynomial}{SDPOL}
+{\bf See}\\
+\pageto{OrderlyDifferentialVariable}{ODVAR}
+\pageto{SequentialDifferentialVariable}{SDVAR}
+\pageto{OrderlyDifferentialPolynomial}{ODPOL}
+\pageto{SequentialDifferentialPolynomial}{SDPOL}
 <<domain DSMP DifferentialSparseMultivariatePolynomial>>=
 )abbrev domain DSMP DifferentialSparseMultivariatePolynomial
 ++ Author:  William Sit
@@ -16520,10 +17456,10 @@ DirectProduct(dim:NonNegativeInteger, R:Type):
 \section{domain DPMM DirectProductMatrixModule}
 \pagehead{DirectProductMatrixModule}{DPMM}
 \pagepic{ps/v103directproductmatrixmodule.ps}{DPMM}{1.00}
-See also:\\
-\refto{OppositeMonogenicLinearOperator}{OMLO}
-\refto{OrdinaryDifferentialRing}{ODR}
-\refto{DirectProductModule}{DPMO}
+{\bf See}\\
+\pageto{OppositeMonogenicLinearOperator}{OMLO}
+\pageto{OrdinaryDifferentialRing}{ODR}
+\pageto{DirectProductModule}{DPMO}
 <<domain DPMM DirectProductMatrixModule>>=
 )abbrev domain DPMM DirectProductMatrixModule
 ++ Author:  Stephen M. Watt
@@ -16565,10 +17501,10 @@ DirectProductMatrixModule(n, R, M, S): DPcategory == DPcapsule where
 \section{domain DPMO DirectProductModule}
 \pagehead{DirectProductModule}{DPMO}
 \pagepic{ps/v103directproductmodule.ps}{DPMO}{1.00}
-See also:\\
-\refto{OppositeMonogenicLinearOperator}{OMLO}
-\refto{OrdinaryDifferentialRing}{ODR}
-\refto{DirectProductMatrixModule}{DPMM}
+{\bf See}\\
+\pageto{OppositeMonogenicLinearOperator}{OMLO}
+\pageto{OrdinaryDifferentialRing}{ODR}
+\pageto{DirectProductMatrixModule}{DPMM}
 <<domain DPMO DirectProductModule>>=
 )abbrev domain DPMO DirectProductModule
 ++ Author:  Stephen M. Watt
@@ -16818,9 +17754,9 @@ o )show DistributedMultivariatePolynomial
 @
 \pagehead{DistributedMultivariatePolynomial}{DMP}
 \pagepic{ps/v103distributedmultivariatepolynomial.ps}{DMP}{1.00}
-See also:\\
-\refto{GeneralDistributedMultivariatePolynomial}{GDMP}
-\refto{HomogeneousDistributedMultivariatePolynomial}{HDMP}
+{\bf See}\\
+\pageto{GeneralDistributedMultivariatePolynomial}{GDMP}
+\pageto{HomogeneousDistributedMultivariatePolynomial}{HDMP}
 <<domain DMP DistributedMultivariatePolynomial>>=
 )abbrev domain DMP DistributedMultivariatePolynomial
 ++ Author: Barry Trager
@@ -19765,13 +20701,13 @@ o )show EqTable
 @
 \pagehead{EqTable}{EQTBL}
 \pagepic{ps/v103eqtable.ps}{EQTBL}{1.00}
-See also:\\
-\refto{HashTable}{HASHTBL}
-\refto{InnerTable}{INTABL}
-\refto{Table}{TABLE}
-\refto{StringTable}{STRTBL}
-\refto{GeneralSparseTable}{GSTBL}
-\refto{SparseTable}{STBL}
+{\bf See}\\
+\pageto{HashTable}{HASHTBL}
+\pageto{InnerTable}{INTABL}
+\pageto{Table}{TABLE}
+\pageto{StringTable}{STRTBL}
+\pageto{GeneralSparseTable}{GSTBL}
+\pageto{SparseTable}{STBL}
 <<domain EQTBL EqTable>>=
 )abbrev domain EQTBL EqTable
 ++ Author: Stephen M. Watt
@@ -19802,9 +20738,9 @@ EqTable(Key: SetCategory, Entry: SetCategory) ==
 \section{domain EMR EuclideanModularRing}
 \pagehead{EuclideanModularRing}{EMR}
 \pagepic{ps/v103euclideanmodularring.ps}{EMR}{1.00}
-See also:\\
-\refto{ModularRing}{MODRING}
-\refto{ModularField}{MODFIELD}
+{\bf See}\\
+\pageto{ModularRing}{MODRING}
+\pageto{ModularField}{MODFIELD}
 <<domain EMR EuclideanModularRing>>=
 )abbrev domain EMR EuclideanModularRing
 ++ Description:
@@ -20055,9 +20991,9 @@ Exit: SetCategory == add
 \section{domain EXPEXPAN ExponentialExpansion}
 \pagehead{ExponentialExpansion}{EXPEXPAN}
 \pagepic{ps/v103exponentialexpansion.ps}{EXPEXPAN}{1.00}
-See also:\\
-\refto{ExponentialOfUnivariatePuiseuxSeries}{EXPUPXS}
-\refto{UnivariatePuiseuxSeriesWithExponentialSingularity}{UPXSSING}
+{\bf See}\\
+\pageto{ExponentialOfUnivariatePuiseuxSeries}{EXPUPXS}
+\pageto{UnivariatePuiseuxSeriesWithExponentialSingularity}{UPXSSING}
 <<domain EXPEXPAN ExponentialExpansion>>=
 )abbrev domain EXPEXPAN ExponentialExpansion
 ++ Author: Clifton J. Williamson
@@ -20590,8 +21526,8 @@ o )show Expression
 @
 \pagehead{Expression}{EXPR}
 \pagepic{ps/v103expression.ps}{EXPR}{1.00}
-See also:\\
-\refto{Pi}{HACKPI}
+{\bf See}\\
+\pageto{Pi}{HACKPI}
 <<domain EXPR Expression>>=
 )abbrev domain EXPR Expression
 ++ Top-level mathematical expressions
@@ -21122,9 +22058,9 @@ Expression(R:OrderedSet): Exports == Implementation where
 \section{domain EXPUPXS ExponentialOfUnivariatePuiseuxSeries}
 \pagehead{ExponentialOfUnivariatePuiseuxSeries}{EXPUPXS}
 \pagepic{ps/v103exponentialofunivariatepuiseuxseries.ps}{EXPUPXS}{1.00}
-See also:\\
-\refto{UnivariatePuiseuxSeriesWithExponentialSingularity}{UPXSSING}
-\refto{ExponentialExpansion}{EXPEXPAN}
+{\bf See}\\
+\pageto{UnivariatePuiseuxSeriesWithExponentialSingularity}{UPXSSING}
+\pageto{ExponentialExpansion}{EXPEXPAN}
 <<domain EXPUPXS ExponentialOfUnivariatePuiseuxSeries>>=
 )abbrev domain EXPUPXS ExponentialOfUnivariatePuiseuxSeries
 ++ Author: Clifton J. Williamson
@@ -21206,9 +22142,9 @@ ExponentialOfUnivariatePuiseuxSeries(FE,var,cen):_
 \section{domain EAB ExtAlgBasis}
 \pagehead{ExtAlgBasis}{EAB}
 \pagepic{ps/v103extalgbasis.ps}{EAB}{1.00}
-See also:\\
-\refto{AntiSymm}{ANTISYM}
-\refto{DeRhamComplex}{DERHAM}
+{\bf See}\\
+\pageto{AntiSymm}{ANTISYM}
+\pageto{DeRhamComplex}{DERHAM}
 <<domain EAB ExtAlgBasis>>=
 )abbrev domain EAB ExtAlgBasis
 --% ExtAlgBasis
@@ -21302,13 +22238,13 @@ ExtAlgBasis(): Export == Implement where
 \section{domain E04DGFA e04dgfAnnaType}
 \pagehead{e04dgfAnnaType}{E04DGFA}
 \pagepic{ps/v103e04dgfannatype.ps}{E04DGFA}{1.00}
-See also:\\
-\refto{E04FDFA}{e04fdfAnnaType}
-\refto{E04GCFA}{e04gcfAnnaType}
-\refto{E04JAFA}{e04jafAnnaType}
-\refto{E04MBFA}{e04mbfAnnaType}
-\refto{E04NAFA}{e04nafAnnaType}
-\refto{E04UCFA}{e04ucfAnnaType}
+{\bf See}\\
+\pageto{E04FDFA}{e04fdfAnnaType}
+\pageto{E04GCFA}{e04gcfAnnaType}
+\pageto{E04JAFA}{e04jafAnnaType}
+\pageto{E04MBFA}{e04mbfAnnaType}
+\pageto{E04NAFA}{e04nafAnnaType}
+\pageto{E04UCFA}{e04ucfAnnaType}
 <<domain E04DGFA e04dgfAnnaType>>=
 )abbrev domain E04DGFA e04dgfAnnaType
 ++ Author: Brian Dupee
@@ -21389,13 +22325,13 @@ e04dgfAnnaType(): NumericalOptimizationCategory == Result add
 \section{domain E04FDFA e04fdfAnnaType}
 \pagehead{e04fdfAnnaType}{E04FDFA}
 \pagepic{ps/v103e04fdfannatype.ps}{E04FDFA}{1.00}
-See also:\\
-\refto{E04DGFA}{e04dgfAnnaType}
-\refto{E04GCFA}{e04gcfAnnaType}
-\refto{E04JAFA}{e04jafAnnaType}
-\refto{E04MBFA}{e04mbfAnnaType}
-\refto{E04NAFA}{e04nafAnnaType}
-\refto{E04UCFA}{e04ucfAnnaType}
+{\bf See}\\
+\pageto{E04DGFA}{e04dgfAnnaType}
+\pageto{E04GCFA}{e04gcfAnnaType}
+\pageto{E04JAFA}{e04jafAnnaType}
+\pageto{E04MBFA}{e04mbfAnnaType}
+\pageto{E04NAFA}{e04nafAnnaType}
+\pageto{E04UCFA}{e04ucfAnnaType}
 <<domain E04FDFA e04fdfAnnaType>>=
 )abbrev domain E04FDFA e04fdfAnnaType
 ++ Author: Brian Dupee
@@ -21501,13 +22437,13 @@ e04fdfAnnaType(): NumericalOptimizationCategory == Result add
 \section{domain E04GCFA e04gcfAnnaType}
 \pagehead{e04gcfAnnaType}{E04GCFA}
 \pagepic{ps/v103e04gcfannatype.ps}{E04GCFA}{1.00}
-See also:\\
-\refto{E04DGFA}{e04dgfAnnaType}
-\refto{E04FDFA}{e04fdfAnnaType}
-\refto{E04JAFA}{e04jafAnnaType}
-\refto{E04MBFA}{e04mbfAnnaType}
-\refto{E04NAFA}{e04nafAnnaType}
-\refto{E04UCFA}{e04ucfAnnaType}
+{\bf See}\\
+\pageto{E04DGFA}{e04dgfAnnaType}
+\pageto{E04FDFA}{e04fdfAnnaType}
+\pageto{E04JAFA}{e04jafAnnaType}
+\pageto{E04MBFA}{e04mbfAnnaType}
+\pageto{E04NAFA}{e04nafAnnaType}
+\pageto{E04UCFA}{e04ucfAnnaType}
 <<domain E04GCFA e04gcfAnnaType>>=
 )abbrev domain E04GCFA e04gcfAnnaType
 ++ Author: Brian Dupee
@@ -21629,13 +22565,13 @@ e04gcfAnnaType(): NumericalOptimizationCategory == Result add
 \section{domain E04JAFA e04jafAnnaType}
 \pagehead{e04jafAnnaType}{E04JAFA}
 \pagepic{ps/v103e04jafannatype.ps}{E04JAFA}{1.00}
-See also:\\
-\refto{E04DGFA}{e04dgfAnnaType}
-\refto{E04FDFA}{e04fdfAnnaType}
-\refto{E04GCFA}{e04gcfAnnaType}
-\refto{E04MBFA}{e04mbfAnnaType}
-\refto{E04NAFA}{e04nafAnnaType}
-\refto{E04UCFA}{e04ucfAnnaType}
+{\bf See}\\
+\pageto{E04DGFA}{e04dgfAnnaType}
+\pageto{E04FDFA}{e04fdfAnnaType}
+\pageto{E04GCFA}{e04gcfAnnaType}
+\pageto{E04MBFA}{e04mbfAnnaType}
+\pageto{E04NAFA}{e04nafAnnaType}
+\pageto{E04UCFA}{e04ucfAnnaType}
 <<domain E04JAFA e04jafAnnaType>>=
 )abbrev domain E04JAFA e04jafAnnaType
 ++ Author: Brian Dupee
@@ -21732,13 +22668,13 @@ e04jafAnnaType(): NumericalOptimizationCategory == Result add
 \section{domain E04MBFA e04mbfAnnaType}
 \pagehead{e04mbfAnnaType}{E04MBFA}
 \pagepic{ps/v103e04mbfannatype.ps}{E04MBFA}{1.00}
-See also:\\
-\refto{E04DGFA}{e04dgfAnnaType}
-\refto{E04FDFA}{e04fdfAnnaType}
-\refto{E04GCFA}{e04gcfAnnaType}
-\refto{E04JAFA}{e04jafAnnaType}
-\refto{E04NAFA}{e04nafAnnaType}
-\refto{E04UCFA}{e04ucfAnnaType}
+{\bf See}\\
+\pageto{E04DGFA}{e04dgfAnnaType}
+\pageto{E04FDFA}{e04fdfAnnaType}
+\pageto{E04GCFA}{e04gcfAnnaType}
+\pageto{E04JAFA}{e04jafAnnaType}
+\pageto{E04NAFA}{e04nafAnnaType}
+\pageto{E04UCFA}{e04ucfAnnaType}
 <<domain E04MBFA e04mbfAnnaType>>=
 )abbrev domain E04MBFA e04mbfAnnaType
 ++ Author: Brian Dupee
@@ -21821,13 +22757,13 @@ e04mbfAnnaType(): NumericalOptimizationCategory == Result add
 \section{domain E04NAFA e04nafAnnaType}
 \pagehead{e04nafAnnaType}{E04NAFA}
 \pagepic{ps/v103e04nafannatype.ps}{E04NAFA}{1.00}
-See also:\\
-\refto{E04DGFA}{e04dgfAnnaType}
-\refto{E04FDFA}{e04fdfAnnaType}
-\refto{E04GCFA}{e04gcfAnnaType}
-\refto{E04JAFA}{e04jafAnnaType}
-\refto{E04MBFA}{e04mbfAnnaType}
-\refto{E04UCFA}{e04ucfAnnaType}
+{\bf See}\\
+\pageto{E04DGFA}{e04dgfAnnaType}
+\pageto{E04FDFA}{e04fdfAnnaType}
+\pageto{E04GCFA}{e04gcfAnnaType}
+\pageto{E04JAFA}{e04jafAnnaType}
+\pageto{E04MBFA}{e04mbfAnnaType}
+\pageto{E04UCFA}{e04ucfAnnaType}
 <<domain E04NAFA e04nafAnnaType>>=
 )abbrev domain E04NAFA e04nafAnnaType
 ++ Author: Brian Dupee
@@ -21925,13 +22861,13 @@ e04nafAnnaType(): NumericalOptimizationCategory == Result add
 \section{domain E04UCFA e04ucfAnnaType}
 \pagehead{e04ucfAnnaType}{E04UCFA}
 \pagepic{ps/v103e04ucfannatype.ps}{E04UCFA}{1.00}
-See also:\\
-\refto{E04DGFA}{e04dgfAnnaType}
-\refto{E04FDFA}{e04fdfAnnaType}
-\refto{E04GCFA}{e04gcfAnnaType}
-\refto{E04JAFA}{e04jafAnnaType}
-\refto{E04MBFA}{e04mbfAnnaType}
-\refto{E04NAFA}{e04nafAnnaType}
+{\bf See}\\
+\pageto{E04DGFA}{e04dgfAnnaType}
+\pageto{E04FDFA}{e04fdfAnnaType}
+\pageto{E04GCFA}{e04gcfAnnaType}
+\pageto{E04JAFA}{e04jafAnnaType}
+\pageto{E04MBFA}{e04mbfAnnaType}
+\pageto{E04NAFA}{e04nafAnnaType}
 <<domain E04UCFA e04ucfAnnaType>>=
 )abbrev domain E04UCFA e04ucfAnnaType
 ++ Author: Brian Dupee
@@ -23420,11 +24356,11 @@ o )show File
 @
 \pagehead{File}{FILE}
 \pagepic{ps/v103file.ps}{FILE}{1.00}
-See also:\\
-\refto{TextFile}{TEXTFILE}
-\refto{BinaryFile}{BINFILE}
-\refto{KeyedAccessFile}{KAFILE}
-\refto{Library}{LIB}
+{\bf See}\\
+\pageto{TextFile}{TEXTFILE}
+\pageto{BinaryFile}{BINFILE}
+\pageto{KeyedAccessFile}{KAFILE}
+\pageto{Library}{LIB}
 <<domain FILE File>>=
 )abbrev domain FILE File
 ++ Author: Stephen M. Watt, Victor Miller
@@ -23841,10 +24777,10 @@ FileName(): FileNameCategory == add
 \section{domain FDIV FiniteDivisor}
 \pagehead{FiniteDivisor}{FDIV}
 \pagepic{ps/v103finitedivisor.ps}{FDIV}{1.00}
-See also:\\
-\refto{FractionalIdeal}{FRIDEAL}
-\refto{FramedModule}{FRMOD}
-\refto{HyperellipticFiniteDivisor}{HELLFDIV}
+{\bf See}\\
+\pageto{FractionalIdeal}{FRIDEAL}
+\pageto{FramedModule}{FRMOD}
+\pageto{HyperellipticFiniteDivisor}{HELLFDIV}
 <<domain FDIV FiniteDivisor>>=
 )abbrev domain FDIV FiniteDivisor
 ++ Finite rational divisors on a curve
@@ -23984,10 +24920,10 @@ FiniteDivisor(F, UP, UPUP, R): Exports == Implementation where
 \section{domain FF FiniteField}
 \pagehead{FiniteField}{FF}
 \pagepic{ps/v103finitefield.ps}{FF}{1.00}
-See also:\\
-\refto{FiniteFieldExtensionByPolynomial}{FFP}
-\refto{FiniteFieldExtension}{FFX}
-\refto{InnerFiniteField}{IFF}
+{\bf See}\\
+\pageto{FiniteFieldExtensionByPolynomial}{FFP}
+\pageto{FiniteFieldExtension}{FFX}
+\pageto{InnerFiniteField}{IFF}
 <<domain FF FiniteField>>=
 )abbrev domain FF FiniteField
 ++ Author: ???
@@ -24027,9 +24963,9 @@ FiniteField(p:PositiveInteger, n:PositiveInteger): _
 \section{domain FFCG FiniteFieldCyclicGroup}
 \pagehead{FiniteFieldCyclicGroup}{FFCG}
 \pagepic{ps/v103finitefieldcyclicgroup.ps}{FFCG}{1.00}
-See also:\\
-\refto{FiniteFieldCyclicGroupExtensionByPolynomial}{FFCGP}
-\refto{FiniteFieldCyclicGroupExtension}{FFCGX}
+{\bf See}\\
+\pageto{FiniteFieldCyclicGroupExtensionByPolynomial}{FFCGP}
+\pageto{FiniteFieldCyclicGroupExtension}{FFCGX}
 <<domain FFCG FiniteFieldCyclicGroup>>=
 )abbrev domain FFCG FiniteFieldCyclicGroup
 ++ Authors: J.Grabmeier, A.Scheerhorn
@@ -24080,9 +25016,9 @@ FiniteFieldCyclicGroup(p,extdeg):_
 \section{domain FFCGX FiniteFieldCyclicGroupExtension}
 \pagehead{FiniteFieldCyclicGroupExtension}{FFCGX}
 \pagepic{ps/v103finitefieldcyclicgroupextension.ps}{FFCGX}{1.00}
-See also:\\
-\refto{FiniteFieldCyclicGroupExtensionByPolynomial}{FFCGP}
-\refto{FiniteFieldCyclicGroup}{FFCG}
+{\bf See}\\
+\pageto{FiniteFieldCyclicGroupExtensionByPolynomial}{FFCGP}
+\pageto{FiniteFieldCyclicGroup}{FFCG}
 <<domain FFCGX FiniteFieldCyclicGroupExtension>>=
 )abbrev domain FFCGX FiniteFieldCyclicGroupExtension
 ++ Authors: J.Grabmeier, A.Scheerhorn
@@ -24136,9 +25072,9 @@ FiniteFieldCyclicGroupExtension(GF,extdeg):_
 \section{domain FFCGP FiniteFieldCyclicGroupExtensionByPolynomial}
 \pagehead{FiniteFieldCyclicGroupExtensionByPolynomial}{FFCGP}
 \pagepic{ps/v103finitefieldcyclicgroupextensionbypolynomial.ps}{FFCGP}{1.00}
-See also:\\
-\refto{FiniteFieldCyclicGroupExtension}{FFCGX}
-\refto{FiniteFieldCyclicGroup}{FFCG}
+{\bf See}\\
+\pageto{FiniteFieldCyclicGroupExtension}{FFCGX}
+\pageto{FiniteFieldCyclicGroup}{FFCG}
 <<domain FFCGP FiniteFieldCyclicGroupExtensionByPolynomial>>=
 )abbrev domain FFCGP FiniteFieldCyclicGroupExtensionByPolynomial
 ++ Authors: J.Grabmeier, A.Scheerhorn
@@ -24458,10 +25394,10 @@ FiniteFieldCyclicGroupExtensionByPolynomial(GF,defpol):_
 \section{domain FFX FiniteFieldExtension}
 \pagehead{FiniteFieldExtension}{FFX}
 \pagepic{ps/v103finitefieldextension.ps}{FFX}{1.00}
-See also:\\
-\refto{FiniteFieldExtensionByPolynomial}{FFP}
-\refto{InnerFiniteField}{IFF}
-\refto{FiniteField}{FF}
+{\bf See}\\
+\pageto{FiniteFieldExtensionByPolynomial}{FFP}
+\pageto{InnerFiniteField}{IFF}
+\pageto{FiniteField}{FF}
 <<domain FFX FiniteFieldExtension>>=
 )abbrev domain FFX FiniteFieldExtension
 ++ Authors: R.Sutor, J. Grabmeier, A. Scheerhorn
@@ -24508,10 +25444,10 @@ FiniteFieldExtension(GF, n): Exports == Implementation where
 \section{domain FFP FiniteFieldExtensionByPolynomial}
 \pagehead{FiniteFieldExtensionByPolynomial}{FFP}
 \pagepic{ps/v103finitefieldextensionbypolynomial.ps}{FFP}{1.00}
-See also:\\
-\refto{FiniteFieldExtension}{FFX}
-\refto{InnerFiniteField}{IFF}
-\refto{FiniteField}{FF}
+{\bf See}\\
+\pageto{FiniteFieldExtension}{FFX}
+\pageto{InnerFiniteField}{IFF}
+\pageto{FiniteField}{FF}
 <<domain FFP FiniteFieldExtensionByPolynomial>>=
 )abbrev domain FFP FiniteFieldExtensionByPolynomial
 ++ Authors: R.Sutor, J. Grabmeier, O. Gschnitzer, A. Scheerhorn
@@ -24755,9 +25691,9 @@ FiniteFieldExtensionByPolynomial(GF:FiniteFieldCategory,_
 \section{domain FFNB FiniteFieldNormalBasis}
 \pagehead{FiniteFieldNormalBasis}{FFNB}
 \pagepic{ps/v103finitefieldnormalbasis.ps}{FFNB}{1.00}
-See also:\\
-\refto{FiniteFieldNormalBasisExtensionByPolynomial}{FFNBP}
-\refto{FiniteFieldNormalBasisExtension}{FFNBX}
+{\bf See}\\
+\pageto{FiniteFieldNormalBasisExtensionByPolynomial}{FFNBP}
+\pageto{FiniteFieldNormalBasisExtension}{FFNBX}
 <<domain FFNB FiniteFieldNormalBasis>>=
 )abbrev domain FFNB FiniteFieldNormalBasis
 ++ Authors: J.Grabmeier, A.Scheerhorn
@@ -24817,9 +25753,9 @@ FiniteFieldNormalBasis(p,extdeg):_
 \section{domain FFNBX FiniteFieldNormalBasisExtension}
 \pagehead{FiniteFieldNormalBasisExtension}{FFNBX}
 \pagepic{ps/v103finitefieldnormalbasisextension.ps}{FFNBX}{1.00}
-See also:\\
-\refto{FiniteFieldNormalBasisExtensionByPolynomial}{FFNBP}
-\refto{FiniteFieldNormalBasis}{FFNB}
+{\bf See}\\
+\pageto{FiniteFieldNormalBasisExtensionByPolynomial}{FFNBP}
+\pageto{FiniteFieldNormalBasis}{FFNB}
 <<domain FFNBX FiniteFieldNormalBasisExtension>>=
 )abbrev domain FFNBX FiniteFieldNormalBasisExtension
 ++ Authors: J.Grabmeier, A.Scheerhorn
@@ -24879,9 +25815,9 @@ FiniteFieldNormalBasisExtension(GF,extdeg):_
 \section{domain FFNBP FiniteFieldNormalBasisExtensionByPolynomial}
 \pagehead{FiniteFieldNormalBasisExtensionByPolynomial}{FFNBP}
 \pagepic{ps/v103finitefieldnormalbasisextensionbypolynomial.ps}{FFNBP}{1.00}
-See also:\\
-\refto{FiniteFieldNormalBasisExtension}{FFNBX}
-\refto{FiniteFieldNormalBasis}{FFNB}
+{\bf See}\\
+\pageto{FiniteFieldNormalBasisExtension}{FFNBX}
+\pageto{FiniteFieldNormalBasis}{FFNB}
 <<domain FFNBP FiniteFieldNormalBasisExtensionByPolynomial>>=
 )abbrev domain FFNBP FiniteFieldNormalBasisExtensionByPolynomial
 ++ Authors: J.Grabmeier, A.Scheerhorn
@@ -25516,12 +26452,12 @@ o )show FlexibleArray
 @
 \pagehead{FlexibleArray}{FARRAY}
 \pagepic{ps/v103flexiblearray.ps}{FARRAY}{1.00}
-See also:\\
-\refto{PrimitiveArray}{PRIMARR}
-\refto{Tuple}{TUPLE}
-\refto{IndexedFlexibleArray}{IFARRAY}
-\refto{IndexedOneDimensionalArray}{IARRAY1}
-\refto{OneDimensionalArray}{ARRAY1}
+{\bf See}\\
+\pageto{PrimitiveArray}{PRIMARR}
+\pageto{Tuple}{TUPLE}
+\pageto{IndexedFlexibleArray}{IFARRAY}
+\pageto{IndexedOneDimensionalArray}{IARRAY1}
+\pageto{OneDimensionalArray}{ARRAY1}
 <<domain FARRAY FlexibleArray>>=
 )abbrev domain FARRAY FlexibleArray
 ++ A FlexibleArray is the notion of an array intended to allow for growth
@@ -27383,14 +28319,14 @@ Float():
 \section{domain FC FortranCode}
 \pagehead{FortranCode}{FC}
 \pagepic{ps/v103fortrancode.ps}{FC}{1.00}
-See also:\\
-\refto{Result}{RESULT}
-\refto{FortranProgram}{FORTRAN}
-\refto{ThreeDimensionalMatrix}{M3D}
-\refto{SimpleFortranProgram}{SFORT}
-\refto{Switch}{SWITCH}
-\refto{FortranTemplate}{FTEM}
-\refto{FortranExpression}{FEXPR}
+{\bf See}\\
+\pageto{Result}{RESULT}
+\pageto{FortranProgram}{FORTRAN}
+\pageto{ThreeDimensionalMatrix}{M3D}
+\pageto{SimpleFortranProgram}{SFORT}
+\pageto{Switch}{SWITCH}
+\pageto{FortranTemplate}{FTEM}
+\pageto{FortranExpression}{FEXPR}
 <<domain FC FortranCode>>=
 )abbrev domain FC FortranCode 
 -- The FortranCode domain is used to represent operations which are to be
@@ -27994,14 +28930,14 @@ FortranCode(): public == private where
 \section{domain FEXPR FortranExpression}
 \pagehead{FortranExpression}{FEXPR}
 \pagepic{ps/v103fortranexpression.ps}{FEXPR}{1.00}
-See also:\\
-\refto{Result}{RESULT}
-\refto{FortranCode}{FC}
-\refto{FortranProgram}{FORTRAN}
-\refto{ThreeDimensionalMatrix}{M3D}
-\refto{SimpleFortranProgram}{SFORT}
-\refto{Switch}{SWITCH}
-\refto{FortranTemplate}{FTEM}
+{\bf See}\\
+\pageto{Result}{RESULT}
+\pageto{FortranCode}{FC}
+\pageto{FortranProgram}{FORTRAN}
+\pageto{ThreeDimensionalMatrix}{M3D}
+\pageto{SimpleFortranProgram}{SFORT}
+\pageto{Switch}{SWITCH}
+\pageto{FortranTemplate}{FTEM}
 <<domain FEXPR FortranExpression>>=
 )abbrev domain FEXPR FortranExpression
 ++ Author: Mike Dewar
@@ -28356,14 +29292,14 @@ FortranExpression(basicSymbols,subscriptedSymbols,R):
 \section{domain FORTRAN FortranProgram}
 \pagehead{FortranProgram}{FORTRAN}
 \pagepic{ps/v103fortranprogram.ps}{FORTRAN}{1.00}
-See also:\\
-\refto{Result}{RESULT}
-\refto{FortranCode}{FC}
-\refto{ThreeDimensionalMatrix}{M3D}
-\refto{SimpleFortranProgram}{SFORT}
-\refto{Switch}{SWITCH}
-\refto{FortranTemplate}{FTEM}
-\refto{FortranExpression}{FEXPR}
+{\bf See}\\
+\pageto{Result}{RESULT}
+\pageto{FortranCode}{FC}
+\pageto{ThreeDimensionalMatrix}{M3D}
+\pageto{SimpleFortranProgram}{SFORT}
+\pageto{Switch}{SWITCH}
+\pageto{FortranTemplate}{FTEM}
+\pageto{FortranExpression}{FEXPR}
 <<domain FORTRAN FortranProgram>>=
 )abbrev domain FORTRAN FortranProgram
 ++ Author: Mike Dewar
@@ -28598,10 +29534,10 @@ FortranProgram(name,returnType,arguments,symbols): Exports == Implement where
 \section{domain FST FortranScalarType}
 \pagehead{FortranScalarType}{FST}
 \pagepic{ps/v103fortranscalartype.ps}{FST}{1.00}
-See also:\\
-\refto{FortranType}{FT}
-\refto{SymbolTable}{SYMTAB}
-\refto{TheSymbolTable}{SYMS}
+{\bf See}\\
+\pageto{FortranType}{FT}
+\pageto{SymbolTable}{SYMTAB}
+\pageto{TheSymbolTable}{SYMS}
 <<domain FST FortranScalarType>>=
 )abbrev domain FST FortranScalarType
 ++ Author: Mike Dewar
@@ -28765,14 +29701,14 @@ FortranScalarType() : exports == implementation where
 \section{domain FTEM FortranTemplate}
 \pagehead{FortranTemplate}{FTEM}
 \pagepic{ps/v103fortrantemplate.ps}{FTEM}{1.00}
-See also:\\
-\refto{Result}{RESULT}
-\refto{FortranCode}{FC}
-\refto{FortranProgram}{FORTRAN}
-\refto{ThreeDimensionalMatrix}{M3D}
-\refto{SimpleFortranProgram}{SFORT}
-\refto{Switch}{SWITCH}
-\refto{FortranExpression}{FEXPR}
+{\bf See}\\
+\pageto{Result}{RESULT}
+\pageto{FortranCode}{FC}
+\pageto{FortranProgram}{FORTRAN}
+\pageto{ThreeDimensionalMatrix}{M3D}
+\pageto{SimpleFortranProgram}{SFORT}
+\pageto{Switch}{SWITCH}
+\pageto{FortranExpression}{FEXPR}
 <<domain FTEM FortranTemplate>>=
 )abbrev domain FTEM FortranTemplate
 ++ Author: Mike Dewar
@@ -28874,10 +29810,10 @@ FortranTemplate() : specification == implementation where
 \section{domain FT FortranType}
 \pagehead{FortranType}{FT}
 \pagepic{ps/v103fortrantype.ps}{FT}{1.00}
-See also:\\
-\refto{FortranScalarType}{FST}
-\refto{SymbolTable}{SYMTAB}
-\refto{TheSymbolTable}{SYMS}
+{\bf See}\\
+\pageto{FortranScalarType}{FST}
+\pageto{SymbolTable}{SYMTAB}
+\pageto{TheSymbolTable}{SYMS}
 <<domain FT FortranType>>=
 )abbrev domain FT FortranType 
 ++ Author: Mike Dewar
@@ -28996,8 +29932,8 @@ FortranType() : exports == implementation where
 \section{domain FCOMP FourierComponent}
 \pagehead{FourierComponent}{FCOMP}
 \pagepic{ps/v103fouriercomponent.ps}{FCOMP}{1.00}
-See also:\\
-\refto{FourierSeries}{FSERIES}
+{\bf See}\\
+\pageto{FourierSeries}{FSERIES}
 <<domain FCOMP FourierComponent>>=
 )abbrev domain FCOMP FourierComponent
 ++ Author: James Davenport
@@ -29050,8 +29986,8 @@ FourierComponent(E:OrderedSet):
 \section{domain FSERIES FourierSeries}
 \pagehead{FourierSeries}{FSERIES}
 \pagepic{ps/v103fourierseries.ps}{FSERIES}{1.00}
-See also:\\
-\refto{FourierComponent}{FCOMP}
+{\bf See}\\
+\pageto{FourierComponent}{FCOMP}
 <<domain FSERIES FourierSeries>>=
 )abbrev domain FSERIES FourierSeries
 ++ Author: James Davenport
@@ -29387,9 +30323,9 @@ o )show Fraction
 @
 \pagehead{Fraction}{FRAC}
 \pagepic{ps/v103fraction.ps}{FRAC}{1.00}
-See also:\\
-\refto{Localize}{LO}
-\refto{LocalAlgebra}{LA}
+{\bf See}\\
+\pageto{Localize}{LO}
+\pageto{LocalAlgebra}{LA}
 <<domain FRAC Fraction>>=
 )abbrev domain FRAC Fraction
 ++ Author:
@@ -29727,10 +30663,10 @@ Fraction(S: IntegralDomain): QuotientFieldCategory S with
 \section{domain FRIDEAL FractionalIdeal}
 \pagehead{FractionalIdeal}{FRIDEAL}
 \pagepic{ps/v103fractionalideal.ps}{FRIDEAL}{1.00}
-See also:\\
-\refto{FramedModule}{FRMOD}
-\refto{HyperellipticFiniteDivisor}{HELLFDIV}
-\refto{FiniteDivisor}{FDIV}
+{\bf See}\\
+\pageto{FramedModule}{FRMOD}
+\pageto{HyperellipticFiniteDivisor}{HELLFDIV}
+\pageto{FiniteDivisor}{FDIV}
 <<domain FRIDEAL FractionalIdeal>>=
 )abbrev domain FRIDEAL FractionalIdeal
 ++ Author: Manuel Bronstein
@@ -29909,10 +30845,10 @@ FractionalIdeal(R, F, UP, A): Exports == Implementation where
 \section{domain FRMOD FramedModule}
 \pagehead{FramedModule}{FRMOD}
 \pagepic{ps/v103framedmodule.ps}{FRMOD}{1.00}
-See also:\\
-\refto{FractionalIdeal}{FRIDEAL}
-\refto{HyperellipticFiniteDivisor}{HELLFDIV}
-\refto{FiniteDivisor}{FDIV}
+{\bf See}\\
+\pageto{FractionalIdeal}{FRIDEAL}
+\pageto{HyperellipticFiniteDivisor}{HELLFDIV}
+\pageto{FiniteDivisor}{FDIV}
 <<domain FRMOD FramedModule>>=
 )abbrev domain FRMOD FramedModule
 ++ Author: Manuel Bronstein
@@ -30028,12 +30964,12 @@ FramedModule(R, F, UP, A, ibasis): Exports == Implementation where
 \section{domain FAGROUP FreeAbelianGroup}
 \pagehead{FreeAbelianGroup}{FAGROUP}
 \pagepic{ps/v103freeabeliangroup.ps}{FAGROUP}{1.00}
-See also:\\
-\refto{ListMonoidOps}{LMOPS}
-\refto{FreeMonoid}{FMONOID}
-\refto{FreeGroup}{FGROUP}
-\refto{InnerFreeAbelianMonoid}{IFAMON}
-\refto{FreeAbelianMonoid}{FAMONOID}
+{\bf See}\\
+\pageto{ListMonoidOps}{LMOPS}
+\pageto{FreeMonoid}{FMONOID}
+\pageto{FreeGroup}{FGROUP}
+\pageto{InnerFreeAbelianMonoid}{IFAMON}
+\pageto{FreeAbelianMonoid}{FAMONOID}
 <<domain FAGROUP FreeAbelianGroup>>=
 )abbrev domain FAGROUP FreeAbelianGroup
 ++ Free abelian group on any set of generators
@@ -30089,12 +31025,12 @@ FreeAbelianGroup(S:SetCategory): Exports == Implementation where
 \section{domain FAMONOID FreeAbelianMonoid}
 \pagehead{FreeAbelianMonoid}{FAMONOID}
 \pagepic{ps/v103freeabelianmonoid.ps}{FAMONOID}{1.00}
-See also:\\
-\refto{ListMonoidOps}{LMOPS}
-\refto{FreeMonoid}{FMONOID}
-\refto{FreeGroup}{FGROUP}
-\refto{InnerFreeAbelianMonoid}{IFAMON}
-\refto{FreeAbelianGroup}{FAGROUP}
+{\bf See}\\
+\pageto{ListMonoidOps}{LMOPS}
+\pageto{FreeMonoid}{FMONOID}
+\pageto{FreeGroup}{FGROUP}
+\pageto{InnerFreeAbelianMonoid}{IFAMON}
+\pageto{FreeAbelianGroup}{FAGROUP}
 <<domain FAMONOID FreeAbelianMonoid>>=
 )abbrev domain FAMONOID FreeAbelianMonoid
 ++ Free abelian monoid on any set of generators
@@ -30120,12 +31056,12 @@ FreeAbelianMonoid(S: SetCategory):
 \section{domain FGROUP FreeGroup}
 \pagehead{FreeGroup}{FGROUP}
 \pagepic{ps/v103freegroup.ps}{FGROUP}{1.00}
-See also:\\
-\refto{ListMonoidOps}{LMOPS}
-\refto{FreeMonoid}{FMONOID}
-\refto{InnerFreeAbelianMonoid}{IFAMON}
-\refto{FreeAbelianMonoid}{FAMONOID}
-\refto{FreeAbelianGroup}{FAGROUP}
+{\bf See}\\
+\pageto{ListMonoidOps}{LMOPS}
+\pageto{FreeMonoid}{FMONOID}
+\pageto{InnerFreeAbelianMonoid}{IFAMON}
+\pageto{FreeAbelianMonoid}{FAMONOID}
+\pageto{FreeAbelianGroup}{FAGROUP}
 <<domain FGROUP FreeGroup>>=
 )abbrev domain FGROUP FreeGroup
 ++ Free group on any set of generators
@@ -30199,10 +31135,10 @@ FreeGroup(S: SetCategory): Join(Group, RetractableTo S) with
 \section{domain FM FreeModule}
 \pagehead{FreeModule}{FM}
 \pagepic{ps/v103freemodule.ps}{FM}{1.00}
-See also:\\
-\refto{PolynomialRing}{PR}
-\refto{SparseUnivariatePolynomial}{SUP}
-\refto{UnivariatePolynomial}{UP}
+{\bf See}\\
+\pageto{PolynomialRing}{PR}
+\pageto{SparseUnivariatePolynomial}{SUP}
+\pageto{UnivariatePolynomial}{UP}
 <<domain FM FreeModule>>=
 )abbrev domain FM FreeModule
 ++ Author: Dave Barton, James Davenport, Barry Trager
@@ -30393,12 +31329,12 @@ FreeModule1(R:Ring,S:OrderedSet): FMcat == FMdef where
 \section{domain FMONOID FreeMonoid}
 \pagehead{FreeMonoid}{FMONOID}
 \pagepic{ps/v103freemonoid.ps}{FMONOID}{1.00}
-See also:\\
-\refto{ListMonoidOps}{LMOPS}
-\refto{FreeGroup}{FGROUP}
-\refto{InnerFreeAbelianMonoid}{IFAMON}
-\refto{FreeAbelianMonoid}{FAMONOID}
-\refto{FreeAbelianGroup}{FAGROUP}
+{\bf See}\\
+\pageto{ListMonoidOps}{LMOPS}
+\pageto{FreeGroup}{FGROUP}
+\pageto{InnerFreeAbelianMonoid}{IFAMON}
+\pageto{FreeAbelianMonoid}{FAMONOID}
+\pageto{FreeAbelianGroup}{FAGROUP}
 <<domain FMONOID FreeMonoid>>=
 )abbrev domain FMONOID FreeMonoid
 ++ Free monoid on any set of generators
@@ -30593,9 +31529,9 @@ FreeMonoid(S: SetCategory): FMcategory == FMdefinition where
 \section{domain FNLA FreeNilpotentLie}
 \pagehead{FreeNilpotentLie}{FNLA}
 \pagepic{ps/v103freenilpotentlie.ps}{FNLA}{1.00}
-See also:\\
-\refto{OrdSetInts}{OSI}
-\refto{Commutator}{COMM}
+{\bf See}\\
+\pageto{OrdSetInts}{OSI}
+\pageto{Commutator}{COMM}
 <<domain FNLA FreeNilpotentLie>>=
 )abbrev domain FNLA FreeNilpotentLie
 ++ Author: Larry Lambe
@@ -31618,9 +32554,9 @@ o )show GeneralDistributedMultivariatePolynomial
 @
 \pagehead{GeneralDistributedMultivariatePolynomial}{GDMP}
 \pagepic{ps/v103generaldistributedmultivariatepolynomial.ps}{GDMP}{1.00}
-See also:\\
-\refto{DistributedMultivariatePolynomial}{DMP}
-\refto{HomogeneousDistributedMultivariatePolynomial}{HDMP}
+{\bf See}\\
+\pageto{DistributedMultivariatePolynomial}{DMP}
+\pageto{HomogeneousDistributedMultivariatePolynomial}{HDMP}
 <<domain GDMP GeneralDistributedMultivariatePolynomial>>=
 )abbrev domain GDMP GeneralDistributedMultivariatePolynomial
 ++ Author: Barry Trager
@@ -31882,8 +32818,8 @@ GeneralDistributedMultivariatePolynomial(vl,R,E): public == private where
 \section{domain GMODPOL GeneralModulePolynomial}
 \pagehead{GeneralModulePolynomial}{GMODPOL}
 \pagepic{ps/v103generalmodulepolynomial.ps}{GMODPOL}{1.00}
-See also:\\
-\refto{ModuleMonomial}{MODMONOM}
+{\bf See}\\
+\pageto{ModuleMonomial}{MODMONOM}
 <<domain GMODPOL GeneralModulePolynomial>>=
 )abbrev domain GMODPOL GeneralModulePolynomial
 ++ Description:
@@ -32442,13 +33378,13 @@ o )show GeneralSparseTable
 @
 \pagehead{GeneralSparseTable}{GSTBL}
 \pagepic{ps/v103generalsparsetable.ps}{GSTBL}{1.00}
-See also:\\
-\refto{HashTable}{HASHTBL}
-\refto{InnerTable}{INTABL}
-\refto{Table}{TABLE}
-\refto{EqTable}{EQTBL}
-\refto{StringTable}{STRTBL}
-\refto{SparseTable}{STBL}
+{\bf See}\\
+\pageto{HashTable}{HASHTBL}
+\pageto{InnerTable}{INTABL}
+\pageto{Table}{TABLE}
+\pageto{EqTable}{EQTBL}
+\pageto{StringTable}{STRTBL}
+\pageto{SparseTable}{STBL}
 <<domain GSTBL GeneralSparseTable>>=
 )abbrev domain GSTBL GeneralSparseTable
 ++ Author: Stephen M. Watt
@@ -32496,8 +33432,8 @@ GeneralSparseTable(Key, Entry, Tbl, dent): TableAggregate(Key, Entry) == Impl
 \section{domain GTSET GeneralTriangularSet}
 \pagehead{GeneralTriangularSet}{GTSET}
 \pagepic{ps/v103generaltriangularset.ps}{GTSET}{1.00}
-See also:\\
-\refto{WuWenTsunTriangularSet}{WUTSET}
+{\bf See}\\
+\pageto{WuWenTsunTriangularSet}{WUTSET}
 <<domain GTSET GeneralTriangularSet>>=
 )abbrev domain GTSET GeneralTriangularSet
 ++ Author: Marc Moreno Maza (marc@nag.co.uk)
@@ -33306,13 +34242,13 @@ GuessOption(): Exports == Implementation where
 \section{domain HASHTBL HashTable}
 \pagehead{HashTable}{HASHTBL}
 \pagepic{ps/v103hashtable.ps}{HASHTBL}{1.00}
-See also:\\
-\refto{InnerTable}{INTABL}
-\refto{Table}{TABLE}
-\refto{EqTable}{EQTBL}
-\refto{StringTable}{STRTBL}
-\refto{GeneralSparseTable}{GSTBL}
-\refto{SparseTable}{STBL}
+{\bf See}\\
+\pageto{InnerTable}{INTABL}
+\pageto{Table}{TABLE}
+\pageto{EqTable}{EQTBL}
+\pageto{StringTable}{STRTBL}
+\pageto{GeneralSparseTable}{GSTBL}
+\pageto{SparseTable}{STBL}
 <<domain HASHTBL HashTable>>=
 )abbrev domain HASHTBL HashTable
 ++ Author: Stephen M. Watt
@@ -33508,11 +34444,11 @@ o )show Heap
 @
 \pagehead{Heap}{HEAP}
 \pagepic{ps/v103heap.ps}{HEAP}{1.00}
-See also:\\
-\refto{Stack}{STACK}
-\refto{ArrayStack}{ASTACK}
-\refto{Queue}{QUEUE}
-\refto{Dequeue}{DEQUEUE}
+{\bf See}\\
+\pageto{Stack}{STACK}
+\pageto{ArrayStack}{ASTACK}
+\pageto{Queue}{QUEUE}
+\pageto{Dequeue}{DEQUEUE}
 <<domain HEAP Heap>>=
 )abbrev domain HEAP Heap
 ++ Author: Michael Monagan and Stephen Watt
@@ -33745,10 +34681,10 @@ o )show HexadecimalExpansion
 @
 \pagehead{HexadecimalExpansion}{HEXADEC}
 \pagepic{ps/v103hexadecimalexpansion.ps}{HEXADEC}{1.00}
-See also:\\
-\refto{RadixExpansion}{RADIX}
-\refto{BinaryExpansion}{BINARY}
-\refto{DecimalExpansion}{DECIMAL}
+{\bf See}\\
+\pageto{RadixExpansion}{RADIX}
+\pageto{BinaryExpansion}{BINARY}
+\pageto{DecimalExpansion}{DECIMAL}
 <<domain HEXADEC HexadecimalExpansion>>=
 )abbrev domain HEXADEC HexadecimalExpansion
 ++ Author: Clifton J. Williamson
@@ -33792,9 +34728,9 @@ HexadecimalExpansion(): Exports == Implementation where
 \section{domain HDP HomogeneousDirectProduct}
 \pagehead{HomogeneousDirectProduct}{HDP}
 \pagepic{ps/v103homogeneousdirectproduct.ps}{HDP}{1.00}
-See also:\\
-\refto{OrderedDirectProduct}{ODP}
-\refto{SplitHomogeneousDirectProduct}{SHDP}
+{\bf See}\\
+\pageto{OrderedDirectProduct}{ODP}
+\pageto{SplitHomogeneousDirectProduct}{SHDP}
 <<domain HDP HomogeneousDirectProduct>>=
 )abbrev domain HDP HomogeneousDirectProduct
 ++ Author:
@@ -34054,9 +34990,9 @@ o )show HomogeneousDistributedMultivariatePolynomial
 @
 \pagehead{HomogeneousDistributedMultivariatePolynomial}{HDMP}
 \pagepic{ps/v103homogeneousdistributedmultivariatepolynomial.ps}{HDMP}{1.00}
-See also:\\
-\refto{GeneralDistributedMultivariatePolynomial}{GDMP}
-\refto{DistributedMultivariatePolynomial}{DMP}
+{\bf See}\\
+\pageto{GeneralDistributedMultivariatePolynomial}{GDMP}
+\pageto{DistributedMultivariatePolynomial}{DMP}
 <<domain HDMP HomogeneousDistributedMultivariatePolynomial>>=
 )abbrev domain HDMP HomogeneousDistributedMultivariatePolynomial
 ++ Author: Barry Trager
@@ -34103,10 +35039,10 @@ HomogeneousDistributedMultivariatePolynomial(vl,R): public == private where
 \section{domain HELLFDIV HyperellipticFiniteDivisor}
 \pagehead{HyperellipticFiniteDivisor}{HELLFDIV}
 \pagepic{ps/v103hyperellipticfinitedivisor.ps}{HELLFDIV}{1.00}
-See also:\\
-\refto{FractionalIdeal}{FRIDEAL}
-\refto{FramedModule}{FRMOD}
-\refto{FiniteDivisor}{FDIV}
+{\bf See}\\
+\pageto{FractionalIdeal}{FRIDEAL}
+\pageto{FramedModule}{FRMOD}
+\pageto{FiniteDivisor}{FDIV}
 <<domain HELLFDIV HyperellipticFiniteDivisor>>=
 )abbrev domain HELLFDIV HyperellipticFiniteDivisor
 ++ Finite rational divisors on an hyperelliptic curve
@@ -34287,10 +35223,10 @@ HyperellipticFiniteDivisor(F, UP, UPUP, R): Exports == Implementation where
 \section{domain ICARD IndexCard}
 \pagehead{IndexCard}{ICARD}
 \pagepic{ps/v103indexcard.ps}{ICARD}{1.00}
-See also:\\
-\refto{DataList}{DLIST}
-\refto{Database}{DBASE}
-\refto{QueryEquation}{QEQUAT}
+{\bf See}\\
+\pageto{DataList}{DLIST}
+\pageto{Database}{DBASE}
+\pageto{QueryEquation}{QEQUAT}
 <<domain ICARD IndexCard>>=
 )abbrev domain ICARD IndexCard
 ++ This domain implements a container of information
@@ -34359,10 +35295,10 @@ IndexCard() : Exports == Implementation where
 \section{domain IBITS IndexedBits}
 \pagehead{IndexedBits}{IBITS}
 \pagepic{ps/v103indexedbits.ps}{IBITS}{1.00}
-See also:\\
-\refto{Reference}{REF}
-\refto{Boolean}{BOOLEAN}
-\refto{Bits}{BITS}
+{\bf See}\\
+\pageto{Reference}{REF}
+\pageto{Boolean}{BOOLEAN}
+\pageto{Bits}{BITS}
 <<domain IBITS IndexedBits>>=
 )abbrev domain IBITS IndexedBits
 ++ Author: Stephen Watt and Michael Monagan
@@ -34434,11 +35370,11 @@ IndexedBits(mn:Integer): BitAggregate() with
 \section{domain IDPAG IndexedDirectProductAbelianGroup}
 \pagehead{IndexedDirectProductAbelianGroup}{IDPAG}
 \pagepic{ps/v103indexeddirectproductabeliangroup.ps}{IDPAG}{1.00}
-See also:\\
-\refto{IndexedDirectProductObject}{IDPO}
-\refto{IndexedDirectProductAbelianMonoid}{IDPAM}
-\refto{IndexedDirectProductOrderedAbelianMonoid}{IDPOAM}
-\refto{IndexedDirectProductOrderedAbelianMonoidSup}{IDPOAMS}
+{\bf See}\\
+\pageto{IndexedDirectProductObject}{IDPO}
+\pageto{IndexedDirectProductAbelianMonoid}{IDPAM}
+\pageto{IndexedDirectProductOrderedAbelianMonoid}{IDPOAM}
+\pageto{IndexedDirectProductOrderedAbelianMonoidSup}{IDPOAMS}
 <<domain IDPAG IndexedDirectProductAbelianGroup>>=
 )abbrev domain IDPAG IndexedDirectProductAbelianGroup
 ++ Indexed direct products of abelian groups over an abelian group \spad{A} of
@@ -34518,11 +35454,11 @@ IndexedDirectProductAbelianGroup(A:AbelianGroup,S:OrderedSet):
 \section{domain IDPAM IndexedDirectProductAbelianMonoid}
 \pagehead{IndexedDirectProductAbelianMonoid}{IDPAM}
 \pagepic{ps/v103indexeddirectproductabelianmonoid.ps}{IDPAM}{1.00}
-See also:\\
-\refto{IndexedDirectProductObject}{IDPO}
-\refto{IndexedDirectProductOrderedAbelianMonoid}{IDPOAM}
-\refto{IndexedDirectProductOrderedAbelianMonoidSup}{IDPOAMS}
-\refto{IndexedDirectProductAbelianGroup}{IDPAG}
+{\bf See}\\
+\pageto{IndexedDirectProductObject}{IDPO}
+\pageto{IndexedDirectProductOrderedAbelianMonoid}{IDPOAM}
+\pageto{IndexedDirectProductOrderedAbelianMonoidSup}{IDPOAMS}
+\pageto{IndexedDirectProductAbelianGroup}{IDPAG}
 <<domain IDPAM IndexedDirectProductAbelianMonoid>>=
 )abbrev domain IDPAM IndexedDirectProductAbelianMonoid
 ++ Indexed direct products of abelian monoids over an abelian monoid \spad{A} of
@@ -34613,11 +35549,11 @@ IndexedDirectProductAbelianMonoid(A:AbelianMonoid,S:OrderedSet):
 \section{domain IDPO IndexedDirectProductObject}
 \pagehead{IndexedDirectProductObject}{IDPO}
 \pagepic{ps/v103indexeddirectproductobject.ps}{IDPO}{1.00}
-See also:\\
-\refto{IndexedDirectProductAbelianMonoid}{IDPAM}
-\refto{IndexedDirectProductOrderedAbelianMonoid}{IDPOAM}
-\refto{IndexedDirectProductOrderedAbelianMonoidSup}{IDPOAMS}
-\refto{IndexedDirectProductAbelianGroup}{IDPAG}
+{\bf See}\\
+\pageto{IndexedDirectProductAbelianMonoid}{IDPAM}
+\pageto{IndexedDirectProductOrderedAbelianMonoid}{IDPOAM}
+\pageto{IndexedDirectProductOrderedAbelianMonoidSup}{IDPOAMS}
+\pageto{IndexedDirectProductAbelianGroup}{IDPAG}
 <<domain IDPO IndexedDirectProductObject>>=
 )abbrev domain IDPO IndexedDirectProductObject
 ++ Indexed direct products of objects over a set \spad{A}
@@ -34670,11 +35606,11 @@ IndexedDirectProductObject(A:SetCategory,S:OrderedSet): IndexedDirectProductCate
 \section{domain IDPOAM IndexedDirectProductOrderedAbelianMonoid}
 \pagehead{IndexedDirectProductOrderedAbelianMonoid}{IDPOAM}
 \pagepic{ps/v103indexeddirectproductorderedabelianmonoid.ps}{IDPOAM}{1.00}
-See also:\\
-\refto{IndexedDirectProductObject}{IDPO}
-\refto{IndexedDirectProductAbelianMonoid}{IDPAM}
-\refto{IndexedDirectProductOrderedAbelianMonoidSup}{IDPOAMS}
-\refto{IndexedDirectProductAbelianGroup}{IDPAG}
+{\bf See}\\
+\pageto{IndexedDirectProductObject}{IDPO}
+\pageto{IndexedDirectProductAbelianMonoid}{IDPAM}
+\pageto{IndexedDirectProductOrderedAbelianMonoidSup}{IDPOAMS}
+\pageto{IndexedDirectProductAbelianGroup}{IDPAG}
 <<domain IDPOAM IndexedDirectProductOrderedAbelianMonoid>>=
 )abbrev domain IDPOAM IndexedDirectProductOrderedAbelianMonoid
 ++ Indexed direct products of ordered abelian monoids \spad{A} of
@@ -34707,11 +35643,11 @@ IndexedDirectProductOrderedAbelianMonoid(A:OrderedAbelianMonoid,S:OrderedSet):
 \section{domain IDPOAMS IndexedDirectProductOrderedAbelianMonoidSup}
 \pagehead{IndexedDirectProductOrderedAbelianMonoidSup}{IDPOAMS}
 \pagepic{ps/v103indexeddirectproductorderedabelianmonoidsup.ps}{IDPOAMS}{1.00}
-See also:\\
-\refto{IndexedDirectProductObject}{IDPO}
-\refto{IndexedDirectProductAbelianMonoid}{IDPAM}
-\refto{IndexedDirectProductOrderedAbelianMonoid}{IDPOAM}
-\refto{IndexedDirectProductAbelianGroup}{IDPAG}
+{\bf See}\\
+\pageto{IndexedDirectProductObject}{IDPO}
+\pageto{IndexedDirectProductAbelianMonoid}{IDPAM}
+\pageto{IndexedDirectProductOrderedAbelianMonoid}{IDPOAM}
+\pageto{IndexedDirectProductAbelianGroup}{IDPAG}
 <<domain IDPOAMS IndexedDirectProductOrderedAbelianMonoidSup>>=
 )abbrev domain IDPOAMS IndexedDirectProductOrderedAbelianMonoidSup
 ++ Indexed direct products of ordered abelian monoid sups \spad{A},
@@ -34761,10 +35697,10 @@ IndexedDirectProductOrderedAbelianMonoidSup(A:OrderedAbelianMonoidSup,S:OrderedS
 \section{domain INDE IndexedExponents}
 \pagehead{IndexedExponents}{INDE}
 \pagepic{ps/v103indexedexponents.ps}{INDE}{1.00}
-See also:\\
-\refto{Polynomial}{POLY}
-\refto{MultivariatePolynomial}{MPOLY}
-\refto{SparseMultivariatePolynomial}{SMP}
+{\bf See}\\
+\pageto{Polynomial}{POLY}
+\pageto{MultivariatePolynomial}{MPOLY}
+\pageto{SparseMultivariatePolynomial}{SMP}
 <<domain INDE IndexedExponents>>=
 )abbrev domain INDE IndexedExponents
 ++ Author: James Davenport
@@ -34808,12 +35744,12 @@ IndexedExponents(Varset:OrderedSet): C == T where
 \section{domain IFARRAY IndexedFlexibleArray}
 \pagehead{IndexedFlexibleArray}{IFARRAY}
 \pagepic{ps/v103indexedflexiblearray.ps}{IFARRAY}{1.00}
-See also:\\
-\refto{PrimitiveArray}{PRIMARR}
-\refto{Tuple}{TUPLE}
-\refto{FlexibleArray}{FARRAY}
-\refto{IndexedOneDimensionalArray}{IARRAY1}
-\refto{OneDimensionalArray}{ARRAY1}
+{\bf See}\\
+\pageto{PrimitiveArray}{PRIMARR}
+\pageto{Tuple}{TUPLE}
+\pageto{FlexibleArray}{FARRAY}
+\pageto{IndexedOneDimensionalArray}{IARRAY1}
+\pageto{OneDimensionalArray}{ARRAY1}
 <<domain IFARRAY IndexedFlexibleArray>>=
 )abbrev domain IFARRAY IndexedFlexibleArray
 ++ Author: Michael Monagan July/87, modified SMW June/91
@@ -35058,9 +35994,9 @@ IndexedFlexibleArray(S:Type, mn: Integer): Exports == Implementation where
 \section{domain ILIST IndexedList}
 \pagehead{IndexedList}{ILIST}
 \pagepic{ps/v103indexedlist.ps}{ILIST}{1.00}
-See also:\\
-\refto{List}{LIST}
-\refto{AssociationList}{ALIST}
+{\bf See}\\
+\pageto{List}{LIST}
+\pageto{AssociationList}{ALIST}
 <<domain ILIST IndexedList>>=
 )abbrev domain ILIST IndexedList
 ++ Author: Michael Monagan
@@ -35262,10 +36198,10 @@ IndexedList(S:Type, mn:Integer): Exports == Implementation where
 \section{domain IMATRIX IndexedMatrix}
 \pagehead{IndexedMatrix}{IMATRIX}
 \pagepic{ps/v103indexedmatrix.ps}{IMATRIX}{1.00}
-See also:\\
-\refto{Matrix}{MATRIX}
-\refto{RectangularMatrix}{RMATRIX}
-\refto{SquareMatrix}{SQMATRIX}
+{\bf See}\\
+\pageto{Matrix}{MATRIX}
+\pageto{RectangularMatrix}{RMATRIX}
+\pageto{SquareMatrix}{SQMATRIX}
 <<domain IMATRIX IndexedMatrix>>=
 )abbrev domain IMATRIX IndexedMatrix
 ++ Author: Grabmeier, Gschnitzer, Williamson
@@ -35345,12 +36281,12 @@ IndexedMatrix(R,mnRow,mnCol): Exports == Implementation where
 \section{domain IARRAY1 IndexedOneDimensionalArray}
 \pagehead{IndexedOneDimensionalArray}{IARRAY1}
 \pagepic{ps/v103indexedonedimensionalarray.ps}{IARRAY1}{1.00}
-See also:\\
-\refto{PrimitiveArray}{PRIMARR}
-\refto{Tuple}{TUPLE}
-\refto{IndexedFlexibleArray}{IFARRAY}
-\refto{FlexibleArray}{FARRAY}
-\refto{OneDimensionalArray}{ARRAY1}
+{\bf See}\\
+\pageto{PrimitiveArray}{PRIMARR}
+\pageto{Tuple}{TUPLE}
+\pageto{IndexedFlexibleArray}{IFARRAY}
+\pageto{FlexibleArray}{FARRAY}
+\pageto{OneDimensionalArray}{ARRAY1}
 <<domain IARRAY1 IndexedOneDimensionalArray>>=
 )abbrev domain IARRAY1 IndexedOneDimensionalArray
 ++ Author Micheal Monagan Aug/87
@@ -35448,10 +36384,10 @@ IndexedOneDimensionalArray(S:Type, mn:Integer):
 \section{domain ISTRING IndexedString}
 \pagehead{IndexedString}{ISTRING}
 \pagepic{ps/v103indexedstring.ps}{ISTRING}{1.00}
-See also:\\
-\refto{Character}{CHAR}
-\refto{CharacterClass}{CCLASS}
-\refto{String}{STRING}
+{\bf See}\\
+\pageto{Character}{CHAR}
+\pageto{CharacterClass}{CCLASS}
+\pageto{String}{STRING}
 <<domain ISTRING IndexedString>>=
 )abbrev domain ISTRING IndexedString
 ++ Authors: Stephen Watt, Michael Monagan, Manuel Bronstein 1986 .. 1991
@@ -35676,9 +36612,9 @@ the first element of a 'Row' is the same as the index of the
 first column in an array and vice versa.
 \pagehead{IndexedTwoDimensionalArray}{IARRAY2}
 \pagepic{ps/v103indexedtwodimensionalarray.ps}{IARRAY2}{1.00}
-See also:\\
-\refto{InnerIndexedTwoDimensionalArray}{IIARRAY2}
-\refto{TwoDimensionalArray}{ARRAY2}
+{\bf See}\\
+\pageto{InnerIndexedTwoDimensionalArray}{IIARRAY2}
+\pageto{TwoDimensionalArray}{ARRAY2}
 <<domain IARRAY2 IndexedTwoDimensionalArray>>=
 )abbrev domain IARRAY2 IndexedTwoDimensionalArray
 IndexedTwoDimensionalArray(R,mnRow,mnCol):Exports == Implementation where
@@ -35781,8 +36717,8 @@ InfiniteTuple(S:Type): Exports == Implementation where
 \section{domain IAN InnerAlgebraicNumber}
 \pagehead{InnerAlgebraicNumber}{IAN}
 \pagepic{ps/v103inneralgebraicnumber.ps}{IAN}{1.00}
-See also:\\
-\refto{AlgebraicNumber}{AN}
+{\bf See}\\
+\pageto{AlgebraicNumber}{AN}
 <<domain IAN InnerAlgebraicNumber>>=
 )abbrev domain IAN InnerAlgebraicNumber
 ++ Algebraic closure of the rational numbers
@@ -35938,10 +36874,10 @@ InnerAlgebraicNumber(): Exports == Implementation where
 \section{domain IFF InnerFiniteField}
 \pagehead{InnerFiniteField}{IFF}
 \pagepic{ps/v103innerfinitefield.ps}{IFF}{1.00}
-See also:\\
-\refto{FiniteFieldExtensionByPolynomial}{FFP}
-\refto{FiniteFieldExtension}{FFX}
-\refto{FiniteField}{FF}
+{\bf See}\\
+\pageto{FiniteFieldExtensionByPolynomial}{FFP}
+\pageto{FiniteFieldExtension}{FFX}
+\pageto{FiniteField}{FF}
 <<domain IFF InnerFiniteField>>=
 )abbrev domain IFF InnerFiniteField
 ++ Author: ???
@@ -35977,12 +36913,12 @@ InnerFiniteField(p:PositiveInteger, n:PositiveInteger) ==
 \section{domain IFAMON InnerFreeAbelianMonoid}
 \pagehead{InnerFreeAbelianMonoid}{IFAMON}
 \pagepic{ps/v103innerfreeabelianmonoid.ps}{IFAMON}{1.00}
-See also:\\
-\refto{ListMonoidOps}{LMOPS}
-\refto{FreeMonoid}{FMONOID}
-\refto{FreeGroup}{FGROUP}
-\refto{FreeAbelianMonoid}{FAMONOID}
-\refto{FreeAbelianGroup}{FAGROUP}
+{\bf See}\\
+\pageto{ListMonoidOps}{LMOPS}
+\pageto{FreeMonoid}{FMONOID}
+\pageto{FreeGroup}{FGROUP}
+\pageto{FreeAbelianMonoid}{FAMONOID}
+\pageto{FreeAbelianGroup}{FAGROUP}
 <<domain IFAMON InnerFreeAbelianMonoid>>=
 )abbrev domain IFAMON InnerFreeAbelianMonoid
 ++ Internal free abelian monoid on any set of generators
@@ -36032,9 +36968,9 @@ This is an internal type which provides an implementation of
 2-dimensional arrays as PrimitiveArray's of PrimitiveArray's.
 \pagehead{InnerIndexedTwoDimensionalArray}{IIARRAY2}
 \pagepic{ps/v103innerindexedtwodimensionalarray.ps}{IIARRAY2}{1.00}
-See also:\\
-\refto{IndexedTwoDimensionalArray}{IARRAY2}
-\refto{TwoDimensionalArray}{ARRAY2}
+{\bf See}\\
+\pageto{IndexedTwoDimensionalArray}{IARRAY2}
+\pageto{TwoDimensionalArray}{ARRAY2}
 <<domain IIARRAY2 InnerIndexedTwoDimensionalArray>>=
 )abbrev domain IIARRAY2 InnerIndexedTwoDimensionalArray
 InnerIndexedTwoDimensionalArray(R,mnRow,mnCol,Row,Col):_
@@ -36129,12 +37065,12 @@ InnerIndexedTwoDimensionalArray(R,mnRow,mnCol,Row,Col):_
 \section{domain IPADIC InnerPAdicInteger}
 \pagehead{InnerPAdicInteger}{IPADIC}
 \pagepic{ps/v103innerpadicinteger.ps}{IPADIC}{1.00}
-See also:\\
-\refto{PAdicInteger}{PADIC}
-\refto{BalancedPAdicInteger}{BPADIC}
-\refto{PAdicRationalConstructor}{PADICRC}
-\refto{PAdicRational}{PADICRAT}
-\refto{BalancedPAdicRational}{BPADICRT}
+{\bf See}\\
+\pageto{PAdicInteger}{PADIC}
+\pageto{BalancedPAdicInteger}{BPADIC}
+\pageto{PAdicRationalConstructor}{PADICRC}
+\pageto{PAdicRational}{PADICRAT}
+\pageto{BalancedPAdicRational}{BPADICRT}
 <<domain IPADIC InnerPAdicInteger>>=
 )abbrev domain IPADIC InnerPAdicInteger
 ++ Author: Clifton J. Williamson
@@ -36397,8 +37333,8 @@ InnerPAdicInteger(p,unBalanced?): Exports == Implementation where
 \section{domain IPF InnerPrimeField}
 \pagehead{InnerPrimeField}{IPF}
 \pagepic{ps/v103innerprimefield.ps}{IPF}{1.00}
-See also:\\
-\refto{PrimeField}{PF}
+{\bf See}\\
+\pageto{PrimeField}{PF}
 <<domain IPF InnerPrimeField>>=
 )abbrev domain IPF InnerPrimeField
 -- Argument MUST be a prime.
@@ -37660,13 +38596,13 @@ InnerSparseUnivariatePowerSeries(Coef): Exports == Implementation where
 \section{domain INTABL InnerTable}
 \pagehead{InnerTable}{INTABL}
 \pagepic{ps/v103innertable.ps}{INTABL}{1.00}
-See also:\\
-\refto{HashTable}{HASHTBL}
-\refto{Table}{TABLE}
-\refto{EqTable}{EQTBL}
-\refto{StringTable}{STRTBL}
-\refto{GeneralSparseTable}{GSTBL}
-\refto{SparseTable}{STBL}
+{\bf See}\\
+\pageto{HashTable}{HASHTBL}
+\pageto{Table}{TABLE}
+\pageto{EqTable}{EQTBL}
+\pageto{StringTable}{STRTBL}
+\pageto{GeneralSparseTable}{GSTBL}
+\pageto{SparseTable}{STBL}
 <<domain INTABL InnerTable>>=
 )abbrev domain INTABL InnerTable
 ++ Author: Barry Trager
@@ -37701,8 +38637,8 @@ InnerTable(Key: SetCategory, Entry: SetCategory, addDom):Exports == Implementati
 \section{domain ITAYLOR InnerTaylorSeries}
 \pagehead{InnerTaylorSeries}{ITAYLOR}
 \pagepic{ps/v103innertaylorseries.ps}{ITAYLOR}{1.00}
-See also:\\
-\refto{UnivariateTaylorSeries}{UTS}
+{\bf See}\\
+\pageto{UnivariateTaylorSeries}{UTS}
 <<domain ITAYLOR InnerTaylorSeries>>=
 )abbrev domain ITAYLOR InnerTaylorSeries
 ++ Author: Clifton J. Williamson
@@ -38710,10 +39646,10 @@ o )show Integer
 @
 \pagehead{Integer}{INT}
 \pagepic{ps/v103integer.ps}{INT}{1.00}
-See also:\\
-\refto{NonNegativeInteger}{NNI}
-\refto{PositiveInteger}{PI}
-\refto{RomanNumeral}{ROMAN}
+{\bf See}\\
+\pageto{NonNegativeInteger}{NNI}
+\pageto{PositiveInteger}{PI}
+\pageto{RomanNumeral}{ROMAN}
 <<domain INT Integer>>=
 )abbrev domain INT Integer
 ++ Author:
@@ -40058,8 +40994,8 @@ o )show Kernel
 @
 \pagehead{Kernel}{KERNEL}
 \pagepic{ps/v103kernel.ps}{KERNEL}{1.00}
-See also:\\
-\refto{MakeCachableSet}{MKCHSET}
+{\bf See}\\
+\pageto{MakeCachableSet}{MKCHSET}
 <<domain KERNEL Kernel>>=
 )abbrev domain KERNEL Kernel
 ++ Operators applied to elements of a set
@@ -40340,11 +41276,11 @@ o )show KeyedAccessFile
 @
 \pagehead{KeyedAccessFile}{KAFILE}
 \pagepic{ps/v103keyedaccessfile.ps}{KAFILE}{1.00}
-See also:\\
-\refto{File}{FILE}
-\refto{TextFile}{TEXTFILE}
-\refto{BinaryFile}{BINFILE}
-\refto{Library}{LIB}
+{\bf See}\\
+\pageto{File}{FILE}
+\pageto{TextFile}{TEXTFILE}
+\pageto{BinaryFile}{BINFILE}
+\pageto{Library}{LIB}
 <<domain KAFILE KeyedAccessFile>>=
 )abbrev domain KAFILE KeyedAccessFile
 ++ Author: Stephen M. Watt
@@ -40718,11 +41654,11 @@ o )show Library
 @
 \pagehead{Library}{LIB}
 \pagepic{ps/v103library.ps}{LIB}{1.00}
-See also:\\
-\refto{File}{FILE}
-\refto{TextFile}{TEXTFILE}
-\refto{BinaryFile}{BINFILE}
-\refto{KeyedAccessFile}{KAFILE}
+{\bf See}\\
+\pageto{File}{FILE}
+\pageto{TextFile}{TEXTFILE}
+\pageto{BinaryFile}{BINFILE}
+\pageto{KeyedAccessFile}{KAFILE}
 <<domain LIB Library>>=
 )abbrev domain LIB Library
 ++ Author: Stephen M. Watt
@@ -41740,9 +42676,9 @@ LiePolynomial(VarSet:OrderedSet, R:CommutativeRing) : Public == Private where
 \section{domain LSQM LieSquareMatrix}
 \pagehead{LieSquareMatrix}{LSQM}
 \pagepic{ps/v103liesquarematrix.ps}{LSQM}{1.00}
-See also:\\
-\refto{AssociatedLieAlgebra}{LIE}
-\refto{AssociatedJordanAlgebra}{JORDAN}
+{\bf See}\\
+\pageto{AssociatedLieAlgebra}{LIE}
+\pageto{AssociatedJordanAlgebra}{JORDAN}
 <<domain LSQM LieSquareMatrix>>=
 )abbrev domain LSQM LieSquareMatrix
 ++ Author: J. Grabmeier
@@ -42326,9 +43262,9 @@ o )show LinearOrdinaryDifferentialOperator
 @
 \pagehead{LinearOrdinaryDifferentialOperator}{LODO}
 \pagepic{ps/v103linearordinarydifferentialoperator.ps}{LODO}{1.00}
-See also:\\
-\refto{LinearOrdinaryDifferentialOperator1}{LODO1}
-\refto{LinearOrdinaryDifferentialOperator2}{LODO2}
+{\bf See}\\
+\pageto{LinearOrdinaryDifferentialOperator1}{LODO1}
+\pageto{LinearOrdinaryDifferentialOperator2}{LODO2}
 <<domain LODO LinearOrdinaryDifferentialOperator>>=
 )abbrev domain LODO LinearOrdinaryDifferentialOperator
 ++ Author: Manuel Bronstein
@@ -42760,9 +43696,9 @@ o )show LinearOrdinaryDifferentialOperator1
 @
 \pagehead{LinearOrdinaryDifferentialOperator1}{LODO1}
 \pagepic{ps/v103linearordinarydifferentialoperator1.ps}{LODO1}{1.00}
-See also:\\
-\refto{LinearOrdinaryDifferentialOperator}{LODO}
-\refto{LinearOrdinaryDifferentialOperator2}{LODO2}
+{\bf See}\\
+\pageto{LinearOrdinaryDifferentialOperator}{LODO}
+\pageto{LinearOrdinaryDifferentialOperator2}{LODO2}
 <<domain LODO1 LinearOrdinaryDifferentialOperator1>>=
 )abbrev domain LODO1 LinearOrdinaryDifferentialOperator1
 ++ Author: Manuel Bronstein
@@ -43308,9 +44244,9 @@ o )show LinearOrdinaryDifferentialOperator2
 @
 \pagehead{LinearOrdinaryDifferentialOperator2}{LODO2}
 \pagepic{ps/v103linearordinarydifferentialoperator2.ps}{LODO2}{1.00}
-See also:\\
-\refto{LinearOrdinaryDifferentialOperator}{LODO}
-\refto{LinearOrdinaryDifferentialOperator1}{LODO1}
+{\bf See}\\
+\pageto{LinearOrdinaryDifferentialOperator}{LODO}
+\pageto{LinearOrdinaryDifferentialOperator1}{LODO1}
 <<domain LODO2 LinearOrdinaryDifferentialOperator2>>=
 )abbrev domain LODO2 LinearOrdinaryDifferentialOperator2
 ++ Author: Stephen M. Watt, Manuel Bronstein
@@ -43904,9 +44840,9 @@ o )show List
 @
 \pagehead{List}{LIST}
 \pagepic{ps/v103list.ps}{LIST}{1.00}
-See also:\\
-\refto{IndexedList}{ILIST}
-\refto{AssociationList}{ALIST}
+{\bf See}\\
+\pageto{IndexedList}{ILIST}
+\pageto{AssociationList}{ALIST}
 <<domain LIST List>>=
 )abbrev domain LIST List
 ++ Author: Michael Monagan
@@ -44053,12 +44989,12 @@ List(S:Type): Exports == Implementation where
 \section{domain LMOPS ListMonoidOps}
 \pagehead{ListMonoidOps}{LMOPS}
 \pagepic{ps/v103listmonoidops.ps}{LMOPS}{1.00}
-See also:\\
-\refto{FreeMonoid}{FMONOID}
-\refto{FreeGroup}{FGROUP}
-\refto{InnerFreeAbelianMonoid}{IFAMON}
-\refto{FreeAbelianMonoid}{FAMONOID}
-\refto{FreeAbelianGroup}{FAGROUP}
+{\bf See}\\
+\pageto{FreeMonoid}{FMONOID}
+\pageto{FreeGroup}{FGROUP}
+\pageto{InnerFreeAbelianMonoid}{IFAMON}
+\pageto{FreeAbelianMonoid}{FAMONOID}
+\pageto{FreeAbelianGroup}{FAGROUP}
 <<domain LMOPS ListMonoidOps>>=
 )abbrev domain LMOPS ListMonoidOps
 ++ Internal representation for monoids
@@ -44380,9 +45316,9 @@ ListMultiDictionary(S:SetCategory): MultiDictionary(S) with
 \section{domain LA LocalAlgebra}
 \pagehead{LocalAlgebra}{LA}
 \pagepic{ps/v103localalgebra.ps}{LA}{1.00}
-See also:\\
-\refto{Localize}{LO}
-\refto{Fraction}{FRAC}
+{\bf See}\\
+\pageto{Localize}{LO}
+\pageto{Fraction}{FRAC}
 <<domain LA LocalAlgebra>>=
 )abbrev domain LA LocalAlgebra
 ++ Author: Dave Barton, Barry Trager
@@ -44424,9 +45360,9 @@ LocalAlgebra(A: Algebra R,
 \section{domain LO Localize}
 \pagehead{Localize}{LO}
 \pagepic{ps/v103localize.ps}{LO}{1.00}
-See also:\\
-\refto{LocalAlgebra}{LA}
-\refto{Fraction}{FRAC}
+{\bf See}\\
+\pageto{LocalAlgebra}{LA}
+\pageto{Fraction}{FRAC}
 <<domain LO Localize>>=
 )abbrev domain LO Localize
 ++ Author: Dave Barton, Barry Trager
@@ -45015,9 +45951,9 @@ LyndonWord(VarSet:OrderedSet):Public == Private where
 \section{domain MCMPLX MachineComplex}
 \pagehead{MachineComplex}{MCMPLX}
 \pagepic{ps/v103machinecomplex.ps}{MCMPLX}{1.00}
-See also:\\
-\refto{MachineInteger}{MINT}
-\refto{MachineFloat}{MFLOAT}
+{\bf See}\\
+\pageto{MachineInteger}{MINT}
+\pageto{MachineFloat}{MFLOAT}
 <<domain MCMPLX MachineComplex>>=
 )abbrev domain MCMPLX MachineComplex
 ++ Date Created:  December 1993
@@ -45075,9 +46011,9 @@ MachineComplex():Exports == Implementation where
 \section{domain MFLOAT MachineFloat}
 \pagehead{MachineFloat}{MFLOAT}
 \pagepic{ps/v103machinefloat.ps}{MFLOAT}{1.00}
-See also:\\
-\refto{MachineInteger}{MINT}
-\refto{MachineComplex}{MCMPLX}
+{\bf See}\\
+\pageto{MachineInteger}{MINT}
+\pageto{MachineComplex}{MCMPLX}
 <<domain MFLOAT MachineFloat>>=
 )abbrev domain MFLOAT MachineFloat
 ++ Author: Mike Dewar
@@ -45390,9 +46326,9 @@ MachineFloat(): Exports == Implementation where
 \section{domain MINT MachineInteger}
 \pagehead{MachineInteger}{MINT}
 \pagepic{ps/v103machineinteger.ps}{MINT}{1.00}
-See also:\\
-\refto{MachineFloat}{MFLOAT}
-\refto{MachineComplex}{MCMPLX}
+{\bf See}\\
+\pageto{MachineFloat}{MFLOAT}
+\pageto{MachineComplex}{MCMPLX}
 <<domain MINT MachineInteger>>=
 )abbrev domain MINT MachineInteger
 ++ Author: Mike Dewar
@@ -45907,8 +46843,8 @@ Magma(VarSet:OrderedSet):Public == Private where
 \section{domain MKCHSET MakeCachableSet}
 \pagehead{MakeCachableSet}{MKCHSET}
 \pagepic{ps/v103makecachableset.ps}{MKCHSET}{1.00}
-See also:\\
-\refto{Kernel}{KERNEL}
+{\bf See}\\
+\pageto{Kernel}{KERNEL}
 <<domain MKCHSET MakeCachableSet>>=
 )abbrev domain MKCHSET MakeCachableSet
 ++ Make a cachable set from any set
@@ -46867,10 +47803,10 @@ o )show Matrix
 @
 \pagehead{Matrix}{MATRIX}
 \pagepic{ps/v103matrix.ps}{MATRIX}{1.00}
-See also:\\
-\refto{IndexedMatrix}{IMATRIX}
-\refto{RectangularMatrix}{RMATRIX}
-\refto{SquareMatrix}{SQMATRIX}
+{\bf See}\\
+\pageto{IndexedMatrix}{IMATRIX}
+\pageto{RectangularMatrix}{RMATRIX}
+\pageto{SquareMatrix}{SQMATRIX}
 <<domain MATRIX Matrix>>=
 )abbrev domain MATRIX Matrix
 ++ Author: Grabmeier, Gschnitzer, Williamson
@@ -47235,9 +48171,9 @@ ModMonic(R,Rep): C == T
 \section{domain MODFIELD ModularField}
 \pagehead{ModularField}{MODFIELD}
 \pagepic{ps/v103modularfield.ps}{MODFIELD}{1.00}
-See also:\\
-\refto{ModularRing}{MODRING}
-\refto{EuclideanModularRing}{EMR}
+{\bf See}\\
+\pageto{ModularRing}{MODRING}
+\pageto{EuclideanModularRing}{EMR}
 <<domain MODFIELD ModularField>>=
 )abbrev domain MODFIELD ModularField
 ++ These domains are used for the factorization and gcds
@@ -47274,9 +48210,9 @@ ModularField(R,Mod,reduction:(R,Mod) -> R,
 \section{domain MODRING ModularRing}
 \pagehead{ModularRing}{MODRING}
 \pagepic{ps/v103modularring.ps}{MODRING}{1.00}
-See also:\\
-\refto{EuclideanModularRing}{EMR}
-\refto{ModularField}{MODFIELD}
+{\bf See}\\
+\pageto{EuclideanModularRing}{EMR}
+\pageto{ModularField}{MODFIELD}
 <<domain MODRING ModularRing>>=
 )abbrev domain MODRING ModularRing
 ++ Author: P.Gianni, B.Trager
@@ -47378,8 +48314,8 @@ ModularRing(R,Mod,reduction:(R,Mod) -> R,
 \section{domain MODMONOM ModuleMonomial}
 \pagehead{ModuleMonomial}{MODMONOM}
 \pagepic{ps/v103modulemonomial.ps}{MODMONOM}{1.00}
-See also:\\
-\refto{GeneralModulePolynomial}{GMODPOL}
+{\bf See}\\
+\pageto{GeneralModulePolynomial}{GMODPOL}
 <<domain MODMONOM ModuleMonomial>>=
 )abbrev domain MODMONOM ModuleMonomial
 ++ Description:
@@ -47421,8 +48357,8 @@ ModuleMonomial(IS: OrderedSet,
 \section{domain MODOP ModuleOperator}
 \pagehead{ModuleOperator}{MODOP}
 \pagepic{ps/v103moduleoperator.ps}{MODOP}{1.00}
-See also:\\
-\refto{Operator}{OP}
+{\bf See}\\
+\pageto{Operator}{OP}
 <<domain MODOP ModuleOperator>>=
 )abbrev domain MODOP ModuleOperator
 ++ Author: Manuel Bronstein
@@ -48808,10 +49744,10 @@ o )show MultivariatePolynomial
 @
 \pagehead{MultivariatePolynomial}{MPOLY}
 \pagepic{ps/v103multivariatepolynomial.ps}{MPOLY}{1.00}
-See also:\\
-\refto{Polynomial}{POLY}
-\refto{SparseMultivariatePolynomial}{SMP}
-\refto{IndexedExponents}{INDE}
+{\bf See}\\
+\pageto{Polynomial}{POLY}
+\pageto{SparseMultivariatePolynomial}{SMP}
+\pageto{IndexedExponents}{INDE}
 <<domain MPOLY MultivariatePolynomial>>=
 )abbrev domain MPOLY MultivariatePolynomial
 ++ Author: Dave Barton, Barry Trager
@@ -48846,8 +49782,8 @@ MultivariatePolynomial(vl:List Symbol, R:Ring)
 \section{domain MYEXPR MyExpression}
 \pagehead{MyExpression}{MYEXPR}
 \pagepic{ps/v103myexpression.ps}{MYEXPR}{1.00}
-See also:\\
-\refto{MyUnivariatePolynomial}{MYUP}
+{\bf See}\\
+\pageto{MyUnivariatePolynomial}{MYUP}
 <<domain MYEXPR MyExpression>>=
 )abbrev domain MYEXPR MyExpression
 MyExpression(q: Symbol, R): Exports == Implementation where
@@ -48909,8 +49845,8 @@ MyExpression(q: Symbol, R): Exports == Implementation where
 \section{domain MYUP MyUnivariatePolynomial}
 \pagehead{MyUnivariatePolynomial}{MYUP}
 \pagepic{ps/v103myunivariatepolynomial.ps}{MYUP}{1.00}
-See also:\\
-\refto{MyExpression}{MYEXPR}
+{\bf See}\\
+\pageto{MyExpression}{MYEXPR}
 <<domain MYUP MyUnivariatePolynomial>>=
 )abbrev domain MYUP MyUnivariatePolynomial
 MyUnivariatePolynomial(x:Symbol, R:Ring):
@@ -48959,8 +49895,8 @@ some additional operations related to polynomial system solving
 by means of triangular sets.
 \pagehead{NewSparseMultivariatePolynomial}{NSMP}
 \pagepic{ps/v103newsparsemultivariatepolynomial.ps}{NSMP}{1.00}
-See also:\\
-\refto{NewSparseUnivariatePolynomial}{NSUP}
+{\bf See}\\
+\pageto{NewSparseUnivariatePolynomial}{NSUP}
 <<domain NSMP NewSparseMultivariatePolynomial>>=
 )abbrev domain NSMP NewSparseMultivariatePolynomial
 ++ Author: Marc Moreno Maza
@@ -49373,8 +50309,8 @@ constructor {\bf NewSparseUnivariatePolynomial} extends the
 constructur {\bf SparseUnivariatePolynomial}. 
 \pagehead{NewSparseUnivariatePolynomial}{NSUP}
 \pagepic{ps/v103newsparseunivariatepolynomial.ps}{NSUP}{1.00}
-See also:\\
-\refto{NewSparseMultivariatePolynomial}{NSMP}
+{\bf See}\\
+\pageto{NewSparseMultivariatePolynomial}{NSMP}
 <<domain NSUP NewSparseUnivariatePolynomial>>=
 )abbrev domain NSUP NewSparseUnivariatePolynomial
 ++ Author: Marc Moreno Maza
@@ -49705,8 +50641,8 @@ o )show None
 @
 \pagehead{None}{NONE}
 \pagepic{ps/v103none.ps}{NONE}{1.00}
-See also:\\
-\refto{Any}{ANY}
+{\bf See}\\
+\pageto{Any}{ANY}
 <<domain NONE None>>=
 )abbrev domain NONE None
 ++ Author:
@@ -49740,10 +50676,10 @@ None():SetCategory == add
 \section{domain NNI NonNegativeInteger}
 \pagehead{NonNegativeInteger}{NNI}
 \pagepic{ps/v103nonnegativeinteger.ps}{NNI}{1.00}
-See also:\\
-\refto{Integer}{INT}
-\refto{PositiveInteger}{PI}
-\refto{RomanNumeral}{ROMAN}
+{\bf See}\\
+\pageto{Integer}{INT}
+\pageto{PositiveInteger}{PI}
+\pageto{RomanNumeral}{ROMAN}
 <<domain NNI NonNegativeInteger>>=
 )abbrev domain NNI NonNegativeInteger
 ++ Author:
@@ -50678,12 +51614,12 @@ o )show OneDimensionalArray
 @
 \pagehead{OneDimensionalArray}{ARRAY1}
 \pagepic{ps/v103onedimensionalarray.ps}{ARRAY1}{1.00}
-See also:\\
-\refto{PrimitiveArray}{PRIMARR}
-\refto{Tuple}{TUPLE}
-\refto{IndexedFlexibleArray}{IFARRAY}
-\refto{FlexibleArray}{FARRAY}
-\refto{IndexedOneDimensionalArray}{IARRAY1}
+{\bf See}\\
+\pageto{PrimitiveArray}{PRIMARR}
+\pageto{Tuple}{TUPLE}
+\pageto{IndexedFlexibleArray}{IFARRAY}
+\pageto{FlexibleArray}{FARRAY}
+\pageto{IndexedOneDimensionalArray}{IARRAY1}
 <<domain ARRAY1 OneDimensionalArray>>=
 )abbrev domain ARRAY1 OneDimensionalArray
 ++ This is the domain of 1-based one dimensional arrays
@@ -50721,8 +51657,8 @@ OneDimensionalArray(S:Type): Exports == Implementation where
 \section{domain ONECOMP OnePointCompletion}
 \pagehead{OnePointCompletion}{ONECOMP}
 \pagepic{ps/v103onepointcompletion.ps}{ONECOMP}{1.00}
-See also:\\
-\refto{OrderedCompletion}{ORDCOMP}
+{\bf See}\\
+\pageto{OrderedCompletion}{ORDCOMP}
 <<domain ONECOMP OnePointCompletion>>=
 )abbrev domain ONECOMP OnePointCompletion
 ++ Completion with infinity
@@ -50836,9 +51772,9 @@ OnePointCompletion(R:SetCategory): Exports == Implementation where
 \section{domain OMCONN OpenMathConnection}
 \pagehead{OpenMathConnection}{OMCONN}
 \pagepic{ps/v103openmathconnection.ps}{OMCONN}{1.00}
-See also:\\
-\refto{OpenMathEncoding}{OMENC}
-\refto{OpenMathDevice}{OMDEV}
+{\bf See}\\
+\pageto{OpenMathEncoding}{OMENC}
+\pageto{OpenMathDevice}{OMDEV}
 <<domain OMCONN OpenMathConnection>>=
 )abbrev domain OMCONN OpenMathConnection
 ++ Author: Vilya Harvey
@@ -50885,9 +51821,9 @@ OpenMathConnection(): with
 \section{domain OMDEV OpenMathDevice}
 \pagehead{OpenMathDevice}{OMDEV}
 \pagepic{ps/v103openmathdevice.ps}{OMDEV}{1.00}
-See also:\\
-\refto{OpenMathEncoding}{OMENC}
-\refto{OpenMathConnection}{OMCONN}
+{\bf See}\\
+\pageto{OpenMathEncoding}{OMENC}
+\pageto{OpenMathConnection}{OMCONN}
 <<domain OMDEV OpenMathDevice>>=
 )abbrev domain OMDEV OpenMathDevice
 ++ Author: Vilya Harvey
@@ -51063,9 +51999,9 @@ OpenMathDevice(): with
 \section{domain OMENC OpenMathEncoding}
 \pagehead{OpenMathEncoding}{OMENC}
 \pagepic{ps/v103openmathencoding.ps}{OMENC}{1.00}
-See also:\\
-\refto{OpenMathDevice}{OMDEV}
-\refto{OpenMathConnection}{OMCONN}
+{\bf See}\\
+\pageto{OpenMathDevice}{OMDEV}
+\pageto{OpenMathConnection}{OMCONN}
 <<domain OMENC OpenMathEncoding>>=
 )abbrev domain OMENC OpenMathEncoding
 ++ Author: Vilya Harvey
@@ -51122,8 +52058,8 @@ OpenMathEncoding(): SetCategory with
 \section{domain OMERR OpenMathError}
 \pagehead{OpenMathError}{OMERR}
 \pagepic{ps/v103openmatherror.ps}{OMERR}{1.00}
-See also:\\
-\refto{OpenMathErrorKind}{OMERRK}
+{\bf See}\\
+\pageto{OpenMathErrorKind}{OMERRK}
 <<domain OMERR OpenMathError>>=
 )abbrev domain OMERR OpenMathError
 ++ Author: Vilya Harvey
@@ -51179,8 +52115,8 @@ OpenMathError() : SetCategory with
 \section{domain OMERRK OpenMathErrorKind}
 \pagehead{OpenMathErrorKind}{OMERRK}
 \pagepic{ps/v103openmatherrorkind.ps}{OMERRK}{1.00}
-See also:\\
-\refto{OpenMathError}{OMERR}
+{\bf See}\\
+\pageto{OpenMathError}{OMERR}
 <<domain OMERRK OpenMathErrorKind>>=
 )abbrev domain OMERRK OpenMathErrorKind
 ++ Author: Vilya Harvey
@@ -51625,8 +52561,8 @@ o )show Operator
 @
 \pagehead{Operator}{OP}
 \pagepic{ps/v103operator.ps}{OP}{1.00}
-See also:\\
-\refto{ModuleOperator}{MODOP}
+{\bf See}\\
+\pageto{ModuleOperator}{MODOP}
 <<domain OP Operator>>=
 )abbrev domain OP Operator
 ++ Author: Manuel Bronstein
@@ -51647,10 +52583,10 @@ Operator(R: Ring) == ModuleOperator(R,R)
 \section{domain OMLO OppositeMonogenicLinearOperator}
 \pagehead{OppositeMonogenicLinearOperator}{OMLO}
 \pagepic{ps/v103oppositemonogeniclinearoperator.ps}{OMLO}{1.00}
-See also:\\
-\refto{OrdinaryDifferentialRing}{ODR}
-\refto{DirectProductModule}{DPMO}
-\refto{DirectProductMatrixModule}{DPMM}
+{\bf See}\\
+\pageto{OrdinaryDifferentialRing}{ODR}
+\pageto{DirectProductModule}{DPMO}
+\pageto{DirectProductMatrixModule}{DPMM}
 <<domain OMLO OppositeMonogenicLinearOperator>>=
 )abbrev domain OMLO OppositeMonogenicLinearOperator
 ++ Author: Stephen M. Watt
@@ -51698,8 +52634,8 @@ OppositeMonogenicLinearOperator(P, R): OPRcat == OPRdef where
 \section{domain ORDCOMP OrderedCompletion}
 \pagehead{OrderedCompletion}{ORDCOMP}
 \pagepic{ps/v103orderedcompletion.ps}{ORDCOMP}{1.00}
-See also:\\
-\refto{OnePointCompletion}{ONECOMP}
+{\bf See}\\
+\pageto{OnePointCompletion}{ONECOMP}
 <<domain ORDCOMP OrderedCompletion>>=
 )abbrev domain ORDCOMP OrderedCompletion
 ++ Completion with + and - infinity
@@ -51839,9 +52775,9 @@ OrderedCompletion(R:SetCategory): Exports == Implementation where
 \section{domain ODP OrderedDirectProduct}
 \pagehead{OrderedDirectProduct}{ODP}
 \pagepic{ps/v103ordereddirectproduct.ps}{ODP}{1.00}
-See also:\\
-\refto{HomogeneousDirectProduct}{HDP}
-\refto{SplitHomogeneousDirectProduct}{SHDP}
+{\bf See}\\
+\pageto{HomogeneousDirectProduct}{HDP}
+\pageto{SplitHomogeneousDirectProduct}{SHDP}
 <<domain ODP OrderedDirectProduct>>=
 )abbrev domain ODP OrderedDirectProduct
 -- all direct product category domains must be compiled
@@ -52180,11 +53116,11 @@ OrderedVariableList(VariableList:List Symbol):
 @
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{domain ODPOL OrderlyDifferentialPolynomial}
-See also:\\
-\refto{OrderlyDifferentialVariable}{ODVAR}
-\refto{SequentialDifferentialVariable}{SDVAR}
-\refto{DifferentialSparseMultivariatePolynomial}{DSMP}
-\refto{SequentialDifferentialPolynomial}{SDPOL}
+{\bf See}\\
+\pageto{OrderlyDifferentialVariable}{ODVAR}
+\pageto{SequentialDifferentialVariable}{SDVAR}
+\pageto{DifferentialSparseMultivariatePolynomial}{DSMP}
+\pageto{SequentialDifferentialPolynomial}{SDPOL}
 <<OrderlyDifferentialPolynomial.input>>=
 -- dpolcat.spad.pamphlet OrderlyDifferentialPolynomial.input
 )spool OrderlyDifferentialPolynomial.output
@@ -52882,11 +53818,11 @@ OrderlyDifferentialPolynomial(R):
 \section{domain ODVAR OrderlyDifferentialVariable}
 \pagehead{OrderlyDifferentialVariable}{ODVAR}
 \pagepic{ps/v103orderlydifferentialvariable.ps}{ODVAR}{1.00}
-See also:\\
-\refto{SequentialDifferentialVariable}{SDVAR}
-\refto{DifferentialSparseMultivariatePolynomial}{DSMP}
-\refto{OrderlyDifferentialPolynomial}{ODPOL}
-\refto{SequentialDifferentialPolynomial}{SDPOL}
+{\bf See}\\
+\pageto{SequentialDifferentialVariable}{SDVAR}
+\pageto{DifferentialSparseMultivariatePolynomial}{DSMP}
+\pageto{OrderlyDifferentialPolynomial}{ODPOL}
+\pageto{SequentialDifferentialPolynomial}{SDPOL}
 <<domain ODVAR OrderlyDifferentialVariable>>=
 )abbrev domain ODVAR OrderlyDifferentialVariable
 ++ Author:  William Sit
@@ -52932,10 +53868,10 @@ OrderlyDifferentialVariable(S:OrderedSet):DifferentialVariableCategory(S)
 \section{domain ODR OrdinaryDifferentialRing}
 \pagehead{OrdinaryDifferentialRing}{ODR}
 \pagepic{ps/v103ordinarydifferentialring.ps}{ODR}{1.00}
-See also:\\
-\refto{OppositeMonogenicLinearOperator}{OMLO}
-\refto{DirectProductModule}{DPMO}
-\refto{DirectProductMatrixModule}{DPMM}
+{\bf See}\\
+\pageto{OppositeMonogenicLinearOperator}{OMLO}
+\pageto{DirectProductModule}{DPMO}
+\pageto{DirectProductMatrixModule}{DPMM}
 <<domain ODR OrdinaryDifferentialRing>>=
 )abbrev domain ODR OrdinaryDifferentialRing
 ++ Author: Stephen M. Watt
@@ -53034,9 +53970,9 @@ OrdinaryWeightedPolynomials(R:Ring,
 \section{domain OSI OrdSetInts}
 \pagehead{OrdSetInts}{OSI}
 \pagepic{ps/v103ordsetints.ps}{OSI}{1.00}
-See also:\\
-\refto{Commutator}{COMM}
-\refto{FreeNilpotentLie}{FNLA}
+{\bf See}\\
+\pageto{Commutator}{COMM}
+\pageto{FreeNilpotentLie}{FNLA}
 <<domain OSI OrdSetInts>>=
 )abbrev domain OSI OrdSetInts
 ++  Author : Larry Lambe
@@ -53547,12 +54483,12 @@ OutputForm(): SetCategory with
 \section{domain PADIC PAdicInteger}
 \pagehead{PAdicInteger}{PADIC}
 \pagepic{ps/v103padicinteger.ps}{PADIC}{1.00}
-See also:\\
-\refto{InnerPAdicInteger}{IPADIC}
-\refto{BalancedPAdicInteger}{BPADIC}
-\refto{PAdicRationalConstructor}{PADICRC}
-\refto{PAdicRational}{PADICRAT}
-\refto{BalancedPAdicRational}{BPADICRT}
+{\bf See}\\
+\pageto{InnerPAdicInteger}{IPADIC}
+\pageto{BalancedPAdicInteger}{BPADIC}
+\pageto{PAdicRationalConstructor}{PADICRC}
+\pageto{PAdicRational}{PADICRAT}
+\pageto{BalancedPAdicRational}{BPADICRT}
 <<domain PADIC PAdicInteger>>=
 )abbrev domain PADIC PAdicInteger
 ++ Author: Clifton J. Williamson
@@ -53582,12 +54518,12 @@ PAdicInteger(p:Integer) == InnerPAdicInteger(p,true$Boolean)
 \section{domain PADICRAT PAdicRational}
 \pagehead{PAdicRational}{PADICRAT}
 \pagepic{ps/v103padicrational.ps}{PADICRAT}{1.00}
-See also:\\
-\refto{InnerPAdicInteger}{IPADIC}
-\refto{PAdicInteger}{PADIC}
-\refto{BalancedPAdicInteger}{BPADIC}
-\refto{PAdicRationalConstructor}{PADICRC}
-\refto{BalancedPAdicRational}{BPADICRT}
+{\bf See}\\
+\pageto{InnerPAdicInteger}{IPADIC}
+\pageto{PAdicInteger}{PADIC}
+\pageto{BalancedPAdicInteger}{BPADIC}
+\pageto{PAdicRationalConstructor}{PADICRC}
+\pageto{BalancedPAdicRational}{BPADICRT}
 <<domain PADICRAT PAdicRational>>=
 )abbrev domain PADICRAT PAdicRational
 ++ Author: Clifton J. Williamson
@@ -53617,12 +54553,12 @@ PAdicRational(p:Integer) == PAdicRationalConstructor(p,PAdicInteger p)
 \section{domain PADICRC PAdicRationalConstructor}
 \pagehead{PAdicRationalConstructor}{PADICRC}
 \pagepic{ps/v103padicrationalconstructor.ps}{PADICRC}{1.00}
-See also:\\
-\refto{InnerPAdicInteger}{IPADIC}
-\refto{PAdicInteger}{PADIC}
-\refto{BalancedPAdicInteger}{BPADIC}
-\refto{PAdicRational}{PADICRAT}
-\refto{BalancedPAdicRational}{BPADICRT}
+{\bf See}\\
+\pageto{InnerPAdicInteger}{IPADIC}
+\pageto{PAdicInteger}{PADIC}
+\pageto{BalancedPAdicInteger}{BPADIC}
+\pageto{PAdicRational}{PADICRAT}
+\pageto{BalancedPAdicRational}{BPADICRT}
 <<domain PADICRC PAdicRationalConstructor>>=
 )abbrev domain PADICRC PAdicRationalConstructor
 ++ Author: Clifton J. Williamson
@@ -53815,8 +54751,8 @@ PAdicRationalConstructor(p,PADIC): Exports == Implementation where
 \section{domain PALETTE Palette}
 \pagehead{Palette}{PALETTE}
 \pagepic{ps/v103palette.ps}{PALETTE}{1.00}
-See also:\\
-\refto{Color}{COLOR}
+{\bf See}\\
+\pageto{Color}{COLOR}
 <<domain PALETTE Palette>>=
 )abbrev domain PALETTE Palette
 ++ Author: Jim Wen
@@ -53883,9 +54819,9 @@ Palette(): Exports == Implementation where
 \section{domain PARPCURV ParametricPlaneCurve}
 \pagehead{ParametricPlaneCurve}{PARPCURV}
 \pagepic{ps/v103parametricplanecurve.ps}{PARPCURV}{1.00}
-See also:\\
-\refto{ParametricSpaceCurve}{PARSCURV}
-\refto{ParametricSurface}{PARSURF}
+{\bf See}\\
+\pageto{ParametricSpaceCurve}{PARSCURV}
+\pageto{ParametricSurface}{PARSURF}
 <<domain PARPCURV ParametricPlaneCurve>>=
 )abbrev domain PARPCURV ParametricPlaneCurve
 ++ Author: Clifton J. Williamson
@@ -53934,9 +54870,9 @@ ParametricPlaneCurve(ComponentFunction): Exports == Implementation where
 \section{domain PARSCURV ParametricSpaceCurve}
 \pagehead{ParametricSpaceCurve}{PARSCURV}
 \pagepic{ps/v103parametricspacecurve.ps}{PARSCURV}{1.00}
-See also:\\
-\refto{ParametricPlaneCurve}{PARPCURV}
-\refto{ParametricSurface}{PARSURF}
+{\bf See}\\
+\pageto{ParametricPlaneCurve}{PARPCURV}
+\pageto{ParametricSurface}{PARSURF}
 <<domain PARSCURV ParametricSpaceCurve>>=
 )abbrev domain PARSCURV ParametricSpaceCurve
 ++ Author: Clifton J. Williamson
@@ -53988,9 +54924,9 @@ ParametricSpaceCurve(ComponentFunction): Exports == Implementation where
 \section{domain PARSURF ParametricSurface}
 \pagehead{ParametricSurface}{PARSURF}
 \pagepic{ps/v103parametricsurface.ps}{PARSURF}{1.00}
-See also:\\
-\refto{ParametricPlaneCurve}{PARPCURV}
-\refto{ParametricSpaceCurve}{PARSCURV}
+{\bf See}\\
+\pageto{ParametricPlaneCurve}{PARPCURV}
+\pageto{ParametricSpaceCurve}{PARSCURV}
 <<domain PARSURF ParametricSurface>>=
 )abbrev domain PARSURF ParametricSurface
 ++ Author: Clifton J. Williamson
@@ -54656,8 +55592,8 @@ PartialFraction(R: EuclideanDomain): Cat == Capsule where
 \section{domain PRTITION Partition}
 \pagehead{Partition}{PRTITION}
 \pagepic{ps/v103partition.ps}{PRTITION}{1.00}
-See also:\\
-\refto{SymmetricPolynomial}{SYMPOLY}
+{\bf See}\\
+\pageto{SymmetricPolynomial}{SYMPOLY}
 <<domain PRTITION Partition>>=
 )abbrev domain PRTITION Partition
 ++ Domain for partitions of positive integers
@@ -55182,8 +56118,8 @@ Pattern(R:SetCategory): Exports == Implementation where
 \section{domain PATLRES PatternMatchListResult}
 \pagehead{PatternMatchListResult}{PATLRES}
 \pagepic{ps/v103patternmatchlistresult.ps}{PATLRES}{1.00}
-See also:\\
-\refto{PatternMatchResult}{PATRES}
+{\bf See}\\
+\pageto{PatternMatchResult}{PATRES}
 <<domain PATLRES PatternMatchListResult>>=
 )abbrev domain PATLRES PatternMatchListResult
 ++ Result returned by the pattern matcher when using lists
@@ -55241,8 +56177,8 @@ PatternMatchListResult(R:SetCategory, S:SetCategory, L:ListAggregate S):
 \section{domain PATRES PatternMatchResult}
 \pagehead{PatternMatchResult}{PATRES}
 \pagepic{ps/v103patternmatchresult.ps}{PATRES}{1.00}
-See also:\\
-\refto{PatternMatchListResult}{PATLRES}
+{\bf See}\\
+\pageto{PatternMatchListResult}{PATLRES}
 <<domain PATRES PatternMatchResult>>=
 )abbrev domain PATRES PatternMatchResult
 ++ Result returned by the pattern matcher
@@ -55357,12 +56293,12 @@ A PendantTree(S)is either a leaf? and is an S or has
 a left and a right both PendantTree(S)'s
 \pagehead{PendantTree}{PENDTREE}
 \pagepic{ps/v103pendanttree.ps}{PENDTREE}{1.00}
-See also:\\
-\refto{Tree}{TREE}
-\refto{BinaryTree}{BTREE}
-\refto{BinarySearchTree}{BSTREE}
-\refto{BinaryTournament}{BTOURN}
-\refto{BalancedBinaryTree}{BBTREE}
+{\bf See}\\
+\pageto{Tree}{TREE}
+\pageto{BinaryTree}{BTREE}
+\pageto{BinarySearchTree}{BSTREE}
+\pageto{BinaryTournament}{BTOURN}
+\pageto{BalancedBinaryTree}{BBTREE}
 <<domain PENDTREE PendantTree>>=
 )abbrev domain PENDTREE PendantTree
 PendantTree(S: SetCategory): T == C where
@@ -56728,8 +57664,8 @@ PermutationGroup(S:SetCategory): public == private where
 \section{domain HACKPI Pi}
 \pagehead{Pi}{HACKPI}
 \pagepic{ps/v103pi.ps}{HACKPI}{1.00}
-See also:\\
-\refto{Expression}{EXPR}
+{\bf See}\\
+\pageto{Expression}{EXPR}
 <<domain HACKPI Pi>>=
 )abbrev domain HACKPI Pi
 ++ Expressions in %pi only
@@ -59340,9 +60276,9 @@ PoincareBirkhoffWittLyndonBasis(VarSet: OrderedSet): Public == Private where
 \section{domain POINT Point}
 \pagehead{Point}{POINT}
 \pagepic{ps/v103point.ps}{POINT}{1.00}
-See also:\\
-\refto{SubSpaceComponentProperty}{COMPPROP}
-\refto{SubSpace}{SUBSPACE}
+{\bf See}\\
+\pageto{SubSpaceComponentProperty}{COMPPROP}
+\pageto{SubSpace}{SUBSPACE}
 <<domain POINT Point>>=
 )abbrev domain POINT Point
 ++ Description:
@@ -60173,10 +61109,10 @@ o )show Polynomial
 @
 \pagehead{Polynomial}{POLY}
 \pagepic{ps/v103polynomial.ps}{POLY}{1.00}
-See also:\\
-\refto{MultivariatePolynomial}{MPOLY}
-\refto{SparseMultivariatePolynomial}{SMP}
-\refto{IndexedExponents}{INDE}
+{\bf See}\\
+\pageto{MultivariatePolynomial}{MPOLY}
+\pageto{SparseMultivariatePolynomial}{SMP}
+\pageto{IndexedExponents}{INDE}
 <<domain POLY Polynomial>>=
 )abbrev domain POLY Polynomial
 ++ Author: Dave Barton, Barry Trager
@@ -60656,10 +61592,10 @@ PolynomialIdeals(F,Expon,VarSet,DPoly) : C == T
 \section{domain PR PolynomialRing}
 \pagehead{PolynomialRing}{PR}
 \pagepic{ps/v103polynomialring.ps}{PR}{1.00}
-See also:\\
-\refto{FreeModule}{FM}
-\refto{SparseUnivariatePolynomial}{SUP}
-\refto{UnivariatePolynomial}{UP}
+{\bf See}\\
+\pageto{FreeModule}{FM}
+\pageto{SparseUnivariatePolynomial}{SUP}
+\pageto{UnivariatePolynomial}{UP}
 <<domain PR PolynomialRing>>=
 )abbrev domain PR PolynomialRing
 ++ Author: Dave Barton, James Davenport, Barry Trager
@@ -60976,10 +61912,10 @@ PolynomialRing(R:Ring,E:OrderedAbelianMonoid): T == C
 \section{domain PI PositiveInteger}
 \pagehead{PositiveInteger}{PI}
 \pagepic{ps/v103positiveinteger.ps}{PI}{1.00}
-See also:\\
-\refto{Integer}{INT}
-\refto{NonNegativeInteger}{NNI}
-\refto{RomanNumeral}{ROMAN}
+{\bf See}\\
+\pageto{Integer}{INT}
+\pageto{NonNegativeInteger}{NNI}
+\pageto{RomanNumeral}{ROMAN}
 <<domain PI PositiveInteger>>=
 )abbrev domain PI PositiveInteger
 ++ Author:
@@ -61013,8 +61949,8 @@ PositiveInteger: Join(AbelianSemiGroup,OrderedSet,Monoid) with
 \section{domain PF PrimeField}
 \pagehead{PrimeField}{PF}
 \pagepic{ps/v103primefield.ps}{PF}{1.00}
-See also:\\
-\refto{InnerPrimeField}{IPF}
+{\bf See}\\
+\pageto{InnerPrimeField}{IPF}
 <<domain PF PrimeField>>=
 )abbrev domain PF PrimeField
 ++ Authors: N.N.,
@@ -61052,12 +61988,12 @@ PrimeField(p:PositiveInteger): Exp == Impl where
 \section{domain PRIMARR PrimitiveArray}
 \pagehead{PrimitiveArray}{PRIMARR}
 \pagepic{ps/v103primitivearray.ps}{PRIMARR}{1.00}
-See also:\\
-\refto{Tuple}{TUPLE}
-\refto{IndexedFlexibleArray}{IFARRAY}
-\refto{FlexibleArray}{FARRAY}
-\refto{IndexedOneDimensionalArray}{IARRAY1}
-\refto{OneDimensionalArray}{ARRAY1}
+{\bf See}\\
+\pageto{Tuple}{TUPLE}
+\pageto{IndexedFlexibleArray}{IFARRAY}
+\pageto{FlexibleArray}{FARRAY}
+\pageto{IndexedOneDimensionalArray}{IARRAY1}
+\pageto{OneDimensionalArray}{ARRAY1}
 <<domain PRIMARR PrimitiveArray>>=
 )abbrev domain PRIMARR PrimitiveArray
 ++ This provides a fast array type with no bound checking on elt's.
@@ -61201,8 +62137,8 @@ Product (A:SetCategory,B:SetCategory) : C == T
 \section{domain QFORM QuadraticForm}
 \pagehead{QuadraticForm}{QFORM}
 \pagepic{ps/v103quadraticform.ps}{QFORM}{1.00}
-See also:\\
-\refto{CliffordAlgebra}{CLIF}
+{\bf See}\\
+\pageto{CliffordAlgebra}{CLIF}
 <<domain QFORM QuadraticForm>>=
 )abbrev domain QFORM QuadraticForm
 ++ Author: Stephen M. Watt
@@ -61739,10 +62675,10 @@ Quaternion(R:CommutativeRing): QuaternionCategory(R) == add
 \section{domain QEQUAT QueryEquation}
 \pagehead{QueryEquation}{QEQUAT}
 \pagepic{ps/v103queryequation.ps}{QEQUAT}{1.00}
-See also:\\
-\refto{DataList}{DLIST}
-\refto{IndexCard}{ICARD}
-\refto{Database}{DBASE}
+{\bf See}\\
+\pageto{DataList}{DLIST}
+\pageto{IndexCard}{ICARD}
+\pageto{Database}{DBASE}
 <<domain QEQUAT QueryEquation>>=
 )abbrev domain QEQUAT QueryEquation
 ++ This domain implements simple database queries 
@@ -61772,11 +62708,11 @@ QueryEquation(): Exports == Implementation where
 \section{domain QUEUE Queue}
 \pagehead{Queue}{QUEUE}
 \pagepic{ps/v103queue.ps}{QUEUE}{1.00}
-See also:\\
-\refto{Stack}{STACK}
-\refto{ArrayStack}{ASTACK}
-\refto{Dequeue}{DEQUEUE}
-\refto{Heap}{HEAP}
+{\bf See}\\
+\pageto{Stack}{STACK}
+\pageto{ArrayStack}{ASTACK}
+\pageto{Dequeue}{DEQUEUE}
+\pageto{Heap}{HEAP}
 <<domain QUEUE Queue>>=
 )abbrev domain QUEUE Queue
 ++ Author: Michael Monagan and Stephen Watt
@@ -61837,8 +62773,8 @@ Queue(S:SetCategory): QueueAggregate S with
 \section{domain RADFF RadicalFunctionField}
 \pagehead{RadicalFunctionField}{RADFF}
 \pagepic{ps/v103radicalfunctionfield.ps}{RADFF}{1.00}
-See also:\\
-\refto{AlgebraicFunctionField}{ALGFF}
+{\bf See}\\
+\pageto{AlgebraicFunctionField}{ALGFF}
 <<domain RADFF RadicalFunctionField>>=
 )abbrev domain RADFF RadicalFunctionField
 ++ Function field defined by y**n = f(x)
@@ -62328,10 +63264,10 @@ o )show RadixExpansion
 @
 \pagehead{RadixExpansion}{RADIX}
 \pagepic{ps/v103radixexpansion.ps}{RADIX}{1.00}
-See also:\\
-\refto{BinaryExpansion}{BINARY}
-\refto{DecimalExpansion}{DECIMAL}
-\refto{HexadecimalExpansion}{HEXADEC}
+{\bf See}\\
+\pageto{BinaryExpansion}{BINARY}
+\pageto{DecimalExpansion}{DECIMAL}
+\pageto{HexadecimalExpansion}{HEXADEC}
 <<domain RADIX RadixExpansion>>=
 )abbrev domain RADIX RadixExpansion
 ++ Author: Stephen M. Watt
@@ -63813,8 +64749,8 @@ o )show RealClosure
 @
 \pagehead{RealClosure}{RECLOS}
 \pagepic{ps/v103realclosure.ps}{RECLOS}{1.00}
-See also:\\
-\refto{RightOpenIntervalRootCharacterization}{ROIRC}
+{\bf See}\\
+\pageto{RightOpenIntervalRootCharacterization}{ROIRC}
 <<domain RECLOS RealClosure>>=
 )abbrev domain RECLOS RealClosure
 ++ Author: Renaud Rioboo
@@ -64137,10 +65073,10 @@ RealClosure(TheField): PUB == PRIV where
 \section{domain RMATRIX RectangularMatrix}
 \pagehead{RectangularMatrix}{RMATRIX}
 \pagepic{ps/v103rectangularmatrix.ps}{RMATRIX}{1.00}
-See also:\\
-\refto{IndexedMatrix}{IMATRIX}
-\refto{Matrix}{MATRIX}
-\refto{SquareMatrix}{SQMATRIX}
+{\bf See}\\
+\pageto{IndexedMatrix}{IMATRIX}
+\pageto{Matrix}{MATRIX}
+\pageto{SquareMatrix}{SQMATRIX}
 <<domain RMATRIX RectangularMatrix>>=
 )abbrev domain RMATRIX RectangularMatrix
 ++ Author: Grabmeier, Gschnitzer, Williamson
@@ -64240,10 +65176,10 @@ RectangularMatrix(m,n,R): Exports == Implementation where
 \section{domain REF Reference}
 \pagehead{Reference}{REF}
 \pagepic{ps/v103reference.ps}{REF}{1.00}
-See also:\\
-\refto{Boolean}{BOOLEAN}
-\refto{IndexedBits}{IBITS}
-\refto{Bits}{BITS}
+{\bf See}\\
+\pageto{Boolean}{BOOLEAN}
+\pageto{IndexedBits}{IBITS}
+\pageto{Bits}{BITS}
 <<domain REF Reference>>=
 )abbrev domain REF Reference
 ++ Author: Stephen M. Watt
@@ -66181,14 +67117,14 @@ ResidueRing(F,Expon,VarSet,FPol,LFPol) : Dom  == Body
 \section{domain RESULT Result}
 \pagehead{Result}{RESULT}
 \pagepic{ps/v103result.ps}{RESULT}{1.00}
-See also:\\
-\refto{FortranCode}{FC}
-\refto{FortranProgram}{FORTRAN}
-\refto{ThreeDimensionalMatrix}{M3D}
-\refto{SimpleFortranProgram}{SFORT}
-\refto{Switch}{SWITCH}
-\refto{FortranTemplate}{FTEM}
-\refto{FortranExpression}{FEXPR}
+{\bf See}\\
+\pageto{FortranCode}{FC}
+\pageto{FortranProgram}{FORTRAN}
+\pageto{ThreeDimensionalMatrix}{M3D}
+\pageto{SimpleFortranProgram}{SFORT}
+\pageto{Switch}{SWITCH}
+\pageto{FortranTemplate}{FTEM}
+\pageto{FortranExpression}{FEXPR}
 <<domain RESULT Result>>=
 )abbrev domain RESULT Result
 ++ Author: Didier Pinchon and Mike Dewar
@@ -66267,8 +67203,8 @@ Result():Exports==Implementation where
 \section{domain RULE RewriteRule}
 \pagehead{RewriteRule}{RULE}
 \pagepic{ps/v103rewriterule.ps}{RULE}{1.00}
-See also:\\
-\refto{Ruleset}{RULESET}
+{\bf See}\\
+\pageto{Ruleset}{RULESET}
 <<domain RULE RewriteRule>>=
 )abbrev domain RULE RewriteRule
 ++ Rules for the pattern matcher
@@ -66444,8 +67380,8 @@ computations are done excatly. They can thus be quite time consuming when
 depending on several "real roots".
 \pagehead{RightOpenIntervalRootCharacterization}{ROIRC}
 \pagepic{ps/v103rightopenintervalrootcharacterization.ps}{ROIRC}{1.00}
-See also:\\
-\refto{RealClosure}{RECLOS}
+{\bf See}\\
+\pageto{RealClosure}{RECLOS}
 <<domain ROIRC RightOpenIntervalRootCharacterization>>=
 )abbrev domain ROIRC RightOpenIntervalRootCharacterization 
 ++ Author: Renaud Rioboo
@@ -67199,10 +68135,10 @@ o )show RomanNumeral
 @
 \pagehead{RomanNumeral}{ROMAN}
 \pagepic{ps/v103romannumeral.ps}{ROMAN}{1.00}
-See also:\\
-\refto{Integer}{INT}
-\refto{NonNegativeInteger}{NNI}
-\refto{PositiveInteger}{PI}
+{\bf See}\\
+\pageto{Integer}{INT}
+\pageto{NonNegativeInteger}{NNI}
+\pageto{PositiveInteger}{PI}
 <<domain ROMAN RomanNumeral>>=
 )abbrev domain ROMAN RomanNumeral
 ++ Author:
@@ -67666,8 +68602,8 @@ RuleCalled(f:Symbol): SetCategory with
 \section{domain RULESET Ruleset}
 \pagehead{Ruleset}{RULESET}
 \pagepic{ps/v103ruleset.ps}{RULESET}{1.00}
-See also:\\
-\refto{RewriteRule}{RULE}
+{\bf See}\\
+\pageto{RewriteRule}{RULE}
 <<domain RULESET Ruleset>>=
 )abbrev domain RULESET Ruleset
 ++ Sets of rules for the pattern matcher
@@ -68326,9 +69262,9 @@ o )show Segment
 @
 \pagehead{Segment}{SEG}
 \pagepic{ps/v103segment.ps}{SEG}{1.00}
-See also:\\
-\refto{SegmentBinding}{SEGBIND}
-\refto{UniversalSegment}{UNISEG}
+{\bf See}\\
+\pageto{SegmentBinding}{SEGBIND}
+\pageto{UniversalSegment}{UNISEG}
 <<domain SEG Segment>>=
 )abbrev domain SEG Segment
 ++ Author:  Stephen M. Watt
@@ -68527,9 +69463,9 @@ o )show SegmentBinding
 @
 \pagehead{SegmentBinding}{SEGBIND}
 \pagepic{ps/v103segmentbinding.ps}{SEGBIND}{1.00}
-See also:\\
-\refto{Segment}{SEG}
-\refto{UniversalSegment}{UNISEG}
+{\bf See}\\
+\pageto{Segment}{SEG}
+\pageto{UniversalSegment}{UNISEG}
 <<domain SEGBIND SegmentBinding>>=
 )abbrev domain SEGBIND SegmentBinding
 ++ Author:
@@ -69235,11 +70171,11 @@ SetOfMIntegersInOneToN(m, n): Exports == Implementation where
 \section{domain SDPOL SequentialDifferentialPolynomial}
 \pagehead{SequentialDifferentialPolynomial}{SDPOL}
 \pagepic{ps/v103sequentialdifferentialpolynomial.ps}{SDPOL}{1.00}
-See also:\\
-\refto{OrderlyDifferentialVariable}{ODVAR}
-\refto{SequentialDifferentialVariable}{SDVAR}
-\refto{DifferentialSparseMultivariatePolynomial}{DSMP}
-\refto{OrderlyDifferentialPolynomial}{ODPOL}
+{\bf See}\\
+\pageto{OrderlyDifferentialVariable}{ODVAR}
+\pageto{SequentialDifferentialVariable}{SDVAR}
+\pageto{DifferentialSparseMultivariatePolynomial}{DSMP}
+\pageto{OrderlyDifferentialPolynomial}{ODPOL}
 <<domain SDPOL SequentialDifferentialPolynomial>>=
 )abbrev domain SDPOL SequentialDifferentialPolynomial
 ++ Author:  William Sit
@@ -69283,11 +70219,11 @@ SequentialDifferentialPolynomial(R):
 \section{domain SDVAR SequentialDifferentialVariable}
 \pagehead{SequentialDifferentialVariable}{SDVAR}
 \pagepic{ps/v103sequentialdifferentialvariable.ps}{SDVAR}{1.00}
-See also:\\
-\refto{OrderlyDifferentialVariable}{ODVAR}
-\refto{DifferentialSparseMultivariatePolynomial}{DSMP}
-\refto{OrderlyDifferentialPolynomial}{ODPOL}
-\refto{SequentialDifferentialPolynomial}{SDPOL}
+{\bf See}\\
+\pageto{OrderlyDifferentialVariable}{ODVAR}
+\pageto{DifferentialSparseMultivariatePolynomial}{DSMP}
+\pageto{OrderlyDifferentialPolynomial}{ODPOL}
+\pageto{SequentialDifferentialPolynomial}{SDPOL}
 <<domain SDVAR SequentialDifferentialVariable>>=
 )abbrev domain SDVAR SequentialDifferentialVariable
 ++ Author:  William Sit
@@ -69336,8 +70272,8 @@ SequentialDifferentialVariable(S:OrderedSet):DifferentialVariableCategory(S)
 \section{domain SEX SExpression}
 \pagehead{SExpression}{SEX}
 \pagepic{ps/v103sexpression.ps}{SEX}{1.00}
-See also:\\
-\refto{SExpressionOf}{SEXOF}
+{\bf See}\\
+\pageto{SExpressionOf}{SEXOF}
 <<domain SEX SExpression>>=
 )abbrev domain SEX SExpression
 ++ Domain for the standard Lisp values
@@ -69360,8 +70296,8 @@ SExpression()
 \section{domain SEXOF SExpressionOf}
 \pagehead{SExpressionOf}{SEXOF}
 \pagepic{ps/v103sexpressionof.ps}{SEXOF}{1.00}
-See also:\\
-\refto{SExpression}{SEX}
+{\bf See}\\
+\pageto{SExpression}{SEX}
 <<domain SEXOF SExpressionOf>>=
 )abbrev domain SEXOF SExpressionOf
 ++ Domain for Lisp values over arbitrary atomic types
@@ -69633,14 +70569,14 @@ SimpleAlgebraicExtension(R:CommutativeRing,
 \section{domain SFORT SimpleFortranProgram}
 \pagehead{SimpleFortranProgram}{SFORT}
 \pagepic{ps/v103simplefortranprogram.ps}{SFORT}{1.00}
-See also:\\
-\refto{Result}{RESULT}
-\refto{FortranCode}{FC}
-\refto{FortranProgram}{FORTRAN}
-\refto{ThreeDimensionalMatrix}{M3D}
-\refto{Switch}{SWITCH}
-\refto{FortranTemplate}{FTEM}
-\refto{FortranExpression}{FEXPR}
+{\bf See}\\
+\pageto{Result}{RESULT}
+\pageto{FortranCode}{FC}
+\pageto{FortranProgram}{FORTRAN}
+\pageto{ThreeDimensionalMatrix}{M3D}
+\pageto{Switch}{SWITCH}
+\pageto{FortranTemplate}{FTEM}
+\pageto{FortranExpression}{FEXPR}
 <<domain SFORT SimpleFortranProgram>>=
 )abbrev domain SFORT SimpleFortranProgram
 -- Because of a bug in the compiler:
@@ -70139,10 +71075,10 @@ SingletonAsOrderedSet(): OrderedSet with
 \section{domain SMP SparseMultivariatePolynomial}
 \pagehead{SparseMultivariatePolynomial}{SMP}
 \pagepic{ps/v103sparsemultivariatepolynomial.ps}{SMP}{1.00}
-See also:\\
-\refto{Polynomial}{POLY}
-\refto{MultivariatePolynomial}{MPOLY}
-\refto{IndexedExponents}{INDE}
+{\bf See}\\
+\pageto{Polynomial}{POLY}
+\pageto{MultivariatePolynomial}{MPOLY}
+\pageto{IndexedExponents}{INDE}
 <<domain SMP SparseMultivariatePolynomial>>=
 )abbrev domain SMP SparseMultivariatePolynomial
 ++ Author: Dave Barton, Barry Trager
@@ -70727,8 +71663,8 @@ SparseMultivariatePolynomial(R: Ring,VarSet: OrderedSet): C == T where
 \section{domain SMTS SparseMultivariateTaylorSeries}
 \pagehead{SparseMultivariateTaylorSeries}{SMTS}
 \pagepic{ps/v103sparsemultivariatetaylorseries.ps}{SMTS}{1.00}
-See also:\\
-\refto{TaylorSeries}{TS}
+{\bf See}\\
+\pageto{TaylorSeries}{TS}
 <<domain SMTS SparseMultivariateTaylorSeries>>=
 )abbrev domain SMTS SparseMultivariateTaylorSeries
 ++ This domain provides multivariate Taylor series
@@ -71119,13 +72055,13 @@ o )show SparseTable
 @
 \pagehead{SparseTable}{STBL}
 \pagepic{ps/v103sparsetable.ps}{STBL}{1.00}
-See also:\\
-\refto{HashTable}{HASHTBL}
-\refto{InnerTable}{INTABL}
-\refto{Table}{TABLE}
-\refto{EqTable}{EQTBL}
-\refto{StringTable}{STRTBL}
-\refto{GeneralSparseTable}{GSTBL}
+{\bf See}\\
+\pageto{HashTable}{HASHTBL}
+\pageto{InnerTable}{INTABL}
+\pageto{Table}{TABLE}
+\pageto{EqTable}{EQTBL}
+\pageto{StringTable}{STRTBL}
+\pageto{GeneralSparseTable}{GSTBL}
 <<domain STBL SparseTable>>=
 )abbrev domain STBL SparseTable
 ++ Author: Stephen M. Watt
@@ -71361,10 +72297,10 @@ SparseUnivariateLaurentSeries(Coef,var,cen): Exports == Implementation where
 \section{domain SUP SparseUnivariatePolynomial}
 \pagehead{SparseUnivariatePolynomial}{SUP}
 \pagepic{ps/v103sparseunivariatepolynomial.ps}{SUP}{1.00}
-See also:\\
-\refto{FreeModule}{FM}
-\refto{PolynomialRing}{PR}
-\refto{UnivariatePolynomial}{UP}
+{\bf See}\\
+\pageto{FreeModule}{FM}
+\pageto{PolynomialRing}{PR}
+\pageto{UnivariatePolynomial}{UP}
 <<domain SUP SparseUnivariatePolynomial>>=
 )abbrev domain SUP SparseUnivariatePolynomial
 ++ Author: Dave Barton, Barry Trager
@@ -71876,9 +72812,9 @@ SparseUnivariatePuiseuxSeries(Coef,var,cen): Exports == Implementation where
 \section{domain ORESUP SparseUnivariateSkewPolynomial}
 \pagehead{SparseUnivariateSkewPolynomial}{ORESUP}
 \pagepic{ps/v103sparseunivariateskewpolynomial.ps}{ORESUP}{1.00}
-See also:\\
-\refto{Automorphism}{AUTOMOR}
-\refto{UnivariateSkewPolynomial}{OREUP}
+{\bf See}\\
+\pageto{Automorphism}{AUTOMOR}
+\pageto{UnivariateSkewPolynomial}{OREUP}
 <<domain ORESUP SparseUnivariateSkewPolynomial>>=
 )abbrev domain ORESUP SparseUnivariateSkewPolynomial
 ++ Author: Manuel Bronstein
@@ -72312,9 +73248,9 @@ SparseUnivariateTaylorSeries(Coef,var,cen): Exports == Implementation where
 \section{domain SHDP SplitHomogeneousDirectProduct}
 \pagehead{SplitHomogeneousDirectProduct}{SHDP}
 \pagepic{ps/v103splithomogeneousdirectproduct.ps}{SHDP}{1.00}
-See also:\\
-\refto{OrderedDirectProduct}{ODP}
-\refto{HomogeneousDirectProduct}{HDP}
+{\bf See}\\
+\pageto{OrderedDirectProduct}{ODP}
+\pageto{HomogeneousDirectProduct}{HDP}
 <<domain SHDP SplitHomogeneousDirectProduct>>=
 )abbrev domain SHDP SplitHomogeneousDirectProduct
 ++ Author:
@@ -72374,8 +73310,8 @@ SplitHomogeneousDirectProduct(dimtot,dim1,S) : T == C where
 \section{domain SPLNODE SplittingNode}
 \pagehead{SplittingNode}{SPLNODE}
 \pagepic{ps/v103splittingnode.ps}{SPLNODE}{1.00}
-See also:\\
-\refto{SplittingNode}{SPLNODE}
+{\bf See}\\
+\pageto{SplittingNode}{SPLNODE}
 <<domain SPLNODE SplittingNode>>=
 )abbrev domain SPLNODE SplittingNode
 ++ Author: Marc Moereno Maza
@@ -72541,8 +73477,8 @@ SplittingNode(V,C) : Exports == Implementation where
 \section{domain SPLTREE SplittingTree}
 \pagehead{SplittingTree}{SPLTREE}
 \pagepic{ps/v103splittingtree.ps}{SPLTREE}{1.00}
-See also:\\
-\refto{SplittingTree}{SPLTREE}
+{\bf See}\\
+\pageto{SplittingTree}{SPLTREE}
 <<domain SPLTREE SplittingTree>>=
 )abbrev domain SPLTREE SplittingTree
 ++ Author: Marc Moereno Maza
@@ -73880,10 +74816,10 @@ o )show SquareMatrix
 @
 \pagehead{SquareMatrix}{SQMATRIX}
 \pagepic{ps/v103squarematrix.ps}{SQMATRIX}{1.00}
-See also:\\
-\refto{IndexedMatrix}{IMATRIX}
-\refto{Matrix}{MATRIX}
-\refto{RectangularMatrix}{RMATRIX}
+{\bf See}\\
+\pageto{IndexedMatrix}{IMATRIX}
+\pageto{Matrix}{MATRIX}
+\pageto{RectangularMatrix}{RMATRIX}
 <<domain SQMATRIX SquareMatrix>>=
 )abbrev domain SQMATRIX SquareMatrix
 ++ Author: Grabmeier, Gschnitzer, Williamson
@@ -74032,11 +74968,11 @@ SquareMatrix(ndim,R): Exports == Implementation where
 \section{domain STACK Stack}
 \pagehead{Stack}{STACK}
 \pagepic{ps/v103stack.ps}{STACK}{1.00}
-See also:\\
-\refto{ArrayStack}{ASTACK}
-\refto{Queue}{QUEUE}
-\refto{Dequeue}{DEQUEUE}
-\refto{Heap}{HEAP}
+{\bf See}\\
+\pageto{ArrayStack}{ASTACK}
+\pageto{Queue}{QUEUE}
+\pageto{Dequeue}{DEQUEUE}
+\pageto{Heap}{HEAP}
 <<domain STACK Stack>>=
 )abbrev domain STACK Stack
 ++ Author: Michael Monagan and Stephen Watt
@@ -75437,10 +76373,10 @@ o )show String
 @
 \pagehead{String}{STRING}
 \pagepic{ps/v103string.ps}{STRING}{1.00}
-See also:\\
-\refto{Character}{CHAR}
-\refto{CharacterClass}{CCLASS}
-\refto{IndexedString}{ISTRING}
+{\bf See}\\
+\pageto{Character}{CHAR}
+\pageto{CharacterClass}{CCLASS}
+\pageto{IndexedString}{ISTRING}
 <<domain STRING String>>=
 )abbrev domain STRING String
 ++ Description:
@@ -75568,13 +76504,13 @@ o )show StringTable
 @
 \pagehead{StringTable}{STRTBL}
 \pagepic{ps/v103stringtable.ps}{STRTBL}{1.00}
-See also:\\
-\refto{HashTable}{HASHTBL}
-\refto{InnerTable}{INTABL}
-\refto{Table}{TABLE}
-\refto{EqTable}{EQTBL}
-\refto{GeneralSparseTable}{GSTBL}
-\refto{SparseTable}{STBL}
+{\bf See}\\
+\pageto{HashTable}{HASHTBL}
+\pageto{InnerTable}{INTABL}
+\pageto{Table}{TABLE}
+\pageto{EqTable}{EQTBL}
+\pageto{GeneralSparseTable}{GSTBL}
+\pageto{SparseTable}{STBL}
 <<domain STRTBL StringTable>>=
 )abbrev domain STRTBL StringTable
 ++ Author: Stephen M. Watt
@@ -75651,9 +76587,9 @@ point.
  
 \pagehead{SubSpace}{SUBSPACE}
 \pagepic{ps/v103subspace.ps}{SUBSPACE}{1.00}
-See also:\\
-\refto{Point}{POINT}
-\refto{SubSpaceComponentProperty}{COMPPROP}
+{\bf See}\\
+\pageto{Point}{POINT}
+\pageto{SubSpaceComponentProperty}{COMPPROP}
 <<domain SUBSPACE SubSpace>>=
 )abbrev domain SUBSPACE SubSpace
 ++ Description:
@@ -76083,9 +77019,9 @@ SubSpace(n:PI,R:Ring) : Exports == Implementation where
 \section{domain COMPPROP SubSpaceComponentProperty}
 \pagehead{SubSpaceComponentProperty}{COMPPROP}
 \pagepic{ps/v103subspacecomponentproperty.ps}{COMPPROP}{1.00}
-See also:\\
-\refto{Point}{POINT}
-\refto{SubSpace}{SUBSPACE}
+{\bf See}\\
+\pageto{Point}{POINT}
+\pageto{SubSpace}{SUBSPACE}
 <<domain COMPPROP SubSpaceComponentProperty>>=
 )abbrev domain COMPPROP SubSpaceComponentProperty
 ++ Description:
@@ -76180,14 +77116,14 @@ SuchThat(S1, S2): Cat == Capsule where
 \section{domain SWITCH Switch}
 \pagehead{Switch}{SWITCH}
 \pagepic{ps/v103switch.ps}{SWITCH}{1.00}
-See also:\\
-\refto{Result}{RESULT}
-\refto{FortranCode}{FC}
-\refto{FortranProgram}{FORTRAN}
-\refto{ThreeDimensionalMatrix}{M3D}
-\refto{SimpleFortranProgram}{SFORT}
-\refto{FortranTemplate}{FTEM}
-\refto{FortranExpression}{FEXPR}
+{\bf See}\\
+\pageto{Result}{RESULT}
+\pageto{FortranCode}{FC}
+\pageto{FortranProgram}{FORTRAN}
+\pageto{ThreeDimensionalMatrix}{M3D}
+\pageto{SimpleFortranProgram}{SFORT}
+\pageto{FortranTemplate}{FTEM}
+\pageto{FortranExpression}{FEXPR}
 <<domain SWITCH Switch>>=
 )abbrev domain SWITCH Switch
 -- Because of a bug in the compiler:
@@ -76987,10 +77923,10 @@ Symbol(): Exports == Implementation where
 \section{domain SYMTAB SymbolTable}
 \pagehead{SymbolTable}{SYMTAB}
 \pagepic{ps/v103symboltable.ps}{SYMTAB}{1.00}
-See also:\\
-\refto{FortranScalarType}{FST}
-\refto{FortranType}{FT}
-\refto{TheSymbolTable}{SYMS}
+{\bf See}\\
+\pageto{FortranScalarType}{FST}
+\pageto{FortranType}{FT}
+\pageto{TheSymbolTable}{SYMS}
 <<domain SYMTAB SymbolTable>>=
 )abbrev domain SYMTAB SymbolTable
 ++ Author: Mike Dewar
@@ -77182,8 +78118,8 @@ SymbolTable() : exports == implementation where
 \section{domain SYMPOLY SymmetricPolynomial}
 \pagehead{SymmetricPolynomial}{SYMPOLY}
 \pagepic{ps/v103symmetricpolynomial.ps}{SYMPOLY}{1.00}
-See also:\\
-\refto{Partition}{PRTITION}
+{\bf See}\\
+\pageto{Partition}{PRTITION}
 <<domain SYMPOLY SymmetricPolynomial>>=
 )abbrev domain SYMPOLY SymmetricPolynomial
 ++ Description:
@@ -77530,13 +78466,13 @@ o )show Table
 @
 \pagehead{Table}{TABLE}
 \pagepic{ps/v103table.ps}{TABLE}{1.00}
-See also:\\
-\refto{HashTable}{HASHTBL}
-\refto{InnerTable}{INTABL}
-\refto{EqTable}{EQTBL}
-\refto{StringTable}{STRTBL}
-\refto{GeneralSparseTable}{GSTBL}
-\refto{SparseTable}{STBL}
+{\bf See}\\
+\pageto{HashTable}{HASHTBL}
+\pageto{InnerTable}{INTABL}
+\pageto{EqTable}{EQTBL}
+\pageto{StringTable}{STRTBL}
+\pageto{GeneralSparseTable}{GSTBL}
+\pageto{SparseTable}{STBL}
 <<domain TABLE Table>>=
 )abbrev domain TABLE Table
 ++ Author: Stephen M. Watt, Barry Trager
@@ -77637,8 +78573,8 @@ Tableau(S:SetCategory):Exports == Implementation where
 \section{domain TS TaylorSeries}
 \pagehead{TaylorSeries}{TS}
 \pagepic{ps/v103taylorseries.ps}{TS}{1.00}
-See also:\\
-\refto{SparseMultivariateTaylorSeries}{SMTS}
+{\bf See}\\
+\pageto{SparseMultivariateTaylorSeries}{SMTS}
 <<domain TS TaylorSeries>>=
 )abbrev domain TS TaylorSeries
 ++ Authors: Burge, Watt, Williamson
@@ -78502,11 +79438,11 @@ o )show TextFile
 @
 \pagehead{TextFile}{TEXTFILE}
 \pagepic{ps/v103textfile.ps}{TEXTFILE}{1.00}
-See also:\\
-\refto{File}{FILE}
-\refto{BinaryFile}{BINFILE}
-\refto{KeyedAccessFile}{KAFILE}
-\refto{Library}{LIB}
+{\bf See}\\
+\pageto{File}{FILE}
+\pageto{BinaryFile}{BINFILE}
+\pageto{KeyedAccessFile}{KAFILE}
+\pageto{Library}{LIB}
 <<domain TEXTFILE TextFile>>=
 )abbrev domain TEXTFILE TextFile
 ++ Author: Stephen M. Watt
@@ -78604,10 +79540,10 @@ TextFile: Cat == Def where
 \section{domain SYMS TheSymbolTable}
 \pagehead{TheSymbolTable}{SYMS}
 \pagepic{ps/v103thesymboltable.ps}{SYMS}{1.00}
-See also:\\
-\refto{FortranScalarType}{FST}
-\refto{FortranType}{FT}
-\refto{SymbolTable}{SYMTAB}
+{\bf See}\\
+\pageto{FortranScalarType}{FST}
+\pageto{FortranType}{FT}
+\pageto{SymbolTable}{SYMTAB}
 <<domain SYMS TheSymbolTable>>=
 )abbrev domain SYMS TheSymbolTable
 ++ Author: Mike Dewar
@@ -78820,14 +79756,14 @@ TheSymbolTable() : Exports == Implementation where
 \section{domain M3D ThreeDimensionalMatrix}
 \pagehead{ThreeDimensionalMatrix}{M3D}
 \pagepic{ps/v103threedimensionalmatrix.ps}{M3D}{1.00}
-See also:\\
-\refto{Result}{RESULT}
-\refto{FortranCode}{FC}
-\refto{FortranProgram}{FORTRAN}
-\refto{SimpleFortranProgram}{SFORT}
-\refto{Switch}{SWITCH}
-\refto{FortranTemplate}{FTEM}
-\refto{FortranExpression}{FEXPR}
+{\bf See}\\
+\pageto{Result}{RESULT}
+\pageto{FortranCode}{FC}
+\pageto{FortranProgram}{FORTRAN}
+\pageto{SimpleFortranProgram}{SFORT}
+\pageto{Switch}{SWITCH}
+\pageto{FortranTemplate}{FTEM}
+\pageto{FortranExpression}{FEXPR}
 <<domain M3D ThreeDimensionalMatrix>>=
 )abbrev domain M3D ThreeDimensionalMatrix
 ++ Author: William Naylor
@@ -80401,12 +81337,12 @@ ThreeSpace(R:Ring):Exports == Implementation where
 \section{domain TREE Tree}
 \pagehead{Tree}{TREE}
 \pagepic{ps/v103tree.ps}{TREE}{1.00}
-See also:\\
-\refto{BinaryTree}{BTREE}
-\refto{BinarySearchTree}{BSTREE}
-\refto{BinaryTournament}{BTOURN}
-\refto{BalancedBinaryTree}{BBTREE}
-\refto{PendantTree}{PENDTREE}
+{\bf See}\\
+\pageto{BinaryTree}{BTREE}
+\pageto{BinarySearchTree}{BSTREE}
+\pageto{BinaryTournament}{BTOURN}
+\pageto{BalancedBinaryTree}{BBTREE}
+\pageto{PendantTree}{PENDTREE}
 <<domain TREE Tree>>=
 )abbrev domain TREE Tree
 ++ Author:W. H. Burge
@@ -80818,12 +81754,12 @@ TubePlot(Curve): Exports == Implementation where
 \section{domain TUPLE Tuple}
 \pagehead{Tuple}{TUPLE}
 \pagepic{ps/v103tuple.ps}{TUPLE}{1.00}
-See also:\\
-\refto{PrimitiveArray}{PRIMARR}
-\refto{IndexedFlexibleArray}{IFARRAY}
-\refto{FlexibleArray}{FARRAY}
-\refto{IndexedOneDimensionalArray}{IARRAY1}
-\refto{OneDimensionalArray}{ARRAY1}
+{\bf See}\\
+\pageto{PrimitiveArray}{PRIMARR}
+\pageto{IndexedFlexibleArray}{IFARRAY}
+\pageto{FlexibleArray}{FARRAY}
+\pageto{IndexedOneDimensionalArray}{IARRAY1}
+\pageto{OneDimensionalArray}{ARRAY1}
 <<domain TUPLE Tuple>>=
 )abbrev domain TUPLE Tuple
 ++ This domain is used to interface with the interpreter's notion
@@ -81325,9 +82261,9 @@ o )show TwoDimensionalArray
 @
 \pagehead{TwoDimensionalArray}{ARRAY2}
 \pagepic{ps/v103twodimensionalarray.ps}{ARRAY2}{1.00}
-See also:\\
-\refto{InnerIndexedTwoDimensionalArray}{IIARRAY2}
-\refto{IndexedTwoDimensionalArray}{IARRAY2}
+{\bf See}\\
+\pageto{InnerIndexedTwoDimensionalArray}{IIARRAY2}
+\pageto{IndexedTwoDimensionalArray}{IARRAY2}
 <<domain ARRAY2 TwoDimensionalArray>>=
 )abbrev domain ARRAY2 TwoDimensionalArray
 TwoDimensionalArray(R):Exports == Implementation where
@@ -82268,8 +83204,8 @@ UnivariateFormalPowerSeries(Coef: Ring) ==
 \section{domain ULS UnivariateLaurentSeries}
 \pagehead{UnivariateLaurentSeries}{ULS}
 \pagepic{ps/v103univariatelaurentseries.ps}{ULS}{1.00}
-See also:\\
-\refto{UnivariateLaurentSeriesConstructor}{ULSCONS}
+{\bf See}\\
+\pageto{UnivariateLaurentSeriesConstructor}{ULSCONS}
 <<domain ULS UnivariateLaurentSeries>>=
 )abbrev domain ULS UnivariateLaurentSeries
 ++ Author: Clifton J. Williamson
@@ -82335,8 +83271,8 @@ UnivariateLaurentSeries(Coef,var,cen): Exports == Implementation where
 \section{domain ULSCONS UnivariateLaurentSeriesConstructor}
 \pagehead{UnivariateLaurentSeriesConstructor}{ULSCONS}
 \pagepic{ps/v103univariatelaurentseriesconstructor.ps}{ULSCONS}{1.00}
-See also:\\
-\refto{UnivariateLaurentSeries}{ULS}
+{\bf See}\\
+\pageto{UnivariateLaurentSeries}{ULS}
 <<domain ULSCONS UnivariateLaurentSeriesConstructor>>=
 )abbrev domain ULSCONS UnivariateLaurentSeriesConstructor
 ++ Authors: Bill Burge, Clifton J. Williamson
@@ -83424,10 +84360,10 @@ o )show UnivariatePolynomial
 @
 \pagehead{UnivariatePolynomial}{UP}
 \pagepic{ps/v103univariatepolynomial.ps}{UP}{1.00}
-See also:\\
-\refto{FreeModule}{FM}
-\refto{PolynomialRing}{PR}
-\refto{SparseUnivariatePolynomial}{SUP}
+{\bf See}\\
+\pageto{FreeModule}{FM}
+\pageto{PolynomialRing}{PR}
+\pageto{SparseUnivariatePolynomial}{SUP}
 <<domain UP UnivariatePolynomial>>=
 )abbrev domain UP UnivariatePolynomial
 ++ Author:
@@ -83469,8 +84405,8 @@ UnivariatePolynomial(x:Symbol, R:Ring):
 \section{domain UPXS UnivariatePuiseuxSeries}
 \pagehead{UnivariatePuiseuxSeries}{UPXS}
 \pagepic{ps/v103univariatepuiseuxseries.ps}{UPXS}{1.00}
-See also:\\
-\refto{UnivariatePuiseuxSeriesConstructor}{UPXSCONS}
+{\bf See}\\
+\pageto{UnivariatePuiseuxSeriesConstructor}{UPXSCONS}
 <<domain UPXS UnivariatePuiseuxSeries>>=
 )abbrev domain UPXS UnivariatePuiseuxSeries
 ++ Author: Clifton J. Williamson
@@ -83640,8 +84576,8 @@ UnivariatePuiseuxSeries(Coef,var,cen): Exports == Implementation where
 \section{domain UPXSCONS UnivariatePuiseuxSeriesConstructor}
 \pagehead{UnivariatePuiseuxSeriesConstructor}{UPXSCONS}
 \pagepic{ps/v103univariatepuiseuxseriesconstructor.ps}{UPXSCONS}{1.00}
-See also:\\
-\refto{UnivariatePuiseuxSeries}{UPXS}
+{\bf See}\\
+\pageto{UnivariatePuiseuxSeries}{UPXS}
 <<domain UPXSCONS UnivariatePuiseuxSeriesConstructor>>=
 )abbrev domain UPXSCONS UnivariatePuiseuxSeriesConstructor
 ++ Author: Clifton J. Williamson
@@ -83999,9 +84935,9 @@ UnivariatePuiseuxSeriesConstructor(Coef,ULS):_
 \section{domain UPXSSING UnivariatePuiseuxSeriesWithExponentialSingularity}
 \pagehead{UnivariatePuiseuxSeriesWithExponentialSingularity}{UPXSSING}
 \pagepic{ps/v103univariatepuiseuxserieswithexponentialsingularity.ps}{UPXSSING}{1.00}
-See also:\\
-\refto{ExponentialOfUnivariatePuiseuxSeries}{EXPUPXS}
-\refto{ExponentialExpansion}{EXPEXPAN}
+{\bf See}\\
+\pageto{ExponentialOfUnivariatePuiseuxSeries}{EXPUPXS}
+\pageto{ExponentialExpansion}{EXPEXPAN}
 <<domain UPXSSING UnivariatePuiseuxSeriesWithExponentialSingularity>>=
 )abbrev domain UPXSSING UnivariatePuiseuxSeriesWithExponentialSingularity
 ++ Author: Clifton J. Williamson
@@ -84293,9 +85229,9 @@ UnivariatePuiseuxSeriesWithExponentialSingularity(R,FE,var,cen):_
 \section{domain OREUP UnivariateSkewPolynomial}
 \pagehead{UnivariateSkewPolynomial}{OREUP}
 \pagepic{ps/v103univariateskewpolynomial.ps}{OREUP}{1.00}
-See also:\\
-\refto{Automorphism}{AUTOMOR}
-\refto{SparseUnivariateSkewPolynomial}{ORESUP}
+{\bf See}\\
+\pageto{Automorphism}{AUTOMOR}
+\pageto{SparseUnivariateSkewPolynomial}{ORESUP}
 <<domain OREUP UnivariateSkewPolynomial>>=
 )abbrev domain OREUP UnivariateSkewPolynomial
 ++ Author: Manuel Bronstein
@@ -84325,8 +85261,8 @@ UnivariateSkewPolynomial(x:Symbol, R:Ring, sigma:Automorphism R, delta: R -> R):
 \section{domain UTS UnivariateTaylorSeries}
 \pagehead{UnivariateTaylorSeries}{UTS}
 \pagepic{ps/v103univariatetaylorseries.ps}{UTS}{1.00}
-See also:\\
-\refto{InnerTaylorSeries}{ITAYLOR}
+{\bf See}\\
+\pageto{InnerTaylorSeries}{ITAYLOR}
 <<domain UTS UnivariateTaylorSeries>>=
 )abbrev domain UTS UnivariateTaylorSeries
 ++ Author: Clifton J. Williamson
@@ -84740,9 +85676,9 @@ o )show UniversalSegment
 @
 \pagehead{UniversalSegment}{UNISEG}
 \pagepic{ps/v103universalsegment.ps}{UNISEG}{1.00}
-See also:\\
-\refto{Segment}{SEG}
-\refto{SegmentBinding}{SEGBIND}
+{\bf See}\\
+\pageto{Segment}{SEG}
+\pageto{SegmentBinding}{SEGBIND}
 <<domain UNISEG UniversalSegment>>=
 )abbrev domain UNISEG UniversalSegment
 ++ Author:  Robert S. Sutor
@@ -85701,8 +86637,8 @@ o )show WuWenTsunTriangularSet
 @
 \pagehead{WuWenTsunTriangularSet}{WUTSET}
 \pagepic{ps/v103wuwentsuntriangularset.ps}{WUTSET}{1.00}
-See also:\\
-\refto{GeneralTriangularSet}{GTSET}
+{\bf See}\\
+\pageto{GeneralTriangularSet}{GTSET}
 <<domain WUTSET WuWenTsunTriangularSet>>=
 )abbrev domain WUTSET WuWenTsunTriangularSet
 ++ Author: Marc Moreno Maza (marc@nag.co.uk)
diff --git a/changelog b/changelog
index 00bc899..7230a7c 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20090113 tpd src/axiom-website/patches.html 20090113.01.tpd.patch
+20090113 tpd books/bookvol10.3 begin adding exports
 20090112 tpd src/axiom-website/patches.html 20090112.02.tpd.patch
 20090112 tpd books/ps/v103univariateformalpowerseries.ps redraw
 20090112 tpd books/ps/v103myunivariatepolynomial.ps redraw
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index ffe0b20..94e2939 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -875,6 +875,8 @@ algebra/Makefile merge layerpic graphviz data<br/>
 bookvol10.3 add dotabb chunks<br/>
 <a href="patches/20090112.02.tpd.patch">20090112.02.tpd.patch</a>
 bookvol10.3 redraw graphs based on dotabb<br/>
+<a href="patches/20090113.01.tpd.patch">20090113.01.tpd.patch</a>
+bookvol10.3 begin adding exports<br/>
 
  </body>
 </html>

\start
Date: Wed, 14 Jan 2009 12:03:47 -0600
From: Tim Daly
To: list
Subject: 20090114.01.tpd.patch (bookvol10.3 add exports)

Exports were added for chapter B thru D
======================================================================
diff --git a/books/bookvol10.3.pamphlet b/books/bookvol10.3.pamphlet
index 5073503..6160c63 100644
--- a/books/bookvol10.3.pamphlet
+++ b/books/bookvol10.3.pamphlet
@@ -7633,6 +7633,58 @@ o )show BalancedBinaryTree
 \pageto{BinarySearchTree}{BSTREE}
 \pageto{BinaryTournament}{BTOURN}
 \pageto{PendantTree}{PENDTREE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{BBTREE}{any?} &
+\cross{BBTREE}{balancedBinaryTree} &
+\cross{BBTREE}{child?} &
+\cross{BBTREE}{children} &
+\cross{BBTREE}{coerce} \\
+\cross{BBTREE}{copy} &
+\cross{BBTREE}{count} &
+\cross{BBTREE}{cyclic?} &
+\cross{BBTREE}{distance} &
+\cross{BBTREE}{empty} \\
+\cross{BBTREE}{empty?} &
+\cross{BBTREE}{eq?} &
+\cross{BBTREE}{eval} &
+\cross{BBTREE}{every?} &
+\cross{BBTREE}{hash} \\
+\cross{BBTREE}{latex} &
+\cross{BBTREE}{leaf?} &
+\cross{BBTREE}{leaves} &
+\cross{BBTREE}{left} &
+\cross{BBTREE}{less?} \\
+\cross{BBTREE}{map} &
+\cross{BBTREE}{map!} &
+\cross{BBTREE}{mapDown!} &
+\cross{BBTREE}{mapUp!} &
+\cross{BBTREE}{member?} \\
+\cross{BBTREE}{members} &
+\cross{BBTREE}{more?} &
+\cross{BBTREE}{node?} &
+\cross{BBTREE}{node} &
+\cross{BBTREE}{nodes} \\
+\cross{BBTREE}{parts} &
+\cross{BBTREE}{right} &
+\cross{BBTREE}{sample} &
+\cross{BBTREE}{setchildren!} &
+\cross{BBTREE}{setelt} \\
+\cross{BBTREE}{setleaves!} &
+\cross{BBTREE}{setleft!} &
+\cross{BBTREE}{setright!} &
+\cross{BBTREE}{setvalue!} &
+\cross{BBTREE}{size?} \\
+\cross{BBTREE}{value} &
+\cross{BBTREE}{\#{}?} &
+\cross{BBTREE}{?=?} &
+\cross{BBTREE}{?\~{}=?} &
+\cross{BBTREE}{?.right} \\
+\cross{BBTREE}{?.left} &
+\cross{BBTREE}{?.value} &&&
+\end{tabular}
+
 <<domain BBTREE BalancedBinaryTree>>=
 )abbrev domain BBTREE BalancedBinaryTree
 ++ Description: \spadtype{BalancedBinaryTree(S)} is the domain of balanced
@@ -7802,6 +7854,57 @@ BalancedBinaryTree(S: SetCategory): Exports == Implementation where
 \pageto{PAdicRationalConstructor}{PADICRC}
 \pageto{PAdicRational}{PADICRAT}
 \pageto{BalancedPAdicRational}{BPADICRT}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{BPADIC}{0} &
+\cross{BPADIC}{1} &
+\cross{BPADIC}{approximate} &
+\cross{BPADIC}{associates?} \\
+\cross{BPADIC}{characteristic} &
+\cross{BPADIC}{coerce} &
+\cross{BPADIC}{complete} &
+\cross{BPADIC}{digits} \\
+\cross{BPADIC}{divide} &
+\cross{BPADIC}{euclideanSize} &
+\cross{BPADIC}{expressIdealMember} &
+\cross{BPADIC}{exquo} \\
+\cross{BPADIC}{extend} &
+\cross{BPADIC}{extendedEuclidean} &
+\cross{BPADIC}{gcd} &
+\cross{BPADIC}{gcdPolynomial} \\
+\cross{BPADIC}{hash} &
+\cross{BPADIC}{latex} &
+\cross{BPADIC}{lcm} &
+\cross{BPADIC}{moduloP} \\
+\cross{BPADIC}{modulus} &
+\cross{BPADIC}{multiEuclidean} &
+\cross{BPADIC}{one?} &
+\cross{BPADIC}{order} \\
+\cross{BPADIC}{principalIdeal} &
+\cross{BPADIC}{quotientByP} &
+\cross{BPADIC}{recip} &
+\cross{BPADIC}{root} \\
+\cross{BPADIC}{sample} &
+\cross{BPADIC}{sizeLess?} &
+\cross{BPADIC}{sqrt} &
+\cross{BPADIC}{subtractIfCan} \\
+\cross{BPADIC}{unit?} &
+\cross{BPADIC}{unitCanonical} &
+\cross{BPADIC}{unitNormal} &
+\cross{BPADIC}{zero?} \\
+\cross{BPADIC}{?\~{}=?} &
+\cross{BPADIC}{?*?} &
+\cross{BPADIC}{?**?} &
+\cross{BPADIC}{?\^{}?} \\
+\cross{BPADIC}{?+?} &
+\cross{BPADIC}{?-?} &
+\cross{BPADIC}{-?} &
+\cross{BPADIC}{?=?} \\
+\cross{BPADIC}{?quo?} &
+\cross{BPADIC}{?rem?} &&
+\end{tabular}
+
 <<domain BPADIC BalancedPAdicInteger>>=
 )abbrev domain BPADIC BalancedPAdicInteger
 ++ Author: Clifton J. Williamson
@@ -7836,6 +7939,93 @@ BalancedPAdicInteger(p:Integer) == InnerPAdicInteger(p,false$Boolean)
 \pageto{BalancedPAdicInteger}{BPADIC}
 \pageto{PAdicRationalConstructor}{PADICRC}
 \pageto{PAdicRational}{PADICRAT}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{BPADICRT}{0} &
+\cross{BPADICRT}{1} &
+\cross{BPADICRT}{abs} \\
+\cross{BPADICRT}{approximate} &
+\cross{BPADICRT}{associates?} &
+\cross{BPADICRT}{ceiling} \\
+\cross{BPADICRT}{characteristic} &
+\cross{BPADICRT}{charthRoot} &
+\cross{BPADICRT}{coerce} \\
+\cross{BPADICRT}{conditionP} &
+\cross{BPADICRT}{continuedFraction} &
+\cross{BPADICRT}{convert} \\
+\cross{BPADICRT}{D} &
+\cross{BPADICRT}{denom} &
+\cross{BPADICRT}{denominator} \\
+\cross{BPADICRT}{differentiate} &
+\cross{BPADICRT}{divide} &
+\cross{BPADICRT}{?.?} \\
+\cross{BPADICRT}{euclideanSize} &
+\cross{BPADICRT}{eval} &
+\cross{BPADICRT}{expressIdealMember} \\
+\cross{BPADICRT}{exquo} &
+\cross{BPADICRT}{extendedEuclidean} &
+\cross{BPADICRT}{factor} \\
+\cross{BPADICRT}{factorPolynomial} &
+\cross{BPADICRT}{factorSquareFreePolynomial} &
+\cross{BPADICRT}{floor} \\
+\cross{BPADICRT}{fractionPart} &
+\cross{BPADICRT}{gcd} &
+\cross{BPADICRT}{gcdPolynomial} \\
+\cross{BPADICRT}{hash} &
+\cross{BPADICRT}{init} &
+\cross{BPADICRT}{inv} \\
+\cross{BPADICRT}{latex} &
+\cross{BPADICRT}{lcm} &
+\cross{BPADICRT}{map} \\
+\cross{BPADICRT}{max} &
+\cross{BPADICRT}{min} &
+\cross{BPADICRT}{multiEuclidean} \\
+\cross{BPADICRT}{negative?} &
+\cross{BPADICRT}{nextItem} &
+\cross{BPADICRT}{numer} \\
+\cross{BPADICRT}{numerator} &
+\cross{BPADICRT}{one?} &
+\cross{BPADICRT}{patternMatch} \\
+\cross{BPADICRT}{positive?} &
+\cross{BPADICRT}{prime?} &
+\cross{BPADICRT}{principalIdeal} \\
+\cross{BPADICRT}{random} &
+\cross{BPADICRT}{recip} &
+\cross{BPADICRT}{reducedSystem} \\
+\cross{BPADICRT}{removeZeroes} &
+\cross{BPADICRT}{retract} &
+\cross{BPADICRT}{retractIfCan} \\
+\cross{BPADICRT}{sample} &
+\cross{BPADICRT}{sign} &
+\cross{BPADICRT}{sizeLess?} \\
+\cross{BPADICRT}{solveLinearPolynomialEquation} &
+\cross{BPADICRT}{squareFree} &
+\cross{BPADICRT}{squareFreePart} \\
+\cross{BPADICRT}{squareFreePolynomial} &
+\cross{BPADICRT}{subtractIfCan} &
+\cross{BPADICRT}{unit?} \\
+\cross{BPADICRT}{unitCanonical} &
+\cross{BPADICRT}{unitNormal} &
+\cross{BPADICRT}{wholePart} \\
+\cross{BPADICRT}{zero?} &
+\cross{BPADICRT}{?*?} &
+\cross{BPADICRT}{?**?} \\
+\cross{BPADICRT}{?+?} &
+\cross{BPADICRT}{?-?} &
+\cross{BPADICRT}{-?} \\
+\cross{BPADICRT}{?/?} &
+\cross{BPADICRT}{?=?} &
+\cross{BPADICRT}{?\^{}?} \\
+\cross{BPADICRT}{?\~{}=?} &
+\cross{BPADICRT}{?$<$?} &
+\cross{BPADICRT}{?$<=$?} \\
+\cross{BPADICRT}{?$>$?} &
+\cross{BPADICRT}{?$>=$?} &
+\cross{BPADICRT}{?quo?} \\
+\cross{BPADICRT}{?rem?} &&
+\end{tabular}
+
 <<domain BPADICRT BalancedPAdicRational>>=
 )abbrev domain BPADICRT BalancedPAdicRational
 ++ Author: Clifton J. Williamson
@@ -7866,6 +8056,18 @@ BalancedPAdicRational(p:Integer) ==
 \section{domain BFUNCT BasicFunctions}
 \pagehead{BasicFunctions}{BFUNCT}
 \pagepic{ps/v103basicfunctions.ps}{BFUNCT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{BFUNCT}{bfEntry} &
+\cross{BFUNCT}{bfKeys} &
+\cross{BFUNCT}{coerce} &
+\cross{BFUNCT}{hash} &
+\cross{BFUNCT}{latex} \\
+\cross{BFUNCT}{?\~{}=?} &
+\cross{BFUNCT}{?=?} &&&
+\end{tabular}
+
 <<domain BFUNCT BasicFunctions>>=
 )abbrev domain BFUNCT BasicFunctions
 ++ Author: Brian Dupee
@@ -8244,6 +8446,47 @@ o )show BasicOperator
 @
 \pagehead{BasicOperator}{BOP}
 \pagepic{ps/v103basicoperator.ps}{BOP}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{BOP}{arity} &
+\cross{BOP}{assert} &
+\cross{BOP}{coerce} &
+\cross{BOP}{comparison} &
+\cross{BOP}{copy} \\
+\cross{BOP}{deleteProperty!} &
+\cross{BOP}{display} &
+\cross{BOP}{display} &
+\cross{BOP}{display} &
+\cross{BOP}{equality} \\
+\cross{BOP}{has?} &
+\cross{BOP}{hash} &
+\cross{BOP}{input} &
+\cross{BOP}{input} &
+\cross{BOP}{is?} \\
+\cross{BOP}{latex} &
+\cross{BOP}{max} &
+\cross{BOP}{min} &
+\cross{BOP}{name} &
+\cross{BOP}{nary?} \\
+\cross{BOP}{nullary?} &
+\cross{BOP}{operator} &
+\cross{BOP}{operator} &
+\cross{BOP}{properties} &
+\cross{BOP}{property} \\
+\cross{BOP}{setProperties} &
+\cross{BOP}{setProperty} &
+\cross{BOP}{unary?} &
+\cross{BOP}{weight} &
+\cross{BOP}{weight} \\
+\cross{BOP}{?\~{}=?} &
+\cross{BOP}{?$<$?} &
+\cross{BOP}{?$<=$?} &
+\cross{BOP}{?=?} &
+\cross{BOP}{?$>$?} \\
+\cross{BOP}{?$>=$?} &&&&
+\end{tabular}
+
 <<domain BOP BasicOperator>>=
 )abbrev domain BOP BasicOperator
 ++ Basic system operators
@@ -8599,6 +8842,91 @@ o )show BinaryExpansion
 \pageto{RadixExpansion}{RADIX}
 \pageto{DecimalExpansion}{DECIMAL}
 \pageto{HexadecimalExpansion}{HEXADEC}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{BINARY}{0} &
+\cross{BINARY}{1} &
+\cross{BINARY}{abs} \\
+\cross{BINARY}{associates?} &
+\cross{BINARY}{binary} &
+\cross{BINARY}{ceiling} \\
+\cross{BINARY}{characteristic} &
+\cross{BINARY}{charthRoot} &
+\cross{BINARY}{coerce} \\
+\cross{BINARY}{conditionP} &
+\cross{BINARY}{convert} &
+\cross{BINARY}{D} \\
+\cross{BINARY}{denom} &
+\cross{BINARY}{denominator} &
+\cross{BINARY}{differentiate} \\
+\cross{BINARY}{divide} &
+\cross{BINARY}{euclideanSize} &
+\cross{BINARY}{eval} \\
+\cross{BINARY}{expressIdealMember} &
+\cross{BINARY}{exquo} &
+\cross{BINARY}{extendedEuclidean} \\
+\cross{BINARY}{factor} &
+\cross{BINARY}{factorPolynomial} &
+\cross{BINARY}{factorSquareFreePolynomial} \\
+\cross{BINARY}{floor} &
+\cross{BINARY}{fractionPart} &
+\cross{BINARY}{gcd} \\
+\cross{BINARY}{gcdPolynomial} &
+\cross{BINARY}{hash} &
+\cross{BINARY}{init} \\
+\cross{BINARY}{inv} &
+\cross{BINARY}{latex} &
+\cross{BINARY}{lcm} \\
+\cross{BINARY}{map} &
+\cross{BINARY}{max} &
+\cross{BINARY}{min} \\
+\cross{BINARY}{multiEuclidean} &
+\cross{BINARY}{negative?} &
+\cross{BINARY}{nextItem} \\
+\cross{BINARY}{numer} &
+\cross{BINARY}{numerator} &
+\cross{BINARY}{one?} \\
+\cross{BINARY}{patternMatch} &
+\cross{BINARY}{positive?} &
+\cross{BINARY}{prime?} \\
+\cross{BINARY}{principalIdeal} &
+\cross{BINARY}{random} &
+\cross{BINARY}{recip} \\
+\cross{BINARY}{reducedSystem} &
+\cross{BINARY}{retract} &
+\cross{BINARY}{retractIfCan} \\
+\cross{BINARY}{sample} &
+\cross{BINARY}{sign} &
+\cross{BINARY}{sizeLess?} \\
+\cross{BINARY}{solveLinearPolynomialEquation} &
+\cross{BINARY}{squareFree} &
+\cross{BINARY}{squareFreePart} \\
+\cross{BINARY}{squareFreePolynomial} &
+\cross{BINARY}{subtractIfCan} &
+\cross{BINARY}{unit?} \\
+\cross{BINARY}{unitCanonical} &
+\cross{BINARY}{unitNormal} &
+\cross{BINARY}{wholePart} \\
+\cross{BINARY}{zero?} &
+\cross{BINARY}{?*?} &
+\cross{BINARY}{?**?} \\
+\cross{BINARY}{?+?} &
+\cross{BINARY}{?-?} &
+\cross{BINARY}{-?} \\
+\cross{BINARY}{?/?} &
+\cross{BINARY}{?=?} &
+\cross{BINARY}{?\^{}?} \\
+\cross{BINARY}{?\~{}=?} &
+\cross{BINARY}{?$<$?} &
+\cross{BINARY}{?$<=$?} \\
+\cross{BINARY}{?$>$?} &
+\cross{BINARY}{?$>=$?} &
+\cross{BINARY}{?.?} \\
+\cross{BINARY}{?quo?} &
+\cross{BINARY}{?rem?} &
+\end{tabular}
+
 <<domain BINARY BinaryExpansion>>=
 )abbrev domain BINARY BinaryExpansion
 ++ Author: Clifton J. Williamson
@@ -8648,6 +8976,26 @@ BinaryExpansion(): Exports == Implementation where
 \pageto{TextFile}{TEXTFILE}
 \pageto{KeyedAccessFile}{KAFILE}
 \pageto{Library}{LIB}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{BINFILE}{close!} &
+\cross{BINFILE}{coerce} &
+\cross{BINFILE}{hash} &
+\cross{BINFILE}{iomode} &
+\cross{BINFILE}{latex} \\
+\cross{BINFILE}{name} &
+\cross{BINFILE}{open} &
+\cross{BINFILE}{position} &
+\cross{BINFILE}{position!} &
+\cross{BINFILE}{read!} \\
+\cross{BINFILE}{readIfCan!} &
+\cross{BINFILE}{reopen!} &
+\cross{BINFILE}{write!} &
+\cross{BINFILE}{?=?} &
+\cross{BINFILE}{?\~{}=?} 
+\end{tabular}
+
 <<domain BINFILE BinaryFile>>=
 )abbrev domain BINFILE BinaryFile
 ++ Author: Barry M. Trager
@@ -8972,6 +9320,64 @@ o )show BinarySearchTree
 \pageto{BinaryTournament}{BTOURN}
 \pageto{BalancedBinaryTree}{BBTREE}
 \pageto{PendantTree}{PENDTREE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{BSTREE}{any?} &
+\cross{BSTREE}{binarySearchTree} &
+\cross{BSTREE}{child?} &
+\cross{BSTREE}{children} &
+\cross{BSTREE}{coerce} \\
+\cross{BSTREE}{copy} &
+\cross{BSTREE}{count} &
+\cross{BSTREE}{count} &
+\cross{BSTREE}{cyclic?} &
+\cross{BSTREE}{distance} \\
+\cross{BSTREE}{empty} &
+\cross{BSTREE}{empty?} &
+\cross{BSTREE}{eq?} &
+\cross{BSTREE}{eval} &
+\cross{BSTREE}{eval} \\
+\cross{BSTREE}{eval} &
+\cross{BSTREE}{eval} &
+\cross{BSTREE}{every?} &
+\cross{BSTREE}{hash} &
+\cross{BSTREE}{insert!} \\
+\cross{BSTREE}{insertRoot!} &
+\cross{BSTREE}{latex} &
+\cross{BSTREE}{leaf?} &
+\cross{BSTREE}{leaves} &
+\cross{BSTREE}{left} \\
+\cross{BSTREE}{less?} &
+\cross{BSTREE}{map} &
+\cross{BSTREE}{map!} &
+\cross{BSTREE}{member?} &
+\cross{BSTREE}{members} \\
+\cross{BSTREE}{more?} &
+\cross{BSTREE}{node} &
+\cross{BSTREE}{node?} &
+\cross{BSTREE}{nodes} &
+\cross{BSTREE}{parts} \\
+\cross{BSTREE}{right} &
+\cross{BSTREE}{sample} &
+\cross{BSTREE}{setchildren!} &
+\cross{BSTREE}{setelt} &
+\cross{BSTREE}{setelt} \\
+\cross{BSTREE}{setelt} &
+\cross{BSTREE}{setleft!} &
+\cross{BSTREE}{setright!} &
+\cross{BSTREE}{setvalue!} &
+\cross{BSTREE}{size?} \\
+\cross{BSTREE}{split} &
+\cross{BSTREE}{value} &
+\cross{BSTREE}{\#{}?} &
+\cross{BSTREE}{?=?} &
+\cross{BSTREE}{?\~{}=?} \\
+\cross{BSTREE}{?.right} &
+\cross{BSTREE}{?.left} &
+\cross{BSTREE}{?.value} &&
+\end{tabular}
+
 <<domain BSTREE BinarySearchTree>>=
 )abbrev domain BSTREE BinarySearchTree
 ++ Description: BinarySearchTree(S) is the domain of
@@ -9054,6 +9460,56 @@ both BinaryTree(S)
 \pageto{BinarySearchTree}{BSTREE}
 \pageto{BalancedBinaryTree}{BBTREE}
 \pageto{PendantTree}{PENDTREE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{BTOURN}{any?} &
+\cross{BTOURN}{binaryTournament} &
+\cross{BTOURN}{child?} &
+\cross{BTOURN}{children} &
+\cross{BTOURN}{coerce} \\
+\cross{BTOURN}{copy} &
+\cross{BTOURN}{count} &
+\cross{BTOURN}{cyclic?} &
+\cross{BTOURN}{distance} &
+\cross{BTOURN}{empty} \\
+\cross{BTOURN}{empty?} &
+\cross{BTOURN}{eq?} &
+\cross{BTOURN}{eval} &
+\cross{BTOURN}{every?} &
+\cross{BTOURN}{hash} \\
+\cross{BTOURN}{insert!} &
+\cross{BTOURN}{latex} &
+\cross{BTOURN}{leaf?} &
+\cross{BTOURN}{leaves} &
+\cross{BTOURN}{left} \\
+\cross{BTOURN}{less?} &
+\cross{BTOURN}{map} &
+\cross{BTOURN}{map!} &
+\cross{BTOURN}{member?} &
+\cross{BTOURN}{members} \\
+\cross{BTOURN}{more?} &
+\cross{BTOURN}{node} &
+\cross{BTOURN}{node?} &
+\cross{BTOURN}{nodes} &
+\cross{BTOURN}{parts} \\
+\cross{BTOURN}{right} &
+\cross{BTOURN}{sample} &
+\cross{BTOURN}{setchildren!} &
+\cross{BTOURN}{setelt} &
+\cross{BTOURN}{setleft!} \\
+\cross{BTOURN}{setright!} &
+\cross{BTOURN}{setvalue!} &
+\cross{BTOURN}{size?} &
+\cross{BTOURN}{value} &
+\cross{BTOURN}{\#{}?} \\
+\cross{BTOURN}{?=?} &
+\cross{BTOURN}{?\~{}=?} &
+\cross{BTOURN}{?.right} &
+\cross{BTOURN}{?.left} &
+\cross{BTOURN}{?.value} 
+\end{tabular}
+
 <<domain BTOURN BinaryTournament>>=
 )abbrev domain BTOURN BinaryTournament
 BinaryTournament(S: OrderedSet): Exports == Implementation where
@@ -9105,6 +9561,55 @@ BinaryTournament(S: OrderedSet): Exports == Implementation where
 \pageto{BinaryTournament}{BTOURN}
 \pageto{BalancedBinaryTree}{BBTREE}
 \pageto{PendantTree}{PENDTREE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{BTREE}{any?} &
+\cross{BTREE}{binaryTree} &
+\cross{BTREE}{child?} &
+\cross{BTREE}{children} &
+\cross{BTREE}{coerce} \\
+\cross{BTREE}{copy} &
+\cross{BTREE}{count} &
+\cross{BTREE}{cyclic?} &
+\cross{BTREE}{distance} &
+\cross{BTREE}{empty} \\
+\cross{BTREE}{empty?} &
+\cross{BTREE}{eq?} &
+\cross{BTREE}{eval} &
+\cross{BTREE}{every?} &
+\cross{BTREE}{hash} \\
+\cross{BTREE}{latex} &
+\cross{BTREE}{leaf?} &
+\cross{BTREE}{leaves} &
+\cross{BTREE}{left} &
+\cross{BTREE}{less?} \\
+\cross{BTREE}{map} &
+\cross{BTREE}{map!} &
+\cross{BTREE}{member?} &
+\cross{BTREE}{members} &
+\cross{BTREE}{more?} \\
+\cross{BTREE}{node} &
+\cross{BTREE}{node?} &
+\cross{BTREE}{nodes} &
+\cross{BTREE}{parts} &
+\cross{BTREE}{right} \\
+\cross{BTREE}{sample} &
+\cross{BTREE}{setchildren!} &
+\cross{BTREE}{setelt} &
+\cross{BTREE}{setleft!} &
+\cross{BTREE}{setright!} \\
+\cross{BTREE}{setvalue!} &
+\cross{BTREE}{size?} &
+\cross{BTREE}{value} &
+\cross{BTREE}{\#{}?} &
+\cross{BTREE}{?=?} \\
+\cross{BTREE}{?\~{}=?} &
+\cross{BTREE}{?.right} &
+\cross{BTREE}{?.left} &
+\cross{BTREE}{?.value} &
+\end{tabular}
+
 <<domain BTREE BinaryTree>>=
 )abbrev domain BTREE BinaryTree
 ++ Description: \spadtype{BinaryTree(S)} is the domain of all
@@ -9173,6 +9678,84 @@ BinaryTree(S: SetCategory): Exports == Implementation where
 \pageto{Reference}{REF}
 \pageto{Boolean}{BOOLEAN}
 \pageto{IndexedBits}{IBITS}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{BITS}{any?} &
+\cross{BITS}{bits} &
+\cross{BITS}{coerce} &
+\cross{BITS}{concat} &
+\cross{BITS}{construct} \\
+\cross{BITS}{convert} &
+\cross{BITS}{copy} &
+\cross{BITS}{copyInto!} &
+\cross{BITS}{count} &
+\cross{BITS}{delete} \\
+\cross{BITS}{elt} &
+\cross{BITS}{empty} &
+\cross{BITS}{empty?} &
+\cross{BITS}{entries} &
+\cross{BITS}{entry?} \\
+\cross{BITS}{eq?} &
+\cross{BITS}{eval} &
+\cross{BITS}{every?} &
+\cross{BITS}{fill!} &
+\cross{BITS}{find} \\
+\cross{BITS}{first} &
+\cross{BITS}{hash} &
+\cross{BITS}{index?} &
+\cross{BITS}{indices} &
+\cross{BITS}{insert} \\
+\cross{BITS}{latex} &
+\cross{BITS}{less?} &
+\cross{BITS}{map} &
+\cross{BITS}{map!} &
+\cross{BITS}{max} \\
+\cross{BITS}{maxIndex} &
+\cross{BITS}{member?} &
+\cross{BITS}{members} &
+\cross{BITS}{merge} &
+\cross{BITS}{min} \\
+\cross{BITS}{minIndex} &
+\cross{BITS}{more?} &
+\cross{BITS}{nand} &
+\cross{BITS}{new} &
+\cross{BITS}{nor} \\
+\cross{BITS}{not?} &
+\cross{BITS}{parts} &
+\cross{BITS}{position} &
+\cross{BITS}{qelt} &
+\cross{BITS}{qsetelt!} \\
+\cross{BITS}{reduce} &
+\cross{BITS}{remove} &
+\cross{BITS}{removeDuplicates} &
+\cross{BITS}{reverse} &
+\cross{BITS}{reverse!} \\
+\cross{BITS}{sample} &
+\cross{BITS}{setelt} &
+\cross{BITS}{size?} &
+\cross{BITS}{sort} &
+\cross{BITS}{sort!} \\
+\cross{BITS}{sorted?} &
+\cross{BITS}{swap!} &
+\cross{BITS}{xor} &
+\cross{BITS}{\#{}?} &
+\cross{BITS}{?.?} \\
+\cross{BITS}{?$/\backslash{}$?} &
+\cross{BITS}{?$<$?} &
+\cross{BITS}{?$<=$?} &
+\cross{BITS}{?=?} &
+\cross{BITS}{?$>$?} \\
+\cross{BITS}{?$>=$?} &
+\cross{BITS}{?$\backslash{}/$?} &
+\cross{BITS}{\^{}?} &
+\cross{BITS}{?and?} &
+\cross{BITS}{?or?} \\
+\cross{BITS}{?.?} &
+\cross{BITS}{\~{}?} &
+\cross{BITS}{?\~{}=?} &&
+\end{tabular}
+
 <<domain BITS Bits>>=
 )abbrev domain BITS Bits
 ++ Author: Stephen M. Watt
@@ -9205,6 +9788,41 @@ Bits(): Exports == Implementation where
 \pageto{Reference}{REF}
 \pageto{IndexedBits}{IBITS}
 \pageto{Bits}{BITS}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{BOOLEAN}{coerce} &
+\cross{BOOLEAN}{convert} &
+\cross{BOOLEAN}{false} &
+\cross{BOOLEAN}{hash} &
+\cross{BOOLEAN}{implies} \\
+\cross{BOOLEAN}{index} &
+\cross{BOOLEAN}{latex} &
+\cross{BOOLEAN}{lookup} &
+\cross{BOOLEAN}{max} &
+\cross{BOOLEAN}{min} \\
+\cross{BOOLEAN}{nand} &
+\cross{BOOLEAN}{nor} &
+\cross{BOOLEAN}{not?} &
+\cross{BOOLEAN}{random} &
+\cross{BOOLEAN}{size} \\
+\cross{BOOLEAN}{test} &
+\cross{BOOLEAN}{true} &
+\cross{BOOLEAN}{xor} &
+\cross{BOOLEAN}{\~{}?} &
+\cross{BOOLEAN}{?\~{}=?} \\
+\cross{BOOLEAN}{?$/\backslash{}$?} &
+\cross{BOOLEAN}{?$<$?} &
+\cross{BOOLEAN}{?$<=$?} &
+\cross{BOOLEAN}{?=?} &
+\cross{BOOLEAN}{?$>$?} \\
+\cross{BOOLEAN}{?$>=$?} &
+\cross{BOOLEAN}{?$\backslash{}/$?} &
+\cross{BOOLEAN}{\^{}?} &
+\cross{BOOLEAN}{?and?} &
+\cross{BOOLEAN}{?or?} 
+\end{tabular}
+
 <<domain BOOLEAN Boolean>>=
 )abbrev domain BOOLEAN Boolean
 ++ Author: Stephen M. Watt
@@ -9377,7 +9995,7 @@ countable? c2
 
 --S 10 of 20
 countable? A0
---R 
+uon --R 
 --R
 --R   (10)  true
 --R                                                                Type: Boolean
@@ -9616,6 +10234,40 @@ o )show CardinalNumber
 @
 \pagehead{CardinalNumber}{CARD}
 \pagepic{ps/v103cardinalnumber.ps}{CARD}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{CARD}{0} &
+\cross{CARD}{1} \\
+\cross{CARD}{Aleph} &
+\cross{CARD}{coerce} \\
+\cross{CARD}{countable?} &
+\cross{CARD}{finite?} \\
+\cross{CARD}{generalizedContinuumHypothesisAssumed} &
+\cross{CARD}{generalizedContinuumHypothesisAssumed?} \\
+\cross{CARD}{hash} &
+\cross{CARD}{latex} \\
+\cross{CARD}{max} &
+\cross{CARD}{min} \\
+\cross{CARD}{one?} &
+\cross{CARD}{recip} \\
+\cross{CARD}{retract} &
+\cross{CARD}{retractIfCan} \\
+\cross{CARD}{sample} &
+\cross{CARD}{zero?} \\
+\cross{CARD}{?\^{}?} &
+\cross{CARD}{?\~{}=?} \\
+\cross{CARD}{?*?} &
+\cross{CARD}{?**?} \\
+\cross{CARD}{?-?} &
+\cross{CARD}{?+?} \\
+\cross{CARD}{?$<$?} &
+\cross{CARD}{?$<=$?} \\
+\cross{CARD}{?=?} &
+\cross{CARD}{?$>$?} \\
+\cross{CARD}{?$>=$?} &
+\end{tabular}
+
 <<domain CARD CardinalNumber>>=
 )abbrev domain CARD CardinalNumber
 ++ Author: S.M. Watt
@@ -10758,6 +11410,37 @@ o )show CartesianTensor
 @
 \pagehead{CartesianTensor}{CARTEN}
 \pagepic{ps/v103cartesiantensor.ps}{CARTEN}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{CARTEN}{0} &
+\cross{CARTEN}{1} &
+\cross{CARTEN}{coerce} &
+\cross{CARTEN}{contract} &
+\cross{CARTEN}{degree} \\
+\cross{CARTEN}{elt} &
+\cross{CARTEN}{hash} &
+\cross{CARTEN}{kroneckerDelta} &
+\cross{CARTEN}{latex} &
+\cross{CARTEN}{leviCivitaSymbol} \\
+\cross{CARTEN}{product} &
+\cross{CARTEN}{rank} &
+\cross{CARTEN}{ravel} &
+\cross{CARTEN}{reindex} &
+\cross{CARTEN}{retract} \\
+\cross{CARTEN}{retractIfCan} &
+\cross{CARTEN}{sample} &
+\cross{CARTEN}{transpose} &
+\cross{CARTEN}{unravel} &
+\cross{CARTEN}{?\~{}=?} \\
+\cross{CARTEN}{?.?} &
+\cross{CARTEN}{?*?} &
+\cross{CARTEN}{?+?} &
+\cross{CARTEN}{?-?} &
+\cross{CARTEN}{-?} \\
+\cross{CARTEN}{?=?} &&&&
+\end{tabular}
+
 <<domain CARTEN CartesianTensor>>=
 )abbrev domain CARTEN CartesianTensor
 ++ Author: Stephen M. Watt
@@ -11579,6 +12262,39 @@ o )show Character
 \pageto{CharacterClass}{CCLASS}
 \pageto{IndexedString}{ISTRING}
 \pageto{String}{STRING}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{CHAR}{alphabetic?} &
+\cross{CHAR}{alphanumeric?} &
+\cross{CHAR}{char} &
+\cross{CHAR}{coerce} &
+\cross{CHAR}{digit?} \\
+\cross{CHAR}{escape} &
+\cross{CHAR}{hash} &
+\cross{CHAR}{hexDigit?} &
+\cross{CHAR}{index} &
+\cross{CHAR}{latex} \\
+\cross{CHAR}{lookup} &
+\cross{CHAR}{lowerCase} &
+\cross{CHAR}{lowerCase?} &
+\cross{CHAR}{max} &
+\cross{CHAR}{min} \\
+\cross{CHAR}{ord} &
+\cross{CHAR}{quote} &
+\cross{CHAR}{random} &
+\cross{CHAR}{size} &
+\cross{CHAR}{space} \\
+\cross{CHAR}{upperCase} &
+\cross{CHAR}{upperCase?} &
+\cross{CHAR}{?\~{}=?} &
+\cross{CHAR}{?$<$?} &
+\cross{CHAR}{?$<=$?} \\
+\cross{CHAR}{?=?} &
+\cross{CHAR}{?$>$?} &
+\cross{CHAR}{?$>=$?} &&
+\end{tabular}
+
 <<domain CHAR Character>>=
 )abbrev domain CHAR Character
 ++ Author: Stephen M. Watt
@@ -11961,6 +12677,81 @@ o )show CharacterClass
 \pageto{Character}{CHAR}
 \pageto{IndexedString}{ISTRING}
 \pageto{String}{STRING}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{CCLASS}{any?} &
+\cross{CCLASS}{alphabetic} &
+\cross{CCLASS}{alphanumeric} &
+\cross{CCLASS}{bag} &
+\cross{CCLASS}{brace} \\
+\cross{CCLASS}{brace} &
+\cross{CCLASS}{cardinality} &
+\cross{CCLASS}{charClass} &
+\cross{CCLASS}{coerce} &
+\cross{CCLASS}{complement} \\
+\cross{CCLASS}{construct} &
+\cross{CCLASS}{convert} &
+\cross{CCLASS}{copy} &
+\cross{CCLASS}{count} &
+\cross{CCLASS}{count} \\
+\cross{CCLASS}{dictionary} &
+\cross{CCLASS}{difference} &
+\cross{CCLASS}{digit} &
+\cross{CCLASS}{empty} &
+\cross{CCLASS}{empty?} \\
+\cross{CCLASS}{eq?} &
+\cross{CCLASS}{eval} &
+\cross{CCLASS}{eval} &
+\cross{CCLASS}{eval} &
+\cross{CCLASS}{eval} \\
+\cross{CCLASS}{every?} &
+\cross{CCLASS}{extract!} &
+\cross{CCLASS}{find} &
+\cross{CCLASS}{hash} &
+\cross{CCLASS}{hexDigit} \\
+\cross{CCLASS}{index} &
+\cross{CCLASS}{insert!} &
+\cross{CCLASS}{inspect} &
+\cross{CCLASS}{intersect} &
+\cross{CCLASS}{latex} \\
+\cross{CCLASS}{less?} &
+\cross{CCLASS}{lookup} &
+\cross{CCLASS}{lowerCase} &
+\cross{CCLASS}{map} &
+\cross{CCLASS}{map!} \\
+\cross{CCLASS}{max} &
+\cross{CCLASS}{member?} &
+\cross{CCLASS}{members} &
+\cross{CCLASS}{min} &
+\cross{CCLASS}{more?} \\
+\cross{CCLASS}{parts} &
+\cross{CCLASS}{random} &
+\cross{CCLASS}{reduce} &
+\cross{CCLASS}{reduce} &
+\cross{CCLASS}{reduce} \\
+\cross{CCLASS}{remove} &
+\cross{CCLASS}{remove} &
+\cross{CCLASS}{remove!} &
+\cross{CCLASS}{remove!} &
+\cross{CCLASS}{removeDuplicates} \\
+\cross{CCLASS}{sample} &
+\cross{CCLASS}{select} &
+\cross{CCLASS}{select!} &
+\cross{CCLASS}{set} &
+\cross{CCLASS}{size} \\
+\cross{CCLASS}{size?} &
+\cross{CCLASS}{subset?} &
+\cross{CCLASS}{symmetricDifference} &
+\cross{CCLASS}{union} &
+\cross{CCLASS}{universe} \\
+\cross{CCLASS}{upperCase} &
+\cross{CCLASS}{\#{}?} &
+\cross{CCLASS}{?$<$?} &
+\cross{CCLASS}{?=?} &
+\cross{CCLASS}{?\~{}=?} 
+\end{tabular}
+
 <<domain CCLASS CharacterClass>>=
 )abbrev domain CCLASS CharacterClass
 ++ Author: Stephen M. Watt
@@ -12888,6 +13679,35 @@ o $AXIOM/doc/src/algebra/clifford.spad
 \pagepic{ps/v103cliffordalgebra.ps}{CLIF}{1.00}
 {\bf See}\\
 \pageto{QuadraticForm}{QFORM}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{CLIF}{0} &
+\cross{CLIF}{1} &
+\cross{CLIF}{characteristic} &
+\cross{CLIF}{coefficient} &
+\cross{CLIF}{coerce} \\
+\cross{CLIF}{dimension} &
+\cross{CLIF}{e} &
+\cross{CLIF}{hash} &
+\cross{CLIF}{latex} &
+\cross{CLIF}{monomial} \\
+\cross{CLIF}{one?} &
+\cross{CLIF}{recip} &
+\cross{CLIF}{sample} &
+\cross{CLIF}{subtractIfCan} &
+\cross{CLIF}{zero?} \\
+\cross{CLIF}{?\~{}=?} &
+\cross{CLIF}{?*?} &
+\cross{CLIF}{?**?} &
+\cross{CLIF}{?\^{}?} &
+\cross{CLIF}{?+?} \\
+\cross{CLIF}{?-?} &
+\cross{CLIF}{-?} &
+\cross{CLIF}{?/?} &
+\cross{CLIF}{?=?} &
+\end{tabular}
+
 <<domain CLIF CliffordAlgebra>>=
 )abbrev domain CLIF CliffordAlgebra
 ++ Author: Stephen M. Watt
@@ -13104,6 +13924,25 @@ CliffordAlgebra(n, K, Q): T == Impl where
 \pagepic{ps/v103color.ps}{COLOR}{1.00}
 {\bf See}\\
 \pageto{Palette}{PALETTE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{COLOR}{blue} &
+\cross{COLOR}{coerce} &
+\cross{COLOR}{color} &
+\cross{COLOR}{green} &
+\cross{COLOR}{hash} \\
+\cross{COLOR}{hue} &
+\cross{COLOR}{latex} &
+\cross{COLOR}{numberOfHues} &
+\cross{COLOR}{red} &
+\cross{COLOR}{yellow} \\
+\cross{COLOR}{?\~{}=?} &
+\cross{COLOR}{?*?} &
+\cross{COLOR}{?+?} &
+\cross{COLOR}{?=?} &
+\end{tabular}
+
 <<domain COLOR Color>>=
 )abbrev domain COLOR Color
 ++ Author: Jim Wen
@@ -13211,6 +14050,17 @@ Color(): Exports == Implementation where
 {\bf See}\\
 \pageto{OrdSetInts}{OSI}
 \pageto{FreeNilpotentLie}{FNLA}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{COMM}{coerce} &
+\cross{COMM}{hash} &
+\cross{COMM}{latex} &
+\cross{COMM}{mkcomm} &
+\cross{COMM}{?=?} &
+\cross{COMM}{?\~{}=?} 
+\end{tabular}
+
 <<domain COMM Commutator>>=
 )abbrev domain COMM Commutator
 ++ Author : Larry Lambe
@@ -13542,6 +14392,147 @@ o )show Complex
 @
 \pagehead{Complex}{COMPLEX}
 \pagepic{ps/v103complex.ps}{COMPLEX}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{COMPLEX}{0} &
+\cross{COMPLEX}{1} &
+\cross{COMPLEX}{abs} \\
+\cross{COMPLEX}{acos} &
+\cross{COMPLEX}{acosh} &
+\cross{COMPLEX}{acot} \\
+\cross{COMPLEX}{acoth} &
+\cross{COMPLEX}{acsc} &
+\cross{COMPLEX}{acsch} \\
+\cross{COMPLEX}{argument} &
+\cross{COMPLEX}{asec} &
+\cross{COMPLEX}{asech} \\
+\cross{COMPLEX}{asin} &
+\cross{COMPLEX}{asinh} &
+\cross{COMPLEX}{associates?} \\
+\cross{COMPLEX}{atan} &
+\cross{COMPLEX}{atanh} &
+\cross{COMPLEX}{basis} \\
+\cross{COMPLEX}{characteristic} &
+\cross{COMPLEX}{characteristicPolynomial} &
+\cross{COMPLEX}{charthRoot} \\
+\cross{COMPLEX}{coerce} &
+\cross{COMPLEX}{complex} &
+\cross{COMPLEX}{conditionP} \\
+\cross{COMPLEX}{conjugate} &
+\cross{COMPLEX}{convert} &
+\cross{COMPLEX}{coordinates} \\
+\cross{COMPLEX}{cos} &
+\cross{COMPLEX}{cosh} &
+\cross{COMPLEX}{cot} \\
+\cross{COMPLEX}{coth} &
+\cross{COMPLEX}{createPrimitiveElement} &
+\cross{COMPLEX}{csc} \\
+\cross{COMPLEX}{csch} &
+\cross{COMPLEX}{D} &
+\cross{COMPLEX}{definingPolynomial} \\
+\cross{COMPLEX}{derivationCoordinates} &
+\cross{COMPLEX}{differentiate} &
+\cross{COMPLEX}{discreteLog} \\
+\cross{COMPLEX}{discriminant} &
+\cross{COMPLEX}{divide} &
+\cross{COMPLEX}{euclideanSize} \\
+\cross{COMPLEX}{eval} &
+\cross{COMPLEX}{exp} &
+\cross{COMPLEX}{expressIdealMember} \\
+\cross{COMPLEX}{exquo} &
+\cross{COMPLEX}{extendedEuclidean} &
+\cross{COMPLEX}{factor} \\
+\cross{COMPLEX}{factorPolynomial} &
+\cross{COMPLEX}{factorSquareFreePolynomial} &
+\cross{COMPLEX}{factorsOfCyclicGroupSize} \\
+\cross{COMPLEX}{gcd} &
+\cross{COMPLEX}{gcdPolynomial} &
+\cross{COMPLEX}{generator} \\
+\cross{COMPLEX}{hash} &
+\cross{COMPLEX}{imag} &
+\cross{COMPLEX}{imaginary} \\
+\cross{COMPLEX}{index} &
+\cross{COMPLEX}{init} &
+\cross{COMPLEX}{inv} \\
+\cross{COMPLEX}{latex} &
+\cross{COMPLEX}{lcm} &
+\cross{COMPLEX}{lift} \\
+\cross{COMPLEX}{log} &
+\cross{COMPLEX}{lookup} &
+\cross{COMPLEX}{map} \\
+\cross{COMPLEX}{max} &
+\cross{COMPLEX}{min} &
+\cross{COMPLEX}{minimalPolynomial} \\
+\cross{COMPLEX}{multiEuclidean} &
+\cross{COMPLEX}{nextItem} &
+\cross{COMPLEX}{norm} \\
+\cross{COMPLEX}{nthRoot} &
+\cross{COMPLEX}{OMwrite} &
+\cross{COMPLEX}{one?} \\
+\cross{COMPLEX}{order} &
+\cross{COMPLEX}{patternMatch} &
+\cross{COMPLEX}{pi} \\
+\cross{COMPLEX}{polarCoordinates} &
+\cross{COMPLEX}{prime?} &
+\cross{COMPLEX}{primeFrobenius} \\
+\cross{COMPLEX}{primitive?} &
+\cross{COMPLEX}{primitiveElement} &
+\cross{COMPLEX}{principalIdeal} \\
+\cross{COMPLEX}{random} &
+\cross{COMPLEX}{rank} &
+\cross{COMPLEX}{rational} \\
+\cross{COMPLEX}{rational?} &
+\cross{COMPLEX}{rationalIfCan} &
+\cross{COMPLEX}{real} \\
+\cross{COMPLEX}{recip} &
+\cross{COMPLEX}{reduce} &
+\cross{COMPLEX}{reducedSystem} \\
+\cross{COMPLEX}{regularRepresentation} &
+\cross{COMPLEX}{representationType} &
+\cross{COMPLEX}{represents} \\
+\cross{COMPLEX}{retract} &
+\cross{COMPLEX}{retractIfCan} &
+\cross{COMPLEX}{sample} \\
+\cross{COMPLEX}{sec} &
+\cross{COMPLEX}{sech} &
+\cross{COMPLEX}{sin} \\
+\cross{COMPLEX}{sinh} &
+\cross{COMPLEX}{size} &
+\cross{COMPLEX}{sizeLess?} \\
+\cross{COMPLEX}{solveLinearPolynomialEquation} &
+\cross{COMPLEX}{sqrt} &
+\cross{COMPLEX}{squareFree} \\
+\cross{COMPLEX}{squareFreePart} &
+\cross{COMPLEX}{squareFreePolynomial} &
+\cross{COMPLEX}{subtractIfCan} \\
+\cross{COMPLEX}{tableForDiscreteLogarithm} &
+\cross{COMPLEX}{tan} &
+\cross{COMPLEX}{tanh} \\
+\cross{COMPLEX}{trace} &
+\cross{COMPLEX}{traceMatrix} &
+\cross{COMPLEX}{unit?} \\
+\cross{COMPLEX}{unitCanonical} &
+\cross{COMPLEX}{unitNormal} &
+\cross{COMPLEX}{zero?} \\
+\cross{COMPLEX}{?*?} &
+\cross{COMPLEX}{?**?} &
+\cross{COMPLEX}{?+?} \\
+\cross{COMPLEX}{?-?} &
+\cross{COMPLEX}{-?} &
+\cross{COMPLEX}{?=?} \\
+\cross{COMPLEX}{?\^{}?} &
+\cross{COMPLEX}{?\~{}=?} &
+\cross{COMPLEX}{?/?} \\
+\cross{COMPLEX}{?$<$?} &
+\cross{COMPLEX}{?$<=$?} &
+\cross{COMPLEX}{?$>$?} \\
+\cross{COMPLEX}{?$>=$?} &
+\cross{COMPLEX}{?.?} &
+\cross{COMPLEX}{?quo?} \\
+\cross{COMPLEX}{?rem?} &&
+\end{tabular}
+
 <<domain COMPLEX Complex>>=
 )abbrev domain COMPLEX Complex
 ++ Author:
@@ -14181,6 +15172,66 @@ o )show ContinuedFraction
 @
 \pagehead{ContinuedFraction}{CONTFRAC}
 \pagepic{ps/v103continuedfraction.ps}{CONTFRAC}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{CONTFRAC}{0} &
+\cross{CONTFRAC}{1} &
+\cross{CONTFRAC}{approximants} \\
+\cross{CONTFRAC}{associates?} &
+\cross{CONTFRAC}{characteristic} &
+\cross{CONTFRAC}{coerce} \\
+\cross{CONTFRAC}{complete} &
+\cross{CONTFRAC}{continuedFraction} &
+\cross{CONTFRAC}{convergents} \\
+\cross{CONTFRAC}{denominators} &
+\cross{CONTFRAC}{divide} &
+\cross{CONTFRAC}{extend} \\
+\cross{CONTFRAC}{euclideanSize} &
+\cross{CONTFRAC}{expressIdealMember} &
+\cross{CONTFRAC}{exquo} \\
+\cross{CONTFRAC}{extendedEuclidean} &
+\cross{CONTFRAC}{factor} &
+\cross{CONTFRAC}{gcd} \\
+\cross{CONTFRAC}{gcdPolynomial} &
+\cross{CONTFRAC}{hash} &
+\cross{CONTFRAC}{inv} \\
+\cross{CONTFRAC}{latex} &
+\cross{CONTFRAC}{lcm} &
+\cross{CONTFRAC}{multiEuclidean} \\
+\cross{CONTFRAC}{numerators} &
+\cross{CONTFRAC}{one?} &
+\cross{CONTFRAC}{partialDenominators} \\
+\cross{CONTFRAC}{partialNumerators} &
+\cross{CONTFRAC}{partialQuotients} &
+\cross{CONTFRAC}{prime?} \\
+\cross{CONTFRAC}{principalIdeal} &
+\cross{CONTFRAC}{recip} &
+\cross{CONTFRAC}{reducedContinuedFraction} \\
+\cross{CONTFRAC}{reducedForm} &
+\cross{CONTFRAC}{sample} &
+\cross{CONTFRAC}{sizeLess?} \\
+\cross{CONTFRAC}{squareFree} &
+\cross{CONTFRAC}{squareFreePart} &
+\cross{CONTFRAC}{subtractIfCan} \\
+\cross{CONTFRAC}{unit?} &
+\cross{CONTFRAC}{unitCanonical} &
+\cross{CONTFRAC}{unitNormal} \\
+\cross{CONTFRAC}{wholePart} &
+\cross{CONTFRAC}{zero?} &
+\cross{CONTFRAC}{?*?} \\
+\cross{CONTFRAC}{?**?} &
+\cross{CONTFRAC}{?+?} &
+\cross{CONTFRAC}{?-?} \\
+\cross{CONTFRAC}{-?} &
+\cross{CONTFRAC}{?/?} &
+\cross{CONTFRAC}{?=?} \\
+\cross{CONTFRAC}{?\^{}?} &
+\cross{CONTFRAC}{?\~{}=?} &
+\cross{CONTFRAC}{?quo?} \\
+\cross{CONTFRAC}{?rem?} &&
+\end{tabular}
+
 <<domain CONTFRAC ContinuedFraction>>=
 )abbrev domain CONTFRAC ContinuedFraction
 ++ Author: Stephen M. Watt
@@ -14522,6 +15573,21 @@ ContinuedFraction(R): Exports == Implementation where
 \pageto{DataList}{DLIST}
 \pageto{IndexCard}{ICARD}
 \pageto{QueryEquation}{QEQUAT}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{DBASE}{coerce} &
+\cross{DBASE}{display} &
+\cross{DBASE}{fullDisplay} &
+\cross{DBASE}{hash} &
+\cross{DBASE}{latex} \\
+\cross{DBASE}{?+?} &
+\cross{DBASE}{?-?} &
+\cross{DBASE}{?=?} &
+\cross{DBASE}{?\~{}=?} &
+\cross{DBASE}{?.?} 
+\end{tabular}
+
 <<domain DBASE Database>>=
 )abbrev domain DBASE Database
 ++ This domain implements a simple view of a database whose fields are 
@@ -14585,6 +15651,115 @@ Database(S): Exports == Implementation where
 \pageto{IndexCard}{ICARD}
 \pageto{Database}{DBASE}
 \pageto{QueryEquation}{QEQUAT}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{DLIST}{any?} &
+\cross{DLIST}{child?} &
+\cross{DLIST}{children} &
+\cross{DLIST}{coerce} &
+\cross{DLIST}{concat} \\
+\cross{DLIST}{concat!} &
+\cross{DLIST}{construct} &
+\cross{DLIST}{convert} &
+\cross{DLIST}{copy} &
+\cross{DLIST}{copyInto!} \\
+\cross{DLIST}{count} &
+\cross{DLIST}{cycleEntry} &
+\cross{DLIST}{cycleLength} &
+\cross{DLIST}{cycleSplit!} &
+\cross{DLIST}{cycleTail} \\
+\cross{DLIST}{cyclic?} &
+\cross{DLIST}{datalist} &
+\cross{DLIST}{delete} &
+\cross{DLIST}{delete!} &
+\cross{DLIST}{distance} \\
+\cross{DLIST}{elt} &
+\cross{DLIST}{empty} &
+\cross{DLIST}{empty?} &
+\cross{DLIST}{entries} &
+\cross{DLIST}{entry?} \\
+\cross{DLIST}{eq?} &
+\cross{DLIST}{eval} &
+\cross{DLIST}{every?} &
+\cross{DLIST}{explicitlyFinite?} &
+\cross{DLIST}{fill!} \\
+\cross{DLIST}{find} &
+\cross{DLIST}{first} &
+\cross{DLIST}{hash} &
+\cross{DLIST}{index?} &
+\cross{DLIST}{indices} \\
+\cross{DLIST}{insert} &
+\cross{DLIST}{insert!} &
+\cross{DLIST}{last} &
+\cross{DLIST}{latex} &
+\cross{DLIST}{leaf?} \\
+\cross{DLIST}{leaves} &
+\cross{DLIST}{less?} &
+\cross{DLIST}{list} &
+\cross{DLIST}{map} &
+\cross{DLIST}{map!} \\
+\cross{DLIST}{max} &
+\cross{DLIST}{maxIndex} &
+\cross{DLIST}{member?} &
+\cross{DLIST}{members} &
+\cross{DLIST}{merge} \\
+\cross{DLIST}{merge!} &
+\cross{DLIST}{min} &
+\cross{DLIST}{minIndex} &
+\cross{DLIST}{more?} &
+\cross{DLIST}{new} \\
+\cross{DLIST}{node?} &
+\cross{DLIST}{nodes} &
+\cross{DLIST}{parts} &
+\cross{DLIST}{position} &
+\cross{DLIST}{possiblyInfinite?} \\
+\cross{DLIST}{qelt} &
+\cross{DLIST}{qsetelt!} &
+\cross{DLIST}{reduce} &
+\cross{DLIST}{remove} &
+\cross{DLIST}{remove!} \\
+\cross{DLIST}{removeDuplicates} &
+\cross{DLIST}{removeDuplicates!} &
+\cross{DLIST}{rest} &
+\cross{DLIST}{reverse} &
+\cross{DLIST}{reverse!} \\
+\cross{DLIST}{sample} &
+\cross{DLIST}{second} &
+\cross{DLIST}{select} &
+\cross{DLIST}{select!} &
+\cross{DLIST}{setchildren!} \\
+\cross{DLIST}{setelt} &
+\cross{DLIST}{setfirst!} &
+\cross{DLIST}{setlast!} &
+\cross{DLIST}{setrest!} &
+\cross{DLIST}{setvalue!} \\
+\cross{DLIST}{size?} &
+\cross{DLIST}{sort} &
+\cross{DLIST}{sort!} &
+\cross{DLIST}{sorted?} &
+\cross{DLIST}{split!} \\
+\cross{DLIST}{swap!} &
+\cross{DLIST}{tail} &
+\cross{DLIST}{third} &
+\cross{DLIST}{value} &
+\cross{DLIST}{\#{}?} \\
+\cross{DLIST}{?$<$?} &
+\cross{DLIST}{?$<=$?} &
+\cross{DLIST}{?=?} &
+\cross{DLIST}{?$>$?} &
+\cross{DLIST}{?$>=$?} \\
+\cross{DLIST}{?.?} &
+\cross{DLIST}{?\~{}=?} &
+\cross{DLIST}{?.count} &
+\cross{DLIST}{?.sort} &
+\cross{DLIST}{?.unique} \\
+\cross{DLIST}{?.last} &
+\cross{DLIST}{?.rest} &
+\cross{DLIST}{?.first} &
+\cross{DLIST}{?.value} &
+\end{tabular}
+
 <<domain DLIST DataList>>=
 )abbrev domain DLIST DataList
 ++ This domain provides some nice functions on lists
@@ -14778,6 +15953,91 @@ o )show DecimalExpansion
 \pageto{RadixExpansion}{RADIX}
 \pageto{BinaryExpansion}{BINARY}
 \pageto{HexadecimalExpansion}{HEXADEC}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{DECIMAL}{0} &
+\cross{DECIMAL}{1} &
+\cross{DECIMAL}{abs} \\
+\cross{DECIMAL}{associates?} &
+\cross{DECIMAL}{ceiling} &
+\cross{DECIMAL}{characteristic} \\
+\cross{DECIMAL}{charthRoot} &
+\cross{DECIMAL}{coerce} &
+\cross{DECIMAL}{conditionP} \\
+\cross{DECIMAL}{convert} &
+\cross{DECIMAL}{D} &
+\cross{DECIMAL}{decimal} \\
+\cross{DECIMAL}{denom} &
+\cross{DECIMAL}{denominator} &
+\cross{DECIMAL}{differentiate} \\
+\cross{DECIMAL}{divide} &
+\cross{DECIMAL}{euclideanSize} &
+\cross{DECIMAL}{eval} \\
+\cross{DECIMAL}{expressIdealMember} &
+\cross{DECIMAL}{exquo} &
+\cross{DECIMAL}{extendedEuclidean} \\
+\cross{DECIMAL}{factor} &
+\cross{DECIMAL}{factorPolynomial} &
+\cross{DECIMAL}{factorSquareFreePolynomial} \\
+\cross{DECIMAL}{floor} &
+\cross{DECIMAL}{fractionPart} &
+\cross{DECIMAL}{gcd} \\
+\cross{DECIMAL}{gcdPolynomial} &
+\cross{DECIMAL}{hash} &
+\cross{DECIMAL}{init} \\
+\cross{DECIMAL}{inv} &
+\cross{DECIMAL}{latex} &
+\cross{DECIMAL}{lcm} \\
+\cross{DECIMAL}{map} &
+\cross{DECIMAL}{max} &
+\cross{DECIMAL}{min} \\
+\cross{DECIMAL}{multiEuclidean} &
+\cross{DECIMAL}{negative?} &
+\cross{DECIMAL}{nextItem} \\
+\cross{DECIMAL}{numer} &
+\cross{DECIMAL}{numerator} &
+\cross{DECIMAL}{one?} \\
+\cross{DECIMAL}{patternMatch} &
+\cross{DECIMAL}{positive?} &
+\cross{DECIMAL}{prime?} \\
+\cross{DECIMAL}{principalIdeal} &
+\cross{DECIMAL}{random} &
+\cross{DECIMAL}{recip} \\
+\cross{DECIMAL}{reducedSystem} &
+\cross{DECIMAL}{retract} &
+\cross{DECIMAL}{retractIfCan} \\
+\cross{DECIMAL}{sample} &
+\cross{DECIMAL}{sign} &
+\cross{DECIMAL}{sizeLess?} \\
+\cross{DECIMAL}{solveLinearPolynomialEquation} &
+\cross{DECIMAL}{squareFree} &
+\cross{DECIMAL}{squareFreePart} \\
+\cross{DECIMAL}{squareFreePolynomial} &
+\cross{DECIMAL}{subtractIfCan} &
+\cross{DECIMAL}{unit?} \\
+\cross{DECIMAL}{unitCanonical} &
+\cross{DECIMAL}{unitNormal} &
+\cross{DECIMAL}{wholePart} \\
+\cross{DECIMAL}{zero?} &
+\cross{DECIMAL}{?*?} &
+\cross{DECIMAL}{?**?} \\
+\cross{DECIMAL}{?+?} &
+\cross{DECIMAL}{?-?} &
+\cross{DECIMAL}{-?} \\
+\cross{DECIMAL}{?/?} &
+\cross{DECIMAL}{?=?} &
+\cross{DECIMAL}{?\^{}?} \\
+\cross{DECIMAL}{?\~{}=?} &
+\cross{DECIMAL}{?$<$?} &
+\cross{DECIMAL}{?$<=$?} \\
+\cross{DECIMAL}{?$>$?} &
+\cross{DECIMAL}{?$>=$?} &
+\cross{DECIMAL}{?.?} \\
+\cross{DECIMAL}{?quo?} &
+\cross{DECIMAL}{?rem?} 
+\end{tabular}
+
 <<domain DECIMAL DecimalExpansion>>=
 )abbrev domain DECIMAL DecimalExpansion
 ++ Author: Stephen M. Watt
@@ -16407,6 +17667,87 @@ description is in terms of a vector and angle of rotation.
 
 \pagehead{DenavitHartenbergMatrix}{DHMATRIX}
 \pagepic{ps/v103denavithartenbergmatrix.ps}{DHMATRIX}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{DHMATRIX}{antisymmetric?} &
+\cross{DHMATRIX}{any?} &
+\cross{DHMATRIX}{coerce} &
+\cross{DHMATRIX}{column} &
+\cross{DHMATRIX}{copy} \\
+\cross{DHMATRIX}{count} &
+\cross{DHMATRIX}{determinant} &
+\cross{DHMATRIX}{diagonal?} &
+\cross{DHMATRIX}{diagonalMatrix} &
+\cross{DHMATRIX}{elt} \\
+\cross{DHMATRIX}{empty} &
+\cross{DHMATRIX}{empty?} &
+\cross{DHMATRIX}{eq?} &
+\cross{DHMATRIX}{eval} &
+\cross{DHMATRIX}{every?} \\
+\cross{DHMATRIX}{exquo} &
+\cross{DHMATRIX}{fill!} &
+\cross{DHMATRIX}{hash} &
+\cross{DHMATRIX}{horizConcat} &
+\cross{DHMATRIX}{identity} \\
+\cross{DHMATRIX}{inverse} &
+\cross{DHMATRIX}{latex} &
+\cross{DHMATRIX}{less?} &
+\cross{DHMATRIX}{listOfLists} &
+\cross{DHMATRIX}{map} \\
+\cross{DHMATRIX}{map!} &
+\cross{DHMATRIX}{matrix} &
+\cross{DHMATRIX}{maxColIndex} &
+\cross{DHMATRIX}{maxRowIndex} &
+\cross{DHMATRIX}{member?} \\
+\cross{DHMATRIX}{members} &
+\cross{DHMATRIX}{minColIndex} &
+\cross{DHMATRIX}{minordet} &
+\cross{DHMATRIX}{minRowIndex} &
+\cross{DHMATRIX}{more?} \\
+\cross{DHMATRIX}{ncols} &
+\cross{DHMATRIX}{new} &
+\cross{DHMATRIX}{nrows} &
+\cross{DHMATRIX}{nullSpace} &
+\cross{DHMATRIX}{nullity} \\
+\cross{DHMATRIX}{parts} &
+\cross{DHMATRIX}{qelt} &
+\cross{DHMATRIX}{qsetelt!} &
+\cross{DHMATRIX}{rank} &
+\cross{DHMATRIX}{rotatex} \\
+\cross{DHMATRIX}{rotatey} &
+\cross{DHMATRIX}{rotatez} &
+\cross{DHMATRIX}{row} &
+\cross{DHMATRIX}{rowEchelon} &
+\cross{DHMATRIX}{sample} \\
+\cross{DHMATRIX}{scalarMatrix} &
+\cross{DHMATRIX}{scale} &
+\cross{DHMATRIX}{setColumn!} &
+\cross{DHMATRIX}{setRow!} &
+\cross{DHMATRIX}{setelt} \\
+\cross{DHMATRIX}{setsubMatrix!} &
+\cross{DHMATRIX}{size?} &
+\cross{DHMATRIX}{square?} &
+\cross{DHMATRIX}{squareTop} &
+\cross{DHMATRIX}{subMatrix} \\
+\cross{DHMATRIX}{swapColumns!} &
+\cross{DHMATRIX}{swapRows!} &
+\cross{DHMATRIX}{symmetric?} &
+\cross{DHMATRIX}{translate} &
+\cross{DHMATRIX}{transpose} \\
+\cross{DHMATRIX}{vertConcat} &
+\cross{DHMATRIX}{zero} &
+\cross{DHMATRIX}{\#{}?} &
+\cross{DHMATRIX}{?**?} &
+\cross{DHMATRIX}{?/?} \\
+\cross{DHMATRIX}{?=?} &
+\cross{DHMATRIX}{?\~{}=?} &
+\cross{DHMATRIX}{?*?} &
+\cross{DHMATRIX}{?+?} &
+\cross{DHMATRIX}{-?} \\
+\cross{DHMATRIX}{?-?} &&&&
+\end{tabular}
+
 <<domain DHMATRIX DenavitHartenbergMatrix>>=
 
 ++ 4x4 Matrices for coordinate transformations
@@ -16513,6 +17854,57 @@ DenavitHartenbergMatrix(R): Exports == Implementation where
 \pageto{ArrayStack}{ASTACK}
 \pageto{Queue}{QUEUE}
 \pageto{Heap}{HEAP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{DEQUEUE}{any?} &
+\cross{DEQUEUE}{back} &
+\cross{DEQUEUE}{bag} &
+\cross{DEQUEUE}{bottom!} &
+\cross{DEQUEUE}{coerce} \\
+\cross{DEQUEUE}{copy} &
+\cross{DEQUEUE}{count} &
+\cross{DEQUEUE}{depth} &
+\cross{DEQUEUE}{dequeue} &
+\cross{DEQUEUE}{dequeue!} \\
+\cross{DEQUEUE}{empty} &
+\cross{DEQUEUE}{empty?} &
+\cross{DEQUEUE}{enqueue!} &
+\cross{DEQUEUE}{eq?} &
+\cross{DEQUEUE}{eval} \\
+\cross{DEQUEUE}{every?} &
+\cross{DEQUEUE}{extract!} &
+\cross{DEQUEUE}{extractBottom!} &
+\cross{DEQUEUE}{extractTop!} &
+\cross{DEQUEUE}{front} \\
+\cross{DEQUEUE}{height} &
+\cross{DEQUEUE}{hash} &
+\cross{DEQUEUE}{insert!} &
+\cross{DEQUEUE}{insertBottom!} &
+\cross{DEQUEUE}{insertTop!} \\
+\cross{DEQUEUE}{inspect} &
+\cross{DEQUEUE}{latex} &
+\cross{DEQUEUE}{length} &
+\cross{DEQUEUE}{less?} &
+\cross{DEQUEUE}{map} \\
+\cross{DEQUEUE}{map!} &
+\cross{DEQUEUE}{member?} &
+\cross{DEQUEUE}{members} &
+\cross{DEQUEUE}{more?} &
+\cross{DEQUEUE}{parts} \\
+\cross{DEQUEUE}{pop!} &
+\cross{DEQUEUE}{push!} &
+\cross{DEQUEUE}{reverse!} &
+\cross{DEQUEUE}{rotate!} &
+\cross{DEQUEUE}{sample} \\
+\cross{DEQUEUE}{size?} &
+\cross{DEQUEUE}{top} &
+\cross{DEQUEUE}{top!} &
+\cross{DEQUEUE}{\#?} &
+\cross{DEQUEUE}{?=?} \\
+\cross{DEQUEUE}{?\~{}=?} &&&&
+\end{tabular}
+
 <<domain DEQUEUE Dequeue>>=
 )abbrev domain DEQUEUE Dequeue
 ++ Author: Michael Monagan and Stephen Watt
@@ -17161,6 +18553,43 @@ o )show DeRhamComplex
 {\bf See}\\
 \pageto{ExtAlgBasis}{EAB}
 \pageto{AntiSymm}{ANTISYM}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{DERHAM}{0} &
+\cross{DERHAM}{1} &
+\cross{DERHAM}{characteristic} &
+\cross{DERHAM}{coefficient} \\
+\cross{DERHAM}{coerce} &
+\cross{DERHAM}{degree} &
+\cross{DERHAM}{exteriorDifferential} &
+\cross{DERHAM}{generator} \\
+\cross{DERHAM}{hash} &
+\cross{DERHAM}{homogeneous?} &
+\cross{DERHAM}{latex} &
+\cross{DERHAM}{leadingBasisTerm} \\
+\cross{DERHAM}{leadingCoefficient} &
+\cross{DERHAM}{map} &
+\cross{DERHAM}{one?} &
+\cross{DERHAM}{recip} \\
+\cross{DERHAM}{reductum} &
+\cross{DERHAM}{retract} &
+\cross{DERHAM}{retractable?} &
+\cross{DERHAM}{retractIfCan} \\
+\cross{DERHAM}{sample} &
+\cross{DERHAM}{subtractIfCan} &
+\cross{DERHAM}{totalDifferential} &
+\cross{DERHAM}{zero?} \\
+\cross{DERHAM}{?\~{}=?} &
+\cross{DERHAM}{?*?} &
+\cross{DERHAM}{?**?} &
+\cross{DERHAM}{?\^{}?} \\
+\cross{DERHAM}{?+?} &
+\cross{DERHAM}{?-?} &
+\cross{DERHAM}{-?} &
+\cross{DERHAM}{?=?} 
+\end{tabular}
+
 <<domain DERHAM DeRhamComplex>>=
 )abbrev domain DERHAM DeRhamComplex
 ++ Author: Larry A. Lambe
@@ -17289,6 +18718,102 @@ DeRhamComplex(CoefRing,listIndVar:List Symbol): Export == Implement where
 \pageto{SequentialDifferentialVariable}{SDVAR}
 \pageto{OrderlyDifferentialPolynomial}{ODPOL}
 \pageto{SequentialDifferentialPolynomial}{SDPOL}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{DSMP}{0} &
+\cross{DSMP}{1} &
+\cross{DSMP}{associates?} \\
+\cross{DSMP}{binomThmExpt} &
+\cross{DSMP}{characteristic} &
+\cross{DSMP}{charthRoot} \\
+\cross{DSMP}{coefficient} &
+\cross{DSMP}{coefficients} &
+\cross{DSMP}{coerce} \\
+\cross{DSMP}{conditionP} &
+\cross{DSMP}{content} &
+\cross{DSMP}{convert} \\
+\cross{DSMP}{D} &
+\cross{DSMP}{degree} &
+\cross{DSMP}{differentialVariables} \\
+\cross{DSMP}{differentiate} &
+\cross{DSMP}{discriminant} &
+\cross{DSMP}{eval} \\
+\cross{DSMP}{exquo} &
+\cross{DSMP}{factor} &
+\cross{DSMP}{factorPolynomial} \\
+\cross{DSMP}{factorSquareFreePolynomial} &
+\cross{DSMP}{gcd} &
+\cross{DSMP}{gcdPolynomial} \\
+\cross{DSMP}{ground} &
+\cross{DSMP}{ground?} &
+\cross{DSMP}{hash} \\
+\cross{DSMP}{initial} &
+\cross{DSMP}{isExpt} &
+\cross{DSMP}{isobaric?} \\
+\cross{DSMP}{isPlus} &
+\cross{DSMP}{isTimes} &
+\cross{DSMP}{latex} \\
+\cross{DSMP}{lcm} &
+\cross{DSMP}{leader} &
+\cross{DSMP}{leadingCoefficient} \\
+\cross{DSMP}{leadingMonomial} &
+\cross{DSMP}{makeVariable} &
+\cross{DSMP}{map} \\
+\cross{DSMP}{mapExponents} &
+\cross{DSMP}{max} &
+\cross{DSMP}{min} \\
+\cross{DSMP}{minimumDegree} &
+\cross{DSMP}{monicDivide} &
+\cross{DSMP}{monomial} \\
+\cross{DSMP}{monomials} &
+\cross{DSMP}{monomial?} &
+\cross{DSMP}{multivariate} \\
+\cross{DSMP}{numberOfMonomials} &
+\cross{DSMP}{one?} &
+\cross{DSMP}{order} \\
+\cross{DSMP}{patternMatch} &
+\cross{DSMP}{pomopo!} &
+\cross{DSMP}{prime?} \\
+\cross{DSMP}{primitiveMonomials} &
+\cross{DSMP}{primitivePart} &
+\cross{DSMP}{recip} \\
+\cross{DSMP}{reducedSystem} &
+\cross{DSMP}{reductum} &
+\cross{DSMP}{resultant} \\
+\cross{DSMP}{retract} &
+\cross{DSMP}{retractIfCan} &
+\cross{DSMP}{sample} \\
+\cross{DSMP}{separant} &
+\cross{DSMP}{solveLinearPolynomialEquation} &
+\cross{DSMP}{squareFree} \\
+\cross{DSMP}{squareFreePart} &
+\cross{DSMP}{squareFreePolynomial} &
+\cross{DSMP}{subtractIfCan} \\
+\cross{DSMP}{totalDegree} &
+\cross{DSMP}{unit?} &
+\cross{DSMP}{unitCanonical} \\
+\cross{DSMP}{unitNormal} &
+\cross{DSMP}{univariate} &
+\cross{DSMP}{variables} \\
+\cross{DSMP}{weight} &
+\cross{DSMP}{weights} &
+\cross{DSMP}{zero?} \\
+\cross{DSMP}{?*?} &
+\cross{DSMP}{?**?} &
+\cross{DSMP}{?+?} \\
+\cross{DSMP}{?-?} &
+\cross{DSMP}{-?} &
+\cross{DSMP}{?=?} \\
+\cross{DSMP}{?\^{}?} &
+\cross{DSMP}{?\~{}=?} &
+\cross{DSMP}{?/?} \\
+\cross{DSMP}{?$<$?} &
+\cross{DSMP}{?$<=$?} &
+\cross{DSMP}{?$>$?} \\
+\cross{DSMP}{?$>=$?} &&
+\end{tabular}
+
 <<domain DSMP DifferentialSparseMultivariatePolynomial>>=
 )abbrev domain DSMP DifferentialSparseMultivariatePolynomial
 ++ Author:  William Sit
@@ -17345,6 +18870,86 @@ DifferentialSparseMultivariatePolynomial(R, S, V):
 \section{domain DIRPROD DirectProduct}
 \pagehead{DirectProduct}{DIRPROD}
 \pagepic{ps/v103directproduct.ps}{DIRPROD}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{DIRPROD}{0} &
+\cross{DIRPROD}{1} &
+\cross{DIRPROD}{abs} &
+\cross{DIRPROD}{any?} &
+\cross{DIRPROD}{characteristic} \\
+\cross{DIRPROD}{coerce} &
+\cross{DIRPROD}{copy} &
+\cross{DIRPROD}{count} &
+\cross{DIRPROD}{D} &
+\cross{DIRPROD}{differentiate} \\
+\cross{DIRPROD}{dimension} &
+\cross{DIRPROD}{directProduct} &
+\cross{DIRPROD}{dot} &
+\cross{DIRPROD}{elt} &
+\cross{DIRPROD}{empty} \\
+\cross{DIRPROD}{empty?} &
+\cross{DIRPROD}{entries} &
+\cross{DIRPROD}{entry?} &
+\cross{DIRPROD}{eq?} &
+\cross{DIRPROD}{eval} \\
+\cross{DIRPROD}{every?} &
+\cross{DIRPROD}{fill!} &
+\cross{DIRPROD}{first} &
+\cross{DIRPROD}{hash} &
+\cross{DIRPROD}{index} \\
+\cross{DIRPROD}{index?} &
+\cross{DIRPROD}{indices} &
+\cross{DIRPROD}{latex} &
+\cross{DIRPROD}{less?} &
+\cross{DIRPROD}{lookup} \\
+\cross{DIRPROD}{map} &
+\cross{DIRPROD}{map!} &
+\cross{DIRPROD}{max} &
+\cross{DIRPROD}{maxIndex} &
+\cross{DIRPROD}{member?} \\
+\cross{DIRPROD}{members} &
+\cross{DIRPROD}{min} &
+\cross{DIRPROD}{minIndex} &
+\cross{DIRPROD}{more?} &
+\cross{DIRPROD}{negative?} \\
+\cross{DIRPROD}{one?} &
+\cross{DIRPROD}{parts} &
+\cross{DIRPROD}{positive?} &
+\cross{DIRPROD}{qelt} &
+\cross{DIRPROD}{qsetelt!} \\
+\cross{DIRPROD}{random} &
+\cross{DIRPROD}{recip} &
+\cross{DIRPROD}{reducedSystem} &
+\cross{DIRPROD}{retract} &
+\cross{DIRPROD}{retractIfCan} \\
+\cross{DIRPROD}{sample} &
+\cross{DIRPROD}{setelt} &
+\cross{DIRPROD}{sign} &
+\cross{DIRPROD}{size} &
+\cross{DIRPROD}{size?} \\
+\cross{DIRPROD}{subtractIfCan} &
+\cross{DIRPROD}{sup} &
+\cross{DIRPROD}{swap!} &
+\cross{DIRPROD}{unitVector} &
+\cross{DIRPROD}{zero?} \\
+\cross{DIRPROD}{\#{}?} &
+\cross{DIRPROD}{?*?} &
+\cross{DIRPROD}{?**?} &
+\cross{DIRPROD}{?+?} &
+\cross{DIRPROD}{?-?} \\
+\cross{DIRPROD}{?/?} &
+\cross{DIRPROD}{?$<$?} &
+\cross{DIRPROD}{?$<=$?} &
+\cross{DIRPROD}{?=?} &
+\cross{DIRPROD}{?$>$?} \\
+\cross{DIRPROD}{?$>=$?} &
+\cross{DIRPROD}{?\^{}?} &
+\cross{DIRPROD}{?\~{}=?} &
+\cross{DIRPROD}{-?} &
+\cross{DIRPROD}{?.?} 
+\end{tabular}
+
 <<domain DIRPROD DirectProduct>>=
 )abbrev domain DIRPROD DirectProduct
 ++ Author:
@@ -17460,6 +19065,87 @@ DirectProduct(dim:NonNegativeInteger, R:Type):
 \pageto{OppositeMonogenicLinearOperator}{OMLO}
 \pageto{OrdinaryDifferentialRing}{ODR}
 \pageto{DirectProductModule}{DPMO}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{DPMM}{0} &
+\cross{DPMM}{1} &
+\cross{DPMM}{coerce} &
+\cross{DPMM}{copy} &
+\cross{DPMM}{directProduct} \\
+\cross{DPMM}{elt} &
+\cross{DPMM}{empty} &
+\cross{DPMM}{empty?} &
+\cross{DPMM}{entries} &
+\cross{DPMM}{eq?} \\
+\cross{DPMM}{hash} &
+\cross{DPMM}{index?} &
+\cross{DPMM}{indices} &
+\cross{DPMM}{latex} &
+\cross{DPMM}{map} \\
+\cross{DPMM}{qelt} &
+\cross{DPMM}{sample} &
+\cross{DPMM}{zero?} &
+\cross{DPMM}{D} &
+\cross{DPMM}{abs} \\
+\cross{DPMM}{any?} &
+\cross{DPMM}{characteristic} &
+\cross{DPMM}{coerce} &
+\cross{DPMM}{count} &
+\cross{DPMM}{differentiate} \\
+\cross{DPMM}{dimension} &
+\cross{DPMM}{dot} &
+\cross{DPMM}{entry?} &
+\cross{DPMM}{eval} &
+\cross{DPMM}{every?} \\
+\cross{DPMM}{fill!} &
+\cross{DPMM}{first} &
+\cross{DPMM}{index} &
+\cross{DPMM}{less?} &
+\cross{DPMM}{lookup} \\
+\cross{DPMM}{map!} &
+\cross{DPMM}{max} &
+\cross{DPMM}{maxIndex} &
+\cross{DPMM}{member?} &
+\cross{DPMM}{members} \\
+\cross{DPMM}{min} &
+\cross{DPMM}{minIndex} &
+\cross{DPMM}{more?} &
+\cross{DPMM}{negative?} &
+\cross{DPMM}{one?} \\
+\cross{DPMM}{parts} &
+\cross{DPMM}{positive?} &
+\cross{DPMM}{qsetelt!} &
+\cross{DPMM}{random} &
+\cross{DPMM}{recip} \\
+\cross{DPMM}{reducedSystem} &
+\cross{DPMM}{retract} &
+\cross{DPMM}{retractIfCan} &
+\cross{DPMM}{setelt} &
+\cross{DPMM}{sign} \\
+\cross{DPMM}{size} &
+\cross{DPMM}{size?} &
+\cross{DPMM}{subtractIfCan} &
+\cross{DPMM}{sup} &
+\cross{DPMM}{swap!} \\
+\cross{DPMM}{unitVector} &
+\cross{DPMM}{\#{}?} &
+\cross{DPMM}{?*?} &
+\cross{DPMM}{?**?} &
+\cross{DPMM}{?/?} \\
+\cross{DPMM}{?$<$?} &
+\cross{DPMM}{?$<=$?} &
+\cross{DPMM}{?$>$?} &
+\cross{DPMM}{?$>=$?} &
+\cross{DPMM}{?\^{}?} \\
+\cross{DPMM}{?\^{}?} &
+\cross{DPMM}{-?} &
+\cross{DPMM}{?-?} &
+\cross{DPMM}{?=?} &
+\cross{DPMM}{?.?} \\
+\cross{DPMM}{?\~{}=?} &&&&
+\end{tabular}
+
 <<domain DPMM DirectProductMatrixModule>>=
 )abbrev domain DPMM DirectProductMatrixModule
 ++ Author:  Stephen M. Watt
@@ -17505,6 +19191,86 @@ DirectProductMatrixModule(n, R, M, S): DPcategory == DPcapsule where
 \pageto{OppositeMonogenicLinearOperator}{OMLO}
 \pageto{OrdinaryDifferentialRing}{ODR}
 \pageto{DirectProductMatrixModule}{DPMM}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{DPMO}{0} &
+\cross{DPMO}{1} &
+\cross{DPMO}{abs} &
+\cross{DPMO}{any?} &
+\cross{DPMO}{characteristic} \\
+\cross{DPMO}{coerce} &
+\cross{DPMO}{copy} &
+\cross{DPMO}{count} &
+\cross{DPMO}{D} &
+\cross{DPMO}{differentiate} \\
+\cross{DPMO}{dimension} &
+\cross{DPMO}{directProduct} &
+\cross{DPMO}{dot} &
+\cross{DPMO}{elt} &
+\cross{DPMO}{empty} \\
+\cross{DPMO}{empty?} &
+\cross{DPMO}{entries} &
+\cross{DPMO}{entry?} &
+\cross{DPMO}{eval} &
+\cross{DPMO}{every?} \\
+\cross{DPMO}{eq?} &
+\cross{DPMO}{fill!} &
+\cross{DPMO}{first} &
+\cross{DPMO}{hash} &
+\cross{DPMO}{index} \\
+\cross{DPMO}{index?} &
+\cross{DPMO}{indices} &
+\cross{DPMO}{latex} &
+\cross{DPMO}{less?} &
+\cross{DPMO}{lookup} \\
+\cross{DPMO}{map} &
+\cross{DPMO}{map!} &
+\cross{DPMO}{max} &
+\cross{DPMO}{maxIndex} &
+\cross{DPMO}{member?} \\
+\cross{DPMO}{members} &
+\cross{DPMO}{min} &
+\cross{DPMO}{minIndex} &
+\cross{DPMO}{more?} &
+\cross{DPMO}{negative?} \\
+\cross{DPMO}{one?} &
+\cross{DPMO}{parts} &
+\cross{DPMO}{positive?} &
+\cross{DPMO}{qelt} &
+\cross{DPMO}{qsetelt!} \\
+\cross{DPMO}{random} &
+\cross{DPMO}{recip} &
+\cross{DPMO}{reducedSystem} &
+\cross{DPMO}{retract} &
+\cross{DPMO}{retractIfCan} \\
+\cross{DPMO}{sample} &
+\cross{DPMO}{setelt} &
+\cross{DPMO}{sign} &
+\cross{DPMO}{size} &
+\cross{DPMO}{size?} \\
+\cross{DPMO}{subtractIfCan} &
+\cross{DPMO}{sup} &
+\cross{DPMO}{swap!} &
+\cross{DPMO}{unitVector} &
+\cross{DPMO}{zero?} \\
+\cross{DPMO}{\#{}?} &
+\cross{DPMO}{?*?} &
+\cross{DPMO}{?**?} &
+\cross{DPMO}{?/?} &
+\cross{DPMO}{?$<$?} \\
+\cross{DPMO}{?$<=$?} &
+\cross{DPMO}{?$>$?} &
+\cross{DPMO}{?$>=$?} &
+\cross{DPMO}{?\^{}?} &
+\cross{DPMO}{?+?} \\
+\cross{DPMO}{-?} &
+\cross{DPMO}{?-?} &
+\cross{DPMO}{?=?} &
+\cross{DPMO}{?.?} &
+\cross{DPMO}{?\~{}=?} 
+\end{tabular}
+
 <<domain DPMO DirectProductModule>>=
 )abbrev domain DPMO DirectProductModule
 ++ Author:  Stephen M. Watt
@@ -17757,6 +19523,95 @@ o )show DistributedMultivariatePolynomial
 {\bf See}\\
 \pageto{GeneralDistributedMultivariatePolynomial}{GDMP}
 \pageto{HomogeneousDistributedMultivariatePolynomial}{HDMP}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{DMP}{0} &
+\cross{DMP}{1} &
+\cross{DMP}{associates?} \\
+\cross{DMP}{binomThmExpt} &
+\cross{DMP}{characteristic} &
+\cross{DMP}{charthRoot} \\
+\cross{DMP}{coefficient} &
+\cross{DMP}{coefficients} &
+\cross{DMP}{coerce} \\
+\cross{DMP}{conditionP} &
+\cross{DMP}{convert} &
+\cross{DMP}{D} \\
+\cross{DMP}{degree} &
+\cross{DMP}{differentiate} &
+\cross{DMP}{discriminant} \\
+\cross{DMP}{eval} &
+\cross{DMP}{exquo} &
+\cross{DMP}{factor} \\
+\cross{DMP}{factorPolynomial} &
+\cross{DMP}{factorSquareFreePolynomial} &
+\cross{DMP}{gcd} \\
+\cross{DMP}{gcdPolynomial} &
+\cross{DMP}{ground} &
+\cross{DMP}{ground?} \\
+\cross{DMP}{hash} &
+\cross{DMP}{isExpt} &
+\cross{DMP}{isPlus} \\
+\cross{DMP}{isTimes} &
+\cross{DMP}{latex} &
+\cross{DMP}{lcm} \\
+\cross{DMP}{leadingCoefficient} &
+\cross{DMP}{leadingMonomial} &
+\cross{DMP}{mainVariable} \\
+\cross{DMP}{map} &
+\cross{DMP}{mapExponents} &
+\cross{DMP}{max} \\
+\cross{DMP}{min} &
+\cross{DMP}{minimumDegree} &
+\cross{DMP}{monicDivide} \\
+\cross{DMP}{monomial} &
+\cross{DMP}{monomial?} &
+\cross{DMP}{monomials} \\
+\cross{DMP}{multivariate} &
+\cross{DMP}{numberOfMonomials} &
+\cross{DMP}{one?} \\
+\cross{DMP}{patternMatch} &
+\cross{DMP}{pomopo!} &
+\cross{DMP}{prime?} \\
+\cross{DMP}{primitiveMonomials} &
+\cross{DMP}{primitivePart} &
+\cross{DMP}{recip} \\
+\cross{DMP}{reducedSystem} &
+\cross{DMP}{reductum} &
+\cross{DMP}{resultant} \\
+\cross{DMP}{retract} &
+\cross{DMP}{retractIfCan} &
+\cross{DMP}{reorder} \\
+\cross{DMP}{retract} &
+\cross{DMP}{sample} &
+\cross{DMP}{solveLinearPolynomialEquation} \\
+\cross{DMP}{squareFree} &
+\cross{DMP}{squareFreePart} &
+\cross{DMP}{squareFreePolynomial} \\
+\cross{DMP}{subtractIfCan} &
+\cross{DMP}{totalDegree} &
+\cross{DMP}{unit?} \\
+\cross{DMP}{unitCanonical} &
+\cross{DMP}{unitNormal} &
+\cross{DMP}{univariate} \\
+\cross{DMP}{variables} &
+\cross{DMP}{zero?} &
+\cross{DMP}{?*?} \\
+\cross{DMP}{?**?} &
+\cross{DMP}{?+?} &
+\cross{DMP}{?-?} \\
+\cross{DMP}{-?} &
+\cross{DMP}{?=?} &
+\cross{DMP}{?\^{}?} \\
+\cross{DMP}{?\~{}=?} &
+\cross{DMP}{?/?} &
+\cross{DMP}{?$<$?} \\
+\cross{DMP}{?$<=$?} &
+\cross{DMP}{?$>$?} &
+\cross{DMP}{?$>=$?} 
+\end{tabular}
+
 <<domain DMP DistributedMultivariatePolynomial>>=
 )abbrev domain DMP DistributedMultivariatePolynomial
 ++ Author: Barry Trager
@@ -18121,6 +19976,131 @@ o )show DoubleFloat
 @
 \pagehead{DoubleFloat}{DFLOAT}
 \pagepic{ps/v103doublefloat.ps}{DFLOAT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{DFLOAT}{0} &
+\cross{DFLOAT}{1} &
+\cross{DFLOAT}{abs} &
+\cross{DFLOAT}{acos} \\
+\cross{DFLOAT}{acosh} &
+\cross{DFLOAT}{acot} &
+\cross{DFLOAT}{acoth} &
+\cross{DFLOAT}{acsc} \\
+\cross{DFLOAT}{acsch} &
+\cross{DFLOAT}{airyAi} &
+\cross{DFLOAT}{airyBi} &
+\cross{DFLOAT}{asec} \\
+\cross{DFLOAT}{asech} &
+\cross{DFLOAT}{asin} &
+\cross{DFLOAT}{asinh} &
+\cross{DFLOAT}{associates?} \\
+\cross{DFLOAT}{atan} &
+\cross{DFLOAT}{atanh} &
+\cross{DFLOAT}{base} &
+\cross{DFLOAT}{besselI} \\
+\cross{DFLOAT}{besselJ} &
+\cross{DFLOAT}{besselK} &
+\cross{DFLOAT}{besselY} &
+\cross{DFLOAT}{Beta} \\
+\cross{DFLOAT}{bits} &
+\cross{DFLOAT}{ceiling} &
+\cross{DFLOAT}{characteristic} &
+\cross{DFLOAT}{coerce} \\
+\cross{DFLOAT}{convert} &
+\cross{DFLOAT}{cos} &
+\cross{DFLOAT}{cosh} &
+\cross{DFLOAT}{cot} \\
+\cross{DFLOAT}{coth} &
+\cross{DFLOAT}{csc} &
+\cross{DFLOAT}{csch} &
+\cross{DFLOAT}{D} \\
+\cross{DFLOAT}{decreasePrecision} &
+\cross{DFLOAT}{differentiate} &
+\cross{DFLOAT}{digamma} &
+\cross{DFLOAT}{digits} \\
+\cross{DFLOAT}{divide} &
+\cross{DFLOAT}{doubleFloatFormat} &
+\cross{DFLOAT}{euclideanSize} &
+\cross{DFLOAT}{exp} \\
+\cross{DFLOAT}{expressIdealMember} &
+\cross{DFLOAT}{exp1} &
+\cross{DFLOAT}{exponent} &
+\cross{DFLOAT}{exquo} \\
+\cross{DFLOAT}{extendedEuclidean} &
+\cross{DFLOAT}{factor} &
+\cross{DFLOAT}{float} &
+\cross{DFLOAT}{floor} \\
+\cross{DFLOAT}{fractionPart} &
+\cross{DFLOAT}{Gamma} &
+\cross{DFLOAT}{gcd} &
+\cross{DFLOAT}{gcdPolynomial} \\
+\cross{DFLOAT}{hash} &
+\cross{DFLOAT}{increasePrecision} &
+\cross{DFLOAT}{inv} &
+\cross{DFLOAT}{latex} \\
+\cross{DFLOAT}{lcm} &
+\cross{DFLOAT}{log} &
+\cross{DFLOAT}{log10} &
+\cross{DFLOAT}{log2} \\
+\cross{DFLOAT}{mantissa} &
+\cross{DFLOAT}{max} &
+\cross{DFLOAT}{min} &
+\cross{DFLOAT}{multiEuclidean} \\
+\cross{DFLOAT}{negative?} &
+\cross{DFLOAT}{norm} &
+\cross{DFLOAT}{nthRoot} &
+\cross{DFLOAT}{OMwrite} \\
+\cross{DFLOAT}{one?} &
+\cross{DFLOAT}{order} &
+\cross{DFLOAT}{patternMatch} &
+\cross{DFLOAT}{pi} \\
+\cross{DFLOAT}{polygamma} &
+\cross{DFLOAT}{positive?} &
+\cross{DFLOAT}{precision} &
+\cross{DFLOAT}{prime?} \\
+\cross{DFLOAT}{principalIdeal} &
+\cross{DFLOAT}{rationalApproximation} &
+\cross{DFLOAT}{recip} &
+\cross{DFLOAT}{retract} \\
+\cross{DFLOAT}{retractIfCan} &
+\cross{DFLOAT}{round} &
+\cross{DFLOAT}{sample} &
+\cross{DFLOAT}{sec} \\
+\cross{DFLOAT}{sech} &
+\cross{DFLOAT}{sign} &
+\cross{DFLOAT}{sin} &
+\cross{DFLOAT}{sinh} \\
+\cross{DFLOAT}{sizeLess?} &
+\cross{DFLOAT}{sqrt} &
+\cross{DFLOAT}{squareFree} &
+\cross{DFLOAT}{squareFreePart} \\
+\cross{DFLOAT}{subtractIfCan} &
+\cross{DFLOAT}{tan} &
+\cross{DFLOAT}{tanh} &
+\cross{DFLOAT}{truncate} \\
+\cross{DFLOAT}{unit?} &
+\cross{DFLOAT}{unitCanonical} &
+\cross{DFLOAT}{unitNormal} &
+\cross{DFLOAT}{wholePart} \\
+\cross{DFLOAT}{zero?} &
+\cross{DFLOAT}{?*?} &
+\cross{DFLOAT}{?**?} &
+\cross{DFLOAT}{?+?} \\
+\cross{DFLOAT}{?-?} &
+\cross{DFLOAT}{-?} &
+\cross{DFLOAT}{?/?} &
+\cross{DFLOAT}{?$<$?} \\
+\cross{DFLOAT}{?$<=$?} &
+\cross{DFLOAT}{?=?} &
+\cross{DFLOAT}{?$>$?} &
+\cross{DFLOAT}{?$>=$?} \\
+\cross{DFLOAT}{?\^{}?} &
+\cross{DFLOAT}{?quo?} &
+\cross{DFLOAT}{?rem?} &
+\cross{DFLOAT}{?\~{}=?} 
+\end{tabular}
+
 <<domain DFLOAT DoubleFloat>>=
 )abbrev domain DFLOAT DoubleFloat
 ++ Author: Michael Monagan
@@ -18453,6 +20433,37 @@ DoubleFloat(): Join(FloatingPointSystem, DifferentialRing, OpenMath,
 \section{domain DROPT DrawOption}
 \pagehead{DrawOption}{DROPT}
 \pagepic{ps/v103drawoption.ps}{DROPT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{DROPT}{adaptive} &
+\cross{DROPT}{clip} &
+\cross{DROPT}{coerce} &
+\cross{DROPT}{colorFunction} &
+\cross{DROPT}{coord} \\
+\cross{DROPT}{coordinates} &
+\cross{DROPT}{curveColor} &
+\cross{DROPT}{hash} &
+\cross{DROPT}{latex} &
+\cross{DROPT}{option} \\
+\cross{DROPT}{option?} &
+\cross{DROPT}{pointColor} &
+\cross{DROPT}{range} &
+\cross{DROPT}{ranges} &
+\cross{DROPT}{space} \\
+\cross{DROPT}{style} &
+\cross{DROPT}{title} &
+\cross{DROPT}{toScale} &
+\cross{DROPT}{tubePoints} &
+\cross{DROPT}{tubeRadius} \\
+\cross{DROPT}{unit} &
+\cross{DROPT}{var1Steps} &
+\cross{DROPT}{var2Steps} &
+\cross{DROPT}{viewpoint} &
+\cross{DROPT}{?=?} \\
+\cross{DROPT}{?\~{}=?} &&&&
+\end{tabular}
+
 <<domain DROPT DrawOption>>=
 )abbrev domain DROPT DrawOption
 ++ Author: Stephen Watt
@@ -18675,6 +20686,18 @@ DrawOption(): Exports == Implementation where
 \section{domain D01AJFA d01ajfAnnaType}
 \pagehead{d01ajfAnnaType}{D01AJFA}
 \pagepic{ps/v103d01ajfannatype.ps}{D01AJFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D01AJFA}{coerce} &
+\cross{D01AJFA}{hash} &
+\cross{D01AJFA}{latex} &
+\cross{D01AJFA}{measure} &
+\cross{D01AJFA}{numericalIntegration} &
+\cross{D01AJFA}{?\~{}=?} &
+\cross{D01AJFA}{?=?} 
+\end{tabular}
+
 <<domain D01AJFA d01ajfAnnaType>>=
 )abbrev domain D01AJFA d01ajfAnnaType
 ++ Author: Brian Dupee
@@ -18740,6 +20763,18 @@ d01ajfAnnaType(): NumericalIntegrationCategory == Result add
 \section{domain D01AKFA d01akfAnnaType}
 \pagehead{d01akfAnnaType}{D01AKFA}
 \pagepic{ps/v103d01akfannatype.ps}{D01AKFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D01AKFA}{coerce} &
+\cross{D01AKFA}{hash} &
+\cross{D01AKFA}{latex} &
+\cross{D01AKFA}{measure} &
+\cross{D01AKFA}{numericalIntegration} &
+\cross{D01AKFA}{?=?} &
+\cross{D01AKFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain D01AKFA d01akfAnnaType>>=
 )abbrev domain D01AKFA d01akfAnnaType
 ++ Author: Brian Dupee
@@ -18810,6 +20845,18 @@ d01akfAnnaType(): NumericalIntegrationCategory == Result add
 \section{domain D01ALFA d01alfAnnaType}
 \pagehead{d01alfAnnaType}{D01ALFA}
 \pagepic{ps/v103d01alfannatype.ps}{D01ALFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D01ALFA}{coerce} &
+\cross{D01ALFA}{hash} &
+\cross{D01ALFA}{latex} &
+\cross{D01ALFA}{measure} &
+\cross{D01ALFA}{numericalIntegration} &
+\cross{D01ALFA}{?\~{}=?} &
+\cross{D01ALFA}{?=?} 
+\end{tabular}
+
 <<domain D01ALFA d01alfAnnaType>>=
 )abbrev domain D01ALFA d01alfAnnaType
 ++ Author: Brian Dupee
@@ -18892,6 +20939,18 @@ d01alfAnnaType(): NumericalIntegrationCategory == Result add
 \section{domain D01AMFA d01amfAnnaType}
 \pagehead{d01amfAnnaType}{D01AMFA}
 \pagepic{ps/v103d01amfannatype.ps}{D01AMFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D01AMFA}{coerce} &
+\cross{D01AMFA}{hash} &
+\cross{D01AMFA}{latex} &
+\cross{D01AMFA}{measure} &
+\cross{D01AMFA}{numericalIntegration} &
+\cross{D01AMFA}{?=?} &
+\cross{D01AMFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain D01AMFA d01amfAnnaType>>=
 )abbrev domain D01AMFA d01amfAnnaType
 ++ Author: Brian Dupee
@@ -18970,6 +21029,18 @@ d01amfAnnaType(): NumericalIntegrationCategory == Result add
 \section{domain D01ANFA d01anfAnnaType}
 \pagehead{d01anfAnnaType}{D01ANFA}
 \pagepic{ps/v103d01anfannatype.ps}{D01ANFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D10ANFA}{coerce} &
+\cross{D10ANFA}{hash} &
+\cross{D10ANFA}{latex} &
+\cross{D10ANFA}{measure} &
+\cross{D10ANFA}{numericalIntegration} &
+\cross{D10ANFA}{?\~{}=?} &
+\cross{D10ANFA}{?=?} 
+\end{tabular}
+
 <<domain D01ANFA d01anfAnnaType>>=
 )abbrev domain D01ANFA d01anfAnnaType
 ++ Author: Brian Dupee
@@ -19050,6 +21121,18 @@ d01anfAnnaType(): NumericalIntegrationCategory == Result add
 \section{domain D01APFA d01apfAnnaType}
 \pagehead{d01apfAnnaType}{D01APFA}
 \pagepic{ps/v103d01apfannatype.ps}{D01APFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D01APFA}{coerce} &
+\cross{D01APFA}{hash} &
+\cross{D01APFA}{latex} &
+\cross{D01APFA}{measure} &
+\cross{D01APFA}{numericalIntegration} &
+\cross{D01APFA}{?=?} &
+\cross{D01APFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain D01APFA d01apfAnnaType>>=
 )abbrev domain D01APFA d01apfAnnaType
 ++ Author: Brian Dupee
@@ -19143,6 +21226,18 @@ d01apfAnnaType(): NumericalIntegrationCategory == Result add
 \section{domain D01AQFA d01aqfAnnaType}
 \pagehead{d01aqfAnnaType}{D01AQFA}
 \pagepic{ps/v103d01aqfannatype.ps}{D01AQFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D01AQFA}{coerce} &
+\cross{D01APFA}{hash} &
+\cross{D01APFA}{latex} &
+\cross{D01APFA}{measure} &
+\cross{D01APFA}{numericalIntegration} &
+\cross{D01APFA}{?=?} &
+\cross{D01APFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain D01AQFA d01aqfAnnaType>>=
 )abbrev domain D01AQFA d01aqfAnnaType
 ++ Author: Brian Dupee
@@ -19232,6 +21327,18 @@ d01aqfAnnaType(): NumericalIntegrationCategory == Result add
 \section{domain D01ASFA d01asfAnnaType}
 \pagehead{d01asfAnnaType}{D01ASFA}
 \pagepic{ps/v103d01asfannatype.ps}{D01ASFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D01ASFA}{coerce} &
+\cross{D01ASFA}{hash} &
+\cross{D01ASFA}{latex} &
+\cross{D01ASFA}{measure} &
+\cross{D01ASFA}{numericalIntegration} &
+\cross{D01ASFA}{?=?} &
+\cross{D01ASFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain D01ASFA d01asfAnnaType>>=
 )abbrev domain D01ASFA d01asfAnnaType
 ++ Author: Brian Dupee
@@ -19318,6 +21425,18 @@ d01asfAnnaType(): NumericalIntegrationCategory == Result add
 \section{domain D01FCFA d01fcfAnnaType}
 \pagehead{d01fcfAnnaType}{D01FCFA}
 \pagepic{ps/v103d01fcfannatype.ps}{D01FCFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D01FCFA}{coerce} &
+\cross{D01FCFA}{hash} &
+\cross{D01FCFA}{latex} &
+\cross{D01FCFA}{measure} &
+\cross{D01FCFA}{numericalIntegration} &
+\cross{D01FCFA}{?=?} &
+\cross{D01FCFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain D01FCFA d01fcfAnnaType>>=
 )abbrev domain D01FCFA d01fcfAnnaType
 ++ Author: Brian Dupee
@@ -19394,6 +21513,18 @@ d01fcfAnnaType(): NumericalIntegrationCategory == Result add
 \section{domain D01GBFA d01gbfAnnaType}
 \pagehead{d01gbfAnnaType}{D01GBFA}
 \pagepic{ps/v103d01gbfannatype.ps}{D01GBFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D01GBFA}{coerce} &
+\cross{D01GBFA}{hash} &
+\cross{D01GBFA}{latex} &
+\cross{D01GBFA}{measure} &
+\cross{D01GBFA}{numericalIntegration} &
+\cross{D01GBFA}{?=?} &
+\cross{D01GBFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain D01GBFA d01gbfAnnaType>>=
 )abbrev domain D01GBFA d01gbfAnnaType
 ++ Author: Brian Dupee
@@ -19476,6 +21607,18 @@ d01gbfAnnaType(): NumericalIntegrationCategory == Result add
 \section{domain D01TRNS d01TransformFunctionType}
 \pagehead{d01TransformFunctionType}{D01TRNS}
 \pagepic{ps/v103d01transformfunctiontype.ps}{D01TRNS}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D01TRNS}{coerce} &
+\cross{D01TRNS}{hash} &
+\cross{D01TRNS}{latex} &
+\cross{D01TRNS}{measure} &
+\cross{D01TRNS}{numericalIntegration} &
+\cross{D01TRNS}{?=?} &
+\cross{D01TRNS}{?\~{}=?} 
+\end{tabular}
+
 <<domain D01TRNS d01TransformFunctionType>>=
 )abbrev domain D01TRNS d01TransformFunctionType
 ++ Author: Brian Dupee
@@ -19643,6 +21786,18 @@ d01TransformFunctionType():NumericalIntegrationCategory == Result add
 \section{domain D02BBFA d02bbfAnnaType}
 \pagehead{d02bbfAnnaType}{D02BBFA}
 \pagepic{ps/v103d02bbfannatype.ps}{D02BBFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D02BBFA}{coerce} &
+\cross{D02BBFA}{hash} &
+\cross{D02BBFA}{latex} &
+\cross{D02BBFA}{measure} &
+\cross{D02BBFA}{ODESolve} &
+\cross{D02BBFA}{?=?} &
+\cross{D02BBFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain D02BBFA d02bbfAnnaType>>=
 )abbrev domain D02BBFA d02bbfAnnaType
 ++ Author: Brian Dupee
@@ -19745,6 +21900,18 @@ d02bbfAnnaType():OrdinaryDifferentialEquationsSolverCategory == Result add
 \section{domain D02BHFA d02bhfAnnaType}
 \pagehead{d02bhfAnnaType}{D02BHFA}
 \pagepic{ps/v103d02bhfannatype.ps}{D02BHFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D02BHFA}{coerce} &
+\cross{D02BHFA}{hash} &
+\cross{D02BHFA}{latex} &
+\cross{D02BHFA}{measure} &
+\cross{D02BHFA}{ODESolve} &
+\cross{D02BHFA}{?=?} &
+\cross{D02BHFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain D02BHFA d02bhfAnnaType>>=
 )abbrev domain D02BHFA d02bhfAnnaType
 ++ Author: Brian Dupee
@@ -19843,6 +22010,18 @@ d02bhfAnnaType():OrdinaryDifferentialEquationsSolverCategory == Result add
 \section{domain D02CJFA d02cjfAnnaType}
 \pagehead{d02cjfAnnaType}{D02CJFA}
 \pagepic{ps/v103d02cjfannatype.ps}{D02CJFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D02CJFA}{coerce} &
+\cross{D02CJFA}{hash} &
+\cross{D02CJFA}{latex} &
+\cross{D02CJFA}{measure} &
+\cross{D02CJFA}{ODESolve} &
+\cross{D02CJFA}{?=?} &
+\cross{D02CJFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain D02CJFA d02cjfAnnaType>>=
 )abbrev domain D02CJFA d02cjfAnnaType
 ++ Author: Brian Dupee
@@ -19934,6 +22113,18 @@ d02cjfAnnaType():OrdinaryDifferentialEquationsSolverCategory == Result add
 \section{domain D02EJFA d02ejfAnnaType}
 \pagehead{d02ejfAnnaType}{D02EJFA}
 \pagepic{ps/v103d02ejfannatype.ps}{D02EJFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D02EJFA}{coerce} &
+\cross{D02EJFA}{hash} &
+\cross{D02EJFA}{latex} &
+\cross{D02EJFA}{measure} &
+\cross{D02EJFA}{ODESolve} &
+\cross{D02EJFA}{?=?} &
+\cross{D02EJFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain D02EJFA d02ejfAnnaType>>=
 )abbrev domain D02EJFA d02ejfAnnaType
 ++ Author: Brian Dupee
@@ -20056,6 +22247,18 @@ d02ejfAnnaType():OrdinaryDifferentialEquationsSolverCategory == Result add
 \section{domain D03EEFA d03eefAnnaType}
 \pagehead{d03eefAnnaType}{D03EEFA}
 \pagepic{ps/v103d03eefannatype.ps}{D03EEFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D03EEFA}{coerce} &
+\cross{D03EEFA}{hash} &
+\cross{D03EEFA}{latex} &
+\cross{D03EEFA}{measure} &
+\cross{D03EEFA}{PDESolve} &
+\cross{D03EEFA}{?=?} &
+\cross{D03EEFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain D03EEFA d03eefAnnaType>>=
 )abbrev domain D03EEFA d03eefAnnaType
 ++ Author: Brian Dupee
@@ -20137,6 +22340,18 @@ d03eefAnnaType():PartialDifferentialEquationsSolverCategory == Result add
 \section{domain D03FAFA d03fafAnnaType}
 \pagehead{d03fafAnnaType}{D03FAFA}
 \pagepic{ps/v103d03fafannatype.ps}{D03FAFA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{D03FAFA}{coerce} &
+\cross{D03FAFA}{hash} &
+\cross{D03FAFA}{latex} &
+\cross{D03FAFA}{measure} &
+\cross{D03FAFA}{PDESolve} &
+\cross{D03FAFA}{?=?} &
+\cross{D03FAFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain D03FAFA d03fafAnnaType>>=
 )abbrev domain D03FAFA d03fafAnnaType
 ++ Author: Brian Dupee
diff --git a/changelog b/changelog
index 7230a7c..b0353c8 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20090114 tpd src/axiom-website/patches.html 20090114.01.tpd.patch
+20090114 tpd books/bookvol10.3 add exports
 20090113 tpd src/axiom-website/patches.html 20090113.01.tpd.patch
 20090113 tpd books/bookvol10.3 begin adding exports
 20090112 tpd src/axiom-website/patches.html 20090112.02.tpd.patch
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 94e2939..ede4471 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -877,6 +877,8 @@ bookvol10.3 add dotabb chunks<br/>
 bookvol10.3 redraw graphs based on dotabb<br/>
 <a href="patches/20090113.01.tpd.patch">20090113.01.tpd.patch</a>
 bookvol10.3 begin adding exports<br/>
+<a href="patches/20090114.01.tpd.patch">20090114.01.tpd.patch</a>
+bookvol10.3 add exports<br/>
 
  </body>
 </html>

\start
Date: Thu, 15 Jan 2009 01:33:40 -0600
From: Tim Daly
To: list
Subject: 20090115.01.tpd.patch (bookvol10.3 add exports)

Add exports for chapters E and F
=======================================================================
diff --git a/books/bookvol10.3.pamphlet b/books/bookvol10.3.pamphlet
index 6160c63..27fff7d 100644
--- a/books/bookvol10.3.pamphlet
+++ b/books/bookvol10.3.pamphlet
@@ -22591,6 +22591,50 @@ o )show Equation
 @
 \pagehead{Equation}{EQ}
 \pagepic{ps/v103equation.ps}{EQ}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{EQ}{0} &
+\cross{EQ}{1} &
+\cross{EQ}{characteristic} &
+\cross{EQ}{coerce} &
+\cross{EQ}{commutator} \\
+\cross{EQ}{conjugate} &
+\cross{EQ}{D} &
+\cross{EQ}{differentiate} &
+\cross{EQ}{dimension} &
+\cross{EQ}{equation} \\
+\cross{EQ}{eval} &
+\cross{EQ}{factorAndSplit} &
+\cross{EQ}{hash} &
+\cross{EQ}{inv} &
+\cross{EQ}{latex} \\
+\cross{EQ}{leftOne} &
+\cross{EQ}{leftZero} &
+\cross{EQ}{lhs} &
+\cross{EQ}{map} &
+\cross{EQ}{one?} \\
+\cross{EQ}{recip} &
+\cross{EQ}{rhs} &
+\cross{EQ}{rightOne} &
+\cross{EQ}{rightZero} &
+\cross{EQ}{sample} \\
+\cross{EQ}{subst} &
+\cross{EQ}{subtractIfCan} &
+\cross{EQ}{swap} &
+\cross{EQ}{zero?} &
+\cross{EQ}{?\~{}=?} \\
+\cross{EQ}{-?} &
+\cross{EQ}{?=?} &
+\cross{EQ}{?*?} &
+\cross{EQ}{?**?} &
+\cross{EQ}{?+?} \\
+\cross{EQ}{?-?} &
+\cross{EQ}{?/?} &
+\cross{EQ}{?=?} &
+\cross{EQ}{?\^{}?} &
+\end{tabular}
+
 <<domain EQ Equation>>=
 )abbrev domain EQ Equation
 --FOR THE BENEFIT  OF LIBAX0 GENERATION
@@ -22923,6 +22967,67 @@ o )show EqTable
 \pageto{StringTable}{STRTBL}
 \pageto{GeneralSparseTable}{GSTBL}
 \pageto{SparseTable}{STBL}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{EQTBL}{any?} &
+\cross{EQTBL}{bag} &
+\cross{EQTBL}{coerce} &
+\cross{EQTBL}{construct} &
+\cross{EQTBL}{convert} \\
+\cross{EQTBL}{copy} &
+\cross{EQTBL}{count} &
+\cross{EQTBL}{dictionary} &
+\cross{EQTBL}{elt} &
+\cross{EQTBL}{empty} \\
+\cross{EQTBL}{empty?} &
+\cross{EQTBL}{entries} &
+\cross{EQTBL}{entry?} &
+\cross{EQTBL}{eq?} &
+\cross{EQTBL}{eval} \\
+\cross{EQTBL}{every?} &
+\cross{EQTBL}{extract!} &
+\cross{EQTBL}{fill!} &
+\cross{EQTBL}{find} &
+\cross{EQTBL}{first} \\
+\cross{EQTBL}{hash} &
+\cross{EQTBL}{index?} &
+\cross{EQTBL}{indices} &
+\cross{EQTBL}{insert!} &
+\cross{EQTBL}{inspect} \\
+\cross{EQTBL}{key?} &
+\cross{EQTBL}{keys} &
+\cross{EQTBL}{latex} &
+\cross{EQTBL}{less?} &
+\cross{EQTBL}{map} \\
+\cross{EQTBL}{map!} &
+\cross{EQTBL}{maxIndex} &
+\cross{EQTBL}{member?} &
+\cross{EQTBL}{members} &
+\cross{EQTBL}{minIndex} \\
+\cross{EQTBL}{more?} &
+\cross{EQTBL}{parts} &
+\cross{EQTBL}{qelt} &
+\cross{EQTBL}{qsetelt!} &
+\cross{EQTBL}{reduce} \\
+\cross{EQTBL}{remove} &
+\cross{EQTBL}{remove!} &
+\cross{EQTBL}{removeDuplicates} &
+\cross{EQTBL}{sample} &
+\cross{EQTBL}{search} \\
+\cross{EQTBL}{select} &
+\cross{EQTBL}{select!} &
+\cross{EQTBL}{setelt} &
+\cross{EQTBL}{size?} &
+\cross{EQTBL}{swap!} \\
+\cross{EQTBL}{table} &
+\cross{EQTBL}{table} &
+\cross{EQTBL}{\#{}?} &
+\cross{EQTBL}{?=?} &
+\cross{EQTBL}{?\~{}=?} \\
+\cross{EQTBL}{?.?} &&&&
+\end{tabular}
+
 <<domain EQTBL EqTable>>=
 )abbrev domain EQTBL EqTable
 ++ Author: Stephen M. Watt
@@ -22956,6 +23061,52 @@ EqTable(Key: SetCategory, Entry: SetCategory) ==
 {\bf See}\\
 \pageto{ModularRing}{MODRING}
 \pageto{ModularField}{MODFIELD}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{EMR}{0} &
+\cross{EMR}{1} &
+\cross{EMR}{associates?} &
+\cross{EMR}{characteristic} &
+\cross{EMR}{coerce} \\
+\cross{EMR}{divide} &
+\cross{EMR}{euclideanSize} &
+\cross{EMR}{exQuo} &
+\cross{EMR}{expressIdealMember} &
+\cross{EMR}{exquo} \\
+\cross{EMR}{extendedEuclidean} &
+\cross{EMR}{gcd} &
+\cross{EMR}{gcdPolynomial} &
+\cross{EMR}{hash} &
+\cross{EMR}{inv} \\
+\cross{EMR}{latex} &
+\cross{EMR}{lcm} &
+\cross{EMR}{modulus} &
+\cross{EMR}{multiEuclidean} &
+\cross{EMR}{one?} \\
+\cross{EMR}{principalIdeal} &
+\cross{EMR}{recip} &
+\cross{EMR}{reduce} &
+\cross{EMR}{sample} &
+\cross{EMR}{sizeLess?} \\
+\cross{EMR}{subtractIfCan} &
+\cross{EMR}{unit?} &
+\cross{EMR}{unitCanonical} &
+\cross{EMR}{unitNormal} &
+\cross{EMR}{zero?} \\
+\cross{EMR}{?\~{}=?} &
+\cross{EMR}{?*?} &
+\cross{EMR}{?**?} &
+\cross{EMR}{?\^{}?} &
+\cross{EMR}{?+?} \\
+\cross{EMR}{?-?} &
+\cross{EMR}{-?} &
+\cross{EMR}{?=?} &
+\cross{EMR}{?.?} &
+\cross{EMR}{?quo?} \\
+\cross{EMR}{?rem?} &&&&
+\end{tabular}
+
 <<domain EMR EuclideanModularRing>>=
 )abbrev domain EMR EuclideanModularRing
 ++ Description:
@@ -23209,6 +23360,91 @@ Exit: SetCategory == add
 {\bf See}\\
 \pageto{ExponentialOfUnivariatePuiseuxSeries}{EXPUPXS}
 \pageto{UnivariatePuiseuxSeriesWithExponentialSingularity}{UPXSSING}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{EXPEXPAN}{0} &
+\cross{EXPEXPAN}{1} &
+\cross{EXPEXPAN}{associates?} \\
+\cross{EXPEXPAN}{abs} &
+\cross{EXPEXPAN}{ceiling} &
+\cross{EXPEXPAN}{characteristic} \\
+\cross{EXPEXPAN}{charthRoot} &
+\cross{EXPEXPAN}{coerce} &
+\cross{EXPEXPAN}{conditionP} \\
+\cross{EXPEXPAN}{convert} &
+\cross{EXPEXPAN}{D} &
+\cross{EXPEXPAN}{denom} \\
+\cross{EXPEXPAN}{denominator} &
+\cross{EXPEXPAN}{differentiate} &
+\cross{EXPEXPAN}{divide} \\
+\cross{EXPEXPAN}{euclideanSize} &
+\cross{EXPEXPAN}{eval} &
+\cross{EXPEXPAN}{expressIdealMember} \\
+\cross{EXPEXPAN}{exquo} &
+\cross{EXPEXPAN}{extendedEuclidean} &
+\cross{EXPEXPAN}{factor} \\
+\cross{EXPEXPAN}{factorPolynomial} &
+\cross{EXPEXPAN}{factorSquareFreePolynomial} &
+\cross{EXPEXPAN}{floor} \\
+\cross{EXPEXPAN}{fractionPart} &
+\cross{EXPEXPAN}{gcd} &
+\cross{EXPEXPAN}{gcdPolynomial} \\
+\cross{EXPEXPAN}{hash} &
+\cross{EXPEXPAN}{init} &
+\cross{EXPEXPAN}{inv} \\
+\cross{EXPEXPAN}{latex} &
+\cross{EXPEXPAN}{lcm} &
+\cross{EXPEXPAN}{limitPlus} \\
+\cross{EXPEXPAN}{map} &
+\cross{EXPEXPAN}{max} &
+\cross{EXPEXPAN}{min} \\
+\cross{EXPEXPAN}{multiEuclidean} &
+\cross{EXPEXPAN}{negative?} &
+\cross{EXPEXPAN}{nextItem} \\
+\cross{EXPEXPAN}{numer} &
+\cross{EXPEXPAN}{numerator} &
+\cross{EXPEXPAN}{one?} \\
+\cross{EXPEXPAN}{patternMatch} &
+\cross{EXPEXPAN}{positive?} &
+\cross{EXPEXPAN}{prime?} \\
+\cross{EXPEXPAN}{principalIdeal} &
+\cross{EXPEXPAN}{random} &
+\cross{EXPEXPAN}{recip} \\
+\cross{EXPEXPAN}{reducedSystem} &
+\cross{EXPEXPAN}{retract} &
+\cross{EXPEXPAN}{retractIfCan} \\
+\cross{EXPEXPAN}{sample} &
+\cross{EXPEXPAN}{sign} &
+\cross{EXPEXPAN}{sizeLess?} \\
+\cross{EXPEXPAN}{solveLinearPolynomialEquation} &
+\cross{EXPEXPAN}{squareFree} &
+\cross{EXPEXPAN}{squareFreePart} \\
+\cross{EXPEXPAN}{squareFreePolynomial} &
+\cross{EXPEXPAN}{subtractIfCan} &
+\cross{EXPEXPAN}{unit?} \\
+\cross{EXPEXPAN}{unitCanonical} &
+\cross{EXPEXPAN}{unitNormal} &
+\cross{EXPEXPAN}{wholePart} \\
+\cross{EXPEXPAN}{zero?} &
+\cross{EXPEXPAN}{?*?} &
+\cross{EXPEXPAN}{?**?} \\
+\cross{EXPEXPAN}{?+?} &
+\cross{EXPEXPAN}{?-?} &
+\cross{EXPEXPAN}{-?} \\
+\cross{EXPEXPAN}{?/?} &
+\cross{EXPEXPAN}{?=?} &
+\cross{EXPEXPAN}{?\^{}?} \\
+\cross{EXPEXPAN}{?\~{}=?} &
+\cross{EXPEXPAN}{?$<$?} &
+\cross{EXPEXPAN}{?$<=$?} \\
+\cross{EXPEXPAN}{?$>$?} &
+\cross{EXPEXPAN}{?$>=$?} &
+\cross{EXPEXPAN}{?.?} \\
+\cross{EXPEXPAN}{?quo?} &
+\cross{EXPEXPAN}{?rem?} &
+\end{tabular}
+
 <<domain EXPEXPAN ExponentialExpansion>>=
 )abbrev domain EXPEXPAN ExponentialExpansion
 ++ Author: Clifton J. Williamson
@@ -23743,6 +23979,166 @@ o )show Expression
 \pagepic{ps/v103expression.ps}{EXPR}{1.00}
 {\bf See}\\
 \pageto{Pi}{HACKPI}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{EXPR}{0} &
+\cross{EXPR}{1} &
+\cross{EXPR}{abs} &
+\cross{EXPR}{acos} \\
+\cross{EXPR}{acosh} &
+\cross{EXPR}{acot} &
+\cross{EXPR}{acoth} &
+\cross{EXPR}{acsc} \\
+\cross{EXPR}{acsch} &
+\cross{EXPR}{airyAi} &
+\cross{EXPR}{airyBi} &
+\cross{EXPR}{applyQuote} \\
+\cross{EXPR}{asec} &
+\cross{EXPR}{asech} &
+\cross{EXPR}{asin} &
+\cross{EXPR}{asinh} \\
+\cross{EXPR}{associates?} &
+\cross{EXPR}{atan} &
+\cross{EXPR}{atanh} &
+\cross{EXPR}{belong?} \\
+\cross{EXPR}{besselI} &
+\cross{EXPR}{besselJ} &
+\cross{EXPR}{besselK} &
+\cross{EXPR}{besselY} \\
+\cross{EXPR}{Beta} &
+\cross{EXPR}{binomial} &
+\cross{EXPR}{box} &
+\cross{EXPR}{characteristic} \\
+\cross{EXPR}{charthRoot} &
+\cross{EXPR}{Ci} &
+\cross{EXPR}{coerce} &
+\cross{EXPR}{commutator} \\
+\cross{EXPR}{conjugate} &
+\cross{EXPR}{convert} &
+\cross{EXPR}{cos} &
+\cross{EXPR}{cosh} \\
+\cross{EXPR}{cot} &
+\cross{EXPR}{coth} &
+\cross{EXPR}{csc} &
+\cross{EXPR}{csch} \\
+\cross{EXPR}{D} &
+\cross{EXPR}{definingPolynomial} &
+\cross{EXPR}{denom} &
+\cross{EXPR}{denominator} \\
+\cross{EXPR}{differentiate} &
+\cross{EXPR}{digamma} &
+\cross{EXPR}{dilog} &
+\cross{EXPR}{distribute} \\
+\cross{EXPR}{divide} &
+\cross{EXPR}{Ei} &
+\cross{EXPR}{elt} &
+\cross{EXPR}{erf} \\
+\cross{EXPR}{euclideanSize} &
+\cross{EXPR}{eval} &
+\cross{EXPR}{even?} &
+\cross{EXPR}{exp} \\
+\cross{EXPR}{expressIdealMember} &
+\cross{EXPR}{exquo} &
+\cross{EXPR}{extendedEuclidean} &
+\cross{EXPR}{factor} \\
+\cross{EXPR}{factorPolynomial} &
+\cross{EXPR}{factorial} &
+\cross{EXPR}{factorials} &
+\cross{EXPR}{freeOf?} \\
+\cross{EXPR}{Gamma} &
+\cross{EXPR}{gcd} &
+\cross{EXPR}{gcdPolynomial} &
+\cross{EXPR}{ground} \\
+\cross{EXPR}{ground?} &
+\cross{EXPR}{hash} &
+\cross{EXPR}{height} &
+\cross{EXPR}{integral} \\
+\cross{EXPR}{inv} &
+\cross{EXPR}{is?} &
+\cross{EXPR}{isExpt} &
+\cross{EXPR}{isMult} \\
+\cross{EXPR}{isPlus} &
+\cross{EXPR}{isPower} &
+\cross{EXPR}{isTimes} &
+\cross{EXPR}{kernel} \\
+\cross{EXPR}{kernels} &
+\cross{EXPR}{latex} &
+\cross{EXPR}{lcm} &
+\cross{EXPR}{li} \\
+\cross{EXPR}{log} &
+\cross{EXPR}{mainKernel} &
+\cross{EXPR}{map} &
+\cross{EXPR}{max} \\
+\cross{EXPR}{min} &
+\cross{EXPR}{minPoly} &
+\cross{EXPR}{multiEuclidean} &
+\cross{EXPR}{nthRoot} \\
+\cross{EXPR}{number?} &
+\cross{EXPR}{numer} &
+\cross{EXPR}{numerator} &
+\cross{EXPR}{odd?} \\
+\cross{EXPR}{one?} &
+\cross{EXPR}{operator} &
+\cross{EXPR}{operators} &
+\cross{EXPR}{paren} \\
+\cross{EXPR}{patternMatch} &
+\cross{EXPR}{permutation} &
+\cross{EXPR}{pi} &
+\cross{EXPR}{polygamma} \\
+\cross{EXPR}{prime?} &
+\cross{EXPR}{principalIdeal} &
+\cross{EXPR}{product} &
+\cross{EXPR}{recip} \\
+\cross{EXPR}{reduce} &
+\cross{EXPR}{reducedSystem} &
+\cross{EXPR}{retract} &
+\cross{EXPR}{retractIfCan} \\
+\cross{EXPR}{rootOf} &
+\cross{EXPR}{rootsOf} &
+\cross{EXPR}{sample} &
+\cross{EXPR}{sec} \\
+\cross{EXPR}{sech} &
+\cross{EXPR}{Si} &
+\cross{EXPR}{simplifyPower} &
+\cross{EXPR}{sin} \\
+\cross{EXPR}{sinh} &
+\cross{EXPR}{sizeLess?} &
+\cross{EXPR}{sqrt} &
+\cross{EXPR}{squareFree} \\
+\cross{EXPR}{squareFreePart} &
+\cross{EXPR}{squareFreePolynomial} &
+\cross{EXPR}{subst} &
+\cross{EXPR}{subtractIfCan} \\
+\cross{EXPR}{summation} &
+\cross{EXPR}{tan} &
+\cross{EXPR}{tanh} &
+\cross{EXPR}{tower} \\
+\cross{EXPR}{unit?} &
+\cross{EXPR}{unitCanonical} &
+\cross{EXPR}{unitNormal} &
+\cross{EXPR}{univariate} \\
+\cross{EXPR}{variables} &
+\cross{EXPR}{zero?} &
+\cross{EXPR}{zeroOf} &
+\cross{EXPR}{zerosOf} \\
+\cross{EXPR}{?$<$?} &
+\cross{EXPR}{?$<=$?} &
+\cross{EXPR}{?=?} &
+\cross{EXPR}{?$>$?} \\
+\cross{EXPR}{?$>=$?} &
+\cross{EXPR}{?\~{}=?} &
+\cross{EXPR}{?*?} &
+\cross{EXPR}{?**?} \\
+\cross{EXPR}{?+?} &
+\cross{EXPR}{-?} &
+\cross{EXPR}{?-?} &
+\cross{EXPR}{?/?} \\
+\cross{EXPR}{?\^{}?} &
+\cross{EXPR}{?quo?} &
+\cross{EXPR}{?rem?} &
+\end{tabular}
+
 <<domain EXPR Expression>>=
 )abbrev domain EXPR Expression
 ++ Top-level mathematical expressions
@@ -24276,6 +24672,118 @@ Expression(R:OrderedSet): Exports == Implementation where
 {\bf See}\\
 \pageto{UnivariatePuiseuxSeriesWithExponentialSingularity}{UPXSSING}
 \pageto{ExponentialExpansion}{EXPEXPAN}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{EXPUPXS}{0} &
+\cross{EXPUPXS}{1} &
+\cross{EXPUPXS}{acos} &
+\cross{EXPUPXS}{acosh} \\
+\cross{EXPUPXS}{acot} &
+\cross{EXPUPXS}{acoth} &
+\cross{EXPUPXS}{acsc} &
+\cross{EXPUPXS}{acsch} \\
+\cross{EXPUPXS}{approximate} &
+\cross{EXPUPXS}{asec} &
+\cross{EXPUPXS}{asech} &
+\cross{EXPUPXS}{asin} \\
+\cross{EXPUPXS}{asinh} &
+\cross{EXPUPXS}{associates?} &
+\cross{EXPUPXS}{atan} &
+\cross{EXPUPXS}{atanh} \\
+\cross{EXPUPXS}{center} &
+\cross{EXPUPXS}{characteristic} &
+\cross{EXPUPXS}{charthRoot} &
+\cross{EXPUPXS}{coefficient} \\
+\cross{EXPUPXS}{coerce} &
+\cross{EXPUPXS}{complete} &
+\cross{EXPUPXS}{cos} &
+\cross{EXPUPXS}{cosh} \\
+\cross{EXPUPXS}{cot} &
+\cross{EXPUPXS}{coth} &
+\cross{EXPUPXS}{csc} &
+\cross{EXPUPXS}{csch} \\
+\cross{EXPUPXS}{D} &
+\cross{EXPUPXS}{degree} &
+\cross{EXPUPXS}{differentiate} &
+\cross{EXPUPXS}{divide} \\
+\cross{EXPUPXS}{euclideanSize} &
+\cross{EXPUPXS}{eval} &
+\cross{EXPUPXS}{exp} &
+\cross{EXPUPXS}{exponent} \\
+\cross{EXPUPXS}{exponential} &
+\cross{EXPUPXS}{exponentialOrder} &
+\cross{EXPUPXS}{expressIdealMember} &
+\cross{EXPUPXS}{exquo} \\
+\cross{EXPUPXS}{extend} &
+\cross{EXPUPXS}{extendedEuclidean} &
+\cross{EXPUPXS}{factor} &
+\cross{EXPUPXS}{gcd} \\
+\cross{EXPUPXS}{gcdPolynomial} &
+\cross{EXPUPXS}{hash} &
+\cross{EXPUPXS}{integrate} &
+\cross{EXPUPXS}{inv} \\
+\cross{EXPUPXS}{latex} &
+\cross{EXPUPXS}{lcm} &
+\cross{EXPUPXS}{leadingCoefficient} &
+\cross{EXPUPXS}{leadingMonomial} \\
+\cross{EXPUPXS}{log} &
+\cross{EXPUPXS}{map} &
+\cross{EXPUPXS}{max} &
+\cross{EXPUPXS}{min} \\
+\cross{EXPUPXS}{monomial} &
+\cross{EXPUPXS}{monomial?} &
+\cross{EXPUPXS}{multiEuclidean} &
+\cross{EXPUPXS}{multiplyExponents} \\
+\cross{EXPUPXS}{multiplyExponents} &
+\cross{EXPUPXS}{nthRoot} &
+\cross{EXPUPXS}{one?} &
+\cross{EXPUPXS}{order} \\
+\cross{EXPUPXS}{pi} &
+\cross{EXPUPXS}{pole?} &
+\cross{EXPUPXS}{prime?} &
+\cross{EXPUPXS}{principalIdeal} \\
+\cross{EXPUPXS}{recip} &
+\cross{EXPUPXS}{reductum} &
+\cross{EXPUPXS}{sample} &
+\cross{EXPUPXS}{sec} \\
+\cross{EXPUPXS}{sech} &
+\cross{EXPUPXS}{series} &
+\cross{EXPUPXS}{sin} &
+\cross{EXPUPXS}{sinh} \\
+\cross{EXPUPXS}{sizeLess?} &
+\cross{EXPUPXS}{sqrt} &
+\cross{EXPUPXS}{squareFree} &
+\cross{EXPUPXS}{squareFreePart} \\
+\cross{EXPUPXS}{subtractIfCan} &
+\cross{EXPUPXS}{tan} &
+\cross{EXPUPXS}{tanh} &
+\cross{EXPUPXS}{terms} \\
+\cross{EXPUPXS}{truncate} &
+\cross{EXPUPXS}{unit?} &
+\cross{EXPUPXS}{unitCanonical} &
+\cross{EXPUPXS}{unitNormal} \\
+\cross{EXPUPXS}{variable} &
+\cross{EXPUPXS}{variables} &
+\cross{EXPUPXS}{zero?} &
+\cross{EXPUPXS}{?*?} \\
+\cross{EXPUPXS}{?**?} &
+\cross{EXPUPXS}{?+?} &
+\cross{EXPUPXS}{?-?} &
+\cross{EXPUPXS}{-?} \\
+\cross{EXPUPXS}{?$<$?} &
+\cross{EXPUPXS}{?$<=$?} &
+\cross{EXPUPXS}{?=?} &
+\cross{EXPUPXS}{?$>$?} \\
+\cross{EXPUPXS}{?$>=$?} &
+\cross{EXPUPXS}{?\^{}?} &
+\cross{EXPUPXS}{?.?} &
+\cross{EXPUPXS}{?\~{}=?} \\
+\cross{EXPUPXS}{?/?} &
+\cross{EXPUPXS}{?quo?} &
+\cross{EXPUPXS}{?rem?} &
+\end{tabular}
+
 <<domain EXPUPXS ExponentialOfUnivariatePuiseuxSeries>>=
 )abbrev domain EXPUPXS ExponentialOfUnivariatePuiseuxSeries
 ++ Author: Clifton J. Williamson
@@ -24360,6 +24868,25 @@ ExponentialOfUnivariatePuiseuxSeries(FE,var,cen):_
 {\bf See}\\
 \pageto{AntiSymm}{ANTISYM}
 \pageto{DeRhamComplex}{DERHAM}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{EAB}{coerce} &
+\cross{EAB}{degree} &
+\cross{EAB}{exponents} &
+\cross{EAB}{hash} &
+\cross{EAB}{latex} \\
+\cross{EAB}{max} &
+\cross{EAB}{min} &
+\cross{EAB}{Nul} &
+\cross{EAB}{?\~{}=?} &
+\cross{EAB}{?$<$?} \\
+\cross{EAB}{?$<=$?} &
+\cross{EAB}{?=?} &
+\cross{EAB}{?$>$?} &
+\cross{EAB}{?$>=$?} &
+\end{tabular}
+
 <<domain EAB ExtAlgBasis>>=
 )abbrev domain EAB ExtAlgBasis
 --% ExtAlgBasis
@@ -24460,6 +24987,18 @@ ExtAlgBasis(): Export == Implement where
 \pageto{E04MBFA}{e04mbfAnnaType}
 \pageto{E04NAFA}{e04nafAnnaType}
 \pageto{E04UCFA}{e04ucfAnnaType}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{E04DGFA}{coerce} &
+\cross{E04DGFA}{hash} &
+\cross{E04DGFA}{latex} &
+\cross{E04DGFA}{measure} &
+\cross{E04DGFA}{numericalOptimization} &
+\cross{E04DGFA}{?=?} &
+\cross{E04DGFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain E04DGFA e04dgfAnnaType>>=
 )abbrev domain E04DGFA e04dgfAnnaType
 ++ Author: Brian Dupee
@@ -24547,6 +25086,18 @@ e04dgfAnnaType(): NumericalOptimizationCategory == Result add
 \pageto{E04MBFA}{e04mbfAnnaType}
 \pageto{E04NAFA}{e04nafAnnaType}
 \pageto{E04UCFA}{e04ucfAnnaType}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{E04FDFA}{coerce} &
+\cross{E04FDFA}{hash} &
+\cross{E04FDFA}{latex} &
+\cross{E04FDFA}{measure} &
+\cross{E04FDFA}{numericalOptimization} &
+\cross{E04FDFA}{?=?} &
+\cross{E04FDFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain E04FDFA e04fdfAnnaType>>=
 )abbrev domain E04FDFA e04fdfAnnaType
 ++ Author: Brian Dupee
@@ -24659,6 +25210,18 @@ e04fdfAnnaType(): NumericalOptimizationCategory == Result add
 \pageto{E04MBFA}{e04mbfAnnaType}
 \pageto{E04NAFA}{e04nafAnnaType}
 \pageto{E04UCFA}{e04ucfAnnaType}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{E04GCFA}{coerce} &
+\cross{E04GCFA}{hash} &
+\cross{E04GCFA}{latex} &
+\cross{E04GCFA}{measure} &
+\cross{E04GCFA}{numericalOptimization} &
+\cross{E04GCFA}{?=?} &
+\cross{E04GCFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain E04GCFA e04gcfAnnaType>>=
 )abbrev domain E04GCFA e04gcfAnnaType
 ++ Author: Brian Dupee
@@ -24787,6 +25350,18 @@ e04gcfAnnaType(): NumericalOptimizationCategory == Result add
 \pageto{E04MBFA}{e04mbfAnnaType}
 \pageto{E04NAFA}{e04nafAnnaType}
 \pageto{E04UCFA}{e04ucfAnnaType}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{E04JAFA}{coerce} &
+\cross{E04JAFA}{hash} &
+\cross{E04JAFA}{latex} &
+\cross{E04JAFA}{measure} &
+\cross{E04JAFA}{numericalOptimization} &
+\cross{E04JAFA}{?=?} &
+\cross{E04JAFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain E04JAFA e04jafAnnaType>>=
 )abbrev domain E04JAFA e04jafAnnaType
 ++ Author: Brian Dupee
@@ -24890,6 +25465,18 @@ e04jafAnnaType(): NumericalOptimizationCategory == Result add
 \pageto{E04JAFA}{e04jafAnnaType}
 \pageto{E04NAFA}{e04nafAnnaType}
 \pageto{E04UCFA}{e04ucfAnnaType}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{E04MBFA}{coerce} &
+\cross{E04MBFA}{hash} &
+\cross{E04MBFA}{latex} &
+\cross{E04MBFA}{measure} &
+\cross{E04MBFA}{numericalOptimization} &
+\cross{E04MBFA}{?=?} &
+\cross{E04MBFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain E04MBFA e04mbfAnnaType>>=
 )abbrev domain E04MBFA e04mbfAnnaType
 ++ Author: Brian Dupee
@@ -24979,6 +25566,18 @@ e04mbfAnnaType(): NumericalOptimizationCategory == Result add
 \pageto{E04JAFA}{e04jafAnnaType}
 \pageto{E04MBFA}{e04mbfAnnaType}
 \pageto{E04UCFA}{e04ucfAnnaType}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{E04NAFA}{coerce} &
+\cross{E04NAFA}{hash} &
+\cross{E04NAFA}{latex} &
+\cross{E04NAFA}{measure} &
+\cross{E04NAFA}{numericalOptimization} &
+\cross{E04NAFA}{?=?} &
+\cross{E04NAFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain E04NAFA e04nafAnnaType>>=
 )abbrev domain E04NAFA e04nafAnnaType
 ++ Author: Brian Dupee
@@ -25083,6 +25682,18 @@ e04nafAnnaType(): NumericalOptimizationCategory == Result add
 \pageto{E04JAFA}{e04jafAnnaType}
 \pageto{E04MBFA}{e04mbfAnnaType}
 \pageto{E04NAFA}{e04nafAnnaType}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{E04UCFA}{coerce} &
+\cross{E04UCFA}{hash} &
+\cross{E04UCFA}{latex} &
+\cross{E04UCFA}{measure} &
+\cross{E04UCFA}{numericalOptimization} &
+\cross{E04UCFA}{?=?} &
+\cross{E04UCFA}{?\~{}=?} 
+\end{tabular}
+
 <<domain E04UCFA e04ucfAnnaType>>=
 )abbrev domain E04UCFA e04ucfAnnaType
 ++ Author: Brian Dupee
@@ -25815,6 +26426,69 @@ o )show Factored
 @
 \pagehead{Factored}{FR}
 \pagepic{ps/v103factored.ps}{FR}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FR}{0} &
+\cross{FR}{1} &
+\cross{FR}{associates?} &
+\cross{FR}{characteristic} &
+\cross{FR}{coerce} \\
+\cross{FR}{convert} &
+\cross{FR}{D} &
+\cross{FR}{differentiate} &
+\cross{FR}{eval} &
+\cross{FR}{expand} \\
+\cross{FR}{exponent} &
+\cross{FR}{exquo} &
+\cross{FR}{factor} &
+\cross{FR}{factorList} &
+\cross{FR}{factors} \\
+\cross{FR}{flagFactor} &
+\cross{FR}{gcd} &
+\cross{FR}{gcdPolynomial} &
+\cross{FR}{hash} &
+\cross{FR}{irreducibleFactor} \\
+\cross{FR}{latex} &
+\cross{FR}{lcm} &
+\cross{FR}{makeFR} &
+\cross{FR}{map} &
+\cross{FR}{nilFactor} \\
+\cross{FR}{nthExponent} &
+\cross{FR}{nthFactor} &
+\cross{FR}{nthFlag} &
+\cross{FR}{numberOfFactors} &
+\cross{FR}{one?} \\
+\cross{FR}{prime?} &
+\cross{FR}{primeFactor} &
+\cross{FR}{rational} &
+\cross{FR}{rational?} &
+\cross{FR}{rationalIfCan} \\
+\cross{FR}{recip} &
+\cross{FR}{retract} &
+\cross{FR}{retractIfCan} &
+\cross{FR}{sample} &
+\cross{FR}{sqfrFactor} \\
+\cross{FR}{squareFree} &
+\cross{FR}{squareFreePart} &
+\cross{FR}{subtractIfCan} &
+\cross{FR}{unit} &
+\cross{FR}{unit?} \\
+\cross{FR}{unitCanonical} &
+\cross{FR}{unitNormal} &
+\cross{FR}{unitNormalize} &
+\cross{FR}{zero?} &
+\cross{FR}{?*?} \\
+\cross{FR}{?**?} &
+\cross{FR}{?+?} &
+\cross{FR}{?-?} &
+\cross{FR}{-?} &
+\cross{FR}{?=?} \\
+\cross{FR}{?\^{}?} &
+\cross{FR}{?\~{}=?} &
+\cross{FR}{?.?} &&
+\end{tabular}
+
 <<domain FR Factored>>=
 )abbrev domain FR Factored
 ++ Author: Robert S. Sutor
@@ -26576,6 +27250,24 @@ o )show File
 \pageto{BinaryFile}{BINFILE}
 \pageto{KeyedAccessFile}{KAFILE}
 \pageto{Library}{LIB}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FILE}{close!} &
+\cross{FILE}{coerce} &
+\cross{FILE}{hash} &
+\cross{FILE}{iomode} &
+\cross{FILE}{latex} \\
+\cross{FILE}{name} &
+\cross{FILE}{open} &
+\cross{FILE}{readIfCan!} &
+\cross{FILE}{read!} &
+\cross{FILE}{reopen!} \\
+\cross{FILE}{write!} &
+\cross{FILE}{?=?} &
+\cross{FILE}{?\~{}=?} &&
+\end{tabular}
+
 <<domain FILE File>>=
 )abbrev domain FILE File
 ++ Author: Stephen M. Watt, Victor Miller
@@ -26946,6 +27638,24 @@ o )show FileName
 @
 \pagehead{FileName}{FNAME}
 \pagepic{ps/v103filename.ps}{FNAME}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FNAME}{coerce} &
+\cross{FNAME}{directory} &
+\cross{FNAME}{exists?} &
+\cross{FNAME}{extension} &
+\cross{FNAME}{filename} \\
+\cross{FNAME}{hash} &
+\cross{FNAME}{latex} &
+\cross{FNAME}{name} &
+\cross{FNAME}{new} &
+\cross{FNAME}{readable?} \\
+\cross{FNAME}{writable?} &
+\cross{FNAME}{?=?} &
+\cross{FNAME}{?\~{}=?} &&
+\end{tabular}
+
 <<domain FNAME FileName>>=
 )abbrev domain FNAME FileName
 ++ Author: Stephen M. Watt
@@ -26996,6 +27706,32 @@ FileName(): FileNameCategory == add
 \pageto{FractionalIdeal}{FRIDEAL}
 \pageto{FramedModule}{FRMOD}
 \pageto{HyperellipticFiniteDivisor}{HELLFDIV}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FDIV}{0} &
+\cross{FDIV}{coerce} &
+\cross{FDIV}{decompose} &
+\cross{FDIV}{divisor} &
+\cross{FDIV}{finiteBasis} \\
+\cross{FDIV}{generator} &
+\cross{FDIV}{hash} &
+\cross{FDIV}{ideal} &
+\cross{FDIV}{lSpaceBasis} &
+\cross{FDIV}{latex} \\
+\cross{FDIV}{principal?} &
+\cross{FDIV}{reduce} &
+\cross{FDIV}{sample} &
+\cross{FDIV}{subtractIfCan} &
+\cross{FDIV}{zero?} \\
+\cross{FDIV}{?\~{}=?} &
+\cross{FDIV}{?*?} &
+\cross{FDIV}{?+?} &
+\cross{FDIV}{?-?} &
+\cross{FDIV}{-?} \\
+\cross{FDIV}{?=?} &&&&
+\end{tabular}
+
 <<domain FDIV FiniteDivisor>>=
 )abbrev domain FDIV FiniteDivisor
 ++ Finite rational divisors on a curve
@@ -27139,6 +27875,96 @@ FiniteDivisor(F, UP, UPUP, R): Exports == Implementation where
 \pageto{FiniteFieldExtensionByPolynomial}{FFP}
 \pageto{FiniteFieldExtension}{FFX}
 \pageto{InnerFiniteField}{IFF}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{FF}{0} &
+\cross{FF}{1} &
+\cross{FF}{algebraic?} \\
+\cross{FF}{associates?} &
+\cross{FF}{basis} &
+\cross{FF}{characteristic} \\
+\cross{FF}{charthRoot} &
+\cross{FF}{coerce} &
+\cross{FF}{conditionP} \\
+\cross{FF}{coordinates} &
+\cross{FF}{createNormalElement} &
+\cross{FF}{createPrimitiveElement} \\
+\cross{FF}{D} &
+\cross{FF}{definingPolynomial} &
+\cross{FF}{degree} \\
+\cross{FF}{differentiate} &
+\cross{FF}{dimension} &
+\cross{FF}{discreteLog} \\
+\cross{FF}{divide} &
+\cross{FF}{euclideanSize} &
+\cross{FF}{expressIdealMember} \\
+\cross{FF}{exquo} &
+\cross{FF}{extendedEuclidean} &
+\cross{FF}{extensionDegree} \\
+\cross{FF}{factor} &
+\cross{FF}{factorsOfCyclicGroupSize} &
+\cross{FF}{Frobenius} \\
+\cross{FF}{gcd} &
+\cross{FF}{gcdPolynomial} &
+\cross{FF}{generator} \\
+\cross{FF}{hash} &
+\cross{FF}{index} &
+\cross{FF}{inGroundField?} \\
+\cross{FF}{init} &
+\cross{FF}{inv} &
+\cross{FF}{latex} \\
+\cross{FF}{lcm} &
+\cross{FF}{linearAssociatedExp} &
+\cross{FF}{linearAssociatedLog} \\
+\cross{FF}{linearAssociatedOrder} &
+\cross{FF}{lookup} &
+\cross{FF}{minimalPolynomial} \\
+\cross{FF}{multiEuclidean} &
+\cross{FF}{nextItem} &
+\cross{FF}{norm} \\
+\cross{FF}{normal?} &
+\cross{FF}{normalElement} &
+\cross{FF}{one?} \\
+\cross{FF}{order} &
+\cross{FF}{prime?} &
+\cross{FF}{primeFrobenius} \\
+\cross{FF}{primitive?} &
+\cross{FF}{primitiveElement} &
+\cross{FF}{principalIdeal} \\
+\cross{FF}{random} &
+\cross{FF}{recip} &
+\cross{FF}{representationType} \\
+\cross{FF}{represents} &
+\cross{FF}{retract} &
+\cross{FF}{retractIfCan} \\
+\cross{FF}{sample} &
+\cross{FF}{size} &
+\cross{FF}{sizeLess?} \\
+\cross{FF}{squareFree} &
+\cross{FF}{squareFreePart} &
+\cross{FF}{subtractIfCan} \\
+\cross{FF}{tableForDiscreteLogarithm} &
+\cross{FF}{trace} &
+\cross{FF}{transcendenceDegree} \\
+\cross{FF}{transcendent?} &
+\cross{FF}{unit?} &
+\cross{FF}{unitCanonical} \\
+\cross{FF}{unitNormal} &
+\cross{FF}{zero?} &
+\cross{FF}{?*?} \\
+\cross{FF}{?**?} &
+\cross{FF}{?+?} &
+\cross{FF}{?-?} \\
+\cross{FF}{-?} &
+\cross{FF}{?/?} &
+\cross{FF}{?=?} \\
+\cross{FF}{?\^{}?} &
+\cross{FF}{?\~{}=?} &
+\cross{FF}{?quo?} \\
+\cross{FF}{?rem?} &&
+\end{tabular}
+
 <<domain FF FiniteField>>=
 )abbrev domain FF FiniteField
 ++ Author: ???
@@ -27181,6 +28007,97 @@ FiniteField(p:PositiveInteger, n:PositiveInteger): _
 {\bf See}\\
 \pageto{FiniteFieldCyclicGroupExtensionByPolynomial}{FFCGP}
 \pageto{FiniteFieldCyclicGroupExtension}{FFCGX}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{FFCG}{0} &
+\cross{FFCG}{1} &
+\cross{FFCG}{algebraic?} \\
+\cross{FFCG}{associates?} &
+\cross{FFCG}{basis} &
+\cross{FFCG}{characteristic} \\
+\cross{FFCG}{charthRoot} &
+\cross{FFCG}{coerce} &
+\cross{FFCG}{conditionP} \\
+\cross{FFCG}{coordinates} &
+\cross{FFCG}{createNormalElement} &
+\cross{FFCG}{createPrimitiveElement} \\
+\cross{FFCG}{D} &
+\cross{FFCG}{definingPolynomial} &
+\cross{FFCG}{degree} \\
+\cross{FFCG}{differentiate} &
+\cross{FFCG}{dimension} &
+\cross{FFCG}{discreteLog} \\
+\cross{FFCG}{divide} &
+\cross{FFCG}{euclideanSize} &
+\cross{FFCG}{expressIdealMember} \\
+\cross{FFCG}{exquo} &
+\cross{FFCG}{extendedEuclidean} &
+\cross{FFCG}{extensionDegree} \\
+\cross{FFCG}{factor} &
+\cross{FFCG}{factorsOfCyclicGroupSize} &
+\cross{FFCG}{Frobenius} \\
+\cross{FFCG}{gcd} &
+\cross{FFCG}{gcdPolynomial} &
+\cross{FFCG}{generator} \\
+\cross{FFCG}{getZechTable} &
+\cross{FFCG}{hash} &
+\cross{FFCG}{index} \\
+\cross{FFCG}{inGroundField?} &
+\cross{FFCG}{init} &
+\cross{FFCG}{inv} \\
+\cross{FFCG}{latex} &
+\cross{FFCG}{lcm} &
+\cross{FFCG}{linearAssociatedExp} \\
+\cross{FFCG}{linearAssociatedLog} &
+\cross{FFCG}{linearAssociatedOrder} &
+\cross{FFCG}{lookup} \\
+\cross{FFCG}{minimalPolynomial} &
+\cross{FFCG}{multiEuclidean} &
+\cross{FFCG}{nextItem} \\
+\cross{FFCG}{norm} &
+\cross{FFCG}{normal?} &
+\cross{FFCG}{normalElement} \\
+\cross{FFCG}{one?} &
+\cross{FFCG}{order} &
+\cross{FFCG}{prime?} \\
+\cross{FFCG}{primeFrobenius} &
+\cross{FFCG}{primitive?} &
+\cross{FFCG}{primitiveElement} \\
+\cross{FFCG}{principalIdeal} &
+\cross{FFCG}{random} &
+\cross{FFCG}{recip} \\
+\cross{FFCG}{representationType} &
+\cross{FFCG}{represents} &
+\cross{FFCG}{retract} \\
+\cross{FFCG}{retractIfCan} &
+\cross{FFCG}{sample} &
+\cross{FFCG}{size} \\
+\cross{FFCG}{sizeLess?} &
+\cross{FFCG}{squareFree} &
+\cross{FFCG}{squareFreePart} \\
+\cross{FFCG}{subtractIfCan} &
+\cross{FFCG}{tableForDiscreteLogarithm} &
+\cross{FFCG}{trace} \\
+\cross{FFCG}{transcendenceDegree} &
+\cross{FFCG}{transcendent?} &
+\cross{FFCG}{unit?} \\
+\cross{FFCG}{unitCanonical} &
+\cross{FFCG}{unitNormal} &
+\cross{FFCG}{zero?} \\
+\cross{FFCG}{?*?} &
+\cross{FFCG}{?**?} &
+\cross{FFCG}{?+?} \\
+\cross{FFCG}{?-?} &
+\cross{FFCG}{-?} &
+\cross{FFCG}{?/?} \\
+\cross{FFCG}{?=?} &
+\cross{FFCG}{?\^{}?} &
+\cross{FFCG}{?\~{}=?} \\
+\cross{FFCG}{?quo?} &
+\cross{FFCG}{?rem?} &
+\end{tabular}
+
 <<domain FFCG FiniteFieldCyclicGroup>>=
 )abbrev domain FFCG FiniteFieldCyclicGroup
 ++ Authors: J.Grabmeier, A.Scheerhorn
@@ -27234,6 +28151,97 @@ FiniteFieldCyclicGroup(p,extdeg):_
 {\bf See}\\
 \pageto{FiniteFieldCyclicGroupExtensionByPolynomial}{FFCGP}
 \pageto{FiniteFieldCyclicGroup}{FFCG}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{FFCGX}{0} &
+\cross{FFCGX}{1} &
+\cross{FFCGX}{algebraic?} \\
+\cross{FFCGX}{associates?} &
+\cross{FFCGX}{basis} &
+\cross{FFCGX}{characteristic} \\
+\cross{FFCGX}{charthRoot} &
+\cross{FFCGX}{coerce} &
+\cross{FFCGX}{conditionP} \\
+\cross{FFCGX}{coordinates} &
+\cross{FFCGX}{createNormalElement} &
+\cross{FFCGX}{createPrimitiveElement} \\
+\cross{FFCGX}{D} &
+\cross{FFCGX}{definingPolynomial} &
+\cross{FFCGX}{degree} \\
+\cross{FFCGX}{differentiate} &
+\cross{FFCGX}{dimension} &
+\cross{FFCGX}{discreteLog} \\
+\cross{FFCGX}{divide} &
+\cross{FFCGX}{euclideanSize} &
+\cross{FFCGX}{expressIdealMember} \\
+\cross{FFCGX}{exquo} &
+\cross{FFCGX}{extendedEuclidean} &
+\cross{FFCGX}{extensionDegree} \\
+\cross{FFCGX}{factor} &
+\cross{FFCGX}{factorsOfCyclicGroupSize} &
+\cross{FFCGX}{Frobenius} \\
+\cross{FFCGX}{gcd} &
+\cross{FFCGX}{gcdPolynomial} &
+\cross{FFCGX}{generator} \\
+\cross{FFCGX}{getZechTable} &
+\cross{FFCGX}{hash} &
+\cross{FFCGX}{index} \\
+\cross{FFCGX}{inGroundField?} &
+\cross{FFCGX}{init} &
+\cross{FFCGX}{inv} \\
+\cross{FFCGX}{latex} &
+\cross{FFCGX}{lcm} &
+\cross{FFCGX}{linearAssociatedExp} \\
+\cross{FFCGX}{linearAssociatedLog} &
+\cross{FFCGX}{linearAssociatedOrder} &
+\cross{FFCGX}{lookup} \\
+\cross{FFCGX}{minimalPolynomial} &
+\cross{FFCGX}{multiEuclidean} &
+\cross{FFCGX}{nextItem} \\
+\cross{FFCGX}{norm} &
+\cross{FFCGX}{normal?} &
+\cross{FFCGX}{normalElement} \\
+\cross{FFCGX}{one?} &
+\cross{FFCGX}{order} &
+\cross{FFCGX}{prime?} \\
+\cross{FFCGX}{primeFrobenius} &
+\cross{FFCGX}{primitive?} &
+\cross{FFCGX}{primitiveElement} \\
+\cross{FFCGX}{principalIdeal} &
+\cross{FFCGX}{random} &
+\cross{FFCGX}{recip} \\
+\cross{FFCGX}{representationType} &
+\cross{FFCGX}{represents} &
+\cross{FFCGX}{retract} \\
+\cross{FFCGX}{retractIfCan} &
+\cross{FFCGX}{sample} &
+\cross{FFCGX}{size} \\
+\cross{FFCGX}{sizeLess?} &
+\cross{FFCGX}{squareFree} &
+\cross{FFCGX}{squareFreePart} \\
+\cross{FFCGX}{subtractIfCan} &
+\cross{FFCGX}{tableForDiscreteLogarithm} &
+\cross{FFCGX}{trace} \\
+\cross{FFCGX}{transcendenceDegree} &
+\cross{FFCGX}{transcendent?} &
+\cross{FFCGX}{unit?} \\
+\cross{FFCGX}{unitCanonical} &
+\cross{FFCGX}{unitNormal} &
+\cross{FFCGX}{zero?} \\
+\cross{FFCGX}{?*?} &
+\cross{FFCGX}{?**?} &
+\cross{FFCGX}{?+?} \\
+\cross{FFCGX}{?-?} &
+\cross{FFCGX}{-?} &
+\cross{FFCGX}{?/?} \\
+\cross{FFCGX}{?=?} &
+\cross{FFCGX}{?\^{}?} &
+\cross{FFCGX}{?\~{}=?} \\
+\cross{FFCGX}{?quo?} &
+\cross{FFCGX}{?rem?} &
+\end{tabular}
+
 <<domain FFCGX FiniteFieldCyclicGroupExtension>>=
 )abbrev domain FFCGX FiniteFieldCyclicGroupExtension
 ++ Authors: J.Grabmeier, A.Scheerhorn
@@ -27290,6 +28298,97 @@ FiniteFieldCyclicGroupExtension(GF,extdeg):_
 {\bf See}\\
 \pageto{FiniteFieldCyclicGroupExtension}{FFCGX}
 \pageto{FiniteFieldCyclicGroup}{FFCG}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{FFCGP}{0} &
+\cross{FFCGP}{1} &
+\cross{FFCGP}{algebraic?} \\
+\cross{FFCGP}{associates?} &
+\cross{FFCGP}{basis} &
+\cross{FFCGP}{characteristic} \\
+\cross{FFCGP}{charthRoot} &
+\cross{FFCGP}{coerce} &
+\cross{FFCGP}{conditionP} \\
+\cross{FFCGP}{coordinates} &
+\cross{FFCGP}{createNormalElement} &
+\cross{FFCGP}{createPrimitiveElement} \\
+\cross{FFCGP}{D} &
+\cross{FFCGP}{definingPolynomial} &
+\cross{FFCGP}{degree} \\
+\cross{FFCGP}{differentiate} &
+\cross{FFCGP}{dimension} &
+\cross{FFCGP}{discreteLog} \\
+\cross{FFCGP}{divide} &
+\cross{FFCGP}{euclideanSize} &
+\cross{FFCGP}{expressIdealMember} \\
+\cross{FFCGP}{exquo} &
+\cross{FFCGP}{extendedEuclidean} &
+\cross{FFCGP}{extensionDegree} \\
+\cross{FFCGP}{factor} &
+\cross{FFCGP}{factorsOfCyclicGroupSize} &
+\cross{FFCGP}{Frobenius} \\
+\cross{FFCGP}{gcd} &
+\cross{FFCGP}{gcdPolynomial} &
+\cross{FFCGP}{generator} \\
+\cross{FFCGP}{getZechTable} &
+\cross{FFCGP}{hash} &
+\cross{FFCGP}{index} \\
+\cross{FFCGP}{inGroundField?} &
+\cross{FFCGP}{init} &
+\cross{FFCGP}{inv} \\
+\cross{FFCGP}{latex} &
+\cross{FFCGP}{lcm} &
+\cross{FFCGP}{linearAssociatedExp} \\
+\cross{FFCGP}{linearAssociatedLog} &
+\cross{FFCGP}{linearAssociatedOrder} &
+\cross{FFCGP}{lookup} \\
+\cross{FFCGP}{minimalPolynomial} &
+\cross{FFCGP}{multiEuclidean} &
+\cross{FFCGP}{nextItem} \\
+\cross{FFCGP}{norm} &
+\cross{FFCGP}{normal?} &
+\cross{FFCGP}{normalElement} \\
+\cross{FFCGP}{one?} &
+\cross{FFCGP}{order} &
+\cross{FFCGP}{prime?} \\
+\cross{FFCGP}{primeFrobenius} &
+\cross{FFCGP}{primitive?} &
+\cross{FFCGP}{primitiveElement} \\
+\cross{FFCGP}{principalIdeal} &
+\cross{FFCGP}{random} &
+\cross{FFCGP}{recip} \\
+\cross{FFCGP}{representationType} &
+\cross{FFCGP}{represents} &
+\cross{FFCGP}{retract} \\
+\cross{FFCGP}{retractIfCan} &
+\cross{FFCGP}{sample} &
+\cross{FFCGP}{size} \\
+\cross{FFCGP}{sizeLess?} &
+\cross{FFCGP}{squareFree} &
+\cross{FFCGP}{squareFreePart} \\
+\cross{FFCGP}{subtractIfCan} &
+\cross{FFCGP}{tableForDiscreteLogarithm} &
+\cross{FFCGP}{trace} \\
+\cross{FFCGP}{transcendenceDegree} &
+\cross{FFCGP}{transcendent?} &
+\cross{FFCGP}{unit?} \\
+\cross{FFCGP}{unitCanonical} &
+\cross{FFCGP}{unitNormal} &
+\cross{FFCGP}{zero?} \\
+\cross{FFCGP}{?*?} &
+\cross{FFCGP}{?**?} &
+\cross{FFCGP}{?+?} \\
+\cross{FFCGP}{?-?} &
+\cross{FFCGP}{-?} &
+\cross{FFCGP}{?/?} \\
+\cross{FFCGP}{?=?} &
+\cross{FFCGP}{?\^{}?} &
+\cross{FFCGP}{?\~{}=?} \\
+\cross{FFCGP}{?quo?} &
+\cross{FFCGP}{?rem?} &
+\end{tabular}
+
 <<domain FFCGP FiniteFieldCyclicGroupExtensionByPolynomial>>=
 )abbrev domain FFCGP FiniteFieldCyclicGroupExtensionByPolynomial
 ++ Authors: J.Grabmeier, A.Scheerhorn
@@ -27613,6 +28712,96 @@ FiniteFieldCyclicGroupExtensionByPolynomial(GF,defpol):_
 \pageto{FiniteFieldExtensionByPolynomial}{FFP}
 \pageto{InnerFiniteField}{IFF}
 \pageto{FiniteField}{FF}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{FFX}{0} &
+\cross{FFX}{1} &
+\cross{FFX}{algebraic?} \\
+\cross{FFX}{associates?} &
+\cross{FFX}{basis} &
+\cross{FFX}{characteristic} \\
+\cross{FFX}{charthRoot} &
+\cross{FFX}{coerce} &
+\cross{FFX}{conditionP} \\
+\cross{FFX}{coordinates} &
+\cross{FFX}{createNormalElement} &
+\cross{FFX}{createPrimitiveElement} \\
+\cross{FFX}{D} &
+\cross{FFX}{definingPolynomial} &
+\cross{FFX}{degree} \\
+\cross{FFX}{differentiate} &
+\cross{FFX}{dimension} &
+\cross{FFX}{discreteLog} \\
+\cross{FFX}{divide} &
+\cross{FFX}{euclideanSize} &
+\cross{FFX}{expressIdealMember} \\
+\cross{FFX}{exquo} &
+\cross{FFX}{extendedEuclidean} &
+\cross{FFX}{extensionDegree} \\
+\cross{FFX}{factor} &
+\cross{FFX}{factorsOfCyclicGroupSize} &
+\cross{FFX}{Frobenius} \\
+\cross{FFX}{gcd} &
+\cross{FFX}{gcdPolynomial} &
+\cross{FFX}{generator} \\
+\cross{FFX}{hash} &
+\cross{FFX}{index} &
+\cross{FFX}{inGroundField?} \\
+\cross{FFX}{init} &
+\cross{FFX}{inv} &
+\cross{FFX}{latex} \\
+\cross{FFX}{lcm} &
+\cross{FFX}{linearAssociatedExp} &
+\cross{FFX}{linearAssociatedLog} \\
+\cross{FFX}{linearAssociatedOrder} &
+\cross{FFX}{lookup} &
+\cross{FFX}{minimalPolynomial} \\
+\cross{FFX}{multiEuclidean} &
+\cross{FFX}{nextItem} &
+\cross{FFX}{norm} \\
+\cross{FFX}{normal?} &
+\cross{FFX}{normalElement} &
+\cross{FFX}{one?} \\
+\cross{FFX}{order} &
+\cross{FFX}{prime?} &
+\cross{FFX}{primeFrobenius} \\
+\cross{FFX}{primitive?} &
+\cross{FFX}{primitiveElement} &
+\cross{FFX}{principalIdeal} \\
+\cross{FFX}{random} &
+\cross{FFX}{recip} &
+\cross{FFX}{representationType} \\
+\cross{FFX}{represents} &
+\cross{FFX}{retract} &
+\cross{FFX}{retractIfCan} \\
+\cross{FFX}{sample} &
+\cross{FFX}{size} &
+\cross{FFX}{sizeLess?} \\
+\cross{FFX}{squareFree} &
+\cross{FFX}{squareFreePart} &
+\cross{FFX}{subtractIfCan} \\
+\cross{FFX}{tableForDiscreteLogarithm} &
+\cross{FFX}{trace} &
+\cross{FFX}{transcendenceDegree} \\
+\cross{FFX}{transcendent?} &
+\cross{FFX}{unit?} &
+\cross{FFX}{unitCanonical} \\
+\cross{FFX}{unitNormal} &
+\cross{FFX}{zero?} &
+\cross{FFX}{?*?} \\
+\cross{FFX}{?**?} &
+\cross{FFX}{?+?} &
+\cross{FFX}{?-?} \\
+\cross{FFX}{-?} &
+\cross{FFX}{?/?} &
+\cross{FFX}{?=?} \\
+\cross{FFX}{?\^{}?} &
+\cross{FFX}{?\~{}=?} &
+\cross{FFX}{?quo?} \\
+\cross{FFX}{?rem?} &&
+\end{tabular}
+
 <<domain FFX FiniteFieldExtension>>=
 )abbrev domain FFX FiniteFieldExtension
 ++ Authors: R.Sutor, J. Grabmeier, A. Scheerhorn
@@ -27663,6 +28852,97 @@ FiniteFieldExtension(GF, n): Exports == Implementation where
 \pageto{FiniteFieldExtension}{FFX}
 \pageto{InnerFiniteField}{IFF}
 \pageto{FiniteField}{FF}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{FFP}{0} &
+\cross{FFP}{1} &
+\cross{FFP}{algebraic?} \\
+\cross{FFP}{associates?} &
+\cross{FFP}{basis} &
+\cross{FFP}{characteristic} \\
+\cross{FFP}{charthRoot} &
+\cross{FFP}{coerce} &
+\cross{FFP}{conditionP} \\
+\cross{FFP}{coordinates} &
+\cross{FFP}{createNormalElement} &
+\cross{FFP}{createPrimitiveElement} \\
+\cross{FFP}{D} &
+\cross{FFP}{definingPolynomial} &
+\cross{FFP}{degree} \\
+\cross{FFP}{differentiate} &
+\cross{FFP}{dimension} &
+\cross{FFP}{discreteLog} \\
+\cross{FFP}{divide} &
+\cross{FFP}{euclideanSize} &
+\cross{FFP}{expressIdealMember} \\
+\cross{FFP}{exquo} &
+\cross{FFP}{extendedEuclidean} &
+\cross{FFP}{extensionDegree} \\
+\cross{FFP}{factor} &
+\cross{FFP}{factorsOfCyclicGroupSize} &
+\cross{FFP}{Frobenius} \\
+\cross{FFP}{gcd} &
+\cross{FFP}{gcdPolynomial} &
+\cross{FFP}{generator} \\
+\cross{FFP}{hash} &
+\cross{FFP}{index} &
+\cross{FFP}{inGroundField?} \\
+\cross{FFP}{init} &
+\cross{FFP}{inv} &
+\cross{FFP}{latex} \\
+\cross{FFP}{lcm} &
+\cross{FFP}{linearAssociatedExp} &
+\cross{FFP}{linearAssociatedLog} \\
+\cross{FFP}{linearAssociatedOrder} &
+\cross{FFP}{lookup} &
+\cross{FFP}{minimalPolynomial} \\
+\cross{FFP}{multiEuclidean} &
+\cross{FFP}{nextItem} &
+\cross{FFP}{norm} \\
+\cross{FFP}{normal?} &
+\cross{FFP}{normalElement} &
+\cross{FFP}{one?} \\
+\cross{FFP}{order} &
+\cross{FFP}{prime?} &
+\cross{FFP}{primeFrobenius} \\
+\cross{FFP}{primitive?} &
+\cross{FFP}{primitiveElement} &
+\cross{FFP}{principalIdeal} \\
+\cross{FFP}{random} &
+\cross{FFP}{recip} &
+\cross{FFP}{representationType} \\
+\cross{FFP}{represents} &
+\cross{FFP}{retract} &
+\cross{FFP}{retractIfCan} \\
+\cross{FFP}{sample} &
+\cross{FFP}{size} &
+\cross{FFP}{sizeLess?} \\
+\cross{FFP}{squareFree} &
+\cross{FFP}{squareFreePart} &
+\cross{FFP}{subtractIfCan} \\
+\cross{FFP}{tableForDiscreteLogarithm} &
+\cross{FFP}{trace} &
+\cross{FFP}{transcendenceDegree} \\
+\cross{FFP}{transcendent?} &
+\cross{FFP}{unit?} &
+\cross{FFP}{unitCanonical} \\
+\cross{FFP}{unitNormal} &
+\cross{FFP}{zero?} &
+\cross{FFP}{?*?} \\
+\cross{FFP}{?**?} &
+\cross{FFP}{?+?} &
+\cross{FFP}{?-?} \\
+\cross{FFP}{-?} &
+\cross{FFP}{?/?} &
+\cross{FFP}{?/?} \\
+\cross{FFP}{?=?} &
+\cross{FFP}{?\^{}?} &
+\cross{FFP}{?\~{}=?} \\
+\cross{FFP}{?quo?} &
+\cross{FFP}{?rem?} &
+\end{tabular}
+
 <<domain FFP FiniteFieldExtensionByPolynomial>>=
 )abbrev domain FFP FiniteFieldExtensionByPolynomial
 ++ Authors: R.Sutor, J. Grabmeier, O. Gschnitzer, A. Scheerhorn
@@ -27909,6 +29189,99 @@ FiniteFieldExtensionByPolynomial(GF:FiniteFieldCategory,_
 {\bf See}\\
 \pageto{FiniteFieldNormalBasisExtensionByPolynomial}{FFNBP}
 \pageto{FiniteFieldNormalBasisExtension}{FFNBX}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{FFNB}{0} &
+\cross{FFNB}{1} &
+\cross{FFNB}{algebraic?} \\
+\cross{FFNB}{associates?} &
+\cross{FFNB}{basis} &
+\cross{FFNB}{characteristic} \\
+\cross{FFNB}{charthRoot} &
+\cross{FFNB}{coerce} &
+\cross{FFNB}{conditionP} \\
+\cross{FFNB}{coordinates} &
+\cross{FFNB}{createNormalElement} &
+\cross{FFNB}{createPrimitiveElement} \\
+\cross{FFNB}{D} &
+\cross{FFNB}{definingPolynomial} &
+\cross{FFNB}{degree} \\
+\cross{FFNB}{differentiate} &
+\cross{FFNB}{dimension} &
+\cross{FFNB}{discreteLog} \\
+\cross{FFNB}{divide} &
+\cross{FFNB}{euclideanSize} &
+\cross{FFNB}{expressIdealMember} \\
+\cross{FFNB}{exquo} &
+\cross{FFNB}{extendedEuclidean} &
+\cross{FFNB}{extensionDegree} \\
+\cross{FFNB}{factor} &
+\cross{FFNB}{factorsOfCyclicGroupSize} &
+\cross{FFNB}{Frobenius} \\
+\cross{FFNB}{gcd} &
+\cross{FFNB}{gcdPolynomial} &
+\cross{FFNB}{generator} \\
+\cross{FFNB}{getMultiplicationMatrix} &
+\cross{FFNB}{getMultiplicationTable} &
+\cross{FFNB}{hash} \\
+\cross{FFNB}{index} &
+\cross{FFNB}{inGroundField?} &
+\cross{FFNB}{init} \\
+\cross{FFNB}{inv} &
+\cross{FFNB}{latex} &
+\cross{FFNB}{lcm} \\
+\cross{FFNB}{linearAssociatedExp} &
+\cross{FFNB}{linearAssociatedLog} &
+\cross{FFNB}{linearAssociatedOrder} \\
+\cross{FFNB}{lookup} &
+\cross{FFNB}{minimalPolynomial} &
+\cross{FFNB}{multiEuclidean} \\
+\cross{FFNB}{nextItem} &
+\cross{FFNB}{norm} &
+\cross{FFNB}{normal?} \\
+\cross{FFNB}{normalElement} &
+\cross{FFNB}{one?} &
+\cross{FFNB}{order} \\
+\cross{FFNB}{prime?} &
+\cross{FFNB}{primeFrobenius} &
+\cross{FFNB}{primitive?} \\
+\cross{FFNB}{primitiveElement} &
+\cross{FFNB}{principalIdeal} &
+\cross{FFNB}{random} \\
+\cross{FFNB}{recip} &
+\cross{FFNB}{representationType} &
+\cross{FFNB}{represents} \\
+\cross{FFNB}{retract} &
+\cross{FFNB}{retractIfCan} &
+\cross{FFNB}{sample} \\
+\cross{FFNB}{size} &
+\cross{FFNB}{sizeLess?} &
+\cross{FFNB}{sizeMultiplication} \\
+\cross{FFNB}{squareFree} &
+\cross{FFNB}{squareFreePart} &
+\cross{FFNB}{subtractIfCan} \\
+\cross{FFNB}{tableForDiscreteLogarithm} &
+\cross{FFNB}{trace} &
+\cross{FFNB}{transcendenceDegree} \\
+\cross{FFNB}{transcendent?} &
+\cross{FFNB}{unit?} &
+\cross{FFNB}{unitCanonical} \\
+\cross{FFNB}{unitNormal} &
+\cross{FFNB}{zero?} &
+\cross{FFNB}{?*?} \\
+\cross{FFNB}{?**?} &
+\cross{FFNB}{?+?} &
+\cross{FFNB}{?-?} \\
+\cross{FFNB}{-?} &
+\cross{FFNB}{?/?} &
+\cross{FFNB}{?=?} \\
+\cross{FFNB}{?\^{}?} &
+\cross{FFNB}{?\~{}=?} &
+\cross{FFNB}{?quo?} \\
+\cross{FFNB}{?rem?} &&
+\end{tabular}
+
 <<domain FFNB FiniteFieldNormalBasis>>=
 )abbrev domain FFNB FiniteFieldNormalBasis
 ++ Authors: J.Grabmeier, A.Scheerhorn
@@ -27971,6 +29344,99 @@ FiniteFieldNormalBasis(p,extdeg):_
 {\bf See}\\
 \pageto{FiniteFieldNormalBasisExtensionByPolynomial}{FFNBP}
 \pageto{FiniteFieldNormalBasis}{FFNB}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{FFNBX}{0} &
+\cross{FFNBX}{1} &
+\cross{FFNBX}{algebraic?} \\
+\cross{FFNBX}{associates?} &
+\cross{FFNBX}{basis} &
+\cross{FFNBX}{characteristic} \\
+\cross{FFNBX}{charthRoot} &
+\cross{FFNBX}{coerce} &
+\cross{FFNBX}{conditionP} \\
+\cross{FFNBX}{coordinates} &
+\cross{FFNBX}{createNormalElement} &
+\cross{FFNBX}{createPrimitiveElement} \\
+\cross{FFNBX}{D} &
+\cross{FFNBX}{definingPolynomial} &
+\cross{FFNBX}{degree} \\
+\cross{FFNBX}{differentiate} &
+\cross{FFNBX}{dimension} &
+\cross{FFNBX}{discreteLog} \\
+\cross{FFNBX}{divide} &
+\cross{FFNBX}{euclideanSize} &
+\cross{FFNBX}{expressIdealMember} \\
+\cross{FFNBX}{exquo} &
+\cross{FFNBX}{extendedEuclidean} &
+\cross{FFNBX}{extensionDegree} \\
+\cross{FFNBX}{factor} &
+\cross{FFNBX}{factorsOfCyclicGroupSize} &
+\cross{FFNBX}{Frobenius} \\
+\cross{FFNBX}{gcd} &
+\cross{FFNBX}{gcdPolynomial} &
+\cross{FFNBX}{generator} \\
+\cross{FFNBX}{getMultiplicationMatrix} &
+\cross{FFNBX}{getMultiplicationTable} &
+\cross{FFNBX}{hash} \\
+\cross{FFNBX}{index} &
+\cross{FFNBX}{inGroundField?} &
+\cross{FFNBX}{init} \\
+\cross{FFNBX}{inv} &
+\cross{FFNBX}{latex} &
+\cross{FFNBX}{lcm} \\
+\cross{FFNBX}{linearAssociatedExp} &
+\cross{FFNBX}{linearAssociatedLog} &
+\cross{FFNBX}{linearAssociatedOrder} \\
+\cross{FFNBX}{lookup} &
+\cross{FFNBX}{minimalPolynomial} &
+\cross{FFNBX}{multiEuclidean} \\
+\cross{FFNBX}{nextItem} &
+\cross{FFNBX}{norm} &
+\cross{FFNBX}{normal?} \\
+\cross{FFNBX}{normalElement} &
+\cross{FFNBX}{one?} &
+\cross{FFNBX}{order} \\
+\cross{FFNBX}{prime?} &
+\cross{FFNBX}{primeFrobenius} &
+\cross{FFNBX}{primitive?} \\
+\cross{FFNBX}{primitiveElement} &
+\cross{FFNBX}{principalIdeal} &
+\cross{FFNBX}{random} \\
+\cross{FFNBX}{recip} &
+\cross{FFNBX}{representationType} &
+\cross{FFNBX}{represents} \\
+\cross{FFNBX}{retract} &
+\cross{FFNBX}{retractIfCan} &
+\cross{FFNBX}{sample} \\
+\cross{FFNBX}{size} &
+\cross{FFNBX}{sizeLess?} &
+\cross{FFNBX}{sizeMultiplication} \\
+\cross{FFNBX}{squareFree} &
+\cross{FFNBX}{squareFreePart} &
+\cross{FFNBX}{subtractIfCan} \\
+\cross{FFNBX}{tableForDiscreteLogarithm} &
+\cross{FFNBX}{trace} &
+\cross{FFNBX}{transcendenceDegree} \\
+\cross{FFNBX}{transcendent?} &
+\cross{FFNBX}{unit?} &
+\cross{FFNBX}{unitCanonical} \\
+\cross{FFNBX}{unitNormal} &
+\cross{FFNBX}{zero?} &
+\cross{FFNBX}{?*?} \\
+\cross{FFNBX}{?**?} &
+\cross{FFNBX}{?+?} &
+\cross{FFNBX}{?-?} \\
+\cross{FFNBX}{-?} &
+\cross{FFNBX}{?/?} &
+\cross{FFNBX}{?=?} \\
+\cross{FFNBX}{?\^{}?} &
+\cross{FFNBX}{?\~{}=?} &
+\cross{FFNBX}{?quo?} \\
+\cross{FFNBX}{?rem?} &&
+\end{tabular}
+
 <<domain FFNBX FiniteFieldNormalBasisExtension>>=
 )abbrev domain FFNBX FiniteFieldNormalBasisExtension
 ++ Authors: J.Grabmeier, A.Scheerhorn
@@ -28033,6 +29499,99 @@ FiniteFieldNormalBasisExtension(GF,extdeg):_
 {\bf See}\\
 \pageto{FiniteFieldNormalBasisExtension}{FFNBX}
 \pageto{FiniteFieldNormalBasis}{FFNB}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{FFNBP}{0} &
+\cross{FFNBP}{1} &
+\cross{FFNBP}{algebraic?} \\
+\cross{FFNBP}{associates?} &
+\cross{FFNBP}{basis} &
+\cross{FFNBP}{characteristic} \\
+\cross{FFNBP}{charthRoot} &
+\cross{FFNBP}{coerce} &
+\cross{FFNBP}{conditionP} \\
+\cross{FFNBP}{coordinates} &
+\cross{FFNBP}{createNormalElement} &
+\cross{FFNBP}{createPrimitiveElement} \\
+\cross{FFNBP}{D} &
+\cross{FFNBP}{definingPolynomial} &
+\cross{FFNBP}{degree} \\
+\cross{FFNBP}{differentiate} &
+\cross{FFNBP}{dimension} &
+\cross{FFNBP}{discreteLog} \\
+\cross{FFNBP}{divide} &
+\cross{FFNBP}{euclideanSize} &
+\cross{FFNBP}{expressIdealMember} \\
+\cross{FFNBP}{exquo} &
+\cross{FFNBP}{extendedEuclidean} &
+\cross{FFNBP}{extensionDegree} \\
+\cross{FFNBP}{factor} &
+\cross{FFNBP}{factorsOfCyclicGroupSize} &
+\cross{FFNBP}{Frobenius} \\
+\cross{FFNBP}{gcd} &
+\cross{FFNBP}{gcdPolynomial} &
+\cross{FFNBP}{generator} \\
+\cross{FFNBP}{getMultiplicationMatrix} &
+\cross{FFNBP}{getMultiplicationTable} &
+\cross{FFNBP}{hash} \\
+\cross{FFNBP}{index} &
+\cross{FFNBP}{inGroundField?} &
+\cross{FFNBP}{init} \\
+\cross{FFNBP}{inv} &
+\cross{FFNBP}{latex} &
+\cross{FFNBP}{lcm} \\
+\cross{FFNBP}{linearAssociatedExp} &
+\cross{FFNBP}{linearAssociatedLog} &
+\cross{FFNBP}{linearAssociatedOrder} \\
+\cross{FFNBP}{lookup} &
+\cross{FFNBP}{minimalPolynomial} &
+\cross{FFNBP}{multiEuclidean} \\
+\cross{FFNBP}{nextItem} &
+\cross{FFNBP}{norm} &
+\cross{FFNBP}{normal?} \\
+\cross{FFNBP}{normalElement} &
+\cross{FFNBP}{one?} &
+\cross{FFNBP}{order} \\
+\cross{FFNBP}{prime?} &
+\cross{FFNBP}{primeFrobenius} &
+\cross{FFNBP}{primitive?} \\
+\cross{FFNBP}{primitiveElement} &
+\cross{FFNBP}{principalIdeal} &
+\cross{FFNBP}{recip} \\
+\cross{FFNBP}{random} &
+\cross{FFNBP}{representationType} &
+\cross{FFNBP}{represents} \\
+\cross{FFNBP}{retract} &
+\cross{FFNBP}{retractIfCan} &
+\cross{FFNBP}{sample} \\
+\cross{FFNBP}{size} &
+\cross{FFNBP}{sizeLess?} &
+\cross{FFNBP}{sizeMultiplication} \\
+\cross{FFNBP}{squareFree} &
+\cross{FFNBP}{squareFreePart} &
+\cross{FFNBP}{subtractIfCan} \\
+\cross{FFNBP}{tableForDiscreteLogarithm} &
+\cross{FFNBP}{trace} &
+\cross{FFNBP}{transcendenceDegree} \\
+\cross{FFNBP}{transcendent?} &
+\cross{FFNBP}{unit?} &
+\cross{FFNBP}{unitCanonical} \\
+\cross{FFNBP}{unitNormal} &
+\cross{FFNBP}{zero?} &
+\cross{FFNBP}{?*?} \\
+\cross{FFNBP}{?**?} &
+\cross{FFNBP}{?+?} &
+\cross{FFNBP}{?-?} \\
+\cross{FFNBP}{-?} &
+\cross{FFNBP}{?/?} &
+\cross{FFNBP}{?=?} \\
+\cross{FFNBP}{?\^{}?} &
+\cross{FFNBP}{?\~{}=?} &
+\cross{FFNBP}{?quo?} \\
+\cross{FFNBP}{?rem?} &&
+\end{tabular}
+
 <<domain FFNBP FiniteFieldNormalBasisExtensionByPolynomial>>=
 )abbrev domain FFNBP FiniteFieldNormalBasisExtensionByPolynomial
 ++ Authors: J.Grabmeier, A.Scheerhorn
@@ -28673,6 +30232,84 @@ o )show FlexibleArray
 \pageto{IndexedFlexibleArray}{IFARRAY}
 \pageto{IndexedOneDimensionalArray}{IARRAY1}
 \pageto{OneDimensionalArray}{ARRAY1}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FARRAY}{any?} &
+\cross{FARRAY}{coerce} &
+\cross{FARRAY}{concat} &
+\cross{FARRAY}{concat!} &
+\cross{FARRAY}{construct} \\
+\cross{FARRAY}{convert} &
+\cross{FARRAY}{copy} &
+\cross{FARRAY}{copyInto!} &
+\cross{FARRAY}{count} &
+\cross{FARRAY}{delete} \\
+\cross{FARRAY}{delete!} &
+\cross{FARRAY}{elt} &
+\cross{FARRAY}{empty} &
+\cross{FARRAY}{empty?} &
+\cross{FARRAY}{entries} \\
+\cross{FARRAY}{entry?} &
+\cross{FARRAY}{eq?} &
+\cross{FARRAY}{eval} &
+\cross{FARRAY}{every?} &
+\cross{FARRAY}{fill!} \\
+\cross{FARRAY}{find} &
+\cross{FARRAY}{first} &
+\cross{FARRAY}{flexibleArray} &
+\cross{FARRAY}{hash} &
+\cross{FARRAY}{index?} \\
+\cross{FARRAY}{indices} &
+\cross{FARRAY}{insert} &
+\cross{FARRAY}{insert!} &
+\cross{FARRAY}{latex} &
+\cross{FARRAY}{less?} \\
+\cross{FARRAY}{map} &
+\cross{FARRAY}{map!} &
+\cross{FARRAY}{max} &
+\cross{FARRAY}{maxIndex} &
+\cross{FARRAY}{member?} \\
+\cross{FARRAY}{members} &
+\cross{FARRAY}{merge} &
+\cross{FARRAY}{merge!} &
+\cross{FARRAY}{min} &
+\cross{FARRAY}{minIndex} \\
+\cross{FARRAY}{more?} &
+\cross{FARRAY}{new} &
+\cross{FARRAY}{parts} &
+\cross{FARRAY}{physicalLength} &
+\cross{FARRAY}{physicalLength!} \\
+\cross{FARRAY}{position} &
+\cross{FARRAY}{qelt} &
+\cross{FARRAY}{qsetelt!} &
+\cross{FARRAY}{reduce} &
+\cross{FARRAY}{remove} \\
+\cross{FARRAY}{remove!} &
+\cross{FARRAY}{removeDuplicates} &
+\cross{FARRAY}{removeDuplicates!} &
+\cross{FARRAY}{reverse} &
+\cross{FARRAY}{reverse!} \\
+\cross{FARRAY}{sample} &
+\cross{FARRAY}{select} &
+\cross{FARRAY}{select!} &
+\cross{FARRAY}{setelt} &
+\cross{FARRAY}{shrinkable} \\
+\cross{FARRAY}{size?} &
+\cross{FARRAY}{sort} &
+\cross{FARRAY}{sort!} &
+\cross{FARRAY}{sorted?} &
+\cross{FARRAY}{swap!} \\
+\cross{FARRAY}{\#{}?} &
+\cross{FARRAY}{?$<$?} &
+\cross{FARRAY}{?$<=$?} &
+\cross{FARRAY}{?=?} &
+\cross{FARRAY}{?$>$?} \\
+\cross{FARRAY}{?$>=$?} &
+\cross{FARRAY}{?\~{}=?} &
+\cross{FARRAY}{?.?} &&
+\end{tabular}
+
 <<domain FARRAY FlexibleArray>>=
 )abbrev domain FARRAY FlexibleArray
 ++ A FlexibleArray is the notion of an array intended to allow for growth
@@ -29543,6 +31180,127 @@ o )show Float
 @
 \pagehead{Float}{FLOAT}
 \pagepic{ps/v103float.ps}{FLOAT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{FLOAT}{0} &
+\cross{FLOAT}{1} &
+\cross{FLOAT}{abs} &
+\cross{FLOAT}{acos} \\
+\cross{FLOAT}{acosh} &
+\cross{FLOAT}{acot} &
+\cross{FLOAT}{acoth} &
+\cross{FLOAT}{acsc} \\
+\cross{FLOAT}{acsch} &
+\cross{FLOAT}{asec} &
+\cross{FLOAT}{asech} &
+\cross{FLOAT}{asin} \\
+\cross{FLOAT}{asinh} &
+\cross{FLOAT}{associates?} &
+\cross{FLOAT}{atan} &
+\cross{FLOAT}{atanh} \\
+\cross{FLOAT}{base} &
+\cross{FLOAT}{bits} &
+\cross{FLOAT}{ceiling} &
+\cross{FLOAT}{characteristic} \\
+\cross{FLOAT}{coerce} &
+\cross{FLOAT}{convert} &
+\cross{FLOAT}{cos} &
+\cross{FLOAT}{cosh} \\
+\cross{FLOAT}{cot} &
+\cross{FLOAT}{coth} &
+\cross{FLOAT}{csc} &
+\cross{FLOAT}{csch} \\
+\cross{FLOAT}{D} &
+\cross{FLOAT}{decreasePrecision} &
+\cross{FLOAT}{differentiate} &
+\cross{FLOAT}{digits} \\
+\cross{FLOAT}{divide} &
+\cross{FLOAT}{euclideanSize} &
+\cross{FLOAT}{exp} &
+\cross{FLOAT}{expressIdealMember} \\
+\cross{FLOAT}{exp1} &
+\cross{FLOAT}{exponent} &
+\cross{FLOAT}{exquo} &
+\cross{FLOAT}{extendedEuclidean} \\
+\cross{FLOAT}{factor} &
+\cross{FLOAT}{float} &
+\cross{FLOAT}{floor} &
+\cross{FLOAT}{fractionPart} \\
+\cross{FLOAT}{gcd} &
+\cross{FLOAT}{gcdPolynomial} &
+\cross{FLOAT}{hash} &
+\cross{FLOAT}{increasePrecision} \\
+\cross{FLOAT}{inv} &
+\cross{FLOAT}{latex} &
+\cross{FLOAT}{lcm} &
+\cross{FLOAT}{log} \\
+\cross{FLOAT}{log10} &
+\cross{FLOAT}{log2} &
+\cross{FLOAT}{mantissa} &
+\cross{FLOAT}{max} \\
+\cross{FLOAT}{min} &
+\cross{FLOAT}{multiEuclidean} &
+\cross{FLOAT}{negative?} &
+\cross{FLOAT}{norm} \\
+\cross{FLOAT}{normalize} &
+\cross{FLOAT}{nthRoot} &
+\cross{FLOAT}{OMwrite} &
+\cross{FLOAT}{one?} \\
+\cross{FLOAT}{order} &
+\cross{FLOAT}{outputFixed} &
+\cross{FLOAT}{outputFloating} &
+\cross{FLOAT}{outputGeneral} \\
+\cross{FLOAT}{outputSpacing} &
+\cross{FLOAT}{patternMatch} &
+\cross{FLOAT}{pi} &
+\cross{FLOAT}{positive?} \\
+\cross{FLOAT}{precision} &
+\cross{FLOAT}{prime?} &
+\cross{FLOAT}{principalIdeal} &
+\cross{FLOAT}{rationalApproximation} \\
+\cross{FLOAT}{recip} &
+\cross{FLOAT}{relerror} &
+\cross{FLOAT}{retract} &
+\cross{FLOAT}{retractIfCan} \\
+\cross{FLOAT}{round} &
+\cross{FLOAT}{sample} &
+\cross{FLOAT}{sec} &
+\cross{FLOAT}{sech} \\
+\cross{FLOAT}{shift} &
+\cross{FLOAT}{sign} &
+\cross{FLOAT}{sin} &
+\cross{FLOAT}{sinh} \\
+\cross{FLOAT}{sizeLess?} &
+\cross{FLOAT}{sqrt} &
+\cross{FLOAT}{squareFree} &
+\cross{FLOAT}{squareFreePart} \\
+\cross{FLOAT}{subtractIfCan} &
+\cross{FLOAT}{tan} &
+\cross{FLOAT}{tanh} &
+\cross{FLOAT}{truncate} \\
+\cross{FLOAT}{unit?} &
+\cross{FLOAT}{unitCanonical} &
+\cross{FLOAT}{unitNormal} &
+\cross{FLOAT}{wholePart} \\
+\cross{FLOAT}{zero?} &
+\cross{FLOAT}{?*?} &
+\cross{FLOAT}{?**?} &
+\cross{FLOAT}{?+?} \\
+\cross{FLOAT}{?-?} &
+\cross{FLOAT}{-?} &
+\cross{FLOAT}{?/?} &
+\cross{FLOAT}{?$<$?} \\
+\cross{FLOAT}{?$<=$?} &
+\cross{FLOAT}{?=?} &
+\cross{FLOAT}{?$>$?} &
+\cross{FLOAT}{?$>=$?} \\
+\cross{FLOAT}{?\^{}?} &
+\cross{FLOAT}{?\~{}=?} &
+\cross{FLOAT}{?quo?} &
+\cross{FLOAT}{?rem?} 
+\end{tabular}
+
 <<domain FLOAT Float>>=
 )abbrev domain FLOAT Float
 
@@ -30542,6 +32300,36 @@ Float():
 \pageto{Switch}{SWITCH}
 \pageto{FortranTemplate}{FTEM}
 \pageto{FortranExpression}{FEXPR}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FC}{assign} &
+\cross{FC}{block} &
+\cross{FC}{call} &
+\cross{FC}{code} &
+\cross{FC}{coerce} \\
+\cross{FC}{comment} &
+\cross{FC}{common} &
+\cross{FC}{cond} &
+\cross{FC}{continue} &
+\cross{FC}{forLoop} \\
+\cross{FC}{getCode} &
+\cross{FC}{goto} &
+\cross{FC}{hash} &
+\cross{FC}{latex} &
+\cross{FC}{operation} \\
+\cross{FC}{printCode} &
+\cross{FC}{printStatement} &
+\cross{FC}{repeatUntilLoop} &
+\cross{FC}{returns} &
+\cross{FC}{save} \\
+\cross{FC}{setLabelValue} &
+\cross{FC}{stop} &
+\cross{FC}{whileLoop} &
+\cross{FC}{?=?} &
+\cross{FC}{?~=?} 
+\end{tabular}
+
 <<domain FC FortranCode>>=
 )abbrev domain FC FortranCode 
 -- The FortranCode domain is used to represent operations which are to be
@@ -31153,6 +32941,78 @@ FortranCode(): public == private where
 \pageto{SimpleFortranProgram}{SFORT}
 \pageto{Switch}{SWITCH}
 \pageto{FortranTemplate}{FTEM}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FEXPR}{0} &
+\cross{FEXPR}{1} &
+\cross{FEXPR}{abs} &
+\cross{FEXPR}{acos} &
+\cross{FEXPR}{asin} \\
+\cross{FEXPR}{atan} &
+\cross{FEXPR}{belong?} &
+\cross{FEXPR}{box} &
+\cross{FEXPR}{characteristic} &
+\cross{FEXPR}{coerce} \\
+\cross{FEXPR}{cos} &
+\cross{FEXPR}{cosh} &
+\cross{FEXPR}{D} &
+\cross{FEXPR}{definingPolynomial} &
+\cross{FEXPR}{differentiate} \\
+\cross{FEXPR}{distribute} &
+\cross{FEXPR}{elt} &
+\cross{FEXPR}{eval} &
+\cross{FEXPR}{even?} &
+\cross{FEXPR}{exp} \\
+\cross{FEXPR}{freeOf?} &
+\cross{FEXPR}{hash} &
+\cross{FEXPR}{height} &
+\cross{FEXPR}{is?} &
+\cross{FEXPR}{kernel} \\
+\cross{FEXPR}{kernels} &
+\cross{FEXPR}{latex} &
+\cross{FEXPR}{log} &
+\cross{FEXPR}{log10} &
+\cross{FEXPR}{mainKernel} \\
+\cross{FEXPR}{map} &
+\cross{FEXPR}{max} &
+\cross{FEXPR}{min} &
+\cross{FEXPR}{minPoly} &
+\cross{FEXPR}{odd?} \\
+\cross{FEXPR}{one?} &
+\cross{FEXPR}{operator} &
+\cross{FEXPR}{operators} &
+\cross{FEXPR}{paren} &
+\cross{FEXPR}{pi} \\
+\cross{FEXPR}{recip} &
+\cross{FEXPR}{retract} &
+\cross{FEXPR}{retractIfCan} &
+\cross{FEXPR}{sample} &
+\cross{FEXPR}{sin} \\
+\cross{FEXPR}{sinh} &
+\cross{FEXPR}{sqrt} &
+\cross{FEXPR}{subst} &
+\cross{FEXPR}{subtractIfCan} &
+\cross{FEXPR}{tan} \\
+\cross{FEXPR}{tanh} &
+\cross{FEXPR}{tower} &
+\cross{FEXPR}{useNagFunctions} &
+\cross{FEXPR}{variables} &
+\cross{FEXPR}{zero?} \\
+\cross{FEXPR}{?*?} &
+\cross{FEXPR}{?**?} &
+\cross{FEXPR}{?+?} &
+\cross{FEXPR}{-?} &
+\cross{FEXPR}{?-?} \\
+\cross{FEXPR}{?$<$?} &
+\cross{FEXPR}{?$<=$?} &
+\cross{FEXPR}{?=?} &
+\cross{FEXPR}{?$>$?} &
+\cross{FEXPR}{?$>=$?} \\
+\cross{FEXPR}{?\^{}?} &
+\cross{FEXPR}{?\~{}=?} &&&
+\end{tabular}
+
 <<domain FEXPR FortranExpression>>=
 )abbrev domain FEXPR FortranExpression
 ++ Author: Mike Dewar
@@ -31515,8 +33375,15 @@ FortranExpression(basicSymbols,subscriptedSymbols,R):
 \pageto{Switch}{SWITCH}
 \pageto{FortranTemplate}{FTEM}
 \pageto{FortranExpression}{FEXPR}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{FORTRAN}{coerce} &
+\cross{FORTRAN}{outputAsFortran}
+\end{tabular}
+
 <<domain FORTRAN FortranProgram>>=
-)abbrev domain FORTRAN FortranProgram
+)abbrev domain FORTRAN FortranProgra\\
 ++ Author: Mike Dewar
 ++ Date Created: October 1992
 ++ Date Last Updated: 13 January 1994
@@ -31753,6 +33620,20 @@ FortranProgram(name,returnType,arguments,symbols): Exports == Implement where
 \pageto{FortranType}{FT}
 \pageto{SymbolTable}{SYMTAB}
 \pageto{TheSymbolTable}{SYMS}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllllll}
+\cross{FST}{character?} &
+\cross{FST}{coerce} &
+\cross{FST}{complex?} &
+\cross{FST}{double?} &
+\cross{FST}{doubleComplex?} &
+\cross{FST}{integer?} &
+\cross{FST}{logical?} &
+\cross{FST}{real?} &
+\cross{FST}{?=?} 
+\end{tabular}
+
 <<domain FST FortranScalarType>>=
 )abbrev domain FST FortranScalarType
 ++ Author: Mike Dewar
@@ -31924,6 +33805,27 @@ FortranScalarType() : exports == implementation where
 \pageto{SimpleFortranProgram}{SFORT}
 \pageto{Switch}{SWITCH}
 \pageto{FortranExpression}{FEXPR}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FTEM}{close!} &
+\cross{FTEM}{coerce} &
+\cross{FTEM}{fortranCarriageReturn} &
+\cross{FTEM}{fortranLiteral} &
+\cross{FTEM}{fortranLiteralLine} \\
+\cross{FTEM}{hash} &
+\cross{FTEM}{iomode} &
+\cross{FTEM}{latex} &
+\cross{FTEM}{name} &
+\cross{FTEM}{open} \\
+\cross{FTEM}{processTemplate} &
+\cross{FTEM}{read!} &
+\cross{FTEM}{reopen!} &
+\cross{FTEM}{write!} &
+\cross{FTEM}{?=?} \\
+\cross{FTEM}{?\~{}=?} &&&&
+\end{tabular}
+
 <<domain FTEM FortranTemplate>>=
 )abbrev domain FTEM FortranTemplate
 ++ Author: Mike Dewar
@@ -32029,6 +33931,27 @@ FortranTemplate() : specification == implementation where
 \pageto{FortranScalarType}{FST}
 \pageto{SymbolTable}{SYMTAB}
 \pageto{TheSymbolTable}{SYMS}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FT}{coerce} &
+\cross{FT}{construct} &
+\cross{FT}{dimensionsOf} &
+\cross{FT}{external?} &
+\cross{FT}{fortranCharacter} \\
+\cross{FT}{fortranComplex} &
+\cross{FT}{fortranDouble} &
+\cross{FT}{fortranDoubleComplex} &
+\cross{FT}{fortranInteger} &
+\cross{FT}{fortranLogical} \\
+\cross{FT}{fortranReal} &
+\cross{FT}{hash} &
+\cross{FT}{latex} &
+\cross{FT}{scalarTypeOf} &
+\cross{FT}{?=?} \\
+\cross{FT}{?\~{}=?} &&&&
+\end{tabular}
+
 <<domain FT FortranType>>=
 )abbrev domain FT FortranType 
 ++ Author: Mike Dewar
@@ -32149,6 +34072,26 @@ FortranType() : exports == implementation where
 \pagepic{ps/v103fouriercomponent.ps}{FCOMP}{1.00}
 {\bf See}\\
 \pageto{FourierSeries}{FSERIES}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FCOMP}{argument} &
+\cross{FCOMP}{coerce} &
+\cross{FCOMP}{cos} &
+\cross{FCOMP}{hash} &
+\cross{FCOMP}{latex} \\
+\cross{FCOMP}{max} &
+\cross{FCOMP}{min} &
+\cross{FCOMP}{sin} &
+\cross{FCOMP}{sin?} &
+\cross{FCOMP}{?\~{}=?} \\
+\cross{FCOMP}{?$<$?} &
+\cross{FCOMP}{?$<=$?} &
+\cross{FCOMP}{?=?} &
+\cross{FCOMP}{?$>$?} &
+\cross{FCOMP}{?$>=$?} 
+\end{tabular}
+
 <<domain FCOMP FourierComponent>>=
 )abbrev domain FCOMP FourierComponent
 ++ Author: James Davenport
@@ -32203,6 +34146,32 @@ FourierComponent(E:OrderedSet):
 \pagepic{ps/v103fourierseries.ps}{FSERIES}{1.00}
 {\bf See}\\
 \pageto{FourierComponent}{FCOMP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FSERIES}{0} &
+\cross{FSERIES}{1} &
+\cross{FSERIES}{characteristic} &
+\cross{FSERIES}{coerce} &
+\cross{FSERIES}{hash} \\
+\cross{FSERIES}{latex} &
+\cross{FSERIES}{makeCos} &
+\cross{FSERIES}{makeSin} &
+\cross{FSERIES}{one?} &
+\cross{FSERIES}{recip} \\
+\cross{FSERIES}{sample} &
+\cross{FSERIES}{subtractIfCan} &
+\cross{FSERIES}{zero?} &
+\cross{FSERIES}{?\~{}=?} &
+\cross{FSERIES}{?*?} \\
+\cross{FSERIES}{?**?} &
+\cross{FSERIES}{?\^{}?} &
+\cross{FSERIES}{?+?} &
+\cross{FSERIES}{?-?} &
+\cross{FSERIES}{-?} \\
+\cross{FSERIES}{?=?} &&&&
+\end{tabular}
+
 <<domain FSERIES FourierSeries>>=
 )abbrev domain FSERIES FourierSeries
 ++ Author: James Davenport
@@ -32541,6 +34510,91 @@ o )show Fraction
 {\bf See}\\
 \pageto{Localize}{LO}
 \pageto{LocalAlgebra}{LA}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{FRAC}{0} &
+\cross{FRAC}{1} &
+\cross{FRAC}{abs} \\
+\cross{FRAC}{associates?} &
+\cross{FRAC}{characteristic} &
+\cross{FRAC}{charthRoot} \\
+\cross{FRAC}{ceiling} &
+\cross{FRAC}{coerce} &
+\cross{FRAC}{conditionP} \\
+\cross{FRAC}{convert} &
+\cross{FRAC}{D} &
+\cross{FRAC}{denom} \\
+\cross{FRAC}{denominator} &
+\cross{FRAC}{differentiate} &
+\cross{FRAC}{divide} \\
+\cross{FRAC}{euclideanSize} &
+\cross{FRAC}{eval} &
+\cross{FRAC}{expressIdealMember} \\
+\cross{FRAC}{exquo} &
+\cross{FRAC}{extendedEuclidean} &
+\cross{FRAC}{factor} \\
+\cross{FRAC}{factorPolynomial} &
+\cross{FRAC}{factorSquareFreePolynomial} &
+\cross{FRAC}{floor} \\
+\cross{FRAC}{fractionPart} &
+\cross{FRAC}{gcd} &
+\cross{FRAC}{gcdPolynomial} \\
+\cross{FRAC}{hash} &
+\cross{FRAC}{init} &
+\cross{FRAC}{inv} \\
+\cross{FRAC}{latex} &
+\cross{FRAC}{lcm} &
+\cross{FRAC}{map} \\
+\cross{FRAC}{max} &
+\cross{FRAC}{min} &
+\cross{FRAC}{multiEuclidean} \\
+\cross{FRAC}{negative?} &
+\cross{FRAC}{nextItem} &
+\cross{FRAC}{numer} \\
+\cross{FRAC}{numerator} &
+\cross{FRAC}{OMwrite} &
+\cross{FRAC}{one?} \\
+\cross{FRAC}{patternMatch} &
+\cross{FRAC}{positive?} &
+\cross{FRAC}{prime?} \\
+\cross{FRAC}{principalIdeal} &
+\cross{FRAC}{random} &
+\cross{FRAC}{recip} \\
+\cross{FRAC}{reducedSystem} &
+\cross{FRAC}{retract} &
+\cross{FRAC}{retractIfCan} \\
+\cross{FRAC}{sample} &
+\cross{FRAC}{sign} &
+\cross{FRAC}{sizeLess?} \\
+\cross{FRAC}{solveLinearPolynomialEquation} &
+\cross{FRAC}{squareFree} &
+\cross{FRAC}{squareFreePart} \\
+\cross{FRAC}{squareFreePolynomial} &
+\cross{FRAC}{subtractIfCan} &
+\cross{FRAC}{unit?} \\
+\cross{FRAC}{unitCanonical} &
+\cross{FRAC}{unitNormal} &
+\cross{FRAC}{wholePart} \\
+\cross{FRAC}{zero?} &
+\cross{FRAC}{?*?} &
+\cross{FRAC}{?**?} \\
+\cross{FRAC}{?+?} &
+\cross{FRAC}{?-?} &
+\cross{FRAC}{-?} \\
+\cross{FRAC}{?/?} &
+\cross{FRAC}{?=?} &
+\cross{FRAC}{?\^{}?} \\
+\cross{FRAC}{?\~{}=?} &
+\cross{FRAC}{?$<$?} &
+\cross{FRAC}{?$<=$?} \\
+\cross{FRAC}{?$>$?} &
+\cross{FRAC}{?$>=$?} &
+\cross{FRAC}{?.?} \\
+\cross{FRAC}{?quo?} &
+\cross{FRAC}{?rem?} &
+\end{tabular}
+
 <<domain FRAC Fraction>>=
 )abbrev domain FRAC Fraction
 ++ Author:
@@ -32882,6 +34936,36 @@ Fraction(S: IntegralDomain): QuotientFieldCategory S with
 \pageto{FramedModule}{FRMOD}
 \pageto{HyperellipticFiniteDivisor}{HELLFDIV}
 \pageto{FiniteDivisor}{FDIV}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FRIDEAL}{1} &
+\cross{FRIDEAL}{basis} &
+\cross{FRIDEAL}{coerce} &
+\cross{FRIDEAL}{commutator} &
+\cross{FRIDEAL}{conjugate} \\
+\cross{FRIDEAL}{denom} &
+\cross{FRIDEAL}{hash} &
+\cross{FRIDEAL}{ideal} &
+\cross{FRIDEAL}{inv} &
+\cross{FRIDEAL}{latex} \\
+\cross{FRIDEAL}{minimize} &
+\cross{FRIDEAL}{norm} &
+\cross{FRIDEAL}{numer} &
+\cross{FRIDEAL}{one?} &
+\cross{FRIDEAL}{randomLC} \\
+\cross{FRIDEAL}{recip} &
+\cross{FRIDEAL}{sample} &
+\cross{FRIDEAL}{?\~{}=?} &
+\cross{FRIDEAL}{?**?} &
+\cross{FRIDEAL}{?\^{}?} \\
+\cross{FRIDEAL}{?*?} &
+\cross{FRIDEAL}{?**?} &
+\cross{FRIDEAL}{?/?} &
+\cross{FRIDEAL}{?=?} &
+\cross{FRIDEAL}{?\^{}?} 
+\end{tabular}
+
 <<domain FRIDEAL FractionalIdeal>>=
 )abbrev domain FRIDEAL FractionalIdeal
 ++ Author: Manuel Bronstein
@@ -33064,6 +35148,27 @@ FractionalIdeal(R, F, UP, A): Exports == Implementation where
 \pageto{FractionalIdeal}{FRIDEAL}
 \pageto{HyperellipticFiniteDivisor}{HELLFDIV}
 \pageto{FiniteDivisor}{FDIV}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FRMOD}{1} &
+\cross{FRMOD}{basis} &
+\cross{FRMOD}{coerce} &
+\cross{FRMOD}{hash} &
+\cross{FRMOD}{latex} \\
+\cross{FRMOD}{module} &
+\cross{FRMOD}{norm} &
+\cross{FRMOD}{one?} &
+\cross{FRMOD}{recip} &
+\cross{FRMOD}{sample} \\
+\cross{FRMOD}{?\~{}=?} &
+\cross{FRMOD}{?**?} &
+\cross{FRMOD}{?\^{}?} &
+\cross{FRMOD}{?*?} &
+\cross{FRMOD}{?**?} \\
+\cross{FRMOD}{?=?} &&&&
+\end{tabular}
+
 <<domain FRMOD FramedModule>>=
 )abbrev domain FRMOD FramedModule
 ++ Author: Manuel Bronstein
@@ -33246,6 +35351,32 @@ FreeAbelianGroup(S:SetCategory): Exports == Implementation where
 \pageto{FreeGroup}{FGROUP}
 \pageto{InnerFreeAbelianMonoid}{IFAMON}
 \pageto{FreeAbelianGroup}{FAGROUP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FAMONOID}{0} &
+\cross{FAMONOID}{coefficient} &
+\cross{FAMONOID}{coerce} &
+\cross{FAMONOID}{hash} &
+\cross{FAMONOID}{highCommonTerms} \\
+\cross{FAMONOID}{latex} &
+\cross{FAMONOID}{mapCoef} &
+\cross{FAMONOID}{mapGen} &
+\cross{FAMONOID}{nthCoef} &
+\cross{FAMONOID}{nthFactor} \\
+\cross{FAMONOID}{retract} &
+\cross{FAMONOID}{retractIfCan} &
+\cross{FAMONOID}{sample} &
+\cross{FAMONOID}{size} &
+\cross{FAMONOID}{subtractIfCan} \\
+\cross{FAMONOID}{terms} &
+\cross{FAMONOID}{zero?} &
+\cross{FAMONOID}{?\~{}=?} &
+\cross{FAMONOID}{?*?} &
+\cross{FAMONOID}{?+?} \\
+\cross{FAMONOID}{?=?} &&&&
+\end{tabular}
+
 <<domain FAMONOID FreeAbelianMonoid>>=
 )abbrev domain FAMONOID FreeAbelianMonoid
 ++ Free abelian monoid on any set of generators
@@ -33277,6 +35408,35 @@ FreeAbelianMonoid(S: SetCategory):
 \pageto{InnerFreeAbelianMonoid}{IFAMON}
 \pageto{FreeAbelianMonoid}{FAMONOID}
 \pageto{FreeAbelianGroup}{FAGROUP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FGROUP}{1} &
+\cross{FGROUP}{coerce} &
+\cross{FGROUP}{commutator} &
+\cross{FGROUP}{conjugate} &
+\cross{FGROUP}{factors} \\
+\cross{FGROUP}{hash} &
+\cross{FGROUP}{inv} &
+\cross{FGROUP}{latex} &
+\cross{FGROUP}{mapExpon} &
+\cross{FGROUP}{mapGen} \\
+\cross{FGROUP}{nthExpon} &
+\cross{FGROUP}{nthFactor} &
+\cross{FGROUP}{one?} &
+\cross{FGROUP}{recip} &
+\cross{FGROUP}{retract} \\
+\cross{FGROUP}{retractIfCan} &
+\cross{FGROUP}{sample} &
+\cross{FGROUP}{size} &
+\cross{FGROUP}{?\~{}=?} &
+\cross{FGROUP}{?**?} \\
+\cross{FGROUP}{?\^{}?} &
+\cross{FGROUP}{?*?} &
+\cross{FGROUP}{?/?} &
+\cross{FGROUP}{?=?} &
+\end{tabular}
+
 <<domain FGROUP FreeGroup>>=
 )abbrev domain FGROUP FreeGroup
 ++ Free group on any set of generators
@@ -33354,6 +35514,29 @@ FreeGroup(S: SetCategory): Join(Group, RetractableTo S) with
 \pageto{PolynomialRing}{PR}
 \pageto{SparseUnivariatePolynomial}{SUP}
 \pageto{UnivariatePolynomial}{UP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FM}{0} &
+\cross{FM}{coerce} &
+\cross{FM}{hash} &
+\cross{FM}{latex} &
+\cross{FM}{leadingCoefficient} \\
+\cross{FM}{leadingSupport} &
+\cross{FM}{map} &
+\cross{FM}{monomial} &
+\cross{FM}{reductum} &
+\cross{FM}{sample} \\
+\cross{FM}{subtractIfCan} &
+\cross{FM}{zero?} &
+\cross{FM}{?\~{}=?} &
+\cross{FM}{?*?} &
+\cross{FM}{?+?} \\
+\cross{FM}{?-?} &
+\cross{FM}{-?} &
+\cross{FM}{?=?} &&
+\end{tabular}
+
 <<domain FM FreeModule>>=
 )abbrev domain FM FreeModule
 ++ Author: Dave Barton, James Davenport, Barry Trager
@@ -33433,6 +35616,38 @@ FreeModule(R:Ring,S:OrderedSet):
 \section{domain FM1 FreeModule1}
 \pagehead{FreeModule1}{FM1}
 \pagepic{ps/v103freemodule1.ps}{FM1}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FM1}{0} &
+\cross{FM1}{coefficient} &
+\cross{FM1}{coefficients} &
+\cross{FM1}{coerce} &
+\cross{FM1}{hash} \\
+\cross{FM1}{latex} &
+\cross{FM1}{leadingCoefficient} &
+\cross{FM1}{leadingMonomial} &
+\cross{FM1}{leadingTerm} &
+\cross{FM1}{ListOfTerms} \\
+\cross{FM1}{map} &
+\cross{FM1}{monom} &
+\cross{FM1}{monomial?} &
+\cross{FM1}{monomials} &
+\cross{FM1}{numberOfMonomials} \\
+\cross{FM1}{reductum} &
+\cross{FM1}{retract} &
+\cross{FM1}{retractIfCan} &
+\cross{FM1}{sample} &
+\cross{FM1}{subtractIfCan} \\
+\cross{FM1}{zero?} &
+\cross{FM1}{?\~{}=?} &
+\cross{FM1}{?*?} &
+\cross{FM1}{?+?} &
+\cross{FM1}{?-?} \\
+\cross{FM1}{-?} &
+\cross{FM1}{?=?} &&&
+\end{tabular}
+
 <<domain FM1 FreeModule1>>=
 )abbrev domain FM1 FreeModule1
 ++ Author: Michel Petitot petitot@lifl.fr
@@ -33550,6 +35765,43 @@ FreeModule1(R:Ring,S:OrderedSet): FMcat == FMdef where
 \pageto{InnerFreeAbelianMonoid}{IFAMON}
 \pageto{FreeAbelianMonoid}{FAMONOID}
 \pageto{FreeAbelianGroup}{FAGROUP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FMONOID}{1} &
+\cross{FMONOID}{coerce} &
+\cross{FMONOID}{divide} &
+\cross{FMONOID}{factors} &
+\cross{FMONOID}{hash} \\
+\cross{FMONOID}{hclf} &
+\cross{FMONOID}{hcrf} &
+\cross{FMONOID}{latex} &
+\cross{FMONOID}{lquo} &
+\cross{FMONOID}{mapExpon} \\
+\cross{FMONOID}{mapGen} &
+\cross{FMONOID}{max} &
+\cross{FMONOID}{min} &
+\cross{FMONOID}{nthExpon} &
+\cross{FMONOID}{nthFactor} \\
+\cross{FMONOID}{one?} &
+\cross{FMONOID}{overlap} &
+\cross{FMONOID}{recip} &
+\cross{FMONOID}{rquo} &
+\cross{FMONOID}{retract} \\
+\cross{FMONOID}{retractIfCan} &
+\cross{FMONOID}{sample} &
+\cross{FMONOID}{size} &
+\cross{FMONOID}{?\~{}=?} &
+\cross{FMONOID}{?**?} \\
+\cross{FMONOID}{?$<$?} &
+\cross{FMONOID}{?$<=$?} &
+\cross{FMONOID}{?$>$?} &
+\cross{FMONOID}{?$>=$?} &
+\cross{FMONOID}{?\^{}?} \\
+\cross{FMONOID}{?*?} &
+\cross{FMONOID}{?=?} &&&
+\end{tabular}
+
 <<domain FMONOID FreeMonoid>>=
 )abbrev domain FMONOID FreeMonoid
 ++ Free monoid on any set of generators
@@ -33747,6 +35999,35 @@ FreeMonoid(S: SetCategory): FMcategory == FMdefinition where
 {\bf See}\\
 \pageto{OrdSetInts}{OSI}
 \pageto{Commutator}{COMM}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FNLA}{0} &
+\cross{FNLA}{antiCommutator} &
+\cross{FNLA}{associator} &
+\cross{FNLA}{coerce} &
+\cross{FNLA}{commutator} \\
+\cross{FNLA}{deepExpand} &
+\cross{FNLA}{dimension} &
+\cross{FNLA}{generator} &
+\cross{FNLA}{hash} &
+\cross{FNLA}{latex} \\
+\cross{FNLA}{leftPower} &
+\cross{FNLA}{plenaryPower} &
+\cross{FNLA}{rightPower} &
+\cross{FNLA}{sample} &
+\cross{FNLA}{shallowExpand} \\
+\cross{FNLA}{subtractIfCan} &
+\cross{FNLA}{zero?} &
+\cross{FNLA}{?\~{}=?} &
+\cross{FNLA}{?*?} &
+\cross{FNLA}{?**?} \\
+\cross{FNLA}{?+?} &
+\cross{FNLA}{?-?} &
+\cross{FNLA}{-?} &
+\cross{FNLA}{?=?} &
+\end{tabular}
+
 <<domain FNLA FreeNilpotentLie>>=
 )abbrev domain FNLA FreeNilpotentLie
 ++ Author: Larry Lambe
@@ -34347,6 +36628,24 @@ o )show FullPartialFractionExpansion
 @
 \pagehead{FullPartialFractionExpansion}{FPARFRAC}
 \pagepic{ps/v103fullpartialfractionexpansion.ps}{FPARFRAC}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FPARFRAC}{coerce} &
+\cross{FPARFRAC}{construct} &
+\cross{FPARFRAC}{convert} &
+\cross{FPARFRAC}{D} &
+\cross{FPARFRAC}{differentiate} \\
+\cross{FPARFRAC}{hash} &
+\cross{FPARFRAC}{latex} &
+\cross{FPARFRAC}{polyPart} &
+\cross{FPARFRAC}{fracPart} &
+\cross{FPARFRAC}{fullPartialFraction} \\
+\cross{FPARFRAC}{?\~{}=?} &
+\cross{FPARFRAC}{?+?} &
+\cross{FPARFRAC}{?=?} &&
+\end{tabular}
+
 <<domain FPARFRAC FullPartialFractionExpansion>>=
 )abbrev domain FPARFRAC FullPartialFractionExpansion
 ++ Full partial fraction expansion of rational functions
@@ -34534,6 +36833,17 @@ FullPartialFractionExpansion(F, UP): Exports == Implementation where
 \section{domain FUNCTION FunctionCalled}
 \pagehead{FunctionCalled}{FUNCTION}
 \pagepic{ps/v103functioncalled.ps}{FUNCTION}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{FUNCTION}{coerce} &
+\cross{FUNCTION}{hash} &
+\cross{FUNCTION}{latex} &
+\cross{FUNCTION}{name} &
+\cross{FUNCTION}{?=?} &
+\cross{FUNCTION}{?\~{}=?} 
+\end{tabular}
+
 <<domain FUNCTION FunctionCalled>>=
 )abbrev domain FUNCTION FunctionCalled
 ++ Description:
diff --git a/changelog b/changelog
index b0353c8..77d2ba3 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20090115 tpd src/axiom-website/patches.html 20090115.01.tpd.patch
+20090115 tpd books/bookvol10.3 add exports
 20090114 tpd src/axiom-website/patches.html 20090114.01.tpd.patch
 20090114 tpd books/bookvol10.3 add exports
 20090113 tpd src/axiom-website/patches.html 20090113.01.tpd.patch
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index ede4471..bb45eb9 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -879,6 +879,8 @@ bookvol10.3 redraw graphs based on dotabb<br/>
 bookvol10.3 begin adding exports<br/>
 <a href="patches/20090114.01.tpd.patch">20090114.01.tpd.patch</a>
 bookvol10.3 add exports<br/>
+<a href="patches/20090115.01.tpd.patch">20090115.01.tpd.patch</a>
+bookvol10.3 add exports<br/>
 
  </body>
 </html>

\start
Date: Fri, 16 Jan 2009 09:53:14 -0600
From: Tim Daly
To: list
Subject: 20090116.01.tpd.patch (bookvol10.3 add exports)

Add Exports information for chapter G to chapter I
==============================================================
diff --git a/books/bookvol10.3.pamphlet b/books/bookvol10.3.pamphlet
index 27fff7d..e62139d 100644
--- a/books/bookvol10.3.pamphlet
+++ b/books/bookvol10.3.pamphlet
@@ -37082,6 +37082,93 @@ o )show GeneralDistributedMultivariatePolynomial
 {\bf See}\\
 \pageto{DistributedMultivariatePolynomial}{DMP}
 \pageto{HomogeneousDistributedMultivariatePolynomial}{HDMP}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{GDMP}{0} &
+\cross{GDMP}{1} &
+\cross{GDMP}{associates?} \\
+\cross{GDMP}{binomThmExpt} &
+\cross{GDMP}{characteristic} &
+\cross{GDMP}{charthRoot} \\
+\cross{GDMP}{coefficient} &
+\cross{GDMP}{coefficients} &
+\cross{GDMP}{coerce} \\
+\cross{GDMP}{conditionP} &
+\cross{GDMP}{content} &
+\cross{GDMP}{D} \\
+\cross{GDMP}{degree} &
+\cross{GDMP}{differentiate} &
+\cross{GDMP}{discriminant} \\
+\cross{GDMP}{eval} &
+\cross{GDMP}{exquo} &
+\cross{GDMP}{factor} \\
+\cross{GDMP}{factorPolynomial} &
+\cross{GDMP}{factorSquareFreePolynomial} &
+\cross{GDMP}{gcd} \\
+\cross{GDMP}{gcdPolynomial} &
+\cross{GDMP}{ground} &
+\cross{GDMP}{ground?} \\
+\cross{GDMP}{hash} &
+\cross{GDMP}{isExpt} &
+\cross{GDMP}{isPlus} \\
+\cross{GDMP}{isTimes} &
+\cross{GDMP}{latex} &
+\cross{GDMP}{lcm} \\
+\cross{GDMP}{leadingCoefficient} &
+\cross{GDMP}{leadingMonomial} &
+\cross{GDMP}{mainVariable} \\
+\cross{GDMP}{map} &
+\cross{GDMP}{mapExponents} &
+\cross{GDMP}{max} \\
+\cross{GDMP}{min} &
+\cross{GDMP}{minimumDegree} &
+\cross{GDMP}{monicDivide} \\
+\cross{GDMP}{monomial} &
+\cross{GDMP}{monomial?} &
+\cross{GDMP}{monomials} \\
+\cross{GDMP}{multivariate} &
+\cross{GDMP}{numberOfMonomials} &
+\cross{GDMP}{one?} \\
+\cross{GDMP}{patternMatch} &
+\cross{GDMP}{pomopo!} &
+\cross{GDMP}{prime?} \\
+\cross{GDMP}{primitiveMonomials} &
+\cross{GDMP}{primitivePart} &
+\cross{GDMP}{recip} \\
+\cross{GDMP}{reducedSystem} &
+\cross{GDMP}{reductum} &
+\cross{GDMP}{reorder} \\
+\cross{GDMP}{resultant} &
+\cross{GDMP}{retract} &
+\cross{GDMP}{retractIfCan} \\
+\cross{GDMP}{sample} &
+\cross{GDMP}{solveLinearPolynomialEquation} &
+\cross{GDMP}{squareFree} \\
+\cross{GDMP}{squareFreePart} &
+\cross{GDMP}{squareFreePolynomial} &
+\cross{GDMP}{subtractIfCan} \\
+\cross{GDMP}{totalDegree} &
+\cross{GDMP}{unit?} &
+\cross{GDMP}{unitCanonical} \\
+\cross{GDMP}{unitNormal} &
+\cross{GDMP}{univariate} &
+\cross{GDMP}{variables} \\
+\cross{GDMP}{zero?} &
+\cross{GDMP}{?*?} &
+\cross{GDMP}{?**?} \\
+\cross{GDMP}{?+?} &
+\cross{GDMP}{?-?} &
+\cross{GDMP}{-?} \\
+\cross{GDMP}{?=?} &
+\cross{GDMP}{?\~{}=?} &
+\cross{GDMP}{?$<$?} \\
+\cross{GDMP}{?$<=$?} &
+\cross{GDMP}{?$>$?} &
+\cross{GDMP}{?$>=$?} \\
+\cross{GDMP}{?\^{}?} &&
+\end{tabular}
+
 <<domain GDMP GeneralDistributedMultivariatePolynomial>>=
 )abbrev domain GDMP GeneralDistributedMultivariatePolynomial
 ++ Author: Barry Trager
@@ -37345,6 +37432,33 @@ GeneralDistributedMultivariatePolynomial(vl,R,E): public == private where
 \pagepic{ps/v103generalmodulepolynomial.ps}{GMODPOL}{1.00}
 {\bf See}\\
 \pageto{ModuleMonomial}{MODMONOM}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{GMODPOL}{0} &
+\cross{GMODPOL}{build} &
+\cross{GMODPOL}{coerce} &
+\cross{GMODPOL}{hash} &
+\cross{GMODPOL}{latex} \\
+\cross{GMODPOL}{leadingCoefficient} &
+\cross{GMODPOL}{leadingExponent} &
+\cross{GMODPOL}{leadingIndex} &
+\cross{GMODPOL}{leadingMonomial} &
+\cross{GMODPOL}{monomial} \\
+\cross{GMODPOL}{multMonom} &
+\cross{GMODPOL}{reductum} &
+\cross{GMODPOL}{sample} &
+\cross{GMODPOL}{subtractIfCan} &
+\cross{GMODPOL}{unitVector} \\
+\cross{GMODPOL}{zero?} &
+\cross{GMODPOL}{?\~{}=?} &
+\cross{GMODPOL}{?*?} &
+\cross{GMODPOL}{?+?} &
+\cross{GMODPOL}{?-?} \\
+\cross{GMODPOL}{-?} &
+\cross{GMODPOL}{?=?} &&&
+\end{tabular}
+
 <<domain GMODPOL GeneralModulePolynomial>>=
 )abbrev domain GMODPOL GeneralModulePolynomial
 ++ Description:
@@ -37427,6 +37541,105 @@ GeneralModulePolynomial(vl, R, IS, E, ff, P): public  ==  private where
 \section{domain GCNAALG GenericNonAssociativeAlgebra}
 \pagehead{GenericNonAssociativeAlgebra}{GCNAALG}
 \pagepic{ps/v103genericnonassociativealgebra.ps}{GCNAALG}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{GCNAALG}{0} &
+\cross{GCNAALG}{alternative?} \\
+\cross{GCNAALG}{antiAssociative?} &
+\cross{GCNAALG}{antiCommutative?} \\
+\cross{GCNAALG}{antiCommutator} &
+\cross{GCNAALG}{apply} \\
+\cross{GCNAALG}{associative?} &
+\cross{GCNAALG}{associator} \\
+\cross{GCNAALG}{associatorDependence} &
+\cross{GCNAALG}{basis} \\
+\cross{GCNAALG}{coerce} &
+\cross{GCNAALG}{commutative?} \\
+\cross{GCNAALG}{commutator} &
+\cross{GCNAALG}{conditionsForIdempotents} \\
+\cross{GCNAALG}{convert} &
+\cross{GCNAALG}{convert} \\
+\cross{GCNAALG}{coordinates} &
+\cross{GCNAALG}{coordinates} \\
+\cross{GCNAALG}{coordinates} &
+\cross{GCNAALG}{coordinates} \\
+\cross{GCNAALG}{flexible?} &
+\cross{GCNAALG}{generic} \\
+\cross{GCNAALG}{genericLeftDiscriminant} &
+\cross{GCNAALG}{genericLeftMinimalPolynomial} \\
+\cross{GCNAALG}{genericLeftNorm} &
+\cross{GCNAALG}{genericLeftTrace} \\
+\cross{GCNAALG}{genericLeftTraceForm} &
+\cross{GCNAALG}{genericRightDiscriminant} \\
+\cross{GCNAALG}{genericRightMinimalPolynomial} &
+\cross{GCNAALG}{genericRightNorm} \\
+\cross{GCNAALG}{genericRightTrace} &
+\cross{GCNAALG}{genericRightTraceForm} \\
+\cross{GCNAALG}{hash} &
+\cross{GCNAALG}{jacobiIdentity?} \\
+\cross{GCNAALG}{jordanAdmissible?} &
+\cross{GCNAALG}{jordanAlgebra?} \\
+\cross{GCNAALG}{latex} &
+\cross{GCNAALG}{leftAlternative?} \\
+\cross{GCNAALG}{leftCharacteristicPolynomial} &
+\cross{GCNAALG}{leftDiscriminant} \\
+\cross{GCNAALG}{leftDiscriminant} &
+\cross{GCNAALG}{leftMinimalPolynomial} \\
+\cross{GCNAALG}{leftNorm} &
+\cross{GCNAALG}{leftPower} \\
+\cross{GCNAALG}{leftRankPolynomial} &
+\cross{GCNAALG}{leftRankPolynomial} \\
+\cross{GCNAALG}{leftRecip} &
+\cross{GCNAALG}{leftRegularRepresentation} \\
+\cross{GCNAALG}{leftRegularRepresentation} &
+\cross{GCNAALG}{leftTrace} \\
+\cross{GCNAALG}{leftTraceMatrix} &
+\cross{GCNAALG}{leftTraceMatrix} \\
+\cross{GCNAALG}{leftUnit} &
+\cross{GCNAALG}{leftUnits} \\
+\cross{GCNAALG}{lieAdmissible?} &
+\cross{GCNAALG}{lieAlgebra?} \\
+\cross{GCNAALG}{noncommutativeJordanAlgebra?} &
+\cross{GCNAALG}{plenaryPower} \\
+\cross{GCNAALG}{powerAssociative?} &
+\cross{GCNAALG}{rank} \\
+\cross{GCNAALG}{recip} &
+\cross{GCNAALG}{represents} \\
+\cross{GCNAALG}{rightAlternative?} &
+\cross{GCNAALG}{rightCharacteristicPolynomial} \\
+\cross{GCNAALG}{rightDiscriminant} &
+\cross{GCNAALG}{rightDiscriminant} \\
+\cross{GCNAALG}{rightMinimalPolynomial} &
+\cross{GCNAALG}{rightNorm} \\
+\cross{GCNAALG}{rightPower} &
+\cross{GCNAALG}{rightRankPolynomial} \\
+\cross{GCNAALG}{rightRankPolynomial} &
+\cross{GCNAALG}{rightRecip} \\
+\cross{GCNAALG}{rightRegularRepresentation} &
+\cross{GCNAALG}{rightRegularRepresentation} \\
+\cross{GCNAALG}{rightTrace} &
+\cross{GCNAALG}{rightTraceMatrix} \\
+\cross{GCNAALG}{rightTraceMatrix} &
+\cross{GCNAALG}{rightUnit} \\
+\cross{GCNAALG}{rightUnits} &
+\cross{GCNAALG}{sample} \\
+\cross{GCNAALG}{someBasis} &
+\cross{GCNAALG}{structuralConstants} \\
+\cross{GCNAALG}{structuralConstants} &
+\cross{GCNAALG}{subtractIfCan} \\
+\cross{GCNAALG}{unit} &
+\cross{GCNAALG}{zero?} \\
+\cross{GCNAALG}{?*?} &
+\cross{GCNAALG}{?**?} \\
+\cross{GCNAALG}{?+?} &
+\cross{GCNAALG}{?-?} \\
+\cross{GCNAALG}{-?} &
+\cross{GCNAALG}{?=?} \\
+\cross{GCNAALG}{?.?} &
+\cross{GCNAALG}{?\~{}=?}
+\end{tabular}
+
 <<domain GCNAALG GenericNonAssociativeAlgebra>>=
 )abbrev domain GCNAALG GenericNonAssociativeAlgebra
 ++ Authors: J. Grabmeier, R. Wisbauer
@@ -37731,6 +37944,61 @@ GenericNonAssociativeAlgebra(R : CommutativeRing, n : PositiveInteger,_
 \section{domain GPOLSET GeneralPolynomialSet}
 \pagehead{GeneralPolynomialSet}{GPOLSET}
 \pagepic{ps/v103generalpolynomialset.ps}{GPOLSET}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{GPOLSET}{any?} &
+\cross{GPOLSET}{coerce} \\
+\cross{GPOLSET}{collect} &
+\cross{GPOLSET}{collectUnder} \\
+\cross{GPOLSET}{collectUpper} &
+\cross{GPOLSET}{construct} \\
+\cross{GPOLSET}{convert} &
+\cross{GPOLSET}{copy} \\
+\cross{GPOLSET}{count} &
+\cross{GPOLSET}{empty} \\
+\cross{GPOLSET}{empty?} &
+\cross{GPOLSET}{eq?} \\
+\cross{GPOLSET}{eval} &
+\cross{GPOLSET}{every?} \\
+\cross{GPOLSET}{find} &
+\cross{GPOLSET}{hash} \\
+\cross{GPOLSET}{headRemainder} &
+\cross{GPOLSET}{latex} \\
+\cross{GPOLSET}{less?} &
+\cross{GPOLSET}{mainVariables} \\
+\cross{GPOLSET}{mainVariable?} &
+\cross{GPOLSET}{map} \\
+\cross{GPOLSET}{map!} &
+\cross{GPOLSET}{member?} \\
+\cross{GPOLSET}{members} &
+\cross{GPOLSET}{more?} \\
+\cross{GPOLSET}{mvar} &
+\cross{GPOLSET}{parts} \\
+\cross{GPOLSET}{reduce} &
+\cross{GPOLSET}{remainder} \\
+\cross{GPOLSET}{remove} &
+\cross{GPOLSET}{removeDuplicates} \\
+\cross{GPOLSET}{retract} &
+\cross{GPOLSET}{retractIfCan} \\
+\cross{GPOLSET}{rewriteIdealWithHeadRemainder} &
+\cross{GPOLSET}{rewriteIdealWithRemainder} \\
+\cross{GPOLSET}{roughBase?} &
+\cross{GPOLSET}{roughEqualIdeals?} \\
+\cross{GPOLSET}{roughSubIdeal?} &
+\cross{GPOLSET}{roughUnitIdeal?} \\
+\cross{GPOLSET}{sample} &
+\cross{GPOLSET}{select} \\
+\cross{GPOLSET}{size?} &
+\cross{GPOLSET}{sort} \\
+\cross{GPOLSET}{triangular?} &
+\cross{GPOLSET}{trivialIdeal?} \\
+\cross{GPOLSET}{variables} &
+\cross{GPOLSET}{\#{}?} \\
+\cross{GPOLSET}{?=?} &
+\cross{GPOLSET}{?\~{}=?} 
+\end{tabular}
+
 <<domain GPOLSET GeneralPolynomialSet>>=
 )abbrev domain GPOLSET GeneralPolynomialSet
 ++ Author: Marc Moreno Maza
@@ -37910,6 +38178,66 @@ o )show GeneralSparseTable
 \pageto{EqTable}{EQTBL}
 \pageto{StringTable}{STRTBL}
 \pageto{SparseTable}{STBL}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{GSTBL}{any?} &
+\cross{GSTBL}{bag} &
+\cross{GSTBL}{coerce} &
+\cross{GSTBL}{construct} &
+\cross{GSTBL}{convert} \\
+\cross{GSTBL}{copy} &
+\cross{GSTBL}{count} &
+\cross{GSTBL}{dictionary} &
+\cross{GSTBL}{elt} &
+\cross{GSTBL}{empty} \\
+\cross{GSTBL}{empty?} &
+\cross{GSTBL}{entries} &
+\cross{GSTBL}{entry?} &
+\cross{GSTBL}{eq?} &
+\cross{GSTBL}{eval} \\
+\cross{GSTBL}{every?} &
+\cross{GSTBL}{extract!} &
+\cross{GSTBL}{fill!} &
+\cross{GSTBL}{find} &
+\cross{GSTBL}{first} \\
+\cross{GSTBL}{hash} &
+\cross{GSTBL}{index?} &
+\cross{GSTBL}{indices} &
+\cross{GSTBL}{insert!} &
+\cross{GSTBL}{inspect} \\
+\cross{GSTBL}{key?} &
+\cross{GSTBL}{keys} &
+\cross{GSTBL}{latex} &
+\cross{GSTBL}{less?} &
+\cross{GSTBL}{map} \\
+\cross{GSTBL}{map!} &
+\cross{GSTBL}{maxIndex} &
+\cross{GSTBL}{member?} &
+\cross{GSTBL}{members} &
+\cross{GSTBL}{minIndex} \\
+\cross{GSTBL}{more?} &
+\cross{GSTBL}{parts} &
+\cross{GSTBL}{qelt} &
+\cross{GSTBL}{qsetelt!} &
+\cross{GSTBL}{reduce} \\
+\cross{GSTBL}{remove} &
+\cross{GSTBL}{remove!} &
+\cross{GSTBL}{removeDuplicates} &
+\cross{GSTBL}{sample} &
+\cross{GSTBL}{search} \\
+\cross{GSTBL}{select} &
+\cross{GSTBL}{select!} &
+\cross{GSTBL}{setelt} &
+\cross{GSTBL}{size?} &
+\cross{GSTBL}{swap!} \\
+\cross{GSTBL}{table} &
+\cross{GSTBL}{\#{}?} &
+\cross{GSTBL}{?=?} &
+\cross{GSTBL}{?\~{}=?} &
+\cross{GSTBL}{?.?} 
+\end{tabular}
+
 <<domain GSTBL GeneralSparseTable>>=
 )abbrev domain GSTBL GeneralSparseTable
 ++ Author: Stephen M. Watt
@@ -37959,6 +38287,91 @@ GeneralSparseTable(Key, Entry, Tbl, dent): TableAggregate(Key, Entry) == Impl
 \pagepic{ps/v103generaltriangularset.ps}{GTSET}{1.00}
 {\bf See}\\
 \pageto{WuWenTsunTriangularSet}{WUTSET}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{GTSET}{algebraic?} &
+\cross{GTSET}{algebraicVariables} \\
+\cross{GTSET}{any?} &
+\cross{GTSET}{autoReduced?} \\
+\cross{GTSET}{basicSet} &
+\cross{GTSET}{coerce} \\
+\cross{GTSET}{collect} &
+\cross{GTSET}{collectQuasiMonic} \\
+\cross{GTSET}{collectUnder} &
+\cross{GTSET}{collectUpper} \\
+\cross{GTSET}{coHeight} &
+\cross{GTSET}{construct} \\
+\cross{GTSET}{convert} &
+\cross{GTSET}{copy} \\
+\cross{GTSET}{count} &
+\cross{GTSET}{degree} \\
+\cross{GTSET}{empty} &
+\cross{GTSET}{empty?} \\
+\cross{GTSET}{eq?} &
+\cross{GTSET}{eval} \\
+\cross{GTSET}{every?} &
+\cross{GTSET}{extend} \\
+\cross{GTSET}{extendIfCan} &
+\cross{GTSET}{find} \\
+\cross{GTSET}{first} &
+\cross{GTSET}{hash} \\
+\cross{GTSET}{headReduce} &
+\cross{GTSET}{headReduced?} \\
+\cross{GTSET}{headReduced?} &
+\cross{GTSET}{headRemainder} \\
+\cross{GTSET}{infRittWu?} &
+\cross{GTSET}{initiallyReduce} \\
+\cross{GTSET}{initiallyReduced?} &
+\cross{GTSET}{initials} \\
+\cross{GTSET}{last} &
+\cross{GTSET}{latex} \\
+\cross{GTSET}{less?} &
+\cross{GTSET}{mainVariable?} \\
+\cross{GTSET}{mainVariables} &
+\cross{GTSET}{map} \\
+\cross{GTSET}{map!} &
+\cross{GTSET}{member?} \\
+\cross{GTSET}{members} &
+\cross{GTSET}{more?} \\
+\cross{GTSET}{mvar} &
+\cross{GTSET}{normalized?} \\
+\cross{GTSET}{normalized?} &
+\cross{GTSET}{parts} \\
+\cross{GTSET}{quasiComponent} &
+\cross{GTSET}{reduce} \\
+\cross{GTSET}{reduceByQuasiMonic} &
+\cross{GTSET}{reduced?} \\
+\cross{GTSET}{remainder} &
+\cross{GTSET}{remove} \\
+\cross{GTSET}{removeDuplicates} &
+\cross{GTSET}{removeZero} \\
+\cross{GTSET}{rest} &
+\cross{GTSET}{retract} \\
+\cross{GTSET}{retractIfCan} &
+\cross{GTSET}{rewriteIdealWithHeadRemainder} \\
+\cross{GTSET}{rewriteIdealWithRemainder} &
+\cross{GTSET}{rewriteSetWithReduction} \\
+\cross{GTSET}{roughBase?} &
+\cross{GTSET}{roughEqualIdeals?} \\
+\cross{GTSET}{roughSubIdeal?} &
+\cross{GTSET}{roughUnitIdeal?} \\
+\cross{GTSET}{sample} &
+\cross{GTSET}{select} \\
+\cross{GTSET}{size?} &
+\cross{GTSET}{sort} \\
+\cross{GTSET}{stronglyReduce} &
+\cross{GTSET}{stronglyReduced?} \\
+\cross{GTSET}{triangular?} &
+\cross{GTSET}{trivialIdeal?} \\
+\cross{GTSET}{variables} &
+\cross{GTSET}{zeroSetSplit} \\
+\cross{GTSET}{zeroSetSplitIntoTriangularSystems} &
+\cross{GTSET}{\#{}?} \\
+\cross{GTSET}{?=?} &
+\cross{GTSET}{?\~{}=?} 
+\end{tabular}
+
 <<domain GTSET GeneralTriangularSet>>=
 )abbrev domain GTSET GeneralTriangularSet
 ++ Author: Marc Moreno Maza (marc@nag.co.uk)
@@ -38078,6 +38491,108 @@ GeneralTriangularSet(R,E,V,P) : Exports == Implementation where
 \section{domain GSERIES GeneralUnivariatePowerSeries}
 \pagehead{GeneralUnivariatePowerSeries}{GSERIES}
 \pagepic{ps/v103generalunivariatepowerseries.ps}{GSERIES}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{GSERIES}{0} &
+\cross{GSERIES}{1} &
+\cross{GSERIES}{acos} &
+\cross{GSERIES}{acosh} \\
+\cross{GSERIES}{acot} &
+\cross{GSERIES}{acoth} &
+\cross{GSERIES}{acsc} &
+\cross{GSERIES}{acsch} \\
+\cross{GSERIES}{approximate} &
+\cross{GSERIES}{asec} &
+\cross{GSERIES}{asech} &
+\cross{GSERIES}{asin} \\
+\cross{GSERIES}{asinh} &
+\cross{GSERIES}{associates?} &
+\cross{GSERIES}{atan} &
+\cross{GSERIES}{atanh} \\
+\cross{GSERIES}{center} &
+\cross{GSERIES}{characteristic} &
+\cross{GSERIES}{charthRoot} &
+\cross{GSERIES}{coefficient} \\
+\cross{GSERIES}{coerce} &
+\cross{GSERIES}{complete} &
+\cross{GSERIES}{cos} &
+\cross{GSERIES}{cosh} \\
+\cross{GSERIES}{cot} &
+\cross{GSERIES}{coth} &
+\cross{GSERIES}{csc} &
+\cross{GSERIES}{csch} \\
+\cross{GSERIES}{D} &
+\cross{GSERIES}{degree} &
+\cross{GSERIES}{differentiate} &
+\cross{GSERIES}{divide} \\
+\cross{GSERIES}{euclideanSize} &
+\cross{GSERIES}{eval} &
+\cross{GSERIES}{exp} &
+\cross{GSERIES}{expressIdealMember} \\
+\cross{GSERIES}{exquo} &
+\cross{GSERIES}{extend} &
+\cross{GSERIES}{extendedEuclidean} &
+\cross{GSERIES}{factor} \\
+\cross{GSERIES}{gcd} &
+\cross{GSERIES}{gcdPolynomial} &
+\cross{GSERIES}{hash} &
+\cross{GSERIES}{integrate} \\
+\cross{GSERIES}{inv} &
+\cross{GSERIES}{latex} &
+\cross{GSERIES}{lcm} &
+\cross{GSERIES}{leadingCoefficient} \\
+\cross{GSERIES}{leadingMonomial} &
+\cross{GSERIES}{log} &
+\cross{GSERIES}{map} &
+\cross{GSERIES}{monomial} \\
+\cross{GSERIES}{monomial?} &
+\cross{GSERIES}{multiEuclidean} &
+\cross{GSERIES}{multiplyExponents} &
+\cross{GSERIES}{nthRoot} \\
+\cross{GSERIES}{one?} &
+\cross{GSERIES}{order} &
+\cross{GSERIES}{pi} &
+\cross{GSERIES}{pole?} \\
+\cross{GSERIES}{prime?} &
+\cross{GSERIES}{principalIdeal} &
+\cross{GSERIES}{recip} &
+\cross{GSERIES}{reductum} \\
+\cross{GSERIES}{sample} &
+\cross{GSERIES}{sec} &
+\cross{GSERIES}{sech} &
+\cross{GSERIES}{series} \\
+\cross{GSERIES}{sin} &
+\cross{GSERIES}{sinh} &
+\cross{GSERIES}{sizeLess?} &
+\cross{GSERIES}{sqrt} \\
+\cross{GSERIES}{squareFree} &
+\cross{GSERIES}{squareFreePart} &
+\cross{GSERIES}{subtractIfCan} &
+\cross{GSERIES}{tan} \\
+\cross{GSERIES}{tanh} &
+\cross{GSERIES}{terms} &
+\cross{GSERIES}{truncate} &
+\cross{GSERIES}{unit?} \\
+\cross{GSERIES}{unitCanonical} &
+\cross{GSERIES}{unitNormal} &
+\cross{GSERIES}{variable} &
+\cross{GSERIES}{variables} \\
+\cross{GSERIES}{zero?} &
+\cross{GSERIES}{?+?} &
+\cross{GSERIES}{?-?} &
+\cross{GSERIES}{-?} \\
+\cross{GSERIES}{?=?} &
+\cross{GSERIES}{?\^{}?} &
+\cross{GSERIES}{?\~{}=?} &
+\cross{GSERIES}{?*?} \\
+\cross{GSERIES}{?**?} &
+\cross{GSERIES}{?/?} &
+\cross{GSERIES}{?.?} \\
+\cross{GSERIES}{?quo?} &
+\cross{GSERIES}{?rem?} &&
+\end{tabular}
+
 <<domain GSERIES GeneralUnivariatePowerSeries>>=
 )abbrev domain GSERIES GeneralUnivariatePowerSeries
 ++ Author: Clifton J. Williamson
@@ -38198,6 +38713,27 @@ GeneralUnivariatePowerSeries(Coef,var,cen): Exports == Implementation where
 \section{domain GRIMAGE GraphImage}
 \pagehead{GraphImage}{GRIMAGE}
 \pagepic{ps/v103graphimage.ps}{GRIMAGE}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{GRIMAGE}{appendPoint} &
+\cross{GRIMAGE}{coerce} &
+\cross{GRIMAGE}{component} &
+\cross{GRIMAGE}{figureUnits} &
+\cross{GRIMAGE}{graphImage} \\
+\cross{GRIMAGE}{hash} &
+\cross{GRIMAGE}{key} &
+\cross{GRIMAGE}{latex} &
+\cross{GRIMAGE}{makeGraphImage} &
+\cross{GRIMAGE}{point} \\
+\cross{GRIMAGE}{pointLists} &
+\cross{GRIMAGE}{putColorInfo} &
+\cross{GRIMAGE}{ranges} &
+\cross{GRIMAGE}{units} &
+\cross{GRIMAGE}{?\~{}=?} \\
+\cross{GRIMAGE}{?=?} &&&&
+\end{tabular}
+
 <<domain GRIMAGE GraphImage>>=
 )abbrev domain GRIMAGE GraphImage
 ++ Author: Jim Wen
@@ -38614,6 +39150,33 @@ GraphImage (): Exports == Implementation where
 \section{domain GOPT GuessOption}
 \pagehead{GuessOption}{GOPT}
 \pagepic{ps/v103guessoption.ps}{GOPT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{GOPT}{allDegrees} &
+\cross{GOPT}{checkOptions} &
+\cross{GOPT}{coerce} &
+\cross{GOPT}{debug} &
+\cross{GOPT}{displayAsGF} \\
+\cross{GOPT}{functionName} &
+\cross{GOPT}{hash} &
+\cross{GOPT}{homogeneous} &
+\cross{GOPT}{indexName} &
+\cross{GOPT}{latex} \\
+\cross{GOPT}{maxDegree} &
+\cross{GOPT}{maxDerivative} &
+\cross{GOPT}{maxLevel} &
+\cross{GOPT}{maxPower} &
+\cross{GOPT}{maxShift} \\
+\cross{GOPT}{one} &
+\cross{GOPT}{option} &
+\cross{GOPT}{option?} &
+\cross{GOPT}{safety} &
+\cross{GOPT}{variableName} \\
+\cross{GOPT}{?\~{}=?} &
+\cross{GOPT}{?=?} &&&
+\end{tabular}
+
 <<domain GOPT GuessOption>>=
 )abbrev domain GOPT GuessOption
 ++ Author: Martin Rubey
@@ -38774,6 +39337,66 @@ GuessOption(): Exports == Implementation where
 \pageto{StringTable}{STRTBL}
 \pageto{GeneralSparseTable}{GSTBL}
 \pageto{SparseTable}{STBL}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{HASHTBL}{any?} &
+\cross{HASHTBL}{bag} &
+\cross{HASHTBL}{coerce} &
+\cross{HASHTBL}{construct} &
+\cross{HASHTBL}{convert} \\
+\cross{HASHTBL}{copy} &
+\cross{HASHTBL}{count} &
+\cross{HASHTBL}{dictionary} &
+\cross{HASHTBL}{entry?} &
+\cross{HASHTBL}{elt} \\
+\cross{HASHTBL}{empty} &
+\cross{HASHTBL}{empty?} &
+\cross{HASHTBL}{entries} &
+\cross{HASHTBL}{eq?} &
+\cross{HASHTBL}{eval} \\
+\cross{HASHTBL}{every?} &
+\cross{HASHTBL}{extract!} &
+\cross{HASHTBL}{fill!} &
+\cross{HASHTBL}{find} &
+\cross{HASHTBL}{first} \\
+\cross{HASHTBL}{hash} &
+\cross{HASHTBL}{index?} &
+\cross{HASHTBL}{indices} &
+\cross{HASHTBL}{insert!} &
+\cross{HASHTBL}{inspect} \\
+\cross{HASHTBL}{key?} &
+\cross{HASHTBL}{keys} &
+\cross{HASHTBL}{latex} &
+\cross{HASHTBL}{less?} &
+\cross{HASHTBL}{map} \\
+\cross{HASHTBL}{map!} &
+\cross{HASHTBL}{maxIndex} &
+\cross{HASHTBL}{member?} &
+\cross{HASHTBL}{members} &
+\cross{HASHTBL}{minIndex} \\
+\cross{HASHTBL}{more?} &
+\cross{HASHTBL}{parts} &
+\cross{HASHTBL}{qelt} &
+\cross{HASHTBL}{qsetelt!} &
+\cross{HASHTBL}{reduce} \\
+\cross{HASHTBL}{remove} &
+\cross{HASHTBL}{remove!} &
+\cross{HASHTBL}{removeDuplicates} &
+\cross{HASHTBL}{sample} &
+\cross{HASHTBL}{search} \\
+\cross{HASHTBL}{select} &
+\cross{HASHTBL}{select!} &
+\cross{HASHTBL}{setelt} &
+\cross{HASHTBL}{size?} &
+\cross{HASHTBL}{swap!} \\
+\cross{HASHTBL}{table} &
+\cross{HASHTBL}{\#{}?} &
+\cross{HASHTBL}{?=?} &
+\cross{HASHTBL}{?\~{}=?} &
+\cross{HASHTBL}{?.?} 
+\end{tabular}
+
 <<domain HASHTBL HashTable>>=
 )abbrev domain HASHTBL HashTable
 ++ Author: Stephen M. Watt
@@ -38974,6 +39597,42 @@ o )show Heap
 \pageto{ArrayStack}{ASTACK}
 \pageto{Queue}{QUEUE}
 \pageto{Dequeue}{DEQUEUE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{HEAP}{any?} &
+\cross{HEAP}{bag} &
+\cross{HEAP}{coerce} &
+\cross{HEAP}{copy} &
+\cross{HEAP}{count} \\
+\cross{HEAP}{empty} &
+\cross{HEAP}{empty?} &
+\cross{HEAP}{eq?} &
+\cross{HEAP}{eval} &
+\cross{HEAP}{every?} \\
+\cross{HEAP}{extract!} &
+\cross{HEAP}{hash} &
+\cross{HEAP}{heap} &
+\cross{HEAP}{insert!} &
+\cross{HEAP}{inspect} \\
+\cross{HEAP}{latex} &
+\cross{HEAP}{less?} &
+\cross{HEAP}{map} &
+\cross{HEAP}{map!} &
+\cross{HEAP}{max} \\
+\cross{HEAP}{member?} &
+\cross{HEAP}{members} &
+\cross{HEAP}{merge} &
+\cross{HEAP}{merge!} &
+\cross{HEAP}{more?} \\
+\cross{HEAP}{parts} &
+\cross{HEAP}{sample} &
+\cross{HEAP}{size?} &
+\cross{HEAP}{\#{}?} &
+\cross{HEAP}{?=?} \\
+\cross{HEAP}{?\~{}=?} &&&&
+\end{tabular}
+
 <<domain HEAP Heap>>=
 )abbrev domain HEAP Heap
 ++ Author: Michael Monagan and Stephen Watt
@@ -39210,6 +39869,91 @@ o )show HexadecimalExpansion
 \pageto{RadixExpansion}{RADIX}
 \pageto{BinaryExpansion}{BINARY}
 \pageto{DecimalExpansion}{DECIMAL}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{HEXADEC}{0} &
+\cross{HEXADEC}{1} \\
+\cross{HEXADEC}{abs} &
+\cross{HEXADEC}{associates?} \\
+\cross{HEXADEC}{ceiling} &
+\cross{HEXADEC}{characteristic} \\
+\cross{HEXADEC}{charthRoot} &
+\cross{HEXADEC}{coerce} \\
+\cross{HEXADEC}{conditionP} &
+\cross{HEXADEC}{convert} \\
+\cross{HEXADEC}{D} &
+\cross{HEXADEC}{denom} \\
+\cross{HEXADEC}{denominator} &
+\cross{HEXADEC}{differentiate} \\
+\cross{HEXADEC}{divide} &
+\cross{HEXADEC}{euclideanSize} \\
+\cross{HEXADEC}{eval} &
+\cross{HEXADEC}{expressIdealMember} \\
+\cross{HEXADEC}{exquo} &
+\cross{HEXADEC}{extendedEuclidean} \\
+\cross{HEXADEC}{factor} &
+\cross{HEXADEC}{factorPolynomial} \\
+\cross{HEXADEC}{factorSquareFreePolynomial} &
+\cross{HEXADEC}{floor} \\
+\cross{HEXADEC}{fractionPart} &
+\cross{HEXADEC}{gcd} \\
+\cross{HEXADEC}{gcdPolynomial} &
+\cross{HEXADEC}{hash} \\
+\cross{HEXADEC}{hex} &
+\cross{HEXADEC}{init} \\
+\cross{HEXADEC}{inv} &
+\cross{HEXADEC}{latex} \\
+\cross{HEXADEC}{lcm} &
+\cross{HEXADEC}{map} \\
+\cross{HEXADEC}{max} &
+\cross{HEXADEC}{min} \\
+\cross{HEXADEC}{multiEuclidean} &
+\cross{HEXADEC}{negative?} \\
+\cross{HEXADEC}{nextItem} &
+\cross{HEXADEC}{numer} \\
+\cross{HEXADEC}{numerator} &
+\cross{HEXADEC}{one?} \\
+\cross{HEXADEC}{patternMatch} &
+\cross{HEXADEC}{positive?} \\
+\cross{HEXADEC}{prime?} &
+\cross{HEXADEC}{principalIdeal} \\
+\cross{HEXADEC}{random} &
+\cross{HEXADEC}{recip} \\
+\cross{HEXADEC}{reducedSystem} &
+\cross{HEXADEC}{retract} \\
+\cross{HEXADEC}{retractIfCan} &
+\cross{HEXADEC}{sample} \\
+\cross{HEXADEC}{sign} &
+\cross{HEXADEC}{sizeLess?} \\
+\cross{HEXADEC}{solveLinearPolynomialEquation} &
+\cross{HEXADEC}{squareFree} \\
+\cross{HEXADEC}{squareFreePart} &
+\cross{HEXADEC}{squareFreePolynomial} \\
+\cross{HEXADEC}{subtractIfCan} &
+\cross{HEXADEC}{unit?} \\
+\cross{HEXADEC}{unitCanonical} &
+\cross{HEXADEC}{unitNormal} \\
+\cross{HEXADEC}{wholePart} &
+\cross{HEXADEC}{zero?} \\
+\cross{HEXADEC}{?*?} &
+\cross{HEXADEC}{?**?} \\
+\cross{HEXADEC}{?+?} &
+\cross{HEXADEC}{?-?} \\
+\cross{HEXADEC}{-?} &
+\cross{HEXADEC}{?/?} \\
+\cross{HEXADEC}{?=?} &
+\cross{HEXADEC}{?\^{}?} \\
+\cross{HEXADEC}{?\~{}=?} &
+\cross{HEXADEC}{?$<$?} \\
+\cross{HEXADEC}{?$<=$?} &
+\cross{HEXADEC}{?$>$?} \\
+\cross{HEXADEC}{?$>=$?} &
+\cross{HEXADEC}{?.?} \\
+\cross{HEXADEC}{?quo?} &
+\cross{HEXADEC}{?rem?} 
+\end{tabular}
+
 <<domain HEXADEC HexadecimalExpansion>>=
 )abbrev domain HEXADEC HexadecimalExpansion
 ++ Author: Clifton J. Williamson
@@ -39256,6 +40000,86 @@ HexadecimalExpansion(): Exports == Implementation where
 {\bf See}\\
 \pageto{OrderedDirectProduct}{ODP}
 \pageto{SplitHomogeneousDirectProduct}{SHDP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{HDP}{0} &
+\cross{HDP}{1} &
+\cross{HDP}{abs} &
+\cross{HDP}{any?} &
+\cross{HDP}{characteristic} \\
+\cross{HDP}{coerce} &
+\cross{HDP}{copy} &
+\cross{HDP}{count} &
+\cross{HDP}{D} &
+\cross{HDP}{differentiate} \\
+\cross{HDP}{dimension} &
+\cross{HDP}{directProduct} &
+\cross{HDP}{dot} &
+\cross{HDP}{elt} &
+\cross{HDP}{empty} \\
+\cross{HDP}{empty?} &
+\cross{HDP}{entries} &
+\cross{HDP}{entry?} &
+\cross{HDP}{eq?} &
+\cross{HDP}{eval} \\
+\cross{HDP}{every?} &
+\cross{HDP}{fill!} &
+\cross{HDP}{first} &
+\cross{HDP}{hash} &
+\cross{HDP}{index} \\
+\cross{HDP}{index?} &
+\cross{HDP}{indices} &
+\cross{HDP}{latex} &
+\cross{HDP}{less?} &
+\cross{HDP}{lookup} \\
+\cross{HDP}{map} &
+\cross{HDP}{map!} &
+\cross{HDP}{max} &
+\cross{HDP}{maxIndex} &
+\cross{HDP}{member?} \\
+\cross{HDP}{members} &
+\cross{HDP}{min} &
+\cross{HDP}{minIndex} &
+\cross{HDP}{more?} &
+\cross{HDP}{negative?} \\
+\cross{HDP}{one?} &
+\cross{HDP}{parts} &
+\cross{HDP}{positive?} &
+\cross{HDP}{qelt} &
+\cross{HDP}{qsetelt!} \\
+\cross{HDP}{random} &
+\cross{HDP}{recip} &
+\cross{HDP}{reducedSystem} &
+\cross{HDP}{retract} &
+\cross{HDP}{retractIfCan} \\
+\cross{HDP}{sample} &
+\cross{HDP}{setelt} &
+\cross{HDP}{sign} &
+\cross{HDP}{size} &
+\cross{HDP}{size?} \\
+\cross{HDP}{subtractIfCan} &
+\cross{HDP}{sup} &
+\cross{HDP}{swap!} &
+\cross{HDP}{unitVector} &
+\cross{HDP}{zero?} \\
+\cross{HDP}{\#{}?} &
+\cross{HDP}{?*?} &
+\cross{HDP}{?**?} &
+\cross{HDP}{?+?} &
+\cross{HDP}{?-?} \\
+\cross{HDP}{?/?} &
+\cross{HDP}{?$<$?} &
+\cross{HDP}{?$<=$?} &
+\cross{HDP}{?=?} &
+\cross{HDP}{?$>$?} \\
+\cross{HDP}{?$>=$?} &
+\cross{HDP}{?\^{}?} &
+\cross{HDP}{?\~{}=?} &
+\cross{HDP}{-?} &
+\cross{HDP}{?.?} 
+\end{tabular}
+
 <<domain HDP HomogeneousDirectProduct>>=
 )abbrev domain HDP HomogeneousDirectProduct
 ++ Author:
@@ -39518,6 +40342,96 @@ o )show HomogeneousDistributedMultivariatePolynomial
 {\bf See}\\
 \pageto{GeneralDistributedMultivariatePolynomial}{GDMP}
 \pageto{DistributedMultivariatePolynomial}{DMP}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{HDMP}{0} &
+\cross{HDMP}{1} &
+\cross{HDMP}{associates?} \\
+\cross{HDMP}{binomThmExpt} &
+\cross{HDMP}{characteristic} &
+\cross{HDMP}{charthRoot} \\
+\cross{HDMP}{coefficient} &
+\cross{HDMP}{coefficients} &
+\cross{HDMP}{coerce} \\
+\cross{HDMP}{conditionP} &
+\cross{HDMP}{content} &
+\cross{HDMP}{convert} \\
+\cross{HDMP}{D} &
+\cross{HDMP}{degree} &
+\cross{HDMP}{differentiate} \\
+\cross{HDMP}{discriminant} &
+\cross{HDMP}{eval} &
+\cross{HDMP}{exquo} \\
+\cross{HDMP}{factor} &
+\cross{HDMP}{factorPolynomial} &
+\cross{HDMP}{factorSquareFreePolynomial} \\
+\cross{HDMP}{gcd} &
+\cross{HDMP}{gcdPolynomial} &
+\cross{HDMP}{ground} \\
+\cross{HDMP}{ground?} &
+\cross{HDMP}{hash} &
+\cross{HDMP}{isExpt} \\
+\cross{HDMP}{isPlus} &
+\cross{HDMP}{isTimes} &
+\cross{HDMP}{latex} \\
+\cross{HDMP}{lcm} &
+\cross{HDMP}{leadingCoefficient} &
+\cross{HDMP}{leadingMonomial} \\
+\cross{HDMP}{mainVariable} &
+\cross{HDMP}{map} &
+\cross{HDMP}{mapExponents} \\
+\cross{HDMP}{max} &
+\cross{HDMP}{min} &
+\cross{HDMP}{minimumDegree} \\
+\cross{HDMP}{monicDivide} &
+\cross{HDMP}{monomial} &
+\cross{HDMP}{monomial?} \\
+\cross{HDMP}{monomials} &
+\cross{HDMP}{multivariate} &
+\cross{HDMP}{numberOfMonomials} \\
+\cross{HDMP}{one?} &
+\cross{HDMP}{patternMatch} &
+\cross{HDMP}{pomopo!} \\
+\cross{HDMP}{prime?} &
+\cross{HDMP}{primitiveMonomials} &
+\cross{HDMP}{primitivePart} \\
+\cross{HDMP}{recip} &
+\cross{HDMP}{reducedSystem} &
+\cross{HDMP}{reductum} \\
+\cross{HDMP}{reorder} &
+\cross{HDMP}{resultant} &
+\cross{HDMP}{retract} \\
+\cross{HDMP}{retractIfCan} &
+\cross{HDMP}{sample} &
+\cross{HDMP}{solveLinearPolynomialEquation} \\
+\cross{HDMP}{squareFree} &
+\cross{HDMP}{squareFreePart} &
+\cross{HDMP}{squareFreePolynomial} \\
+\cross{HDMP}{subtractIfCan} &
+\cross{HDMP}{totalDegree} &
+\cross{HDMP}{unit?} \\
+\cross{HDMP}{unitCanonical} &
+\cross{HDMP}{unitNormal} &
+\cross{HDMP}{univariate} \\
+\cross{HDMP}{variables} &
+\cross{HDMP}{zero?} &
+\cross{HDMP}{?*?} \\
+\cross{HDMP}{?**?} &
+\cross{HDMP}{?+?} &
+\cross{HDMP}{?-?} \\
+\cross{HDMP}{-?} &
+\cross{HDMP}{?=?} &
+\cross{HDMP}{?\^{}?} \\
+\cross{HDMP}{?\~{}=?} &
+\cross{HDMP}{?/?} &
+\cross{HDMP}{?$<$?} \\
+\cross{HDMP}{?$<=$?} &
+\cross{HDMP}{?$>$?} &
+\cross{HDMP}{?$>=$?} \\
+\cross{HDMP}{?\^{}?} &&
+\end{tabular}
+
 <<domain HDMP HomogeneousDistributedMultivariatePolynomial>>=
 )abbrev domain HDMP HomogeneousDistributedMultivariatePolynomial
 ++ Author: Barry Trager
@@ -39568,6 +40482,30 @@ HomogeneousDistributedMultivariatePolynomial(vl,R): public == private where
 \pageto{FractionalIdeal}{FRIDEAL}
 \pageto{FramedModule}{FRMOD}
 \pageto{FiniteDivisor}{FDIV}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{HELLFDIV}{0} &
+\cross{HELLFDIV}{coerce} &
+\cross{HELLFDIV}{decompose} &
+\cross{HELLFDIV}{divisor} &
+\cross{HELLFDIV}{hash} \\
+\cross{HELLFDIV}{ideal} &
+\cross{HELLFDIV}{generator} &
+\cross{HELLFDIV}{latex} &
+\cross{HELLFDIV}{principal?} &
+\cross{HELLFDIV}{reduce} \\
+\cross{HELLFDIV}{sample} &
+\cross{HELLFDIV}{subtractIfCan} &
+\cross{HELLFDIV}{zero?} &
+\cross{HELLFDIV}{?\~{}=?} &
+\cross{HELLFDIV}{?*?} \\
+\cross{HELLFDIV}{?+?} &
+\cross{HELLFDIV}{?-?} &
+\cross{HELLFDIV}{-?} &
+\cross{HELLFDIV}{?=?} &
+\end{tabular}
+
 <<domain HELLFDIV HyperellipticFiniteDivisor>>=
 )abbrev domain HELLFDIV HyperellipticFiniteDivisor
 ++ Finite rational divisors on an hyperelliptic curve
@@ -39752,6 +40690,25 @@ HyperellipticFiniteDivisor(F, UP, UPUP, R): Exports == Implementation where
 \pageto{DataList}{DLIST}
 \pageto{Database}{DBASE}
 \pageto{QueryEquation}{QEQUAT}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ICARD}{coerce} &
+\cross{ICARD}{display} &
+\cross{ICARD}{fullDisplay} &
+\cross{ICARD}{hash} &
+\cross{ICARD}{latex} \\
+\cross{ICARD}{max} &
+\cross{ICARD}{min} &
+\cross{ICARD}{?\~{}=?} &
+\cross{ICARD}{?$<$?} &
+\cross{ICARD}{?$<=$?} \\
+\cross{ICARD}{?=?} &
+\cross{ICARD}{?$>$?} &
+\cross{ICARD}{?$>=$?} &
+\cross{ICARD}{?.?} &
+\end{tabular}
+
 <<domain ICARD IndexCard>>=
 )abbrev domain ICARD IndexCard
 ++ This domain implements a container of information
@@ -39824,6 +40781,86 @@ IndexCard() : Exports == Implementation where
 \pageto{Reference}{REF}
 \pageto{Boolean}{BOOLEAN}
 \pageto{Bits}{BITS}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IBITS}{And} &
+\cross{IBITS}{any?} &
+\cross{IBITS}{coerce} &
+\cross{IBITS}{concat} &
+\cross{IBITS}{construct} \\
+\cross{IBITS}{convert} &
+\cross{IBITS}{copy} &
+\cross{IBITS}{copyInto!} &
+\cross{IBITS}{count} &
+\cross{IBITS}{count} \\
+\cross{IBITS}{delete} &
+\cross{IBITS}{elt} &
+\cross{IBITS}{empty} &
+\cross{IBITS}{empty?} &
+\cross{IBITS}{entries} \\
+\cross{IBITS}{entry?} &
+\cross{IBITS}{eq?} &
+\cross{IBITS}{eval} &
+\cross{IBITS}{every?} &
+\cross{IBITS}{fill!} \\
+\cross{IBITS}{find} &
+\cross{IBITS}{first} &
+\cross{IBITS}{hash} &
+\cross{IBITS}{index?} &
+\cross{IBITS}{indices} \\
+\cross{IBITS}{insert} &
+\cross{IBITS}{latex} &
+\cross{IBITS}{less?} &
+\cross{IBITS}{map} &
+\cross{IBITS}{map!} \\
+\cross{IBITS}{max} &
+\cross{IBITS}{maxIndex} &
+\cross{IBITS}{member?} &
+\cross{IBITS}{members} &
+\cross{IBITS}{merge} \\
+\cross{IBITS}{min} &
+\cross{IBITS}{minIndex} &
+\cross{IBITS}{more?} &
+\cross{IBITS}{nand} &
+\cross{IBITS}{new} \\
+\cross{IBITS}{nor} &
+\cross{IBITS}{Not} &
+\cross{IBITS}{not?} &
+\cross{IBITS}{Or} &
+\cross{IBITS}{parts} \\
+\cross{IBITS}{position} &
+\cross{IBITS}{qelt} &
+\cross{IBITS}{qsetelt!} &
+\cross{IBITS}{reduce} &
+\cross{IBITS}{removeDuplicates} \\
+\cross{IBITS}{reverse} &
+\cross{IBITS}{reverse!} &
+\cross{IBITS}{sample} &
+\cross{IBITS}{select} &
+\cross{IBITS}{size?} \\
+\cross{IBITS}{sort} &
+\cross{IBITS}{sort!} &
+\cross{IBITS}{sorted?} &
+\cross{IBITS}{swap!} &
+\cross{IBITS}{xor} \\
+\cross{IBITS}{\#{}?} &
+\cross{IBITS}{?.?} &
+\cross{IBITS}{?/$\backslash{}$?} &
+\cross{IBITS}{?$<$?} &
+\cross{IBITS}{?$<=$?} \\
+\cross{IBITS}{?=?} &
+\cross{IBITS}{?$>$?} &
+\cross{IBITS}{?$>=$?} &
+\cross{IBITS}{?$\backslash{}$/?} &
+\cross{IBITS}{\^{}?} \\
+\cross{IBITS}{?.?} &
+\cross{IBITS}{\~{}?} &
+\cross{IBITS}{?\~{}=?} &
+\cross{IBITS}{?or?} &
+\cross{IBITS}{?and?} 
+\end{tabular}
+
 <<domain IBITS IndexedBits>>=
 )abbrev domain IBITS IndexedBits
 ++ Author: Stephen Watt and Michael Monagan
@@ -39900,6 +40937,29 @@ IndexedBits(mn:Integer): BitAggregate() with
 \pageto{IndexedDirectProductAbelianMonoid}{IDPAM}
 \pageto{IndexedDirectProductOrderedAbelianMonoid}{IDPOAM}
 \pageto{IndexedDirectProductOrderedAbelianMonoidSup}{IDPOAMS}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IDPAG}{0} &
+\cross{IDPAG}{coerce} &
+\cross{IDPAG}{hash} &
+\cross{IDPAG}{latex} &
+\cross{IDPAG}{leadingCoefficient} \\
+\cross{IDPAG}{leadingSupport} &
+\cross{IDPAG}{map} &
+\cross{IDPAG}{monomial} &
+\cross{IDPAG}{reductum} &
+\cross{IDPAG}{sample} \\
+\cross{IDPAG}{subtractIfCan} &
+\cross{IDPAG}{zero?} &
+\cross{IDPAG}{?\~{}=?} &
+\cross{IDPAG}{?*?} &
+\cross{IDPAG}{?+?} \\
+\cross{IDPAG}{?-?} &
+\cross{IDPAG}{-?} &
+\cross{IDPAG}{?=?} &&
+\end{tabular}
+
 <<domain IDPAG IndexedDirectProductAbelianGroup>>=
 )abbrev domain IDPAG IndexedDirectProductAbelianGroup
 ++ Indexed direct products of abelian groups over an abelian group \spad{A} of
@@ -39984,6 +41044,26 @@ IndexedDirectProductAbelianGroup(A:AbelianGroup,S:OrderedSet):
 \pageto{IndexedDirectProductOrderedAbelianMonoid}{IDPOAM}
 \pageto{IndexedDirectProductOrderedAbelianMonoidSup}{IDPOAMS}
 \pageto{IndexedDirectProductAbelianGroup}{IDPAG}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IDPAM}{0} &
+\cross{IDPAM}{coerce} &
+\cross{IDPAM}{hash} &
+\cross{IDPAM}{latex} &
+\cross{IDPAM}{leadingCoefficient} \\
+\cross{IDPAM}{leadingSupport} &
+\cross{IDPAM}{map} &
+\cross{IDPAM}{monomial} &
+\cross{IDPAM}{reductum} &
+\cross{IDPAM}{sample} \\
+\cross{IDPAM}{zero?} &
+\cross{IDPAM}{?\~{}=?} &
+\cross{IDPAM}{?*?} &
+\cross{IDPAM}{?+?} &
+\cross{IDPAM}{?=?}
+\end{tabular}
+
 <<domain IDPAM IndexedDirectProductAbelianMonoid>>=
 )abbrev domain IDPAM IndexedDirectProductAbelianMonoid
 ++ Indexed direct products of abelian monoids over an abelian monoid \spad{A} of
@@ -40079,6 +41159,21 @@ IndexedDirectProductAbelianMonoid(A:AbelianMonoid,S:OrderedSet):
 \pageto{IndexedDirectProductOrderedAbelianMonoid}{IDPOAM}
 \pageto{IndexedDirectProductOrderedAbelianMonoidSup}{IDPOAMS}
 \pageto{IndexedDirectProductAbelianGroup}{IDPAG}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IDPO}{coerce} &
+\cross{IDPO}{hash} &
+\cross{IDPO}{latex} &
+\cross{IDPO}{leadingCoefficient} &
+\cross{IDPO}{leadingSupport} \\
+\cross{IDPO}{map} &
+\cross{IDPO}{monomial} &
+\cross{IDPO}{reductum} &
+\cross{IDPO}{?=?} &
+\cross{IDPO}{?\~{}=?} 
+\end{tabular}
+
 <<domain IDPO IndexedDirectProductObject>>=
 )abbrev domain IDPO IndexedDirectProductObject
 ++ Indexed direct products of objects over a set \spad{A}
@@ -40136,6 +41231,32 @@ IndexedDirectProductObject(A:SetCategory,S:OrderedSet): IndexedDirectProductCate
 \pageto{IndexedDirectProductAbelianMonoid}{IDPAM}
 \pageto{IndexedDirectProductOrderedAbelianMonoidSup}{IDPOAMS}
 \pageto{IndexedDirectProductAbelianGroup}{IDPAG}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IDPOAM}{0} &
+\cross{IDPOAM}{coerce} &
+\cross{IDPOAM}{hash} &
+\cross{IDPOAM}{latex} &
+\cross{IDPOAM}{leadingCoefficient} \\
+\cross{IDPOAM}{leadingSupport} &
+\cross{IDPOAM}{map} &
+\cross{IDPOAM}{max} &
+\cross{IDPOAM}{min} &
+\cross{IDPOAM}{monomial} \\
+\cross{IDPOAM}{reductum} &
+\cross{IDPOAM}{sample} &
+\cross{IDPOAM}{zero?} &
+\cross{IDPOAM}{?\~{}=?} &
+\cross{IDPOAM}{?*?} \\
+\cross{IDPOAM}{?+?} &
+\cross{IDPOAM}{?$<$?} &
+\cross{IDPOAM}{?$<=$?} &
+\cross{IDPOAM}{?=?} &
+\cross{IDPOAM}{?$>$?} \\
+\cross{IDPOAM}{?$>=$?} &&&&
+\end{tabular}
+
 <<domain IDPOAM IndexedDirectProductOrderedAbelianMonoid>>=
 )abbrev domain IDPOAM IndexedDirectProductOrderedAbelianMonoid
 ++ Indexed direct products of ordered abelian monoids \spad{A} of
@@ -40173,6 +41294,34 @@ IndexedDirectProductOrderedAbelianMonoid(A:OrderedAbelianMonoid,S:OrderedSet):
 \pageto{IndexedDirectProductAbelianMonoid}{IDPAM}
 \pageto{IndexedDirectProductOrderedAbelianMonoid}{IDPOAM}
 \pageto{IndexedDirectProductAbelianGroup}{IDPAG}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IDPOAMS}{0} &
+\cross{IDPOAMS}{coerce} &
+\cross{IDPOAMS}{hash} &
+\cross{IDPOAMS}{latex} &
+\cross{IDPOAMS}{leadingCoefficient} \\
+\cross{IDPOAMS}{leadingSupport} &
+\cross{IDPOAMS}{map} &
+\cross{IDPOAMS}{max} &
+\cross{IDPOAMS}{min} &
+\cross{IDPOAMS}{monomial} \\
+\cross{IDPOAMS}{reductum} &
+\cross{IDPOAMS}{sample} &
+\cross{IDPOAMS}{subtractIfCan} &
+\cross{IDPOAMS}{sup} &
+\cross{IDPOAMS}{zero?} \\
+\cross{IDPOAMS}{?\~{}=?} &
+\cross{IDPOAMS}{?*?} &
+\cross{IDPOAMS}{?+?} &
+\cross{IDPOAMS}{?$<$?} &
+\cross{IDPOAMS}{?$<=$?} \\
+\cross{IDPOAMS}{?=?} &
+\cross{IDPOAMS}{?$>$?} &
+\cross{IDPOAMS}{?$>=$?} &&
+\end{tabular}
+
 <<domain IDPOAMS IndexedDirectProductOrderedAbelianMonoidSup>>=
 )abbrev domain IDPOAMS IndexedDirectProductOrderedAbelianMonoidSup
 ++ Indexed direct products of ordered abelian monoid sups \spad{A},
@@ -40226,6 +41375,34 @@ IndexedDirectProductOrderedAbelianMonoidSup(A:OrderedAbelianMonoidSup,S:OrderedS
 \pageto{Polynomial}{POLY}
 \pageto{MultivariatePolynomial}{MPOLY}
 \pageto{SparseMultivariatePolynomial}{SMP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{INDE}{0} &
+\cross{INDE}{coerce} &
+\cross{INDE}{hash} &
+\cross{INDE}{latex} &
+\cross{INDE}{leadingCoefficient} \\
+\cross{INDE}{leadingSupport} &
+\cross{INDE}{map} &
+\cross{INDE}{max} &
+\cross{INDE}{min} &
+\cross{INDE}{monomial} \\
+\cross{INDE}{reductum} &
+\cross{INDE}{sample} &
+\cross{INDE}{subtractIfCan} &
+\cross{INDE}{sup} &
+\cross{INDE}{zero?} \\
+\cross{INDE}{?\~{}=?} &
+\cross{INDE}{?*?} &
+\cross{INDE}{?+?} &
+\cross{INDE}{?$<$?} &
+\cross{INDE}{?$<=$?} \\
+\cross{INDE}{?=?} &
+\cross{INDE}{?$>$?} &
+\cross{INDE}{?$>=$?} &&
+\end{tabular}
+
 <<domain INDE IndexedExponents>>=
 )abbrev domain INDE IndexedExponents
 ++ Author: James Davenport
@@ -40275,6 +41452,86 @@ IndexedExponents(Varset:OrderedSet): C == T where
 \pageto{FlexibleArray}{FARRAY}
 \pageto{IndexedOneDimensionalArray}{IARRAY1}
 \pageto{OneDimensionalArray}{ARRAY1}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{IFARRAY}{concat} &
+\cross{IFARRAY}{concat!} &
+\cross{IFARRAY}{construct} &
+\cross{IFARRAY}{copy} \\
+\cross{IFARRAY}{delete} &
+\cross{IFARRAY}{delete!} &
+\cross{IFARRAY}{elt} &
+\cross{IFARRAY}{empty} \\
+\cross{IFARRAY}{empty?} &
+\cross{IFARRAY}{entries} &
+\cross{IFARRAY}{eq?} &
+\cross{IFARRAY}{flexibleArray} \\
+\cross{IFARRAY}{index?} &
+\cross{IFARRAY}{indices} &
+\cross{IFARRAY}{insert} &
+\cross{IFARRAY}{insert!} \\
+\cross{IFARRAY}{map} &
+\cross{IFARRAY}{new} &
+\cross{IFARRAY}{qelt} &
+\cross{IFARRAY}{reverse} \\
+\cross{IFARRAY}{sample} &
+\cross{IFARRAY}{shrinkable} &
+\cross{IFARRAY}{ any?} &
+\cross{IFARRAY}{coerce} \\
+\cross{IFARRAY}{convert} &
+\cross{IFARRAY}{copyInto!} &
+\cross{IFARRAY}{count} &
+\cross{IFARRAY}{delete} \\
+\cross{IFARRAY}{delete!} &
+\cross{IFARRAY}{entry?} &
+\cross{IFARRAY}{eval} &
+\cross{IFARRAY}{every?} \\
+\cross{IFARRAY}{fill!} &
+\cross{IFARRAY}{find} &
+\cross{IFARRAY}{first} &
+\cross{IFARRAY}{hash} \\
+\cross{IFARRAY}{latex} &
+\cross{IFARRAY}{less?} &
+\cross{IFARRAY}{map!} &
+\cross{IFARRAY}{max} \\
+\cross{IFARRAY}{maxIndex} &
+\cross{IFARRAY}{member?} &
+\cross{IFARRAY}{members} &
+\cross{IFARRAY}{merge} \\
+\cross{IFARRAY}{merge!} &
+\cross{IFARRAY}{min} &
+\cross{IFARRAY}{minIndex} &
+\cross{IFARRAY}{more?} \\
+\cross{IFARRAY}{parts} &
+\cross{IFARRAY}{physicalLength} &
+\cross{IFARRAY}{physicalLength!} &
+\cross{IFARRAY}{position} \\
+\cross{IFARRAY}{qsetelt!} &
+\cross{IFARRAY}{reduce} &
+\cross{IFARRAY}{remove} &
+\cross{IFARRAY}{remove!} \\
+\cross{IFARRAY}{removeDuplicates} &
+\cross{IFARRAY}{removeDuplicates!} &
+\cross{IFARRAY}{reverse!} &
+\cross{IFARRAY}{select} \\
+\cross{IFARRAY}{select!} &
+\cross{IFARRAY}{setelt} &
+\cross{IFARRAY}{size?} &
+\cross{IFARRAY}{sort} \\
+\cross{IFARRAY}{sort!} &
+\cross{IFARRAY}{sorted?} &
+\cross{IFARRAY}{swap!} &
+\cross{IFARRAY}{\#{}?} \\
+\cross{IFARRAY}{?$<$?} &
+\cross{IFARRAY}{?$<=$?} &
+\cross{IFARRAY}{?=?} &
+\cross{IFARRAY}{?$>$?} \\
+\cross{IFARRAY}{?$>=$?} &
+\cross{IFARRAY}{?\~{}=?} &
+\cross{IFARRAY}{?.?} &
+\end{tabular}
+
 <<domain IFARRAY IndexedFlexibleArray>>=
 )abbrev domain IFARRAY IndexedFlexibleArray
 ++ Author: Michael Monagan July/87, modified SMW June/91
@@ -40522,6 +41779,111 @@ IndexedFlexibleArray(S:Type, mn: Integer): Exports == Implementation where
 {\bf See}\\
 \pageto{List}{LIST}
 \pageto{AssociationList}{ALIST}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ILIST}{any?} &
+\cross{ILIST}{child?} &
+\cross{ILIST}{children} &
+\cross{ILIST}{coerce} \\
+\cross{ILIST}{concat} &
+\cross{ILIST}{convert} &
+\cross{ILIST}{concat!} &
+\cross{ILIST}{copyInto!} \\
+\cross{ILIST}{construct} &
+\cross{ILIST}{copy} &
+\cross{ILIST}{count} &
+\cross{ILIST}{cycleEntry} \\
+\cross{ILIST}{cycleLength} &
+\cross{ILIST}{cycleSplit!} &
+\cross{ILIST}{cycleTail} &
+\cross{ILIST}{cyclic?} \\
+\cross{ILIST}{delete} &
+\cross{ILIST}{delete!} &
+\cross{ILIST}{distance} &
+\cross{ILIST}{elt} \\
+\cross{ILIST}{empty} &
+\cross{ILIST}{empty?} &
+\cross{ILIST}{entries} &
+\cross{ILIST}{entry?} \\
+\cross{ILIST}{eq?} &
+\cross{ILIST}{eval} &
+\cross{ILIST}{every?} &
+\cross{ILIST}{explicitlyFinite?} \\
+\cross{ILIST}{fill!} &
+\cross{ILIST}{find} &
+\cross{ILIST}{first} &
+\cross{ILIST}{hash} \\
+\cross{ILIST}{index?} &
+\cross{ILIST}{indices} &
+\cross{ILIST}{insert} &
+\cross{ILIST}{insert!} \\
+\cross{ILIST}{last} &
+\cross{ILIST}{latex} &
+\cross{ILIST}{leaf?} &
+\cross{ILIST}{leaves} \\
+\cross{ILIST}{less?} &
+\cross{ILIST}{list} &
+\cross{ILIST}{map} &
+\cross{ILIST}{map!} \\
+\cross{ILIST}{max} &
+\cross{ILIST}{maxIndex} &
+\cross{ILIST}{member?} &
+\cross{ILIST}{members} \\
+\cross{ILIST}{merge} &
+\cross{ILIST}{merge!} &
+\cross{ILIST}{min} &
+\cross{ILIST}{minIndex} \\
+\cross{ILIST}{more?} &
+\cross{ILIST}{new} &
+\cross{ILIST}{node?} &
+\cross{ILIST}{nodes} \\
+\cross{ILIST}{parts} &
+\cross{ILIST}{position} &
+\cross{ILIST}{possiblyInfinite?} &
+\cross{ILIST}{qelt} \\
+\cross{ILIST}{qsetelt!} &
+\cross{ILIST}{reduce} &
+\cross{ILIST}{remove} &
+\cross{ILIST}{remove!} \\
+\cross{ILIST}{removeDuplicates} &
+\cross{ILIST}{removeDuplicates!} &
+\cross{ILIST}{rest} &
+\cross{ILIST}{reverse} \\
+\cross{ILIST}{reverse!} &
+\cross{ILIST}{sample} &
+\cross{ILIST}{second} &
+\cross{ILIST}{select} \\
+\cross{ILIST}{select!} &
+\cross{ILIST}{setchildren!} &
+\cross{ILIST}{setelt} &
+\cross{ILIST}{setfirst!} \\
+\cross{ILIST}{setlast!} &
+\cross{ILIST}{setrest!} &
+\cross{ILIST}{setvalue!} &
+\cross{ILIST}{size?} \\
+\cross{ILIST}{sort} &
+\cross{ILIST}{sort!} &
+\cross{ILIST}{sorted?} &
+\cross{ILIST}{split!} \\
+\cross{ILIST}{swap!} &
+\cross{ILIST}{tail} &
+\cross{ILIST}{third} &
+\cross{ILIST}{value} \\
+\cross{ILIST}{\#{}?} &
+\cross{ILIST}{?$<$?} &
+\cross{ILIST}{?$<=$?} &
+\cross{ILIST}{?=?} \\
+\cross{ILIST}{?$>$?} &
+\cross{ILIST}{?$>=$?} &
+\cross{ILIST}{?\~{}=?} &
+\cross{ILIST}{?.?} \\
+\cross{ILIST}{?.last} &
+\cross{ILIST}{?.rest} &
+\cross{ILIST}{?.first} &
+\cross{ILIST}{?.value} 
+\end{tabular}
+
 <<domain ILIST IndexedList>>=
 )abbrev domain ILIST IndexedList
 ++ Author: Michael Monagan
@@ -40727,6 +42089,81 @@ IndexedList(S:Type, mn:Integer): Exports == Implementation where
 \pageto{Matrix}{MATRIX}
 \pageto{RectangularMatrix}{RMATRIX}
 \pageto{SquareMatrix}{SQMATRIX}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IMATRIX}{any?} &
+\cross{IMATRIX}{antisymmetric?} &
+\cross{IMATRIX}{coerce} &
+\cross{IMATRIX}{column} &
+\cross{IMATRIX}{copy} \\
+\cross{IMATRIX}{count} &
+\cross{IMATRIX}{determinant} &
+\cross{IMATRIX}{diagonal?} &
+\cross{IMATRIX}{diagonalMatrix} &
+\cross{IMATRIX}{elt} \\
+\cross{IMATRIX}{empty} &
+\cross{IMATRIX}{empty?} &
+\cross{IMATRIX}{eq?} &
+\cross{IMATRIX}{eval} &
+\cross{IMATRIX}{every?} \\
+\cross{IMATRIX}{exquo} &
+\cross{IMATRIX}{fill!} &
+\cross{IMATRIX}{hash} &
+\cross{IMATRIX}{horizConcat} &
+\cross{IMATRIX}{inverse} \\
+\cross{IMATRIX}{latex} &
+\cross{IMATRIX}{less?} &
+\cross{IMATRIX}{listOfLists} &
+\cross{IMATRIX}{map} &
+\cross{IMATRIX}{map!} \\
+\cross{IMATRIX}{matrix} &
+\cross{IMATRIX}{maxColIndex} &
+\cross{IMATRIX}{maxRowIndex} &
+\cross{IMATRIX}{member?} &
+\cross{IMATRIX}{members} \\
+\cross{IMATRIX}{minColIndex} &
+\cross{IMATRIX}{minordet} &
+\cross{IMATRIX}{minRowIndex} &
+\cross{IMATRIX}{more?} &
+\cross{IMATRIX}{ncols} \\
+\cross{IMATRIX}{new} &
+\cross{IMATRIX}{nrows} &
+\cross{IMATRIX}{nullSpace} &
+\cross{IMATRIX}{nullity} &
+\cross{IMATRIX}{parts} \\
+\cross{IMATRIX}{qelt} &
+\cross{IMATRIX}{qsetelt!} &
+\cross{IMATRIX}{rank} &
+\cross{IMATRIX}{row} &
+\cross{IMATRIX}{rowEchelon} \\
+\cross{IMATRIX}{sample} &
+\cross{IMATRIX}{scalarMatrix} &
+\cross{IMATRIX}{setColumn!} &
+\cross{IMATRIX}{setRow!} &
+\cross{IMATRIX}{setelt} \\
+\cross{IMATRIX}{setsubMatrix!} &
+\cross{IMATRIX}{size?} &
+\cross{IMATRIX}{square?} &
+\cross{IMATRIX}{squareTop} &
+\cross{IMATRIX}{subMatrix} \\
+\cross{IMATRIX}{swapColumns!} &
+\cross{IMATRIX}{swapRows!} &
+\cross{IMATRIX}{symmetric?} &
+\cross{IMATRIX}{transpose} &
+\cross{IMATRIX}{vertConcat} \\
+\cross{IMATRIX}{zero} &
+\cross{IMATRIX}{\#{}?} &
+\cross{IMATRIX}{?*?} &
+\cross{IMATRIX}{?**?} &
+\cross{IMATRIX}{?/?} \\
+\cross{IMATRIX}{?=?} &
+\cross{IMATRIX}{?\~{}=?} &
+\cross{IMATRIX}{?+?} &
+\cross{IMATRIX}{-?} &
+\cross{IMATRIX}{?-?} 
+\end{tabular}
+
 <<domain IMATRIX IndexedMatrix>>=
 )abbrev domain IMATRIX IndexedMatrix
 ++ Author: Grabmeier, Gschnitzer, Williamson
@@ -40812,6 +42249,90 @@ IndexedMatrix(R,mnRow,mnCol): Exports == Implementation where
 \pageto{IndexedFlexibleArray}{IFARRAY}
 \pageto{FlexibleArray}{FARRAY}
 \pageto{OneDimensionalArray}{ARRAY1}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IARRAY1}{concat} &
+\cross{IARRAY1}{construct} &
+\cross{IARRAY1}{copy} &
+\cross{IARRAY1}{delete} &
+\cross{IARRAY1}{elt} \\
+\cross{IARRAY1}{empty} &
+\cross{IARRAY1}{empty?} &
+\cross{IARRAY1}{entries} &
+\cross{IARRAY1}{eq?} &
+\cross{IARRAY1}{index?} \\
+\cross{IARRAY1}{indices} &
+\cross{IARRAY1}{insert} &
+\cross{IARRAY1}{insert} &
+\cross{IARRAY1}{map} &
+\cross{IARRAY1}{map} \\
+\cross{IARRAY1}{new} &
+\cross{IARRAY1}{qelt} &
+\cross{IARRAY1}{reverse} &
+\cross{IARRAY1}{sample} &
+\cross{IARRAY1}{any?} \\
+\cross{IARRAY1}{coerce} &
+\cross{IARRAY1}{convert} &
+\cross{IARRAY1}{copyInto!} &
+\cross{IARRAY1}{count} &
+\cross{IARRAY1}{count} \\
+\cross{IARRAY1}{delete} &
+\cross{IARRAY1}{entry?} &
+\cross{IARRAY1}{eval} &
+\cross{IARRAY1}{eval} &
+\cross{IARRAY1}{eval} \\
+\cross{IARRAY1}{eval} &
+\cross{IARRAY1}{every?} &
+\cross{IARRAY1}{fill!} &
+\cross{IARRAY1}{find} &
+\cross{IARRAY1}{first} \\
+\cross{IARRAY1}{hash} &
+\cross{IARRAY1}{latex} &
+\cross{IARRAY1}{less?} &
+\cross{IARRAY1}{map!} &
+\cross{IARRAY1}{max} \\
+\cross{IARRAY1}{maxIndex} &
+\cross{IARRAY1}{member?} &
+\cross{IARRAY1}{members} &
+\cross{IARRAY1}{merge} &
+\cross{IARRAY1}{merge} \\
+\cross{IARRAY1}{min} &
+\cross{IARRAY1}{minIndex} &
+\cross{IARRAY1}{more?} &
+\cross{IARRAY1}{parts} &
+\cross{IARRAY1}{position} \\
+\cross{IARRAY1}{position} &
+\cross{IARRAY1}{position} &
+\cross{IARRAY1}{qsetelt!} &
+\cross{IARRAY1}{reduce} &
+\cross{IARRAY1}{reduce} \\
+\cross{IARRAY1}{reduce} &
+\cross{IARRAY1}{remove} &
+\cross{IARRAY1}{remove} &
+\cross{IARRAY1}{removeDuplicates} &
+\cross{IARRAY1}{reverse!} \\
+\cross{IARRAY1}{select} &
+\cross{IARRAY1}{setelt} &
+\cross{IARRAY1}{setelt} &
+\cross{IARRAY1}{size?} &
+\cross{IARRAY1}{sort} \\
+\cross{IARRAY1}{sort} &
+\cross{IARRAY1}{sort!} &
+\cross{IARRAY1}{sort!} &
+\cross{IARRAY1}{sorted?} &
+\cross{IARRAY1}{sorted?} \\
+\cross{IARRAY1}{swap!} &
+\cross{IARRAY1}{\#{}?} &
+\cross{IARRAY1}{?$<$?} &
+\cross{IARRAY1}{?$<=$?} &
+\cross{IARRAY1}{?=?} \\
+\cross{IARRAY1}{?$>$?} &
+\cross{IARRAY1}{?$>=$?} &
+\cross{IARRAY1}{?\~{}=?} &
+\cross{IARRAY1}{?.?} &
+\end{tabular}
+
 <<domain IARRAY1 IndexedOneDimensionalArray>>=
 )abbrev domain IARRAY1 IndexedOneDimensionalArray
 ++ Author Micheal Monagan Aug/87
@@ -40913,6 +42434,87 @@ IndexedOneDimensionalArray(S:Type, mn:Integer):
 \pageto{Character}{CHAR}
 \pageto{CharacterClass}{CCLASS}
 \pageto{String}{STRING}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ISTRING}{any?} &
+\cross{ISTRING}{coerce} &
+\cross{ISTRING}{concat} &
+\cross{ISTRING}{construct} &
+\cross{ISTRING}{convert} \\
+\cross{ISTRING}{copy} &
+\cross{ISTRING}{copyInto!} &
+\cross{ISTRING}{count} &
+\cross{ISTRING}{delete} &
+\cross{ISTRING}{elt} \\
+\cross{ISTRING}{empty} &
+\cross{ISTRING}{empty?} &
+\cross{ISTRING}{entries} &
+\cross{ISTRING}{entry?} &
+\cross{ISTRING}{eq?} \\
+\cross{ISTRING}{eval} &
+\cross{ISTRING}{every?} &
+\cross{ISTRING}{fill!} &
+\cross{ISTRING}{find} &
+\cross{ISTRING}{first} \\
+\cross{ISTRING}{hash} &
+\cross{ISTRING}{index?} &
+\cross{ISTRING}{indices} &
+\cross{ISTRING}{insert} &
+\cross{ISTRING}{latex} \\
+\cross{ISTRING}{leftTrim} &
+\cross{ISTRING}{less?} &
+\cross{ISTRING}{lowerCase} &
+\cross{ISTRING}{lowerCase!} &
+\cross{ISTRING}{map} \\
+\cross{ISTRING}{map!} &
+\cross{ISTRING}{match} &
+\cross{ISTRING}{match?} &
+\cross{ISTRING}{max} &
+\cross{ISTRING}{maxIndex} \\
+\cross{ISTRING}{member?} &
+\cross{ISTRING}{members} &
+\cross{ISTRING}{merge} &
+\cross{ISTRING}{min} &
+\cross{ISTRING}{minIndex} \\
+\cross{ISTRING}{more?} &
+\cross{ISTRING}{new} &
+\cross{ISTRING}{parts} &
+\cross{ISTRING}{prefix?} &
+\cross{ISTRING}{position} \\
+\cross{ISTRING}{qelt} &
+\cross{ISTRING}{qsetelt!} &
+\cross{ISTRING}{reduce} &
+\cross{ISTRING}{remove} &
+\cross{ISTRING}{removeDuplicates} \\
+\cross{ISTRING}{replace} &
+\cross{ISTRING}{reverse} &
+\cross{ISTRING}{reverse!} &
+\cross{ISTRING}{rightTrim} &
+\cross{ISTRING}{sample} \\
+\cross{ISTRING}{select} &
+\cross{ISTRING}{setelt} &
+\cross{ISTRING}{size?} &
+\cross{ISTRING}{sort} &
+\cross{ISTRING}{sort!} \\
+\cross{ISTRING}{sorted?} &
+\cross{ISTRING}{split} &
+\cross{ISTRING}{suffix?} &
+\cross{ISTRING}{substring?} &
+\cross{ISTRING}{swap!} \\
+\cross{ISTRING}{trim} &
+\cross{ISTRING}{upperCase} &
+\cross{ISTRING}{upperCase!} &
+\cross{ISTRING}{\#{}?} &
+\cross{ISTRING}{?$<$?} \\
+\cross{ISTRING}{?$<=$?} &
+\cross{ISTRING}{?=?} &
+\cross{ISTRING}{?$>$?} &
+\cross{ISTRING}{?$>=$?} &
+\cross{ISTRING}{?\~{}=?} \\
+\cross{ISTRING}{?.?} &&&&
+\end{tabular}
+
 <<domain ISTRING IndexedString>>=
 )abbrev domain ISTRING IndexedString
 ++ Authors: Stephen Watt, Michael Monagan, Manuel Bronstein 1986 .. 1991
@@ -41140,6 +42742,51 @@ first column in an array and vice versa.
 {\bf See}\\
 \pageto{InnerIndexedTwoDimensionalArray}{IIARRAY2}
 \pageto{TwoDimensionalArray}{ARRAY2}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IARRAY2}{any?} &
+\cross{IARRAY2}{coerce} &
+\cross{IARRAY2}{column} &
+\cross{IARRAY2}{copy} &
+\cross{IARRAY2}{count} \\
+\cross{IARRAY2}{count} &
+\cross{IARRAY2}{elt} &
+\cross{IARRAY2}{empty} &
+\cross{IARRAY2}{empty?} &
+\cross{IARRAY2}{eq?} \\
+\cross{IARRAY2}{eval} &
+\cross{IARRAY2}{every?} &
+\cross{IARRAY2}{fill!} &
+\cross{IARRAY2}{hash} &
+\cross{IARRAY2}{latex} \\
+\cross{IARRAY2}{less?} &
+\cross{IARRAY2}{maxColIndex} &
+\cross{IARRAY2}{maxRowIndex} &
+\cross{IARRAY2}{map} &
+\cross{IARRAY2}{map!} \\
+\cross{IARRAY2}{member?} &
+\cross{IARRAY2}{members} &
+\cross{IARRAY2}{minColIndex} &
+\cross{IARRAY2}{minRowIndex} &
+\cross{IARRAY2}{more?} \\
+\cross{IARRAY2}{ncols} &
+\cross{IARRAY2}{new} &
+\cross{IARRAY2}{nrows} &
+\cross{IARRAY2}{parts} &
+\cross{IARRAY2}{qelt} \\
+\cross{IARRAY2}{qsetelt!} &
+\cross{IARRAY2}{row} &
+\cross{IARRAY2}{sample} &
+\cross{IARRAY2}{setColumn!} &
+\cross{IARRAY2}{setRow!} \\
+\cross{IARRAY2}{setelt} &
+\cross{IARRAY2}{size?} &
+\cross{IARRAY2}{\#{}?} &
+\cross{IARRAY2}{?=?} &
+\cross{IARRAY2}{?\~{}=?}
+\end{tabular}
+
 <<domain IARRAY2 IndexedTwoDimensionalArray>>=
 )abbrev domain IARRAY2 IndexedTwoDimensionalArray
 IndexedTwoDimensionalArray(R,mnRow,mnCol):Exports == Implementation where
@@ -41165,6 +42812,82 @@ IndexedTwoDimensionalArray(R,mnRow,mnCol):Exports == Implementation where
 \section{domain IVECTOR IndexedVector}
 \pagehead{IndexedVector}{IVECTOR}
 \pagepic{ps/v103indexedvector.ps}{IVECTOR}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IVECTOR}{any?} &
+\cross{IVECTOR}{coerce} &
+\cross{IVECTOR}{concat} &
+\cross{IVECTOR}{construct} &
+\cross{IVECTOR}{convert} \\
+\cross{IVECTOR}{copy} &
+\cross{IVECTOR}{copyInto!} &
+\cross{IVECTOR}{count} &
+\cross{IVECTOR}{cross} &
+\cross{IVECTOR}{delete} \\
+\cross{IVECTOR}{dot} &
+\cross{IVECTOR}{elt} &
+\cross{IVECTOR}{empty} &
+\cross{IVECTOR}{empty?} &
+\cross{IVECTOR}{entries} \\
+\cross{IVECTOR}{entry?} &
+\cross{IVECTOR}{eq?} &
+\cross{IVECTOR}{eval} &
+\cross{IVECTOR}{every?} &
+\cross{IVECTOR}{fill!} \\
+\cross{IVECTOR}{find} &
+\cross{IVECTOR}{first} &
+\cross{IVECTOR}{hash} &
+\cross{IVECTOR}{index?} &
+\cross{IVECTOR}{indices} \\
+\cross{IVECTOR}{insert} &
+\cross{IVECTOR}{latex} &
+\cross{IVECTOR}{length} &
+\cross{IVECTOR}{less?} &
+\cross{IVECTOR}{magnitude} \\
+\cross{IVECTOR}{map!} &
+\cross{IVECTOR}{max} &
+\cross{IVECTOR}{maxIndex} &
+\cross{IVECTOR}{member?} &
+\cross{IVECTOR}{members} \\
+\cross{IVECTOR}{merge} &
+\cross{IVECTOR}{min} &
+\cross{IVECTOR}{minIndex} &
+\cross{IVECTOR}{more?} &
+\cross{IVECTOR}{new} \\
+\cross{IVECTOR}{outerProduct} &
+\cross{IVECTOR}{parts} &
+\cross{IVECTOR}{position} &
+\cross{IVECTOR}{qelt} &
+\cross{IVECTOR}{qsetelt!} \\
+\cross{IVECTOR}{reduce} &
+\cross{IVECTOR}{remove} &
+\cross{IVECTOR}{removeDuplicates} &
+\cross{IVECTOR}{reverse} &
+\cross{IVECTOR}{reverse!} \\
+\cross{IVECTOR}{sample} &
+\cross{IVECTOR}{select} &
+\cross{IVECTOR}{setelt} &
+\cross{IVECTOR}{size?} &
+\cross{IVECTOR}{sort} \\
+\cross{IVECTOR}{sort!} &
+\cross{IVECTOR}{sorted?} &
+\cross{IVECTOR}{swap!} &
+\cross{IVECTOR}{zero} &
+\cross{IVECTOR}{\#{}?} \\
+\cross{IVECTOR}{?*?} &
+\cross{IVECTOR}{?+?} &
+\cross{IVECTOR}{?-?} &
+\cross{IVECTOR}{?$<$?} &
+\cross{IVECTOR}{?$<=$?} \\
+\cross{IVECTOR}{?=?} &
+\cross{IVECTOR}{?$>$?} &
+\cross{IVECTOR}{?$>=$?} &
+\cross{IVECTOR}{?\~{}=?} &
+\cross{IVECTOR}{-?} \\
+\cross{IVECTOR}{?.?} &&&&
+\end{tabular}
+
 <<domain IVECTOR IndexedVector>>=
 )abbrev domain IVECTOR IndexedVector
 ++ Author:
@@ -41194,6 +42917,18 @@ IndexedVector(R:Type, mn:Integer):
 \section{domain ITUPLE InfiniteTuple}
 \pagehead{InfiniteTuple}{ITUPLE}
 \pagepic{ps/v103infinitetuple.ps}{ITUPLE}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{ITUPLE}{coerce} &
+\cross{ITUPLE}{construct} &
+\cross{ITUPLE}{filterUntil} &
+\cross{ITUPLE}{filterWhile} &
+\cross{ITUPLE}{generate} &
+\cross{ITUPLE}{map} &
+\cross{ITUPLE}{select} 
+\end{tabular}
+
 <<domain ITUPLE InfiniteTuple>>=
 )abbrev domain ITUPLE InfiniteTuple
 ++ Infinite tuples for the interpreter
@@ -41244,6 +42979,99 @@ InfiniteTuple(S:Type): Exports == Implementation where
 \pagepic{ps/v103inneralgebraicnumber.ps}{IAN}{1.00}
 {\bf See}\\
 \pageto{AlgebraicNumber}{AN}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IAN}{0} &
+\cross{IAN}{1} &
+\cross{IAN}{associates?} &
+\cross{IAN}{belong?} &
+\cross{IAN}{box} \\
+\cross{IAN}{characteristic} &
+\cross{IAN}{coerce} &
+\cross{IAN}{convert} &
+\cross{IAN}{D} &
+\cross{IAN}{definingPolynomial} \\
+\cross{IAN}{denom} &
+\cross{IAN}{differentiate} &
+\cross{IAN}{distribute} &
+\cross{IAN}{divide} &
+\cross{IAN}{elt} \\
+\cross{IAN}{euclideanSize} &
+\cross{IAN}{eval} &
+\cross{IAN}{even?} &
+\cross{IAN}{expressIdealMember} &
+\cross{IAN}{exquo} \\
+\cross{IAN}{extendedEuclidean} &
+\cross{IAN}{factor} &
+\cross{IAN}{freeOf?} &
+\cross{IAN}{gcd} &
+\cross{IAN}{gcdPolynomial} \\
+\cross{IAN}{hash} &
+\cross{IAN}{height} &
+\cross{IAN}{inv} &
+\cross{IAN}{is?} &
+\cross{IAN}{kernel} \\
+\cross{IAN}{kernels} &
+\cross{IAN}{latex} &
+\cross{IAN}{lcm} &
+\cross{IAN}{mainKernel} &
+\cross{IAN}{map} \\
+\cross{IAN}{max} &
+\cross{IAN}{min} &
+\cross{IAN}{minPoly} &
+\cross{IAN}{multiEuclidean} &
+\cross{IAN}{norm} \\
+\cross{IAN}{nthRoot} &
+\cross{IAN}{numer} &
+\cross{IAN}{odd?} &
+\cross{IAN}{one?} &
+\cross{IAN}{operator} \\
+\cross{IAN}{operators} &
+\cross{IAN}{paren} &
+\cross{IAN}{prime?} &
+\cross{IAN}{principalIdeal} &
+\cross{IAN}{recip} \\
+\cross{IAN}{reduce} &
+\cross{IAN}{reducedSystem} &
+\cross{IAN}{retract} &
+\cross{IAN}{retractIfCan} &
+\cross{IAN}{rootOf} \\
+\cross{IAN}{rootsOf} &
+\cross{IAN}{sample} &
+\cross{IAN}{sizeLess?} &
+\cross{IAN}{sqrt} &
+\cross{IAN}{squareFree} \\
+\cross{IAN}{squareFreePart} &
+\cross{IAN}{subst} &
+\cross{IAN}{subtractIfCan} &
+\cross{IAN}{tower} &
+\cross{IAN}{trueEqual} \\
+\cross{IAN}{unit?} &
+\cross{IAN}{unitCanonical} &
+\cross{IAN}{unitNormal} &
+\cross{IAN}{zero?} &
+\cross{IAN}{zeroOf} \\
+\cross{IAN}{zerosOf} &
+\cross{IAN}{?*?} &
+\cross{IAN}{?**?} &
+\cross{IAN}{?+?} &
+\cross{IAN}{-?} \\
+\cross{IAN}{?-?} &
+\cross{IAN}{?/?} &
+\cross{IAN}{?$<$?} &
+\cross{IAN}{?$<=$?} &
+\cross{IAN}{?=?} \\
+\cross{IAN}{?$>$?} &
+\cross{IAN}{?$>=$?} &
+\cross{IAN}{?\^{}?} &
+\cross{IAN}{?\~{}=?} &
+\cross{IAN}{?*?} \\
+\cross{IAN}{?**?} &
+\cross{IAN}{?quo?} &
+\cross{IAN}{?rem?} &&
+\end{tabular}
+
 <<domain IAN InnerAlgebraicNumber>>=
 )abbrev domain IAN InnerAlgebraicNumber
 ++ Algebraic closure of the rational numbers
@@ -41403,6 +43231,96 @@ InnerAlgebraicNumber(): Exports == Implementation where
 \pageto{FiniteFieldExtensionByPolynomial}{FFP}
 \pageto{FiniteFieldExtension}{FFX}
 \pageto{FiniteField}{FF}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{IFF}{0} &
+\cross{IFF}{1} &
+\cross{IFF}{algebraic?} \\
+\cross{IFF}{associates?} &
+\cross{IFF}{basis} &
+\cross{IFF}{characteristic} \\
+\cross{IFF}{charthRoot} &
+\cross{IFF}{coerce} &
+\cross{IFF}{conditionP} \\
+\cross{IFF}{coordinates} &
+\cross{IFF}{createNormalElement} &
+\cross{IFF}{createPrimitiveElement} \\
+\cross{IFF}{D} &
+\cross{IFF}{definingPolynomial} &
+\cross{IFF}{degree} \\
+\cross{IFF}{dimension} &
+\cross{IFF}{differentiate} &
+\cross{IFF}{discreteLog} \\
+\cross{IFF}{divide} &
+\cross{IFF}{euclideanSize} &
+\cross{IFF}{expressIdealMember} \\
+\cross{IFF}{exquo} &
+\cross{IFF}{extendedEuclidean} &
+\cross{IFF}{extensionDegree} \\
+\cross{IFF}{factor} &
+\cross{IFF}{factorsOfCyclicGroupSize} &
+\cross{IFF}{Frobenius} \\
+\cross{IFF}{gcd} &
+\cross{IFF}{gcdPolynomial} &
+\cross{IFF}{generator} \\
+\cross{IFF}{hash} &
+\cross{IFF}{index} &
+\cross{IFF}{inGroundField?} \\
+\cross{IFF}{init} &
+\cross{IFF}{inv} &
+\cross{IFF}{latex} \\
+\cross{IFF}{lcm} &
+\cross{IFF}{linearAssociatedExp} &
+\cross{IFF}{linearAssociatedLog} \\
+\cross{IFF}{linearAssociatedOrder} &
+\cross{IFF}{lookup} &
+\cross{IFF}{minimalPolynomial} \\
+\cross{IFF}{multiEuclidean} &
+\cross{IFF}{nextItem} &
+\cross{IFF}{norm} \\
+\cross{IFF}{normal?} &
+\cross{IFF}{normalElement} &
+\cross{IFF}{one?} \\
+\cross{IFF}{order} &
+\cross{IFF}{prime?} &
+\cross{IFF}{primeFrobenius} \\
+\cross{IFF}{primitive?} &
+\cross{IFF}{primitiveElement} &
+\cross{IFF}{principalIdeal} \\
+\cross{IFF}{random} &
+\cross{IFF}{recip} &
+\cross{IFF}{representationType} \\
+\cross{IFF}{represents} &
+\cross{IFF}{retract} &
+\cross{IFF}{retractIfCan} \\
+\cross{IFF}{sample} &
+\cross{IFF}{size} &
+\cross{IFF}{sizeLess?} \\
+\cross{IFF}{squareFree} &
+\cross{IFF}{squareFreePart} &
+\cross{IFF}{subtractIfCan} \\
+\cross{IFF}{tableForDiscreteLogarithm} &
+\cross{IFF}{trace} &
+\cross{IFF}{transcendenceDegree} \\
+\cross{IFF}{transcendent?} &
+\cross{IFF}{unit?} &
+\cross{IFF}{unitCanonical} \\
+\cross{IFF}{unitNormal} &
+\cross{IFF}{zero?} &
+\cross{IFF}{?*?} \\
+\cross{IFF}{?**?} &
+\cross{IFF}{?+?} &
+\cross{IFF}{?-?} \\
+\cross{IFF}{-?} &
+\cross{IFF}{?/?} &
+\cross{IFF}{?=?} \\
+\cross{IFF}{?\^{}?} &
+\cross{IFF}{?\~{}=?} &
+\cross{IFF}{?quo?} \\
+\cross{IFF}{?rem?} &&
+\end{tabular}
+
 <<domain IFF InnerFiniteField>>=
 )abbrev domain IFF InnerFiniteField
 ++ Author: ???
@@ -41444,6 +43362,32 @@ InnerFiniteField(p:PositiveInteger, n:PositiveInteger) ==
 \pageto{FreeGroup}{FGROUP}
 \pageto{FreeAbelianMonoid}{FAMONOID}
 \pageto{FreeAbelianGroup}{FAGROUP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IFAMON}{0} &
+\cross{IFAMON}{coefficient} &
+\cross{IFAMON}{coerce} &
+\cross{IFAMON}{hash} &
+\cross{IFAMON}{highCommonTerms} \\
+\cross{IFAMON}{latex} &
+\cross{IFAMON}{mapCoef} &
+\cross{IFAMON}{mapGen} &
+\cross{IFAMON}{nthCoef} &
+\cross{IFAMON}{nthFactor} \\
+\cross{IFAMON}{retract} &
+\cross{IFAMON}{retractIfCan} &
+\cross{IFAMON}{sample} &
+\cross{IFAMON}{size} &
+\cross{IFAMON}{subtractIfCan} \\
+\cross{IFAMON}{terms} &
+\cross{IFAMON}{zero?} &
+\cross{IFAMON}{?\~{}=?} &
+\cross{IFAMON}{?*?} &
+\cross{IFAMON}{?+?} \\
+\cross{IFAMON}{?=?} &&&&
+\end{tabular}
+
 <<domain IFAMON InnerFreeAbelianMonoid>>=
 )abbrev domain IFAMON InnerFreeAbelianMonoid
 ++ Internal free abelian monoid on any set of generators
@@ -41496,6 +43440,50 @@ This is an internal type which provides an implementation of
 {\bf See}\\
 \pageto{IndexedTwoDimensionalArray}{IARRAY2}
 \pageto{TwoDimensionalArray}{ARRAY2}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IIARRAY2}{any?} &
+\cross{IIARRAY2}{coerce} &
+\cross{IIARRAY2}{column} &
+\cross{IIARRAY2}{copy} &
+\cross{IIARRAY2}{count} \\
+\cross{IIARRAY2}{elt} &
+\cross{IIARRAY2}{empty} &
+\cross{IIARRAY2}{empty?} &
+\cross{IIARRAY2}{eq?} &
+\cross{IIARRAY2}{eval} \\
+\cross{IIARRAY2}{every?} &
+\cross{IIARRAY2}{fill!} &
+\cross{IIARRAY2}{hash} &
+\cross{IIARRAY2}{latex} &
+\cross{IIARRAY2}{less?} \\
+\cross{IIARRAY2}{map} &
+\cross{IIARRAY2}{map!} &
+\cross{IIARRAY2}{maxColIndex} &
+\cross{IIARRAY2}{maxRowIndex} &
+\cross{IIARRAY2}{member?} \\
+\cross{IIARRAY2}{members} &
+\cross{IIARRAY2}{minColIndex} &
+\cross{IIARRAY2}{minRowIndex} &
+\cross{IIARRAY2}{more?} &
+\cross{IIARRAY2}{ncols} \\
+\cross{IIARRAY2}{new} &
+\cross{IIARRAY2}{nrows} &
+\cross{IIARRAY2}{parts} &
+\cross{IIARRAY2}{qelt} &
+\cross{IIARRAY2}{qsetelt!} \\
+\cross{IIARRAY2}{row} &
+\cross{IIARRAY2}{sample} &
+\cross{IIARRAY2}{setColumn!} &
+\cross{IIARRAY2}{setelt} &
+\cross{IIARRAY2}{setRow!} \\
+\cross{IIARRAY2}{size?} &
+\cross{IIARRAY2}{\#{}?} &
+\cross{IIARRAY2}{?=?} &
+\cross{IIARRAY2}{?\~{}=?} &
+\end{tabular}
+
 <<domain IIARRAY2 InnerIndexedTwoDimensionalArray>>=
 )abbrev domain IIARRAY2 InnerIndexedTwoDimensionalArray
 InnerIndexedTwoDimensionalArray(R,mnRow,mnCol,Row,Col):_
@@ -41596,6 +43584,57 @@ InnerIndexedTwoDimensionalArray(R,mnRow,mnCol,Row,Col):_
 \pageto{PAdicRationalConstructor}{PADICRC}
 \pageto{PAdicRational}{PADICRAT}
 \pageto{BalancedPAdicRational}{BPADICRT}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{IPADIC}{0} &
+\cross{IPADIC}{1} &
+\cross{IPADIC}{approximate} &
+\cross{IPADIC}{associates?} \\
+\cross{IPADIC}{characteristic} &
+\cross{IPADIC}{coerce} &
+\cross{IPADIC}{complete} &
+\cross{IPADIC}{digits} \\
+\cross{IPADIC}{divide} &
+\cross{IPADIC}{euclideanSize} &
+\cross{IPADIC}{expressIdealMember} &
+\cross{IPADIC}{exquo} \\
+\cross{IPADIC}{extend} &
+\cross{IPADIC}{extendedEuclidean} &
+\cross{IPADIC}{gcd} &
+\cross{IPADIC}{gcdPolynomial} \\
+\cross{IPADIC}{hash} &
+\cross{IPADIC}{latex} &
+\cross{IPADIC}{lcm} &
+\cross{IPADIC}{multiEuclidean} \\
+\cross{IPADIC}{moduloP} &
+\cross{IPADIC}{modulus} &
+\cross{IPADIC}{one?} &
+\cross{IPADIC}{order} \\
+\cross{IPADIC}{principalIdeal} &
+\cross{IPADIC}{quotientByP} &
+\cross{IPADIC}{recip} &
+\cross{IPADIC}{root} \\
+\cross{IPADIC}{sample} &
+\cross{IPADIC}{sizeLess?} &
+\cross{IPADIC}{sqrt} &
+\cross{IPADIC}{subtractIfCan} \\
+\cross{IPADIC}{unit?} &
+\cross{IPADIC}{unitCanonical} &
+\cross{IPADIC}{unitNormal} &
+\cross{IPADIC}{zero?} \\
+\cross{IPADIC}{?\~{}=?} &
+\cross{IPADIC}{?*?} &
+\cross{IPADIC}{?**?} &
+\cross{IPADIC}{?\^{}?} \\
+\cross{IPADIC}{?+?} &
+\cross{IPADIC}{?-?} &
+\cross{IPADIC}{-?} &
+\cross{IPADIC}{?=?} \\
+\cross{IPADIC}{?quo?} &
+\cross{IPADIC}{?rem?} &&
+\end{tabular}
+
 <<domain IPADIC InnerPAdicInteger>>=
 )abbrev domain IPADIC InnerPAdicInteger
 ++ Author: Clifton J. Williamson
@@ -41860,6 +43899,97 @@ InnerPAdicInteger(p,unBalanced?): Exports == Implementation where
 \pagepic{ps/v103innerprimefield.ps}{IPF}{1.00}
 {\bf See}\\
 \pageto{PrimeField}{PF}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{IPF}{0} &
+\cross{IPF}{1} &
+\cross{IPF}{algebraic?} \\
+\cross{IPF}{associates?} &
+\cross{IPF}{basis} &
+\cross{IPF}{characteristic} \\
+\cross{IPF}{charthRoot} &
+\cross{IPF}{coerce} &
+\cross{IPF}{conditionP} \\
+\cross{IPF}{convert} &
+\cross{IPF}{coordinates} &
+\cross{IPF}{createPrimitiveElement} \\
+\cross{IPF}{createNormalElement} &
+\cross{IPF}{D} &
+\cross{IPF}{definingPolynomial} \\
+\cross{IPF}{degree} &
+\cross{IPF}{differentiate} &
+\cross{IPF}{dimension} \\
+\cross{IPF}{discreteLog} &
+\cross{IPF}{divide} &
+\cross{IPF}{euclideanSize} \\
+\cross{IPF}{expressIdealMember} &
+\cross{IPF}{exquo} &
+\cross{IPF}{extendedEuclidean} \\
+\cross{IPF}{extensionDegree} &
+\cross{IPF}{factor} &
+\cross{IPF}{factorsOfCyclicGroupSize} \\
+\cross{IPF}{Frobenius} &
+\cross{IPF}{gcd} &
+\cross{IPF}{gcdPolynomial} \\
+\cross{IPF}{generator} &
+\cross{IPF}{hash} &
+\cross{IPF}{inGroundField?} \\
+\cross{IPF}{index} &
+\cross{IPF}{init} &
+\cross{IPF}{inv} \\
+\cross{IPF}{latex} &
+\cross{IPF}{lcm} &
+\cross{IPF}{linearAssociatedExp} \\
+\cross{IPF}{linearAssociatedLog} &
+\cross{IPF}{linearAssociatedOrder} &
+\cross{IPF}{lookup} \\
+\cross{IPF}{minimalPolynomial} &
+\cross{IPF}{multiEuclidean} &
+\cross{IPF}{nextItem} \\
+\cross{IPF}{norm} &
+\cross{IPF}{normal?} &
+\cross{IPF}{normalElement} \\
+\cross{IPF}{one?} &
+\cross{IPF}{order} &
+\cross{IPF}{prime?} \\
+\cross{IPF}{primeFrobenius} &
+\cross{IPF}{primitive?} &
+\cross{IPF}{primitiveElement} \\
+\cross{IPF}{principalIdeal} &
+\cross{IPF}{random} &
+\cross{IPF}{recip} \\
+\cross{IPF}{representationType} &
+\cross{IPF}{represents} &
+\cross{IPF}{retract} \\
+\cross{IPF}{retractIfCan} &
+\cross{IPF}{sample} &
+\cross{IPF}{size} \\
+\cross{IPF}{sizeLess?} &
+\cross{IPF}{squareFree} &
+\cross{IPF}{squareFreePart} \\
+\cross{IPF}{subtractIfCan} &
+\cross{IPF}{tableForDiscreteLogarithm} &
+\cross{IPF}{trace} \\
+\cross{IPF}{transcendenceDegree} &
+\cross{IPF}{transcendent?} &
+\cross{IPF}{unit?} \\
+\cross{IPF}{unitCanonical} &
+\cross{IPF}{unitNormal} &
+\cross{IPF}{zero?} \\
+\cross{IPF}{?*?} &
+\cross{IPF}{?**?} &
+\cross{IPF}{?+?} \\
+\cross{IPF}{?-?} &
+\cross{IPF}{-?} &
+\cross{IPF}{?/?} \\
+\cross{IPF}{?=?} &
+\cross{IPF}{?\^{}?} &
+\cross{IPF}{?\~{}=?} \\
+\cross{IPF}{?quo?} &
+\cross{IPF}{?rem?} &
+\end{tabular}
+
 <<domain IPF InnerPrimeField>>=
 )abbrev domain IPF InnerPrimeField
 -- Argument MUST be a prime.
@@ -42052,6 +44182,100 @@ InnerPrimeField(p:PositiveInteger): Exports == Implementation where
 \section{domain ISUPS InnerSparseUnivariatePowerSeries}
 \pagehead{InnerSparseUnivariatePowerSeries}{ISUPS}
 \pagepic{ps/v103innersparseunivariatepowerseries.ps}{ISUPS}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ISUPS}{0} &
+\cross{ISUPS}{1} &
+\cross{ISUPS}{approximate} &
+\cross{ISUPS}{associates?} \\
+\cross{ISUPS}{cAcos} &
+\cross{ISUPS}{cAcosh} &
+\cross{ISUPS}{cAcot} &
+\cross{ISUPS}{cAcoth} \\
+\cross{ISUPS}{cAcsc} &
+\cross{ISUPS}{cAcsch} &
+\cross{ISUPS}{cAsec} &
+\cross{ISUPS}{cAsech} \\
+\cross{ISUPS}{cAsin} &
+\cross{ISUPS}{cAsinh} &
+\cross{ISUPS}{cAtan} &
+\cross{ISUPS}{cAtanh} \\
+\cross{ISUPS}{cCos} &
+\cross{ISUPS}{cCosh} &
+\cross{ISUPS}{cCot} &
+\cross{ISUPS}{cCoth} \\
+\cross{ISUPS}{cCsc} &
+\cross{ISUPS}{cCsch} &
+\cross{ISUPS}{center} &
+\cross{ISUPS}{cExp} \\
+\cross{ISUPS}{cLog} &
+\cross{ISUPS}{coefficient} &
+\cross{ISUPS}{cPower} &
+\cross{ISUPS}{cRationalPower} \\
+\cross{ISUPS}{cSec} &
+\cross{ISUPS}{cSech} &
+\cross{ISUPS}{cSin} &
+\cross{ISUPS}{cSinh} \\
+\cross{ISUPS}{cTan} &
+\cross{ISUPS}{cTanh} &
+\cross{ISUPS}{characteristic} &
+\cross{ISUPS}{charthRoot} \\
+\cross{ISUPS}{coerce} &
+\cross{ISUPS}{complete} &
+\cross{ISUPS}{D} &
+\cross{ISUPS}{differentiate} \\
+\cross{ISUPS}{degree} &
+\cross{ISUPS}{eval} &
+\cross{ISUPS}{exquo} &
+\cross{ISUPS}{extend} \\
+\cross{ISUPS}{getRef} &
+\cross{ISUPS}{getStream} &
+\cross{ISUPS}{hash} &
+\cross{ISUPS}{iCompose} \\
+\cross{ISUPS}{iExquo} &
+\cross{ISUPS}{integrate} &
+\cross{ISUPS}{latex} &
+\cross{ISUPS}{leadingCoefficient} \\
+\cross{ISUPS}{leadingMonomial} &
+\cross{ISUPS}{makeSeries} &
+\cross{ISUPS}{map} &
+\cross{ISUPS}{monomial} \\
+\cross{ISUPS}{monomial?} &
+\cross{ISUPS}{multiplyCoefficients} &
+\cross{ISUPS}{multiplyExponents} &
+\cross{ISUPS}{one?} \\
+\cross{ISUPS}{order} &
+\cross{ISUPS}{pole?} &
+\cross{ISUPS}{recip} &
+\cross{ISUPS}{reductum} \\
+\cross{ISUPS}{sample} &
+\cross{ISUPS}{series} &
+\cross{ISUPS}{seriesToOutputForm} &
+\cross{ISUPS}{subtractIfCan} \\
+\cross{ISUPS}{taylorQuoByVar} &
+\cross{ISUPS}{terms} &
+\cross{ISUPS}{truncate} &
+\cross{ISUPS}{unit?} \\
+\cross{ISUPS}{unitCanonical} &
+\cross{ISUPS}{unitNormal} &
+\cross{ISUPS}{variable} &
+\cross{ISUPS}{variables} \\
+\cross{ISUPS}{zero?} &
+\cross{ISUPS}{?*?} &
+\cross{ISUPS}{?**?} &
+\cross{ISUPS}{?+?} \\
+\cross{ISUPS}{?-?} &
+\cross{ISUPS}{-?} &
+\cross{ISUPS}{?=?} &
+\cross{ISUPS}{?\^{}?} \\
+\cross{ISUPS}{?.?} &
+\cross{ISUPS}{?\~{}=?} &
+\cross{ISUPS}{?/?} &
+\cross{ISUPS}{?\^{}?} \\
+\cross{ISUPS}{?.?} &&&
+\end{tabular}
+
 <<domain ISUPS InnerSparseUnivariatePowerSeries>>=
 )abbrev domain ISUPS InnerSparseUnivariatePowerSeries
 ++ Author: Clifton J. Williamson
@@ -43128,6 +45352,67 @@ InnerSparseUnivariatePowerSeries(Coef): Exports == Implementation where
 \pageto{StringTable}{STRTBL}
 \pageto{GeneralSparseTable}{GSTBL}
 \pageto{SparseTable}{STBL}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{INTABL}{any?} &
+\cross{INTABL}{any?} &
+\cross{INTABL}{bag} &
+\cross{INTABL}{coerce} &
+\cross{INTABL}{construct} \\
+\cross{INTABL}{convert} &
+\cross{INTABL}{copy} &
+\cross{INTABL}{count} &
+\cross{INTABL}{dictionary} &
+\cross{INTABL}{entry?} \\
+\cross{INTABL}{elt} &
+\cross{INTABL}{empty} &
+\cross{INTABL}{empty?} &
+\cross{INTABL}{entries} &
+\cross{INTABL}{eq?} \\
+\cross{INTABL}{eval} &
+\cross{INTABL}{every?} &
+\cross{INTABL}{extract!} &
+\cross{INTABL}{fill!} &
+\cross{INTABL}{find} \\
+\cross{INTABL}{first} &
+\cross{INTABL}{hash} &
+\cross{INTABL}{index?} &
+\cross{INTABL}{indices} &
+\cross{INTABL}{insert!} \\
+\cross{INTABL}{inspect} &
+\cross{INTABL}{key?} &
+\cross{INTABL}{keys} &
+\cross{INTABL}{latex} &
+\cross{INTABL}{less?} \\
+\cross{INTABL}{map} &
+\cross{INTABL}{map!} &
+\cross{INTABL}{maxIndex} &
+\cross{INTABL}{member?} &
+\cross{INTABL}{members} \\
+\cross{INTABL}{minIndex} &
+\cross{INTABL}{more?} &
+\cross{INTABL}{parts} &
+\cross{INTABL}{sample} &
+\cross{INTABL}{qelt} \\
+\cross{INTABL}{qsetelt!} &
+\cross{INTABL}{reduce} &
+\cross{INTABL}{remove} &
+\cross{INTABL}{remove!} &
+\cross{INTABL}{removeDuplicates} \\
+\cross{INTABL}{search} &
+\cross{INTABL}{select} &
+\cross{INTABL}{select!} &
+\cross{INTABL}{setelt} &
+\cross{INTABL}{size?} \\
+\cross{INTABL}{swap!} &
+\cross{INTABL}{table} &
+\cross{INTABL}{?.?} &
+\cross{INTABL}{\#{}?} &
+\cross{INTABL}{?=?} \\
+\cross{INTABL}{?\~{}=?} &&&&
+\end{tabular}
+
 <<domain INTABL InnerTable>>=
 )abbrev domain INTABL InnerTable
 ++ Author: Barry Trager
@@ -43164,6 +45449,40 @@ InnerTable(Key: SetCategory, Entry: SetCategory, addDom):Exports == Implementati
 \pagepic{ps/v103innertaylorseries.ps}{ITAYLOR}{1.00}
 {\bf See}\\
 \pageto{UnivariateTaylorSeries}{UTS}
+
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ITAYLOR}{0} &
+\cross{ITAYLOR}{1} &
+\cross{ITAYLOR}{associates?} &
+\cross{ITAYLOR}{characteristic} &
+\cross{ITAYLOR}{coefficients} \\
+\cross{ITAYLOR}{coerce} &
+\cross{ITAYLOR}{exquo} &
+\cross{ITAYLOR}{hash} &
+\cross{ITAYLOR}{latex} &
+\cross{ITAYLOR}{one?} \\
+\cross{ITAYLOR}{order} &
+\cross{ITAYLOR}{pole?} &
+\cross{ITAYLOR}{recip} &
+\cross{ITAYLOR}{sample} &
+\cross{ITAYLOR}{series} \\
+\cross{ITAYLOR}{subtractIfCan} &
+\cross{ITAYLOR}{unit?} &
+\cross{ITAYLOR}{unitCanonical} &
+\cross{ITAYLOR}{unitNormal} &
+\cross{ITAYLOR}{zero?} \\
+\cross{ITAYLOR}{?\~{}=?} &
+\cross{ITAYLOR}{?*?} &
+\cross{ITAYLOR}{?**?} &
+\cross{ITAYLOR}{?\^{}?} &
+\cross{ITAYLOR}{?+?} \\
+\cross{ITAYLOR}{?-?} &
+\cross{ITAYLOR}{-?} &
+\cross{ITAYLOR}{?=?} &&
+\end{tabular}
+
 <<domain ITAYLOR InnerTaylorSeries>>=
 )abbrev domain ITAYLOR InnerTaylorSeries
 ++ Author: Clifton J. Williamson
@@ -43310,6 +45629,51 @@ InnerTaylorSeries(Coef): Exports == Implementation where
 \section{domain INFORM InputForm}
 \pagehead{InputForm}{INFORM}
 \pagepic{ps/v103inputform.ps}{INFORM}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{INFORM}{0} &
+\cross{INFORM}{1} &
+\cross{INFORM}{atom?} &
+\cross{INFORM}{binary} &
+\cross{INFORM}{car} \\
+\cross{INFORM}{cdr} &
+\cross{INFORM}{coerce} &
+\cross{INFORM}{compile} &
+\cross{INFORM}{convert} &
+\cross{INFORM}{declare} \\
+\cross{INFORM}{destruct} &
+\cross{INFORM}{eq} &
+\cross{INFORM}{expr} &
+\cross{INFORM}{flatten} &
+\cross{INFORM}{float} \\
+\cross{INFORM}{float?} &
+\cross{INFORM}{function} &
+\cross{INFORM}{hash} &
+\cross{INFORM}{integer} &
+\cross{INFORM}{integer?} \\
+\cross{INFORM}{interpret} &
+\cross{INFORM}{lambda} &
+\cross{INFORM}{latex} &
+\cross{INFORM}{list?} &
+\cross{INFORM}{null?} \\
+\cross{INFORM}{pair?} &
+\cross{INFORM}{parse} &
+\cross{INFORM}{string} &
+\cross{INFORM}{string?} &
+\cross{INFORM}{symbol} \\
+\cross{INFORM}{symbol?} &
+\cross{INFORM}{unparse} &
+\cross{INFORM}{\#{}?} &
+\cross{INFORM}{?\~{}=?} &
+\cross{INFORM}{?**?} \\
+\cross{INFORM}{?*?} &
+\cross{INFORM}{?+?} &
+\cross{INFORM}{?/?} &
+\cross{INFORM}{?=?} &
+\cross{INFORM}{?.?} 
+\end{tabular}
+
 <<domain INFORM InputForm>>=
 )abbrev domain INFORM InputForm
 ++ Parser forms
@@ -44175,6 +46539,96 @@ o )show Integer
 \pageto{NonNegativeInteger}{NNI}
 \pageto{PositiveInteger}{PI}
 \pageto{RomanNumeral}{ROMAN}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{INT}{0} &
+\cross{INT}{1} &
+\cross{INT}{abs} &
+\cross{INT}{addmod} \\
+\cross{INT}{associates?} &
+\cross{INT}{base} &
+\cross{INT}{binomial} &
+\cross{INT}{bit?} \\
+\cross{INT}{characteristic} &
+\cross{INT}{coerce} &
+\cross{INT}{convert} &
+\cross{INT}{copy} \\
+\cross{INT}{D} &
+\cross{INT}{dec} &
+\cross{INT}{differentiate} &
+\cross{INT}{divide} \\
+\cross{INT}{euclideanSize} &
+\cross{INT}{even?} &
+\cross{INT}{expressIdealMember} &
+\cross{INT}{exquo} \\
+\cross{INT}{extendedEuclidean} &
+\cross{INT}{extendedEuclidean} &
+\cross{INT}{factor} &
+\cross{INT}{factorial} \\
+\cross{INT}{gcd} &
+\cross{INT}{gcdPolynomial} &
+\cross{INT}{hash} &
+\cross{INT}{inc} \\
+\cross{INT}{init} &
+\cross{INT}{invmod} &
+\cross{INT}{latex} &
+\cross{INT}{lcm} \\
+\cross{INT}{length} &
+\cross{INT}{mask} &
+\cross{INT}{max} &
+\cross{INT}{min} \\
+\cross{INT}{mulmod} &
+\cross{INT}{multiEuclidean} &
+\cross{INT}{negative?} &
+\cross{INT}{nextItem} \\
+\cross{INT}{odd?} &
+\cross{INT}{OMwrite} &
+\cross{INT}{one?} &
+\cross{INT}{patternMatch} \\
+\cross{INT}{permutation} &
+\cross{INT}{positive?} &
+\cross{INT}{positiveRemainder} &
+\cross{INT}{powmod} \\
+\cross{INT}{prime?} &
+\cross{INT}{principalIdeal} &
+\cross{INT}{random} &
+\cross{INT}{rational} \\
+\cross{INT}{rational?} &
+\cross{INT}{rationalIfCan} &
+\cross{INT}{recip} &
+\cross{INT}{reducedSystem} \\
+\cross{INT}{retract} &
+\cross{INT}{retractIfCan} &
+\cross{INT}{sample} &
+\cross{INT}{shift} \\
+\cross{INT}{sign} &
+\cross{INT}{sizeLess?} &
+\cross{INT}{squareFree} &
+\cross{INT}{squareFreePart} \\
+\cross{INT}{submod} &
+\cross{INT}{subtractIfCan} &
+\cross{INT}{symmetricRemainder} &
+\cross{INT}{unit?} \\
+\cross{INT}{unitCanonical} &
+\cross{INT}{unitNormal} &
+\cross{INT}{zero?} &
+\cross{INT}{?*?} \\
+\cross{INT}{?**?} &
+\cross{INT}{?+?} &
+\cross{INT}{?-?} &
+\cross{INT}{-?} \\
+\cross{INT}{?$<$?} &
+\cross{INT}{?$<=$?} &
+\cross{INT}{?=?} &
+\cross{INT}{?$>$?} \\
+\cross{INT}{?$>=$?} &
+\cross{INT}{?\^{}?} &
+\cross{INT}{?\~{}=?} &
+\cross{INT}{?quo?} \\
+\cross{INT}{?rem?} &&&
+\end{tabular}
+
 <<domain INT Integer>>=
 )abbrev domain INT Integer
 ++ Author:
@@ -44367,6 +46821,37 @@ Integer: Join(IntegerNumberSystem, ConvertibleTo String, OpenMath) with
 \section{domain ZMOD IntegerMod}
 \pagehead{IntegerMod}{ZMOD}
 \pagepic{ps/v103integermod.ps}{ZMOD}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ZMOD}{0} &
+\cross{ZMOD}{1} &
+\cross{ZMOD}{characteristic} &
+\cross{ZMOD}{coerce} &
+\cross{ZMOD}{convert} \\
+\cross{ZMOD}{hash} &
+\cross{ZMOD}{index} &
+\cross{ZMOD}{init} &
+\cross{ZMOD}{latex} &
+\cross{ZMOD}{lookup} \\
+\cross{ZMOD}{nextItem} &
+\cross{ZMOD}{one?} &
+\cross{ZMOD}{random} &
+\cross{ZMOD}{recip} &
+\cross{ZMOD}{sample} \\
+\cross{ZMOD}{size} &
+\cross{ZMOD}{subtractIfCan} &
+\cross{ZMOD}{zero?} &
+\cross{ZMOD}{?\~{}=?} &
+\cross{ZMOD}{?*?} \\
+\cross{ZMOD}{?**?} &
+\cross{ZMOD}{?\^{}?} &
+\cross{ZMOD}{?+?} &
+\cross{ZMOD}{?-?} &
+\cross{ZMOD}{-?} \\
+\cross{ZMOD}{?=?} &&&&
+\end{tabular}
+
 <<domain ZMOD IntegerMod>>=
 )abbrev domain ZMOD IntegerMod
 ++ Author:
@@ -44465,6 +46950,19 @@ IntegerMod(p:PositiveInteger):
 \section{domain INTFTBL IntegrationFunctionsTable}
 \pagehead{IntegrationFunctionsTable}{INTFTBL}
 \pagepic{ps/v103integrationfunctionstable.ps}{INTFTBL}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllllll}
+\cross{INTFTBL}{clearTheFTable} &
+\cross{INTFTBL}{entries} &
+\cross{INTFTBL}{entry} &
+\cross{INTFTBL}{fTable} &
+\cross{INTFTBL}{insert!} &
+\cross{INTFTBL}{keys} &
+\cross{INTFTBL}{showAttributes} &
+\cross{INTFTBL}{showTheFTable} 
+\end{tabular}
+
 <<domain INTFTBL IntegrationFunctionsTable>>=
 )abbrev domain INTFTBL IntegrationFunctionsTable
 ++ Author: Brian Dupee
@@ -44573,6 +47071,33 @@ IntegrationFunctionsTable(): E == I where
 \section{domain IR IntegrationResult}
 \pagehead{IntegrationResult}{IR}
 \pagepic{ps/v103integrationresult.ps}{IR}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IR}{0} &
+\cross{IR}{coerce} &
+\cross{IR}{differentiate} &
+\cross{IR}{elem?} &
+\cross{IR}{hash} \\
+\cross{IR}{integral} &
+\cross{IR}{latex} &
+\cross{IR}{logpart} &
+\cross{IR}{mkAnswer} &
+\cross{IR}{notelem} \\
+\cross{IR}{ratpart} &
+\cross{IR}{retract} &
+\cross{IR}{retractIfCan} &
+\cross{IR}{subtractIfCan} &
+\cross{IR}{sample} \\
+\cross{IR}{zero?} &
+\cross{IR}{?\~{}=?} &
+\cross{IR}{?*?} &
+\cross{IR}{?+?} &
+\cross{IR}{?-?} \\
+\cross{IR}{-?} &
+\cross{IR}{?=?} &&&
+\end{tabular}
+
 <<domain IR IntegrationResult>>=
 )abbrev domain IR IntegrationResult
 ++ The result of a transcendental integration.
@@ -44755,6 +47280,83 @@ IntegrationResult(F:Field): Exports == Implementation where
 \section{domain INTRVL Interval}
 \pagehead{Interval}{INTRVL}
 \pagepic{ps/v103interval.ps}{INTRVL}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{INTRVL}{0} &
+\cross{INTRVL}{1} &
+\cross{INTRVL}{acos} &
+\cross{INTRVL}{acosh} &
+\cross{INTRVL}{acot} \\
+\cross{INTRVL}{acoth} &
+\cross{INTRVL}{acsc} &
+\cross{INTRVL}{acsch} &
+\cross{INTRVL}{asec} &
+\cross{INTRVL}{asech} \\
+\cross{INTRVL}{asin} &
+\cross{INTRVL}{asinh} &
+\cross{INTRVL}{associates?} &
+\cross{INTRVL}{atan} &
+\cross{INTRVL}{atanh} \\
+\cross{INTRVL}{characteristic} &
+\cross{INTRVL}{coerce} &
+\cross{INTRVL}{contains?} &
+\cross{INTRVL}{cos} &
+\cross{INTRVL}{cosh} \\
+\cross{INTRVL}{cot} &
+\cross{INTRVL}{coth} &
+\cross{INTRVL}{csc} &
+\cross{INTRVL}{csch} &
+\cross{INTRVL}{exp} \\
+\cross{INTRVL}{exquo} &
+\cross{INTRVL}{gcd} &
+\cross{INTRVL}{gcdPolynomial} &
+\cross{INTRVL}{hash} &
+\cross{INTRVL}{inf} \\
+\cross{INTRVL}{interval} &
+\cross{INTRVL}{latex} &
+\cross{INTRVL}{lcm} &
+\cross{INTRVL}{log} &
+\cross{INTRVL}{max} \\
+\cross{INTRVL}{min} &
+\cross{INTRVL}{negative?} &
+\cross{INTRVL}{nthRoot} &
+\cross{INTRVL}{one?} &
+\cross{INTRVL}{pi} \\
+\cross{INTRVL}{positive?} &
+\cross{INTRVL}{qinterval} &
+\cross{INTRVL}{recip} &
+\cross{INTRVL}{retract} &
+\cross{INTRVL}{retractIfCan} \\
+\cross{INTRVL}{sample} &
+\cross{INTRVL}{sec} &
+\cross{INTRVL}{sech} &
+\cross{INTRVL}{sin} &
+\cross{INTRVL}{sinh} \\
+\cross{INTRVL}{sqrt} &
+\cross{INTRVL}{subtractIfCan} &
+\cross{INTRVL}{sup} &
+\cross{INTRVL}{tan} &
+\cross{INTRVL}{tanh} \\
+\cross{INTRVL}{unit?} &
+\cross{INTRVL}{unitCanonical} &
+\cross{INTRVL}{unitNormal} &
+\cross{INTRVL}{width} &
+\cross{INTRVL}{zero?} \\
+\cross{INTRVL}{?*?} &
+\cross{INTRVL}{?**?} &
+\cross{INTRVL}{?+?} &
+\cross{INTRVL}{?-?} &
+\cross{INTRVL}{-?} \\
+\cross{INTRVL}{?$<$?} &
+\cross{INTRVL}{?$<=$?} &
+\cross{INTRVL}{?=?} &
+\cross{INTRVL}{?$>$?} &
+\cross{INTRVL}{?$>=$?} \\
+\cross{INTRVL}{?\^{}?} &
+\cross{INTRVL}{?\~{}=?} &&&
+\end{tabular}
+
 <<domain INTRVL Interval>>=
 )abbrev domain INTRVL Interval
 +++ Author: Mike Dewar
diff --git a/changelog b/changelog
index 77d2ba3..cee02a2 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20090116 tpd src/axiom-website/patches.html 20090116.01.tpd.patch
+20090116 tpd books/bookvol10.3 add exports
 20090115 tpd src/axiom-website/patches.html 20090115.01.tpd.patch
 20090115 tpd books/bookvol10.3 add exports
 20090114 tpd src/axiom-website/patches.html 20090114.01.tpd.patch
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index bb45eb9..7a50cf1 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -881,6 +881,8 @@ bookvol10.3 begin adding exports<br/>
 bookvol10.3 add exports<br/>
 <a href="patches/20090115.01.tpd.patch">20090115.01.tpd.patch</a>
 bookvol10.3 add exports<br/>
+<a href="patches/20090116.01.tpd.patch">20090116.01.tpd.patch</a>
+bookvol10.3 add exports<br/>
 
  </body>
 </html>

\start
Date: Fri, 16 Jan 2009 16:18:39 -0600
From: Tim Daly
To: list
Subject: 20090116.02.tpd.patch (bookvol10.3 add exports)

Add exports for chapters K and L
=======================================================================
diff --git a/books/bookvol10.3.pamphlet b/books/bookvol10.3.pamphlet
index e62139d..e09ee90 100644
--- a/books/bookvol10.3.pamphlet
+++ b/books/bookvol10.3.pamphlet
@@ -9995,7 +9995,7 @@ countable? c2
 
 --S 10 of 20
 countable? A0
-uon --R 
+--R 
 --R
 --R   (10)  true
 --R                                                                Type: Boolean
@@ -48123,6 +48123,32 @@ o )show Kernel
 \pagepic{ps/v103kernel.ps}{KERNEL}{1.00}
 {\bf See}\\
 \pageto{MakeCachableSet}{MKCHSET}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{KERNEL}{argument} &
+\cross{KERNEL}{coerce} &
+\cross{KERNEL}{convert} &
+\cross{KERNEL}{hash} &
+\cross{KERNEL}{height} \\
+\cross{KERNEL}{is?} &
+\cross{KERNEL}{kernel} &
+\cross{KERNEL}{latex} &
+\cross{KERNEL}{max} &
+\cross{KERNEL}{min} \\
+\cross{KERNEL}{name} &
+\cross{KERNEL}{operator} &
+\cross{KERNEL}{position} &
+\cross{KERNEL}{setPosition} &
+\cross{KERNEL}{symbolIfCan} \\
+\cross{KERNEL}{?\~{}=?} &
+\cross{KERNEL}{?$<$?} &
+\cross{KERNEL}{?$<=$?} &
+\cross{KERNEL}{?=?} &
+\cross{KERNEL}{?$>$?} \\
+\cross{KERNEL}{?$>=$?} &&&&
+\end{tabular}
+
 <<domain KERNEL Kernel>>=
 )abbrev domain KERNEL Kernel
 ++ Operators applied to elements of a set
@@ -48408,6 +48434,78 @@ o )show KeyedAccessFile
 \pageto{TextFile}{TEXTFILE}
 \pageto{BinaryFile}{BINFILE}
 \pageto{Library}{LIB}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{KAFILE}{any?} &
+\cross{KAFILE}{any?} &
+\cross{KAFILE}{bag} &
+\cross{KAFILE}{close!} &
+\cross{KAFILE}{coerce} \\
+\cross{KAFILE}{construct} &
+\cross{KAFILE}{convert} &
+\cross{KAFILE}{copy} &
+\cross{KAFILE}{count} &
+\cross{KAFILE}{count} \\
+\cross{KAFILE}{dictionary} &
+\cross{KAFILE}{elt} &
+\cross{KAFILE}{empty} &
+\cross{KAFILE}{empty?} &
+\cross{KAFILE}{entries} \\
+\cross{KAFILE}{entry?} &
+\cross{KAFILE}{eq?} &
+\cross{KAFILE}{eval} &
+\cross{KAFILE}{every?} &
+\cross{KAFILE}{every?} \\
+\cross{KAFILE}{extract!} &
+\cross{KAFILE}{fill!} &
+\cross{KAFILE}{find} &
+\cross{KAFILE}{first} &
+\cross{KAFILE}{hash} \\
+\cross{KAFILE}{index?} &
+\cross{KAFILE}{indices} &
+\cross{KAFILE}{insert!} &
+\cross{KAFILE}{inspect} &
+\cross{KAFILE}{iomode} \\
+\cross{KAFILE}{key?} &
+\cross{KAFILE}{keys} &
+\cross{KAFILE}{latex} &
+\cross{KAFILE}{less?} &
+\cross{KAFILE}{map} \\
+\cross{KAFILE}{map!} &
+\cross{KAFILE}{maxIndex} &
+\cross{KAFILE}{member?} &
+\cross{KAFILE}{members} &
+\cross{KAFILE}{minIndex} \\
+\cross{KAFILE}{more?} &
+\cross{KAFILE}{name} &
+\cross{KAFILE}{open} &
+\cross{KAFILE}{pack!} &
+\cross{KAFILE}{parts} \\
+\cross{KAFILE}{parts} &
+\cross{KAFILE}{qelt} &
+\cross{KAFILE}{qsetelt!} &
+\cross{KAFILE}{read!} &
+\cross{KAFILE}{reduce} \\
+\cross{KAFILE}{remove} &
+\cross{KAFILE}{remove!} &
+\cross{KAFILE}{removeDuplicates} &
+\cross{KAFILE}{reopen!} &
+\cross{KAFILE}{sample} \\
+\cross{KAFILE}{search} &
+\cross{KAFILE}{select} &
+\cross{KAFILE}{select!} &
+\cross{KAFILE}{setelt} &
+\cross{KAFILE}{size?} \\
+\cross{KAFILE}{swap!} &
+\cross{KAFILE}{table} &
+\cross{KAFILE}{write!} &
+\cross{KAFILE}{\#{}?} &
+\cross{KAFILE}{?\~{}=?} \\
+\cross{KAFILE}{?=?} &
+\cross{KAFILE}{?.?} &&&
+\end{tabular}
+
 <<domain KAFILE KeyedAccessFile>>=
 )abbrev domain KAFILE KeyedAccessFile
 ++ Author: Stephen M. Watt
@@ -48549,6 +48647,62 @@ KeyedAccessFile(Entry): KAFcategory == KAFcapsule where
 \section{domain LAUPOL LaurentPolynomial}
 \pagehead{LaurentPolynomial}{LAUPOL}
 \pagepic{ps/v103laurentpolynomial.ps}{LAUPOL}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{LAUPOL}{0} &
+\cross{LAUPOL}{1} &
+\cross{LAUPOL}{associates?} \\
+\cross{LAUPOL}{characteristic} &
+\cross{LAUPOL}{charthRoot} &
+\cross{LAUPOL}{coefficient} \\
+\cross{LAUPOL}{coerce} &
+\cross{LAUPOL}{convert} &
+\cross{LAUPOL}{D} \\
+\cross{LAUPOL}{degree} &
+\cross{LAUPOL}{differentiate} &
+\cross{LAUPOL}{divide} \\
+\cross{LAUPOL}{euclideanSize} &
+\cross{LAUPOL}{expressIdealMember} &
+\cross{LAUPOL}{exquo} \\
+\cross{LAUPOL}{extendedEuclidean} &
+\cross{LAUPOL}{gcd} &
+\cross{LAUPOL}{gcdPolynomial} \\
+\cross{LAUPOL}{hash} &
+\cross{LAUPOL}{latex} &
+\cross{LAUPOL}{lcm} \\
+\cross{LAUPOL}{leadingCoefficient} &
+\cross{LAUPOL}{monomial} &
+\cross{LAUPOL}{monomial?} \\
+\cross{LAUPOL}{multiEuclidean} &
+\cross{LAUPOL}{one?} &
+\cross{LAUPOL}{order} \\
+\cross{LAUPOL}{principalIdeal} &
+\cross{LAUPOL}{recip} &
+\cross{LAUPOL}{reductum} \\
+\cross{LAUPOL}{retract} &
+\cross{LAUPOL}{retractIfCan} &
+\cross{LAUPOL}{sample} \\
+\cross{LAUPOL}{separate} &
+\cross{LAUPOL}{sizeLess?} &
+\cross{LAUPOL}{subtractIfCan} \\
+\cross{LAUPOL}{trailingCoefficient} &
+\cross{LAUPOL}{unit?} &
+\cross{LAUPOL}{unitCanonical} \\
+\cross{LAUPOL}{unitNormal} &
+\cross{LAUPOL}{zero?} &
+\cross{LAUPOL}{?*?} \\
+\cross{LAUPOL}{?**?} &
+\cross{LAUPOL}{?+?} &
+\cross{LAUPOL}{?-?} \\
+\cross{LAUPOL}{-?} &
+\cross{LAUPOL}{?=?} &
+\cross{LAUPOL}{?\^{}?} \\
+\cross{LAUPOL}{?\~{}=?} &
+\cross{LAUPOL}{?quo?} &
+\cross{LAUPOL}{?rem?} 
+\end{tabular}
+
 <<domain LAUPOL LaurentPolynomial>>=
 )abbrev domain LAUPOL LaurentPolynomial
 ++ Univariate polynomials with negative and positive exponents.
@@ -48786,6 +48940,71 @@ o )show Library
 \pageto{TextFile}{TEXTFILE}
 \pageto{BinaryFile}{BINFILE}
 \pageto{KeyedAccessFile}{KAFILE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{LIB}{any?} &
+\cross{LIB}{any?} &
+\cross{LIB}{bag} &
+\cross{LIB}{close!} &
+\cross{LIB}{coerce} \\
+\cross{LIB}{copy} &
+\cross{LIB}{construct} &
+\cross{LIB}{convert} &
+\cross{LIB}{count} &
+\cross{LIB}{dictionary} \\
+\cross{LIB}{elt} &
+\cross{LIB}{empty} &
+\cross{LIB}{empty?} &
+\cross{LIB}{entries} &
+\cross{LIB}{entry?} \\
+\cross{LIB}{eq?} &
+\cross{LIB}{eval} &
+\cross{LIB}{every?} &
+\cross{LIB}{every?} &
+\cross{LIB}{extract!} \\
+\cross{LIB}{fill!} &
+\cross{LIB}{find} &
+\cross{LIB}{first} &
+\cross{LIB}{hash} &
+\cross{LIB}{index?} \\
+\cross{LIB}{indices} &
+\cross{LIB}{insert!} &
+\cross{LIB}{inspect} &
+\cross{LIB}{key?} &
+\cross{LIB}{keys} \\
+\cross{LIB}{latex} &
+\cross{LIB}{less?} &
+\cross{LIB}{library} &
+\cross{LIB}{map} &
+\cross{LIB}{map!} \\
+\cross{LIB}{maxIndex} &
+\cross{LIB}{member?} &
+\cross{LIB}{members} &
+\cross{LIB}{minIndex} &
+\cross{LIB}{more?} \\
+\cross{LIB}{pack!} &
+\cross{LIB}{parts} &
+\cross{LIB}{qelt} &
+\cross{LIB}{qsetelt!} &
+\cross{LIB}{reduce} \\
+\cross{LIB}{remove} &
+\cross{LIB}{remove!} &
+\cross{LIB}{removeDuplicates} &
+\cross{LIB}{sample} &
+\cross{LIB}{search} \\
+\cross{LIB}{select} &
+\cross{LIB}{select!} &
+\cross{LIB}{setelt} &
+\cross{LIB}{size?} &
+\cross{LIB}{swap!} \\
+\cross{LIB}{table} &
+\cross{LIB}{\#{}?} &
+\cross{LIB}{?=?} &
+\cross{LIB}{?\~{}=?} &
+\cross{LIB}{?.?} 
+\end{tabular}
+
 <<domain LIB Library>>=
 )abbrev domain LIB Library
 ++ Author: Stephen M. Watt
@@ -49053,6 +49272,35 @@ o )show LieExponentials
 @
 \pagehead{LieExponentials}{LEXP}
 \pagepic{ps/v103lieexponentials.ps}{LEXP}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{LEXP}{1} &
+\cross{LEXP}{coerce} &
+\cross{LEXP}{commutator} &
+\cross{LEXP}{conjugate} \\
+\cross{LEXP}{exp} &
+\cross{LEXP}{hash} &
+\cross{LEXP}{identification} &
+\cross{LEXP}{inv} \\
+\cross{LEXP}{latex} &
+\cross{LEXP}{log} &
+\cross{LEXP}{ListOfTerms} &
+\cross{LEXP}{LyndonBasis} \\
+\cross{LEXP}{LyndonCoordinates} &
+\cross{LEXP}{mirror} &
+\cross{LEXP}{one?} &
+\cross{LEXP}{recip} \\
+\cross{LEXP}{sample} &
+\cross{LEXP}{varList} &
+\cross{LEXP}{?\~{}=?} &
+\cross{LEXP}{?\^{}?} \\
+\cross{LEXP}{?*?} &
+\cross{LEXP}{?**?} &
+\cross{LEXP}{?/?} &
+\cross{LEXP}{?=?}
+\end{tabular}
+
 <<domain LEXP LieExponentials>>=
 )abbrev domain LEXP LieExponentials
 ++ Author: Michel Petitot (petitot@lifl.fr).
@@ -49599,6 +49847,50 @@ o )show LiePolynomial
 @
 \pagehead{LiePolynomial}{LPOLY}
 \pagepic{ps/v103liepolynomial.ps}{LPOLY}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{LPOLY}{0} &
+\cross{LPOLY}{coef} &
+\cross{LPOLY}{coefficient} &
+\cross{LPOLY}{coefficients} \\
+\cross{LPOLY}{coerce} &
+\cross{LPOLY}{construct} &
+\cross{LPOLY}{degree} &
+\cross{LPOLY}{eval} \\
+\cross{LPOLY}{hash} &
+\cross{LPOLY}{latex} &
+\cross{LPOLY}{leadingCoefficient} &
+\cross{LPOLY}{leadingMonomial} \\
+\cross{LPOLY}{leadingTerm} &
+\cross{LPOLY}{LiePoly} &
+\cross{LPOLY}{LiePolyIfCan} &
+\cross{LPOLY}{ListOfTerms} \\
+\cross{LPOLY}{lquo} &
+\cross{LPOLY}{map} &
+\cross{LPOLY}{mirror} &
+\cross{LPOLY}{monom} \\
+\cross{LPOLY}{monomial?} &
+\cross{LPOLY}{monomials} &
+\cross{LPOLY}{numberOfMonomials} &
+\cross{LPOLY}{reductum} \\
+\cross{LPOLY}{retract} &
+\cross{LPOLY}{retractIfCan} &
+\cross{LPOLY}{rquo} &
+\cross{LPOLY}{sample} \\
+\cross{LPOLY}{subtractIfCan} &
+\cross{LPOLY}{trunc} &
+\cross{LPOLY}{varList} &
+\cross{LPOLY}{zero?} \\
+\cross{LPOLY}{?\~{}=?} &
+\cross{LPOLY}{?*?} &
+\cross{LPOLY}{?/?} &
+\cross{LPOLY}{?+?} \\
+\cross{LPOLY}{?-?} &
+\cross{LPOLY}{-?} &
+\cross{LPOLY}{?=?} 
+\end{tabular}
+
 <<domain LPOLY LiePolynomial>>=
 )abbrev domain LPOLY LiePolynomial
 ++ Author: Michel Petitot (petitot@lifl.fr).
@@ -49806,6 +50098,139 @@ LiePolynomial(VarSet:OrderedSet, R:CommutativeRing) : Public == Private where
 {\bf See}\\
 \pageto{AssociatedLieAlgebra}{LIE}
 \pageto{AssociatedJordanAlgebra}{JORDAN}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{LSQM}{0} &
+\cross{LSQM}{1} \\
+\cross{LSQM}{alternative?} &
+\cross{LSQM}{antiAssociative?} \\
+\cross{LSQM}{antiCommutator} &
+\cross{LSQM}{antisymmetric?} \\
+\cross{LSQM}{any?} &
+\cross{LSQM}{apply} \\
+\cross{LSQM}{associative?} &
+\cross{LSQM}{associator} \\
+\cross{LSQM}{associatorDependence} &
+\cross{LSQM}{basis} \\
+\cross{LSQM}{characteristic} &
+\cross{LSQM}{coerce} \\
+\cross{LSQM}{column} &
+\cross{LSQM}{commutative?} \\
+\cross{LSQM}{commutator} &
+\cross{LSQM}{conditionsForIdempotents} \\
+\cross{LSQM}{convert} &
+\cross{LSQM}{coordinates} \\
+\cross{LSQM}{copy} &
+\cross{LSQM}{count} \\
+\cross{LSQM}{D} &
+\cross{LSQM}{determinant} \\
+\cross{LSQM}{diagonal} &
+\cross{LSQM}{diagonal?} \\
+\cross{LSQM}{diagonalMatrix} &
+\cross{LSQM}{diagonalProduct} \\
+\cross{LSQM}{differentiate} &
+\cross{LSQM}{elt} \\
+\cross{LSQM}{empty} &
+\cross{LSQM}{empty?} \\
+\cross{LSQM}{eq?} &
+\cross{LSQM}{eval} \\
+\cross{LSQM}{every?} &
+\cross{LSQM}{exquo} \\
+\cross{LSQM}{flexible?} &
+\cross{LSQM}{hash} \\
+\cross{LSQM}{inverse} &
+\cross{LSQM}{jacobiIdentity?} \\
+\cross{LSQM}{jordanAdmissible?} &
+\cross{LSQM}{jordanAlgebra?} \\
+\cross{LSQM}{latex} &
+\cross{LSQM}{leftAlternative?} \\
+\cross{LSQM}{leftCharacteristicPolynomial} &
+\cross{LSQM}{leftDiscriminant} \\
+\cross{LSQM}{leftDiscriminant} &
+\cross{LSQM}{leftMinimalPolynomial} \\
+\cross{LSQM}{leftNorm} &
+\cross{LSQM}{leftPower} \\
+\cross{LSQM}{leftRankPolynomial} &
+\cross{LSQM}{leftRecip} \\
+\cross{LSQM}{leftRegularRepresentation} &
+\cross{LSQM}{leftRegularRepresentation} \\
+\cross{LSQM}{leftTrace} &
+\cross{LSQM}{leftTraceMatrix} \\
+\cross{LSQM}{leftUnit} &
+\cross{LSQM}{leftUnits} \\
+\cross{LSQM}{less?} &
+\cross{LSQM}{lieAdmissible?} \\
+\cross{LSQM}{lieAlgebra?} &
+\cross{LSQM}{listOfLists} \\
+\cross{LSQM}{map} &
+\cross{LSQM}{map!} \\
+\cross{LSQM}{matrix} &
+\cross{LSQM}{maxColIndex} \\
+\cross{LSQM}{maxRowIndex} &
+\cross{LSQM}{member?} \\
+\cross{LSQM}{members} &
+\cross{LSQM}{minColIndex} \\
+\cross{LSQM}{minordet} &
+\cross{LSQM}{minRowIndex} \\
+\cross{LSQM}{more?} &
+\cross{LSQM}{ncols} \\
+\cross{LSQM}{noncommutativeJordanAlgebra?} &
+\cross{LSQM}{nrows} \\
+\cross{LSQM}{nullSpace} &
+\cross{LSQM}{nullity} \\
+\cross{LSQM}{one?} &
+\cross{LSQM}{parts} \\
+\cross{LSQM}{plenaryPower} &
+\cross{LSQM}{powerAssociative?} \\
+\cross{LSQM}{qelt} &
+\cross{LSQM}{rank} \\
+\cross{LSQM}{recip} &
+\cross{LSQM}{reducedSystem} \\
+\cross{LSQM}{represents} &
+\cross{LSQM}{retract} \\
+\cross{LSQM}{retractIfCan} &
+\cross{LSQM}{rightAlternative?} \\
+\cross{LSQM}{rightCharacteristicPolynomial} &
+\cross{LSQM}{rightDiscriminant} \\
+\cross{LSQM}{rightMinimalPolynomial} &
+\cross{LSQM}{rightNorm} \\
+\cross{LSQM}{rightPower} &
+\cross{LSQM}{rightRankPolynomial} \\
+\cross{LSQM}{rightRecip} &
+\cross{LSQM}{rightRegularRepresentation} \\
+\cross{LSQM}{rightRegularRepresentation} &
+\cross{LSQM}{rightTrace} \\
+\cross{LSQM}{rightTraceMatrix} &
+\cross{LSQM}{rightUnit} \\
+\cross{LSQM}{rightUnits} &
+\cross{LSQM}{row} \\
+\cross{LSQM}{rowEchelon} &
+\cross{LSQM}{sample} \\
+\cross{LSQM}{scalarMatrix} &
+\cross{LSQM}{size?} \\
+\cross{LSQM}{someBasis} &
+\cross{LSQM}{square?} \\
+\cross{LSQM}{structuralConstants} &
+\cross{LSQM}{structuralConstants} \\
+\cross{LSQM}{subtractIfCan} &
+\cross{LSQM}{symmetric?} \\
+\cross{LSQM}{trace} &
+\cross{LSQM}{unit} \\
+\cross{LSQM}{zero?} &
+\cross{LSQM}{\#{}?} \\
+\cross{LSQM}{?\~{}=?} &
+\cross{LSQM}{?*?} \\
+\cross{LSQM}{?**?} &
+\cross{LSQM}{?+?} \\
+\cross{LSQM}{?-?} &
+\cross{LSQM}{-?} \\
+\cross{LSQM}{?/?} &
+\cross{LSQM}{?=?} \\
+\cross{LSQM}{?\^{}?} &
+\cross{LSQM}{?.?} 
+\end{tabular}
+
 <<domain LSQM LieSquareMatrix>>=
 )abbrev domain LSQM LieSquareMatrix
 ++ Author: J. Grabmeier
@@ -50392,6 +50817,66 @@ o )show LinearOrdinaryDifferentialOperator
 {\bf See}\\
 \pageto{LinearOrdinaryDifferentialOperator1}{LODO1}
 \pageto{LinearOrdinaryDifferentialOperator2}{LODO2}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{LODO}{0} &
+\cross{LODO}{1} &
+\cross{LODO}{adjoint} \\
+\cross{LODO}{apply} &
+\cross{LODO}{characteristic} &
+\cross{LODO}{coefficient} \\
+\cross{LODO}{coefficients} &
+\cross{LODO}{coerce} &
+\cross{LODO}{content} \\
+\cross{LODO}{D} &
+\cross{LODO}{degree} &
+\cross{LODO}{directSum} \\
+\cross{LODO}{exquo} &
+\cross{LODO}{hash} &
+\cross{LODO}{latex} \\
+\cross{LODO}{leadingCoefficient} &
+\cross{LODO}{leftDivide} &
+\cross{LODO}{leftExactQuotient} \\
+\cross{LODO}{leftExtendedGcd} &
+\cross{LODO}{leftGcd} &
+\cross{LODO}{leftLcm} \\
+\cross{LODO}{leftQuotient} &
+\cross{LODO}{leftRemainder} &
+\cross{LODO}{minimumDegree} \\
+\cross{LODO}{monicLeftDivide} &
+\cross{LODO}{monicRightDivide} &
+\cross{LODO}{monomial} \\
+\cross{LODO}{one?} &
+\cross{LODO}{primitivePart} &
+\cross{LODO}{recip} \\
+\cross{LODO}{reductum} &
+\cross{LODO}{retract} &
+\cross{LODO}{retractIfCan} \\
+\cross{LODO}{rightDivide} &
+\cross{LODO}{rightExactQuotient} &
+\cross{LODO}{rightExtendedGcd} \\
+\cross{LODO}{rightGcd} &
+\cross{LODO}{rightLcm} &
+\cross{LODO}{rightQuotient} \\
+\cross{LODO}{rightRemainder} &
+\cross{LODO}{sample} &
+\cross{LODO}{subtractIfCan} \\
+\cross{LODO}{symmetricPower} &
+\cross{LODO}{symmetricProduct} &
+\cross{LODO}{symmetricSquare} \\
+\cross{LODO}{zero?} &
+\cross{LODO}{?*?} &
+\cross{LODO}{?**?} \\
+\cross{LODO}{?+?} &
+\cross{LODO}{?-?} &
+\cross{LODO}{-?} \\
+\cross{LODO}{?=?} &
+\cross{LODO}{?\^{}?} &
+\cross{LODO}{?.?} \\
+\cross{LODO}{?\~{}=?} &&
+\end{tabular}
+
 <<domain LODO LinearOrdinaryDifferentialOperator>>=
 )abbrev domain LODO LinearOrdinaryDifferentialOperator
 ++ Author: Manuel Bronstein
@@ -50826,6 +51311,66 @@ o )show LinearOrdinaryDifferentialOperator1
 {\bf See}\\
 \pageto{LinearOrdinaryDifferentialOperator}{LODO}
 \pageto{LinearOrdinaryDifferentialOperator2}{LODO2}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{LODO1}{0} &
+\cross{LODO1}{1} &
+\cross{LODO1}{adjoint} &
+\cross{LODO1}{apply} \\
+\cross{LODO1}{characteristic} &
+\cross{LODO1}{coefficient} &
+\cross{LODO1}{coefficients} &
+\cross{LODO1}{coerce} \\
+\cross{LODO1}{content} &
+\cross{LODO1}{D} &
+\cross{LODO1}{degree} &
+\cross{LODO1}{directSum} \\
+\cross{LODO1}{exquo} &
+\cross{LODO1}{hash} &
+\cross{LODO1}{latex} &
+\cross{LODO1}{leadingCoefficient} \\
+\cross{LODO1}{leftDivide} &
+\cross{LODO1}{leftExactQuotient} &
+\cross{LODO1}{leftExtendedGcd} &
+\cross{LODO1}{leftGcd} \\
+\cross{LODO1}{leftLcm} &
+\cross{LODO1}{leftQuotient} &
+\cross{LODO1}{leftRemainder} &
+\cross{LODO1}{minimumDegree} \\
+\cross{LODO1}{monicLeftDivide} &
+\cross{LODO1}{monicRightDivide} &
+\cross{LODO1}{monomial} &
+\cross{LODO1}{one?} \\
+\cross{LODO1}{primitivePart} &
+\cross{LODO1}{recip} &
+\cross{LODO1}{reductum} &
+\cross{LODO1}{retract} \\
+\cross{LODO1}{retractIfCan} &
+\cross{LODO1}{rightDivide} &
+\cross{LODO1}{rightExactQuotient} &
+\cross{LODO1}{rightExtendedGcd} \\
+\cross{LODO1}{rightGcd} &
+\cross{LODO1}{rightLcm} &
+\cross{LODO1}{rightQuotient} &
+\cross{LODO1}{rightRemainder} \\
+\cross{LODO1}{sample} &
+\cross{LODO1}{subtractIfCan} &
+\cross{LODO1}{symmetricPower} &
+\cross{LODO1}{symmetricProduct} \\
+\cross{LODO1}{symmetricSquare} &
+\cross{LODO1}{zero?} &
+\cross{LODO1}{?*?} &
+\cross{LODO1}{?**?} \\
+\cross{LODO1}{?+?} &
+\cross{LODO1}{?-?} &
+\cross{LODO1}{-?} &
+\cross{LODO1}{?=?} \\
+\cross{LODO1}{?\^{}?} &
+\cross{LODO1}{?.?} &
+\cross{LODO1}{?\~{}=?} &
+\end{tabular}
+
 <<domain LODO1 LinearOrdinaryDifferentialOperator1>>=
 )abbrev domain LODO1 LinearOrdinaryDifferentialOperator1
 ++ Author: Manuel Bronstein
@@ -51374,6 +51919,66 @@ o )show LinearOrdinaryDifferentialOperator2
 {\bf See}\\
 \pageto{LinearOrdinaryDifferentialOperator}{LODO}
 \pageto{LinearOrdinaryDifferentialOperator1}{LODO1}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{LODO2}{0} &
+\cross{LODO2}{1} &
+\cross{LODO2}{adjoint} &
+\cross{LODO2}{apply} \\
+\cross{LODO2}{characteristic} &
+\cross{LODO2}{coefficient} &
+\cross{LODO2}{coefficients} &
+\cross{LODO2}{coerce} \\
+\cross{LODO2}{content} &
+\cross{LODO2}{D} &
+\cross{LODO2}{degree} &
+\cross{LODO2}{directSum} \\
+\cross{LODO2}{exquo} &
+\cross{LODO2}{hash} &
+\cross{LODO2}{latex} &
+\cross{LODO2}{leadingCoefficient} \\
+\cross{LODO2}{leftDivide} &
+\cross{LODO2}{leftExactQuotient} &
+\cross{LODO2}{leftExtendedGcd} &
+\cross{LODO2}{leftGcd} \\
+\cross{LODO2}{leftLcm} &
+\cross{LODO2}{leftQuotient} &
+\cross{LODO2}{leftRemainder} &
+\cross{LODO2}{minimumDegree} \\
+\cross{LODO2}{monicLeftDivide} &
+\cross{LODO2}{monicRightDivide} &
+\cross{LODO2}{monomial} &
+\cross{LODO2}{one?} \\
+\cross{LODO2}{primitivePart} &
+\cross{LODO2}{recip} &
+\cross{LODO2}{reductum} &
+\cross{LODO2}{retract} \\
+\cross{LODO2}{retractIfCan} &
+\cross{LODO2}{rightDivide} &
+\cross{LODO2}{rightExactQuotient} &
+\cross{LODO2}{rightExtendedGcd} \\
+\cross{LODO2}{rightGcd} &
+\cross{LODO2}{rightLcm} &
+\cross{LODO2}{rightQuotient} &
+\cross{LODO2}{rightRemainder} \\
+\cross{LODO2}{sample} &
+\cross{LODO2}{subtractIfCan} &
+\cross{LODO2}{symmetricPower} &
+\cross{LODO2}{symmetricProduct} \\
+\cross{LODO2}{symmetricSquare} &
+\cross{LODO2}{zero?} &
+\cross{LODO2}{?*?} &
+\cross{LODO2}{?**?} \\
+\cross{LODO2}{?+?} &
+\cross{LODO2}{?-?} &
+\cross{LODO2}{-?} &
+\cross{LODO2}{?=?} \\
+\cross{LODO2}{?\^{}?} &
+\cross{LODO2}{?.?} &
+\cross{LODO2}{?\~{}=?} &
+\end{tabular}
+
 <<domain LODO2 LinearOrdinaryDifferentialOperator2>>=
 )abbrev domain LODO2 LinearOrdinaryDifferentialOperator2
 ++ Author: Stephen M. Watt, Manuel Bronstein
@@ -51970,6 +52575,120 @@ o )show List
 {\bf See}\\
 \pageto{IndexedList}{ILIST}
 \pageto{AssociationList}{ALIST}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{LIST}{any?} &
+\cross{LIST}{append} &
+\cross{LIST}{child?} &
+\cross{LIST}{children} &
+\cross{LIST}{coerce} \\
+\cross{LIST}{concat} &
+\cross{LIST}{concat!} &
+\cross{LIST}{cons} &
+\cross{LIST}{construct} &
+\cross{LIST}{convert} \\
+\cross{LIST}{copy} &
+\cross{LIST}{copyInto!} &
+\cross{LIST}{count} &
+\cross{LIST}{cycleEntry} &
+\cross{LIST}{cycleLength} \\
+\cross{LIST}{cycleSplit!} &
+\cross{LIST}{cycleTail} &
+\cross{LIST}{cyclic?} &
+\cross{LIST}{delete} &
+\cross{LIST}{delete!} \\
+\cross{LIST}{distance} &
+\cross{LIST}{elt} &
+\cross{LIST}{empty} &
+\cross{LIST}{empty?} &
+\cross{LIST}{entries} \\
+\cross{LIST}{entry?} &
+\cross{LIST}{eq?} &
+\cross{LIST}{eval} &
+\cross{LIST}{every?} &
+\cross{LIST}{explicitlyFinite?} \\
+\cross{LIST}{fill!} &
+\cross{LIST}{find} &
+\cross{LIST}{first} &
+\cross{LIST}{hash} &
+\cross{LIST}{index?} \\
+\cross{LIST}{indices} &
+\cross{LIST}{insert} &
+\cross{LIST}{insert!} &
+\cross{LIST}{last} &
+\cross{LIST}{latex} \\
+\cross{LIST}{leaf?} &
+\cross{LIST}{leaves} &
+\cross{LIST}{less?} &
+\cross{LIST}{list} &
+\cross{LIST}{map} \\
+\cross{LIST}{map!} &
+\cross{LIST}{max} &
+\cross{LIST}{maxIndex} &
+\cross{LIST}{member?} &
+\cross{LIST}{members} \\
+\cross{LIST}{merge} &
+\cross{LIST}{merge!} &
+\cross{LIST}{min} &
+\cross{LIST}{minIndex} &
+\cross{LIST}{more?} \\
+\cross{LIST}{node?} &
+\cross{LIST}{new} &
+\cross{LIST}{nil} &
+\cross{LIST}{nodes} &
+\cross{LIST}{null} \\
+\cross{LIST}{OMwrite} &
+\cross{LIST}{parts} &
+\cross{LIST}{position} &
+\cross{LIST}{possiblyInfinite?} &
+\cross{LIST}{qelt} \\
+\cross{LIST}{qsetelt!} &
+\cross{LIST}{reduce} &
+\cross{LIST}{remove} &
+\cross{LIST}{remove!} &
+\cross{LIST}{removeDuplicates} \\
+\cross{LIST}{removeDuplicates!} &
+\cross{LIST}{rest} &
+\cross{LIST}{reverse} &
+\cross{LIST}{reverse!} &
+\cross{LIST}{sample} \\
+\cross{LIST}{second} &
+\cross{LIST}{select} &
+\cross{LIST}{select!} &
+\cross{LIST}{setDifference} &
+\cross{LIST}{setIntersection} \\
+\cross{LIST}{setUnion} &
+\cross{LIST}{setchildren!} &
+\cross{LIST}{setelt} &
+\cross{LIST}{setfirst!} &
+\cross{LIST}{setlast!} \\
+\cross{LIST}{setrest!} &
+\cross{LIST}{setvalue!} &
+\cross{LIST}{size?} &
+\cross{LIST}{sort} &
+\cross{LIST}{sort!} \\
+\cross{LIST}{sorted?} &
+\cross{LIST}{split!} &
+\cross{LIST}{swap!} &
+\cross{LIST}{tail} &
+\cross{LIST}{third} \\
+\cross{LIST}{value} &
+\cross{LIST}{\#{}?} &
+\cross{LIST}{?$<$?} &
+\cross{LIST}{?$<=$?} &
+\cross{LIST}{?=?} \\
+\cross{LIST}{?$>$?} &
+\cross{LIST}{?$>=$?} &
+\cross{LIST}{?.?} &
+\cross{LIST}{?\~{}=?} &
+\cross{LIST}{?.?} \\
+\cross{LIST}{?.last} &
+\cross{LIST}{?.rest} &
+\cross{LIST}{?.first} &
+\cross{LIST}{?.value} &
+\end{tabular}
+
 <<domain LIST List>>=
 )abbrev domain LIST List
 ++ Author: Michael Monagan
@@ -52122,6 +52841,34 @@ List(S:Type): Exports == Implementation where
 \pageto{InnerFreeAbelianMonoid}{IFAMON}
 \pageto{FreeAbelianMonoid}{FAMONOID}
 \pageto{FreeAbelianGroup}{FAGROUP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{LMOPS}{coerce} &
+\cross{LMOPS}{commutativeEquality} &
+\cross{LMOPS}{hash} &
+\cross{LMOPS}{latex} &
+\cross{LMOPS}{leftMult} \\
+\cross{LMOPS}{listOfMonoms} &
+\cross{LMOPS}{makeTerm} &
+\cross{LMOPS}{makeUnit} &
+\cross{LMOPS}{mapExpon} &
+\cross{LMOPS}{mapGen} \\
+\cross{LMOPS}{makeMulti} &
+\cross{LMOPS}{nthExpon} &
+\cross{LMOPS}{nthFactor} &
+\cross{LMOPS}{outputForm} &
+\cross{LMOPS}{plus} \\
+\cross{LMOPS}{retract} &
+\cross{LMOPS}{retractIfCan} &
+\cross{LMOPS}{reverse} &
+\cross{LMOPS}{reverse!} &
+\cross{LMOPS}{rightMult} \\
+\cross{LMOPS}{size} &
+\cross{LMOPS}{?=?} &
+\cross{LMOPS}{?\~{}=?} &&
+\end{tabular}
+
 <<domain LMOPS ListMonoidOps>>=
 )abbrev domain LMOPS ListMonoidOps
 ++ Internal representation for monoids
@@ -52288,6 +53035,53 @@ ListMonoidOps(S, E, un): Exports == Implementation where
 \section{domain LMDICT ListMultiDictionary}
 \pagehead{ListMultiDictionary}{LMDICT}
 \pagepic{ps/v103listmultidictionary.ps}{LMDICT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{LMDICT}{any?} &
+\cross{LMDICT}{bag} &
+\cross{LMDICT}{coerce} &
+\cross{LMDICT}{construct} &
+\cross{LMDICT}{convert} \\
+\cross{LMDICT}{copy} &
+\cross{LMDICT}{count} &
+\cross{LMDICT}{dictionary} &
+\cross{LMDICT}{dictionary} &
+\cross{LMDICT}{duplicates} \\
+\cross{LMDICT}{duplicates?} &
+\cross{LMDICT}{empty} &
+\cross{LMDICT}{empty?} &
+\cross{LMDICT}{eq?} &
+\cross{LMDICT}{eval} \\
+\cross{LMDICT}{extract!} &
+\cross{LMDICT}{every?} &
+\cross{LMDICT}{find} &
+\cross{LMDICT}{hash} &
+\cross{LMDICT}{insert!} \\
+\cross{LMDICT}{inspect} &
+\cross{LMDICT}{latex} &
+\cross{LMDICT}{less?} &
+\cross{LMDICT}{map} &
+\cross{LMDICT}{map!} \\
+\cross{LMDICT}{member?} &
+\cross{LMDICT}{members} &
+\cross{LMDICT}{more?} &
+\cross{LMDICT}{parts} &
+\cross{LMDICT}{reduce} \\
+\cross{LMDICT}{remove} &
+\cross{LMDICT}{remove!} &
+\cross{LMDICT}{removeDuplicates} &
+\cross{LMDICT}{removeDuplicates!} &
+\cross{LMDICT}{sample} \\
+\cross{LMDICT}{select} &
+\cross{LMDICT}{select!} &
+\cross{LMDICT}{size?} &
+\cross{LMDICT}{substitute} &
+\cross{LMDICT}{\#{}?} \\
+\cross{LMDICT}{?\~{}=?} &
+\cross{LMDICT}{?=?} &&&
+\end{tabular}
+
 <<domain LMDICT ListMultiDictionary>>=
 )abbrev domain LMDICT ListMultiDictionary
 ++ Author: MBM Nov/87, MB Oct/89
@@ -52446,6 +53240,43 @@ ListMultiDictionary(S:SetCategory): MultiDictionary(S) with
 {\bf See}\\
 \pageto{Localize}{LO}
 \pageto{Fraction}{FRAC}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{LA}{0} &
+\cross{LA}{1} &
+\cross{LA}{abs} &
+\cross{LA}{characteristic} &
+\cross{LA}{coerce} \\
+\cross{LA}{denom} &
+\cross{LA}{hash} &
+\cross{LA}{latex} &
+\cross{LA}{max} &
+\cross{LA}{min} \\
+\cross{LA}{negative?} &
+\cross{LA}{numer} &
+\cross{LA}{one?} &
+\cross{LA}{positive?} &
+\cross{LA}{recip} \\
+\cross{LA}{sample} &
+\cross{LA}{sign} &
+\cross{LA}{subtractIfCan} &
+\cross{LA}{zero?} &
+\cross{LA}{?\~{}=?} \\
+\cross{LA}{?*?} &
+\cross{LA}{?**?} &
+\cross{LA}{?$<$?} &
+\cross{LA}{?$<=$?} &
+\cross{LA}{?$>$?} \\
+\cross{LA}{?$>=$?} &
+\cross{LA}{?\^{}?} &
+\cross{LA}{?+?} &
+\cross{LA}{?-?} &
+\cross{LA}{-?} \\
+\cross{LA}{?/?} &
+\cross{LA}{?=?} &&&
+\end{tabular}
+
 <<domain LA LocalAlgebra>>=
 )abbrev domain LA LocalAlgebra
 ++ Author: Dave Barton, Barry Trager
@@ -52490,6 +53321,33 @@ LocalAlgebra(A: Algebra R,
 {\bf See}\\
 \pageto{LocalAlgebra}{LA}
 \pageto{Fraction}{FRAC}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{LO}{0} &
+\cross{LO}{coerce} &
+\cross{LO}{denom} &
+\cross{LO}{hash} &
+\cross{LO}{latex} \\
+\cross{LO}{max} &
+\cross{LO}{min} &
+\cross{LO}{numer} &
+\cross{LO}{sample} &
+\cross{LO}{subtractIfCan} \\
+\cross{LO}{zero?} &
+\cross{LO}{?\~{}=?} &
+\cross{LO}{?*?} &
+\cross{LO}{?$<$?} &
+\cross{LO}{?$<=$?} \\
+\cross{LO}{?$>$?} &
+\cross{LO}{?$>=$?} &
+\cross{LO}{?+?} &
+\cross{LO}{?-?} &
+\cross{LO}{-?} \\
+\cross{LO}{?/?} &
+\cross{LO}{?=?} &&&
+\end{tabular}
+
 <<domain LO Localize>>=
 )abbrev domain LO Localize
 ++ Author: Dave Barton, Barry Trager
@@ -52905,6 +53763,36 @@ o )show LyndonWord
 @
 \pagehead{LyndonWord}{LWORD}
 \pagepic{ps/v103lyndonword.ps}{LWORD}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{LWORD}{coerce} &
+\cross{LWORD}{factor} &
+\cross{LWORD}{hash} &
+\cross{LWORD}{latex} &
+\cross{LWORD}{left} \\
+\cross{LWORD}{length} &
+\cross{LWORD}{lexico} &
+\cross{LWORD}{lyndon} &
+\cross{LWORD}{lyndon?} &
+\cross{LWORD}{lyndonIfCan} \\
+\cross{LWORD}{LyndonWordsList} &
+\cross{LWORD}{LyndonWordsList1} &
+\cross{LWORD}{max} &
+\cross{LWORD}{min} &
+\cross{LWORD}{retract} \\
+\cross{LWORD}{retractIfCan} &
+\cross{LWORD}{retractable?} &
+\cross{LWORD}{right} &
+\cross{LWORD}{varList} &
+\cross{LWORD}{?$<$?} \\
+\cross{LWORD}{?$<=$?} &
+\cross{LWORD}{?=?} &
+\cross{LWORD}{?$>$?} &
+\cross{LWORD}{?$>=$?} &
+\cross{LWORD}{?\~{}=?} 
+\end{tabular}
+
 <<domain LWORD LyndonWord>>=
 )abbrev domain LWORD LyndonWord
 ++ Author: Michel Petitot (petitot@lifl.fr).
diff --git a/changelog b/changelog
index cee02a2..fefc30f 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20090116 tpd src/axiom-website/patches.html 20090116.02.tpd.patch
+20090116 tpd books/bookvol10.3 add exports
 20090116 tpd src/axiom-website/patches.html 20090116.01.tpd.patch
 20090116 tpd books/bookvol10.3 add exports
 20090115 tpd src/axiom-website/patches.html 20090115.01.tpd.patch
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 7a50cf1..5290bbe 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -883,6 +883,8 @@ bookvol10.3 add exports<br/>
 bookvol10.3 add exports<br/>
 <a href="patches/20090116.01.tpd.patch">20090116.01.tpd.patch</a>
 bookvol10.3 add exports<br/>
+<a href="patches/20090116.02.tpd.patch">20090116.02.tpd.patch</a>
+bookvol10.3 add exports<br/>
 
  </body>
 </html>

\start
Date: Sat, 17 Jan 2009 03:11:45 -0600
From: Tim Daly
To: list
Subject: 20090116.03.tpd.patch (bookvol10.3 add exports)

Add Exports for chapter J thru chapter P
=========================================================
diff --git a/books/bookvol10.3.pamphlet b/books/bookvol10.3.pamphlet
index e09ee90..8b136ee 100644
--- a/books/bookvol10.3.pamphlet
+++ b/books/bookvol10.3.pamphlet
@@ -53969,6 +53969,147 @@ LyndonWord(VarSet:OrderedSet):Public == Private where
 {\bf See}\\
 \pageto{MachineInteger}{MINT}
 \pageto{MachineFloat}{MFLOAT}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{MCMPLX}{0} &
+\cross{MCMPLX}{1} \\
+\cross{MCMPLX}{abs} &
+\cross{MCMPLX}{acos} \\
+\cross{MCMPLX}{acosh} &
+\cross{MCMPLX}{acot} \\
+\cross{MCMPLX}{acoth} &
+\cross{MCMPLX}{acsc} \\
+\cross{MCMPLX}{acsch} &
+\cross{MCMPLX}{argument} \\
+\cross{MCMPLX}{asec} &
+\cross{MCMPLX}{asech} \\
+\cross{MCMPLX}{asin} &
+\cross{MCMPLX}{asinh} \\
+\cross{MCMPLX}{associates?} &
+\cross{MCMPLX}{atan} \\
+\cross{MCMPLX}{atanh} &
+\cross{MCMPLX}{basis} \\
+\cross{MCMPLX}{characteristic} &
+\cross{MCMPLX}{characteristicPolynomial} \\
+\cross{MCMPLX}{charthRoot} &
+\cross{MCMPLX}{coerce} \\
+\cross{MCMPLX}{complex} &
+\cross{MCMPLX}{conditionP} \\
+\cross{MCMPLX}{conjugate} &
+\cross{MCMPLX}{convert} \\
+\cross{MCMPLX}{coordinates} &
+\cross{MCMPLX}{cos} \\
+\cross{MCMPLX}{cosh} &
+\cross{MCMPLX}{cot} \\
+\cross{MCMPLX}{coth} &
+\cross{MCMPLX}{createPrimitiveElement} \\
+\cross{MCMPLX}{csc} &
+\cross{MCMPLX}{csch} \\
+\cross{MCMPLX}{D} &
+\cross{MCMPLX}{definingPolynomial} \\
+\cross{MCMPLX}{derivationCoordinates} &
+\cross{MCMPLX}{differentiate} \\
+\cross{MCMPLX}{discreteLog} &
+\cross{MCMPLX}{discriminant} \\
+\cross{MCMPLX}{divide} &
+\cross{MCMPLX}{euclideanSize} \\
+\cross{MCMPLX}{eval} &
+\cross{MCMPLX}{exp} \\
+\cross{MCMPLX}{expressIdealMember} &
+\cross{MCMPLX}{exquo} \\
+\cross{MCMPLX}{extendedEuclidean} &
+\cross{MCMPLX}{factor} \\
+\cross{MCMPLX}{factorPolynomial} &
+\cross{MCMPLX}{factorSquareFreePolynomial} \\
+\cross{MCMPLX}{factorsOfCyclicGroupSize} &
+\cross{MCMPLX}{gcd} \\
+\cross{MCMPLX}{gcdPolynomial} &
+\cross{MCMPLX}{generator} \\
+\cross{MCMPLX}{hash} &
+\cross{MCMPLX}{imag} \\
+\cross{MCMPLX}{imaginary} &
+\cross{MCMPLX}{index} \\
+\cross{MCMPLX}{init} &
+\cross{MCMPLX}{inv} \\
+\cross{MCMPLX}{latex} &
+\cross{MCMPLX}{lcm} \\
+\cross{MCMPLX}{lift} &
+\cross{MCMPLX}{log} \\
+\cross{MCMPLX}{lookup} &
+\cross{MCMPLX}{map} \\
+\cross{MCMPLX}{max} &
+\cross{MCMPLX}{min} \\
+\cross{MCMPLX}{minimalPolynomial} &
+\cross{MCMPLX}{multiEuclidean} \\
+\cross{MCMPLX}{nextItem} &
+\cross{MCMPLX}{norm} \\
+\cross{MCMPLX}{nthRoot} &
+\cross{MCMPLX}{one?} \\
+\cross{MCMPLX}{order} &
+\cross{MCMPLX}{patternMatch} \\
+\cross{MCMPLX}{pi} &
+\cross{MCMPLX}{polarCoordinates} \\
+\cross{MCMPLX}{prime?} &
+\cross{MCMPLX}{primeFrobenius} \\
+\cross{MCMPLX}{primitive?} &
+\cross{MCMPLX}{primitiveElement} \\
+\cross{MCMPLX}{principalIdeal} &
+\cross{MCMPLX}{random} \\
+\cross{MCMPLX}{rank} &
+\cross{MCMPLX}{rational} \\
+\cross{MCMPLX}{rational?} &
+\cross{MCMPLX}{rationalIfCan} \\
+\cross{MCMPLX}{real} &
+\cross{MCMPLX}{recip} \\
+\cross{MCMPLX}{reduce} &
+\cross{MCMPLX}{reducedSystem} \\
+\cross{MCMPLX}{regularRepresentation} &
+\cross{MCMPLX}{representationType} \\
+\cross{MCMPLX}{represents} &
+\cross{MCMPLX}{retract} \\
+\cross{MCMPLX}{retractIfCan} &
+\cross{MCMPLX}{sample} \\
+\cross{MCMPLX}{sec} &
+\cross{MCMPLX}{sech} \\
+\cross{MCMPLX}{sin} &
+\cross{MCMPLX}{sinh} \\
+\cross{MCMPLX}{size} &
+\cross{MCMPLX}{sizeLess?} \\
+\cross{MCMPLX}{solveLinearPolynomialEquation} &
+\cross{MCMPLX}{sqrt} \\
+\cross{MCMPLX}{squareFree} &
+\cross{MCMPLX}{squareFreePart} \\
+\cross{MCMPLX}{squareFreePolynomial} &
+\cross{MCMPLX}{subtractIfCan} \\
+\cross{MCMPLX}{tableForDiscreteLogarithm} &
+\cross{MCMPLX}{tan} \\
+\cross{MCMPLX}{tanh} &
+\cross{MCMPLX}{trace} \\
+\cross{MCMPLX}{traceMatrix} &
+\cross{MCMPLX}{traceMatrix} \\
+\cross{MCMPLX}{unit?} &
+\cross{MCMPLX}{unitCanonical} \\
+\cross{MCMPLX}{unitNormal} &
+\cross{MCMPLX}{zero?} \\
+\cross{MCMPLX}{?*?} &
+\cross{MCMPLX}{?**?} \\
+\cross{MCMPLX}{?+?} &
+\cross{MCMPLX}{?-?} \\
+\cross{MCMPLX}{-?} &
+\cross{MCMPLX}{?$<$?} \\
+\cross{MCMPLX}{?$<=$?} &
+\cross{MCMPLX}{?=?} \\
+\cross{MCMPLX}{?$>$?} &
+\cross{MCMPLX}{?$>=$?} \\
+\cross{MCMPLX}{?\^{}?} &
+\cross{MCMPLX}{?\~{}=?} \\
+\cross{MCMPLX}{?/?} &
+\cross{MCMPLX}{?.?} \\
+\cross{MCMPLX}{?quo?} &
+\cross{MCMPLX}{?rem?} 
+\end{tabular}
+
 <<domain MCMPLX MachineComplex>>=
 )abbrev domain MCMPLX MachineComplex
 ++ Date Created:  December 1993
@@ -54029,6 +54170,89 @@ MachineComplex():Exports == Implementation where
 {\bf See}\\
 \pageto{MachineInteger}{MINT}
 \pageto{MachineComplex}{MCMPLX}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{MFLOAT}{1} &
+\cross{MFLOAT}{0} &
+\cross{MFLOAT}{abs} &
+\cross{MFLOAT}{associates?} \\
+\cross{MFLOAT}{base} &
+\cross{MFLOAT}{bits} &
+\cross{MFLOAT}{ceiling} &
+\cross{MFLOAT}{coerce} \\
+\cross{MFLOAT}{changeBase} &
+\cross{MFLOAT}{characteristic} &
+\cross{MFLOAT}{convert} &
+\cross{MFLOAT}{decreasePrecision} \\
+\cross{MFLOAT}{digits} &
+\cross{MFLOAT}{exponent} &
+\cross{MFLOAT}{divide} &
+\cross{MFLOAT}{euclideanSize} \\
+\cross{MFLOAT}{expressIdealMember} &
+\cross{MFLOAT}{exquo} &
+\cross{MFLOAT}{extendedEuclidean} &
+\cross{MFLOAT}{factor} \\
+\cross{MFLOAT}{float} &
+\cross{MFLOAT}{floor} &
+\cross{MFLOAT}{fractionPart} &
+\cross{MFLOAT}{gcd} \\
+\cross{MFLOAT}{gcdPolynomial} &
+\cross{MFLOAT}{hash} &
+\cross{MFLOAT}{increasePrecision} &
+\cross{MFLOAT}{inv} \\
+\cross{MFLOAT}{latex} &
+\cross{MFLOAT}{lcm} &
+\cross{MFLOAT}{mantissa} &
+\cross{MFLOAT}{max} \\
+\cross{MFLOAT}{maximumExponent} &
+\cross{MFLOAT}{min} &
+\cross{MFLOAT}{minimumExponent} &
+\cross{MFLOAT}{multiEuclidean} \\
+\cross{MFLOAT}{negative?} &
+\cross{MFLOAT}{norm} &
+\cross{MFLOAT}{nthRoot} &
+\cross{MFLOAT}{one?} \\
+\cross{MFLOAT}{order} &
+\cross{MFLOAT}{patternMatch} &
+\cross{MFLOAT}{positive?} &
+\cross{MFLOAT}{precision} \\
+\cross{MFLOAT}{prime?} &
+\cross{MFLOAT}{principalIdeal} &
+\cross{MFLOAT}{recip} &
+\cross{MFLOAT}{retract} \\
+\cross{MFLOAT}{retractIfCan} &
+\cross{MFLOAT}{round} &
+\cross{MFLOAT}{sample} &
+\cross{MFLOAT}{sign} \\
+\cross{MFLOAT}{sizeLess?} &
+\cross{MFLOAT}{sqrt} &
+\cross{MFLOAT}{squareFree} &
+\cross{MFLOAT}{squareFreePart} \\
+\cross{MFLOAT}{subtractIfCan} &
+\cross{MFLOAT}{truncate} &
+\cross{MFLOAT}{unit?} &
+\cross{MFLOAT}{unitCanonical} \\
+\cross{MFLOAT}{unitNormal} &
+\cross{MFLOAT}{wholePart} &
+\cross{MFLOAT}{zero?} &
+\cross{MFLOAT}{?*?} \\
+\cross{MFLOAT}{?**?} &
+\cross{MFLOAT}{?+?} &
+\cross{MFLOAT}{?-?} &
+\cross{MFLOAT}{-?} \\
+\cross{MFLOAT}{?/?} &
+\cross{MFLOAT}{?$<$?} &
+\cross{MFLOAT}{?$<=$?} &
+\cross{MFLOAT}{?=?} \\
+\cross{MFLOAT}{?$>$?} &
+\cross{MFLOAT}{?$>=$?} &
+\cross{MFLOAT}{?\~{}=?} &
+\cross{MFLOAT}{?\^{}?} \\
+\cross{MFLOAT}{?quo?} &
+\cross{MFLOAT}{?rem?} &&
+\end{tabular}
+
 <<domain MFLOAT MachineFloat>>=
 )abbrev domain MFLOAT MachineFloat
 ++ Author: Mike Dewar
@@ -54344,6 +54568,95 @@ MachineFloat(): Exports == Implementation where
 {\bf See}\\
 \pageto{MachineFloat}{MFLOAT}
 \pageto{MachineComplex}{MCMPLX}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MINT}{0} &
+\cross{MINT}{1} &
+\cross{MINT}{abs} &
+\cross{MINT}{addmod} &
+\cross{MINT}{associates?} \\
+\cross{MINT}{base} &
+\cross{MINT}{binomial} &
+\cross{MINT}{bit?} &
+\cross{MINT}{characteristic} &
+\cross{MINT}{coerce} \\
+\cross{MINT}{convert} &
+\cross{MINT}{copy} &
+\cross{MINT}{D} &
+\cross{MINT}{dec} &
+\cross{MINT}{differentiate} \\
+\cross{MINT}{divide} &
+\cross{MINT}{euclideanSize} &
+\cross{MINT}{even?} &
+\cross{MINT}{expressIdealMember} &
+\cross{MINT}{exquo} \\
+\cross{MINT}{extendedEuclidean} &
+\cross{MINT}{factor} &
+\cross{MINT}{factorial} &
+\cross{MINT}{gcd} &
+\cross{MINT}{gcdPolynomial} \\
+\cross{MINT}{hash} &
+\cross{MINT}{inc} &
+\cross{MINT}{init} &
+\cross{MINT}{invmod} &
+\cross{MINT}{latex} \\
+\cross{MINT}{lcm} &
+\cross{MINT}{length} &
+\cross{MINT}{mask} &
+\cross{MINT}{max} &
+\cross{MINT}{maxint} \\
+\cross{MINT}{min} &
+\cross{MINT}{mulmod} &
+\cross{MINT}{multiEuclidean} &
+\cross{MINT}{negative?} &
+\cross{MINT}{nextItem} \\
+\cross{MINT}{odd?} &
+\cross{MINT}{one?} &
+\cross{MINT}{patternMatch} &
+\cross{MINT}{permutation} &
+\cross{MINT}{positive?} \\
+\cross{MINT}{positiveRemainder} &
+\cross{MINT}{powmod} &
+\cross{MINT}{prime?} &
+\cross{MINT}{principalIdeal} &
+\cross{MINT}{random} \\
+\cross{MINT}{rational} &
+\cross{MINT}{rationalIfCan} &
+\cross{MINT}{rational?} &
+\cross{MINT}{recip} &
+\cross{MINT}{reducedSystem} \\
+\cross{MINT}{retract} &
+\cross{MINT}{retractIfCan} &
+\cross{MINT}{sample} &
+\cross{MINT}{shift} &
+\cross{MINT}{sign} \\
+\cross{MINT}{sizeLess?} &
+\cross{MINT}{squareFree} &
+\cross{MINT}{squareFreePart} &
+\cross{MINT}{submod} &
+\cross{MINT}{subtractIfCan} \\
+\cross{MINT}{symmetricRemainder} &
+\cross{MINT}{unit?} &
+\cross{MINT}{unitCanonical} &
+\cross{MINT}{unitNormal} &
+\cross{MINT}{zero?} \\
+\cross{MINT}{?\~{}=?} &
+\cross{MINT}{?*?} &
+\cross{MINT}{?**?} &
+\cross{MINT}{?\^{}?} &
+\cross{MINT}{?+?} \\
+\cross{MINT}{?-?} &
+\cross{MINT}{-?} &
+\cross{MINT}{?$<$?} &
+\cross{MINT}{?$<=$?} &
+\cross{MINT}{?=?} \\
+\cross{MINT}{?$>$?} &
+\cross{MINT}{?$>=$?} &
+\cross{MINT}{?quo?} &
+\cross{MINT}{?rem?} &
+\end{tabular}
+
 <<domain MINT MachineInteger>>=
 )abbrev domain MINT MachineInteger
 ++ Author: Mike Dewar
@@ -54704,6 +55017,34 @@ o )show Magma
 @
 \pagehead{Magma}{MAGMA}
 \pagepic{ps/v103magma.ps}{MAGMA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MAGMA}{coerce} &
+\cross{MAGMA}{first} &
+\cross{MAGMA}{hash} &
+\cross{MAGMA}{latex} &
+\cross{MAGMA}{left} \\
+\cross{MAGMA}{length} &
+\cross{MAGMA}{lexico} &
+\cross{MAGMA}{max} &
+\cross{MAGMA}{min} &
+\cross{MAGMA}{mirror} \\
+\cross{MAGMA}{rest} &
+\cross{MAGMA}{retract} &
+\cross{MAGMA}{retractIfCan} &
+\cross{MAGMA}{retractable?} &
+\cross{MAGMA}{right} \\
+\cross{MAGMA}{varList} &
+\cross{MAGMA}{?\~{}=?} &
+\cross{MAGMA}{?*?} &
+\cross{MAGMA}{?$<$?} &
+\cross{MAGMA}{?$<=$?} \\
+\cross{MAGMA}{?=?} &
+\cross{MAGMA}{?$>$?} &
+\cross{MAGMA}{?$>=$?} &&
+\end{tabular}
+
 <<domain MAGMA Magma>>=
 )abbrev domain MAGMA Magma
 ++ Author: Michel Petitot (petitot@lifl.fr).
@@ -54860,6 +55201,24 @@ Magma(VarSet:OrderedSet):Public == Private where
 \pagepic{ps/v103makecachableset.ps}{MKCHSET}{1.00}
 {\bf See}\\
 \pageto{Kernel}{KERNEL}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{MKCHSET}{coerce} &
+\cross{MKCHSET}{hash} &
+\cross{MKCHSET}{latex} &
+\cross{MKCHSET}{max} &
+\cross{MKCHSET}{min} &
+\cross{MKCHSET}{position} \\
+\cross{MKCHSET}{setPosition} &
+\cross{MKCHSET}{?\~{}=?} &
+\cross{MKCHSET}{?$<$?} &
+\cross{MKCHSET}{?$<=$?} &
+\cross{MKCHSET}{?=?} &
+\cross{MKCHSET}{?$>$?} \\
+\cross{MKCHSET}{?$>=$?} &&&&&
+\end{tabular}
+
 <<domain MKCHSET MakeCachableSet>>=
 )abbrev domain MKCHSET MakeCachableSet
 ++ Make a cachable set from any set
@@ -55822,6 +56181,83 @@ o )show Matrix
 \pageto{IndexedMatrix}{IMATRIX}
 \pageto{RectangularMatrix}{RMATRIX}
 \pageto{SquareMatrix}{SQMATRIX}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MATRIX}{antisymmetric?} &
+\cross{MATRIX}{any?} &
+\cross{MATRIX}{coerce} &
+\cross{MATRIX}{column} &
+\cross{MATRIX}{convert} \\
+\cross{MATRIX}{copy} &
+\cross{MATRIX}{count} &
+\cross{MATRIX}{determinant} &
+\cross{MATRIX}{diagonal?} &
+\cross{MATRIX}{diagonalMatrix} \\
+\cross{MATRIX}{elt} &
+\cross{MATRIX}{empty} &
+\cross{MATRIX}{empty?} &
+\cross{MATRIX}{eq?} &
+\cross{MATRIX}{eval} \\
+\cross{MATRIX}{every?} &
+\cross{MATRIX}{exquo} &
+\cross{MATRIX}{fill!} &
+\cross{MATRIX}{hash} &
+\cross{MATRIX}{horizConcat} \\
+\cross{MATRIX}{inverse} &
+\cross{MATRIX}{latex} &
+\cross{MATRIX}{less?} &
+\cross{MATRIX}{listOfLists} &
+\cross{MATRIX}{map} \\
+\cross{MATRIX}{map!} &
+\cross{MATRIX}{matrix} &
+\cross{MATRIX}{maxColIndex} &
+\cross{MATRIX}{maxRowIndex} &
+\cross{MATRIX}{member?} \\
+\cross{MATRIX}{members} &
+\cross{MATRIX}{minColIndex} &
+\cross{MATRIX}{minordet} &
+\cross{MATRIX}{minRowIndex} &
+\cross{MATRIX}{more?} \\
+\cross{MATRIX}{ncols} &
+\cross{MATRIX}{new} &
+\cross{MATRIX}{nrows} &
+\cross{MATRIX}{nullSpace} &
+\cross{MATRIX}{nullity} \\
+\cross{MATRIX}{parts} &
+\cross{MATRIX}{qelt} &
+\cross{MATRIX}{qsetelt!} &
+\cross{MATRIX}{rank} &
+\cross{MATRIX}{row} \\
+\cross{MATRIX}{rowEchelon} &
+\cross{MATRIX}{sample} &
+\cross{MATRIX}{scalarMatrix} &
+\cross{MATRIX}{setColumn!} &
+\cross{MATRIX}{setRow!} \\
+\cross{MATRIX}{setelt} &
+\cross{MATRIX}{setelt} &
+\cross{MATRIX}{setsubMatrix!} &
+\cross{MATRIX}{size?} &
+\cross{MATRIX}{square?} \\
+\cross{MATRIX}{squareTop} &
+\cross{MATRIX}{subMatrix} &
+\cross{MATRIX}{swapColumns!} &
+\cross{MATRIX}{swapRows!} &
+\cross{MATRIX}{symmetric?} \\
+\cross{MATRIX}{transpose} &
+\cross{MATRIX}{vertConcat} &
+\cross{MATRIX}{zero} &
+\cross{MATRIX}{\#{}?} &
+\cross{MATRIX}{?**?} \\
+\cross{MATRIX}{?/?} &
+\cross{MATRIX}{?=?} &
+\cross{MATRIX}{?\~{}=?} &
+\cross{MATRIX}{?*?} &
+\cross{MATRIX}{?+?} \\
+\cross{MATRIX}{-?} &
+\cross{MATRIX}{?-?} &&&
+\end{tabular}
+
 <<domain MATRIX Matrix>>=
 )abbrev domain MATRIX Matrix
 ++ Author: Grabmeier, Gschnitzer, Williamson
@@ -56007,6 +56443,137 @@ Matrix(R): Exports == Implementation where
 \section{domain MODMON ModMonic}
 \pagehead{ModMonic}{MODMON}
 \pagepic{ps/v103modmonic.ps}{MODMON}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{MODMON}{0} &
+\cross{MODMON}{1} &
+\cross{MODMON}{An} &
+\cross{MODMON}{associates?} \\
+\cross{MODMON}{binomThmExpt} &
+\cross{MODMON}{characteristic} &
+\cross{MODMON}{charthRoot} &
+\cross{MODMON}{coefficient} \\
+\cross{MODMON}{coefficients} &
+\cross{MODMON}{coerce} &
+\cross{MODMON}{composite} &
+\cross{MODMON}{computePowers} \\
+\cross{MODMON}{conditionP} &
+\cross{MODMON}{content} &
+\cross{MODMON}{convert} &
+\cross{MODMON}{D} \\
+\cross{MODMON}{degree} &
+\cross{MODMON}{differentiate} &
+\cross{MODMON}{discriminant} &
+\cross{MODMON}{divide} \\
+\cross{MODMON}{divideExponents} &
+\cross{MODMON}{elt} &
+\cross{MODMON}{euclideanSize} &
+\cross{MODMON}{eval} \\
+\cross{MODMON}{expressIdealMember} &
+\cross{MODMON}{exquo} &
+\cross{MODMON}{extendedEuclidean} &
+\cross{MODMON}{factor} \\
+\cross{MODMON}{factorPolynomial} &
+\cross{MODMON}{factorSquareFreePolynomial} &
+\cross{MODMON}{frobenius} &
+\cross{MODMON}{gcd} \\
+\cross{MODMON}{gcdPolynomial} &
+\cross{MODMON}{ground} &
+\cross{MODMON}{ground?} &
+\cross{MODMON}{hash} \\
+\cross{MODMON}{index} &
+\cross{MODMON}{init} &
+\cross{MODMON}{integrate} &
+\cross{MODMON}{isExpt} \\
+\cross{MODMON}{isPlus} &
+\cross{MODMON}{isTimes} &
+\cross{MODMON}{karatsubaDivide} &
+\cross{MODMON}{latex} \\
+\cross{MODMON}{lcm} &
+\cross{MODMON}{leadingCoefficient} &
+\cross{MODMON}{leadingMonomial} &
+\cross{MODMON}{lift} \\
+\cross{MODMON}{lookup} &
+\cross{MODMON}{mainVariable} &
+\cross{MODMON}{makeSUP} &
+\cross{MODMON}{map} \\
+\cross{MODMON}{mapExponents} &
+\cross{MODMON}{max} &
+\cross{MODMON}{min} &
+\cross{MODMON}{minimumDegree} \\
+\cross{MODMON}{modulus} &
+\cross{MODMON}{monicDivide} &
+\cross{MODMON}{monomial} &
+\cross{MODMON}{monomial?} \\
+\cross{MODMON}{monomials} &
+\cross{MODMON}{multiEuclidean} &
+\cross{MODMON}{multiplyExponents} &
+\cross{MODMON}{multivariate} \\
+\cross{MODMON}{nextItem} &
+\cross{MODMON}{numberOfMonomials} &
+\cross{MODMON}{one?} &
+\cross{MODMON}{order} \\
+\cross{MODMON}{patternMatch} &
+\cross{MODMON}{pomopo!} &
+\cross{MODMON}{pow} &
+\cross{MODMON}{prime?} \\
+\cross{MODMON}{primitiveMonomials} &
+\cross{MODMON}{primitivePart} &
+\cross{MODMON}{principalIdeal} &
+\cross{MODMON}{pseudoDivide} \\
+\cross{MODMON}{pseudoQuotient} &
+\cross{MODMON}{pseudoRemainder} &
+\cross{MODMON}{random} &
+\cross{MODMON}{recip} \\
+\cross{MODMON}{reduce} &
+\cross{MODMON}{reducedSystem} &
+\cross{MODMON}{reductum} &
+\cross{MODMON}{resultant} \\
+\cross{MODMON}{retract} &
+\cross{MODMON}{retractIfCan} &
+\cross{MODMON}{sample} &
+\cross{MODMON}{separate} \\
+\cross{MODMON}{setPoly} &
+\cross{MODMON}{shiftLeft} &
+\cross{MODMON}{shiftRight} &
+\cross{MODMON}{size} \\
+\cross{MODMON}{sizeLess?} &
+\cross{MODMON}{solveLinearPolynomialEquation} &
+\cross{MODMON}{squareFree} &
+\cross{MODMON}{squareFreePart} \\
+\cross{MODMON}{squareFreePolynomial} &
+\cross{MODMON}{subResultantGcd} &
+\cross{MODMON}{subtractIfCan} &
+\cross{MODMON}{totalDegree} \\
+\cross{MODMON}{unit?} &
+\cross{MODMON}{unitCanonical} &
+\cross{MODMON}{unitNormal} &
+\cross{MODMON}{univariate} \\
+\cross{MODMON}{unmakeSUP} &
+\cross{MODMON}{UnVectorise} &
+\cross{MODMON}{variables} &
+\cross{MODMON}{vectorise} \\
+\cross{MODMON}{Vectorise} &
+\cross{MODMON}{zero?} &
+\cross{MODMON}{?*?} &
+\cross{MODMON}{?**?} \\
+\cross{MODMON}{?+?} &
+\cross{MODMON}{?-?} &
+\cross{MODMON}{-?} &
+\cross{MODMON}{?=?} \\
+\cross{MODMON}{?\^{}?} &
+\cross{MODMON}{?.?} &
+\cross{MODMON}{?\~{}=?} &
+\cross{MODMON}{?/?} \\
+\cross{MODMON}{?$<$?} &
+\cross{MODMON}{?$<=$?} &
+\cross{MODMON}{?$>$?} &
+\cross{MODMON}{?$>=$?} \\
+\cross{MODMON}{?quo?} &
+\cross{MODMON}{?rem?} &
+\end{tabular}
+
 <<domain MODMON ModMonic>>=
 )abbrev domain MODMON ModMonic
 ++ Description:
@@ -56189,6 +56756,56 @@ ModMonic(R,Rep): C == T
 {\bf See}\\
 \pageto{ModularRing}{MODRING}
 \pageto{EuclideanModularRing}{EMR}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MODFIELD}{0} &
+\cross{MODFIELD}{1} &
+\cross{MODFIELD}{associates?} &
+\cross{MODFIELD}{characteristic} &
+\cross{MODFIELD}{coerce} \\
+\cross{MODFIELD}{divide} &
+\cross{MODFIELD}{euclideanSize} &
+\cross{MODFIELD}{expressIdealMember} &
+\cross{MODFIELD}{exquo} &
+\cross{MODFIELD}{exQuo} \\
+\cross{MODFIELD}{extendedEuclidean} &
+\cross{MODFIELD}{factor} &
+\cross{MODFIELD}{gcd} &
+\cross{MODFIELD}{gcdPolynomial} &
+\cross{MODFIELD}{hash} \\
+\cross{MODFIELD}{inv} &
+\cross{MODFIELD}{latex} &
+\cross{MODFIELD}{lcm} &
+\cross{MODFIELD}{modulus} &
+\cross{MODFIELD}{multiEuclidean} \\
+\cross{MODFIELD}{one?} &
+\cross{MODFIELD}{prime?} &
+\cross{MODFIELD}{principalIdeal} &
+\cross{MODFIELD}{recip} &
+\cross{MODFIELD}{reduce} \\
+\cross{MODFIELD}{sample} &
+\cross{MODFIELD}{sizeLess?} &
+\cross{MODFIELD}{squareFree} &
+\cross{MODFIELD}{squareFreePart} &
+\cross{MODFIELD}{subtractIfCan} \\
+\cross{MODFIELD}{unit?} &
+\cross{MODFIELD}{unitCanonical} &
+\cross{MODFIELD}{unitNormal} &
+\cross{MODFIELD}{zero?} &
+\cross{MODFIELD}{?*?} \\
+\cross{MODFIELD}{?**?} &
+\cross{MODFIELD}{?+?} &
+\cross{MODFIELD}{?-?} &
+\cross{MODFIELD}{-?} &
+\cross{MODFIELD}{?/?} \\
+\cross{MODFIELD}{?=?} &
+\cross{MODFIELD}{?\^{}?} &
+\cross{MODFIELD}{?\~{}=?} &
+\cross{MODFIELD}{?quo?} &
+\cross{MODFIELD}{?rem?} 
+\end{tabular}
+
 <<domain MODFIELD ModularField>>=
 )abbrev domain MODFIELD ModularField
 ++ These domains are used for the factorization and gcds
@@ -56228,6 +56845,34 @@ ModularField(R,Mod,reduction:(R,Mod) -> R,
 {\bf See}\\
 \pageto{EuclideanModularRing}{EMR}
 \pageto{ModularField}{MODFIELD}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MODRING}{0} &
+\cross{MODRING}{1} &
+\cross{MODRING}{characteristic} &
+\cross{MODRING}{coerce} &
+\cross{MODRING}{exQuo} \\
+\cross{MODRING}{hash} &
+\cross{MODRING}{inv} &
+\cross{MODRING}{latex} &
+\cross{MODRING}{modulus} &
+\cross{MODRING}{one?} \\
+\cross{MODRING}{recip} &
+\cross{MODRING}{reduce} &
+\cross{MODRING}{sample} &
+\cross{MODRING}{subtractIfCan} &
+\cross{MODRING}{zero?} \\
+\cross{MODRING}{?\~{}=?} &
+\cross{MODRING}{?*?} &
+\cross{MODRING}{?**?} &
+\cross{MODRING}{?\^{}?} &
+\cross{MODRING}{?+?} \\
+\cross{MODRING}{?-?} &
+\cross{MODRING}{-?} &
+\cross{MODRING}{?=?} &&
+\end{tabular}
+
 <<domain MODRING ModularRing>>=
 )abbrev domain MODRING ModularRing
 ++ Author: P.Gianni, B.Trager
@@ -56331,6 +56976,25 @@ ModularRing(R,Mod,reduction:(R,Mod) -> R,
 \pagepic{ps/v103modulemonomial.ps}{MODMONOM}{1.00}
 {\bf See}\\
 \pageto{GeneralModulePolynomial}{GMODPOL}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MODMONOM}{coerce} &
+\cross{MODMONOM}{construct} &
+\cross{MODMONOM}{exponent} &
+\cross{MODMONOM}{hash} &
+\cross{MODMONOM}{index} \\
+\cross{MODMONOM}{latex} &
+\cross{MODMONOM}{max} &
+\cross{MODMONOM}{min} &
+\cross{MODMONOM}{?\~{}=?} &
+\cross{MODMONOM}{?$<$?} \\
+\cross{MODMONOM}{?$<=$?} &
+\cross{MODMONOM}{?=?} &
+\cross{MODMONOM}{?$>$?} &
+\cross{MODMONOM}{?$>=$?} &
+\end{tabular}
+
 <<domain MODMONOM ModuleMonomial>>=
 )abbrev domain MODMONOM ModuleMonomial
 ++ Description:
@@ -56374,6 +57038,40 @@ ModuleMonomial(IS: OrderedSet,
 \pagepic{ps/v103moduleoperator.ps}{MODOP}{1.00}
 {\bf See}\\
 \pageto{Operator}{OP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MODOP}{0} &
+\cross{MODOP}{1} &
+\cross{MODOP}{adjoint} &
+\cross{MODOP}{characteristic} &
+\cross{MODOP}{charthRoot} \\
+\cross{MODOP}{coerce} &
+\cross{MODOP}{conjug} &
+\cross{MODOP}{evaluate} &
+\cross{MODOP}{evaluateInverse} &
+\cross{MODOP}{hash} \\
+\cross{MODOP}{latex} &
+\cross{MODOP}{makeop} &
+\cross{MODOP}{one?} &
+\cross{MODOP}{opeval} &
+\cross{MODOP}{recip} \\
+\cross{MODOP}{retract} &
+\cross{MODOP}{retractIfCan} &
+\cross{MODOP}{sample} &
+\cross{MODOP}{subtractIfCan} &
+\cross{MODOP}{zero?} \\
+\cross{MODOP}{?*?} &
+\cross{MODOP}{?**?} &
+\cross{MODOP}{?+?} &
+\cross{MODOP}{?-?} &
+\cross{MODOP}{-?} \\
+\cross{MODOP}{?=?} &
+\cross{MODOP}{?\^{}?} &
+\cross{MODOP}{?.?} &
+\cross{MODOP}{?\~{}=?} &
+\end{tabular}
+
 <<domain MODOP ModuleOperator>>=
 )abbrev domain MODOP ModuleOperator
 ++ Author: Manuel Bronstein
@@ -56613,6 +57311,32 @@ ModuleOperator(R: Ring, M:LeftModule(R)): Exports == Implementation where
 \section{domain MOEBIUS MoebiusTransform}
 \pagehead{MoebiusTransform}{MOEBIUS}
 \pagepic{ps/v103moebiustransform.ps}{MOEBIUS}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MOEBIUS}{1} &
+\cross{MOEBIUS}{coerce} &
+\cross{MOEBIUS}{commutator} &
+\cross{MOEBIUS}{conjugate} &
+\cross{MOEBIUS}{eval} \\
+\cross{MOEBIUS}{hash} &
+\cross{MOEBIUS}{inv} &
+\cross{MOEBIUS}{latex} &
+\cross{MOEBIUS}{moebius} &
+\cross{MOEBIUS}{one?} \\
+\cross{MOEBIUS}{recip} &
+\cross{MOEBIUS}{sample} &
+\cross{MOEBIUS}{scale} &
+\cross{MOEBIUS}{shift} &
+\cross{MOEBIUS}{?\~{}=?} \\
+\cross{MOEBIUS}{?**?} &
+\cross{MOEBIUS}{?\^{}?} &
+\cross{MOEBIUS}{?*?} &
+\cross{MOEBIUS}{?/?} &
+\cross{MOEBIUS}{?=?} \\
+\cross{MOEBIUS}{?\^{}?} &&&&
+\end{tabular}
+
 <<domain MOEBIUS MoebiusTransform>>=
 )abbrev domain MOEBIUS MoebiusTransform
 ++ 2-by-2 matrices acting on P1(F).
@@ -56724,6 +57448,48 @@ MoebiusTransform(F): Exports == Implementation where
 \section{domain MRING MonoidRing}
 \pagehead{MonoidRing}{MRING}
 \pagepic{ps/v103monoidring.ps}{MRING}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MRING}{0} &
+\cross{MRING}{1} &
+\cross{MRING}{characteristic} &
+\cross{MRING}{charthRoot} &
+\cross{MRING}{coefficient} \\
+\cross{MRING}{coefficients} &
+\cross{MRING}{coerce} &
+\cross{MRING}{hash} &
+\cross{MRING}{index} &
+\cross{MRING}{latex} \\
+\cross{MRING}{leadingCoefficient} &
+\cross{MRING}{leadingMonomial} &
+\cross{MRING}{lookup} &
+\cross{MRING}{map} &
+\cross{MRING}{monomial} \\
+\cross{MRING}{monomial?} &
+\cross{MRING}{monomials} &
+\cross{MRING}{numberOfMonomials} &
+\cross{MRING}{one?} &
+\cross{MRING}{random} \\
+\cross{MRING}{recip} &
+\cross{MRING}{reductum} &
+\cross{MRING}{retract} &
+\cross{MRING}{retractIfCan} &
+\cross{MRING}{sample} \\
+\cross{MRING}{size} &
+\cross{MRING}{subtractIfCan} &
+\cross{MRING}{terms} &
+\cross{MRING}{zero?} &
+\cross{MRING}{?*?} \\
+\cross{MRING}{?**?} &
+\cross{MRING}{?+?} &
+\cross{MRING}{?-?} &
+\cross{MRING}{-?} &
+\cross{MRING}{?=?} \\
+\cross{MRING}{?\^{}?} &
+\cross{MRING}{?\~{}=?} &&&
+\end{tabular}
+
 <<domain MRING MonoidRing>>=
 )abbrev domain MRING MonoidRing
 ++ Authors: Stephan M. Watt; revised by Johannes Grabmeier
@@ -57267,6 +58033,58 @@ o )show Multiset
 @
 \pagehead{Multiset}{MSET}
 \pagepic{ps/v103multiset.ps}{MSET}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MSET}{any?} &
+\cross{MSET}{bag} &
+\cross{MSET}{brace} &
+\cross{MSET}{coerce} &
+\cross{MSET}{construct} \\
+\cross{MSET}{convert} &
+\cross{MSET}{copy} &
+\cross{MSET}{count} &
+\cross{MSET}{dictionary} &
+\cross{MSET}{difference} \\
+\cross{MSET}{duplicates} &
+\cross{MSET}{empty} &
+\cross{MSET}{empty?} &
+\cross{MSET}{eq?} &
+\cross{MSET}{eval} \\
+\cross{MSET}{every?} &
+\cross{MSET}{extract!} &
+\cross{MSET}{find} &
+\cross{MSET}{hash} &
+\cross{MSET}{insert!} \\
+\cross{MSET}{inspect} &
+\cross{MSET}{intersect} &
+\cross{MSET}{latex} &
+\cross{MSET}{less?} &
+\cross{MSET}{map} \\
+\cross{MSET}{map!} &
+\cross{MSET}{members} &
+\cross{MSET}{member?} &
+\cross{MSET}{more?} &
+\cross{MSET}{multiset} \\
+\cross{MSET}{parts} &
+\cross{MSET}{reduce} &
+\cross{MSET}{remove} &
+\cross{MSET}{remove!} &
+\cross{MSET}{removeDuplicates} \\
+\cross{MSET}{sample} &
+\cross{MSET}{select} &
+\cross{MSET}{select!} &
+\cross{MSET}{set} &
+\cross{MSET}{size?} \\
+\cross{MSET}{subset?} &
+\cross{MSET}{symmetricDifference} &
+\cross{MSET}{union} &
+\cross{MSET}{\#{}?} &
+\cross{MSET}{?$<$?} \\
+\cross{MSET}{?=?} &
+\cross{MSET}{?\~{}=?} &&&
+\end{tabular}
+
 <<domain MSET Multiset>>=
 )abbrev domain MSET Multiset
 ++ Author:Stephen M. Watt, William H. Burge, Richard D. Jenks, Frederic Lehobey
@@ -57763,6 +58581,94 @@ o )show MultivariatePolynomial
 \pageto{Polynomial}{POLY}
 \pageto{SparseMultivariatePolynomial}{SMP}
 \pageto{IndexedExponents}{INDE}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{MPOLY}{0} &
+\cross{MPOLY}{1} &
+\cross{MPOLY}{associates?} &
+\cross{MPOLY}{binomThmExpt} \\
+\cross{MPOLY}{characteristic} &
+\cross{MPOLY}{charthRoot} &
+\cross{MPOLY}{coefficient} &
+\cross{MPOLY}{coefficients} \\
+\cross{MPOLY}{coerce} &
+\cross{MPOLY}{conditionP} &
+\cross{MPOLY}{content} &
+\cross{MPOLY}{convert} \\
+\cross{MPOLY}{D} &
+\cross{MPOLY}{degree} &
+\cross{MPOLY}{differentiate} &
+\cross{MPOLY}{discriminant} \\
+\cross{MPOLY}{eval} &
+\cross{MPOLY}{exquo} &
+\cross{MPOLY}{factor} &
+\cross{MPOLY}{factorPolynomial} \\
+\cross{MPOLY}{factorSquareFreePolynomial} &
+\cross{MPOLY}{gcd} &
+\cross{MPOLY}{gcdPolynomial} &
+\cross{MPOLY}{ground} \\
+\cross{MPOLY}{ground?} &
+\cross{MPOLY}{hash} &
+\cross{MPOLY}{isExpt} &
+\cross{MPOLY}{isPlus} \\
+\cross{MPOLY}{isTimes} &
+\cross{MPOLY}{latex} &
+\cross{MPOLY}{lcm} &
+\cross{MPOLY}{leadingCoefficient} \\
+\cross{MPOLY}{leadingMonomial} &
+\cross{MPOLY}{mainVariable} &
+\cross{MPOLY}{map} &
+\cross{MPOLY}{mapExponents} \\
+\cross{MPOLY}{max} &
+\cross{MPOLY}{min} &
+\cross{MPOLY}{minimumDegree} &
+\cross{MPOLY}{monicDivide} \\
+\cross{MPOLY}{monomial} &
+\cross{MPOLY}{monomial?} &
+\cross{MPOLY}{monomials} &
+\cross{MPOLY}{multivariate} \\
+\cross{MPOLY}{numberOfMonomials} &
+\cross{MPOLY}{one?} &
+\cross{MPOLY}{patternMatch} &
+\cross{MPOLY}{pomopo!} \\
+\cross{MPOLY}{prime?} &
+\cross{MPOLY}{primitivePart} &
+\cross{MPOLY}{primitiveMonomials} &
+\cross{MPOLY}{recip} \\
+\cross{MPOLY}{reducedSystem} &
+\cross{MPOLY}{reductum} &
+\cross{MPOLY}{resultant} &
+\cross{MPOLY}{retract} \\
+\cross{MPOLY}{retractIfCan} &
+\cross{MPOLY}{sample} &
+\cross{MPOLY}{solveLinearPolynomialEquation} &
+\cross{MPOLY}{squareFree} \\
+\cross{MPOLY}{squareFreePart} &
+\cross{MPOLY}{squareFreePolynomial} &
+\cross{MPOLY}{subtractIfCan} &
+\cross{MPOLY}{totalDegree} \\
+\cross{MPOLY}{unit?} &
+\cross{MPOLY}{unitCanonical} &
+\cross{MPOLY}{unitNormal} &
+\cross{MPOLY}{univariate} \\
+\cross{MPOLY}{variables} &
+\cross{MPOLY}{zero?} &
+\cross{MPOLY}{?*?} &
+\cross{MPOLY}{?**?} \\
+\cross{MPOLY}{?+?} &
+\cross{MPOLY}{?-?} &
+\cross{MPOLY}{-?} &
+\cross{MPOLY}{?=?} \\
+\cross{MPOLY}{?\^{}?} &
+\cross{MPOLY}{?\~{}=?} &
+\cross{MPOLY}{?/?} &
+\cross{MPOLY}{?$<$?} \\
+\cross{MPOLY}{?$<=$?} &
+\cross{MPOLY}{?$>$?} &
+\cross{MPOLY}{?$>=$?} &
+\end{tabular}
+
 <<domain MPOLY MultivariatePolynomial>>=
 )abbrev domain MPOLY MultivariatePolynomial
 ++ Author: Dave Barton, Barry Trager
@@ -57799,6 +58705,111 @@ MultivariatePolynomial(vl:List Symbol, R:Ring)
 \pagepic{ps/v103myexpression.ps}{MYEXPR}{1.00}
 {\bf See}\\
 \pageto{MyUnivariatePolynomial}{MYUP}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{MYEXPR}{0} &
+\cross{MYEXPR}{1} &
+\cross{MYEXPR}{applyQuote} &
+\cross{MYEXPR}{associates?} \\
+\cross{MYEXPR}{belong?} &
+\cross{MYEXPR}{binomial} &
+\cross{MYEXPR}{box} &
+\cross{MYEXPR}{characteristic} \\
+\cross{MYEXPR}{charthRoot} &
+\cross{MYEXPR}{coerce} &
+\cross{MYEXPR}{commutator} &
+\cross{MYEXPR}{conjugate} \\
+\cross{MYEXPR}{convert} &
+\cross{MYEXPR}{D} &
+\cross{MYEXPR}{definingPolynomial} &
+\cross{MYEXPR}{denom} \\
+\cross{MYEXPR}{denominator} &
+\cross{MYEXPR}{differentiate} &
+\cross{MYEXPR}{distribute} &
+\cross{MYEXPR}{divide} \\
+\cross{MYEXPR}{elt} &
+\cross{MYEXPR}{euclideanSize} &
+\cross{MYEXPR}{eval} &
+\cross{MYEXPR}{even?} \\
+\cross{MYEXPR}{expressIdealMember} &
+\cross{MYEXPR}{exquo} &
+\cross{MYEXPR}{extendedEuclidean} &
+\cross{MYEXPR}{factor} \\
+\cross{MYEXPR}{factorial} &
+\cross{MYEXPR}{factorials} &
+\cross{MYEXPR}{freeOf?} &
+\cross{MYEXPR}{gcd} \\
+\cross{MYEXPR}{gcdPolynomial} &
+\cross{MYEXPR}{ground} &
+\cross{MYEXPR}{ground?} &
+\cross{MYEXPR}{hash} \\
+\cross{MYEXPR}{height} &
+\cross{MYEXPR}{inv} &
+\cross{MYEXPR}{is?} &
+\cross{MYEXPR}{is?} \\
+\cross{MYEXPR}{isExpt} &
+\cross{MYEXPR}{isMult} &
+\cross{MYEXPR}{isPlus} &
+\cross{MYEXPR}{isPower} \\
+\cross{MYEXPR}{isTimes} &
+\cross{MYEXPR}{kernel} &
+\cross{MYEXPR}{kernels} &
+\cross{MYEXPR}{latex} \\
+\cross{MYEXPR}{lcm} &
+\cross{MYEXPR}{mainKernel} &
+\cross{MYEXPR}{map} &
+\cross{MYEXPR}{max} \\
+\cross{MYEXPR}{min} &
+\cross{MYEXPR}{minPoly} &
+\cross{MYEXPR}{multiEuclidean} &
+\cross{MYEXPR}{numer} \\
+\cross{MYEXPR}{numerator} &
+\cross{MYEXPR}{odd?} &
+\cross{MYEXPR}{one?} &
+\cross{MYEXPR}{operator} \\
+\cross{MYEXPR}{operators} &
+\cross{MYEXPR}{paren} &
+\cross{MYEXPR}{patternMatch} &
+\cross{MYEXPR}{permutation} \\
+\cross{MYEXPR}{prime?} &
+\cross{MYEXPR}{principalIdeal} &
+\cross{MYEXPR}{product} &
+\cross{MYEXPR}{recip} \\
+\cross{MYEXPR}{reducedSystem} &
+\cross{MYEXPR}{retract} &
+\cross{MYEXPR}{retractIfCan} &
+\cross{MYEXPR}{sample} \\
+\cross{MYEXPR}{sizeLess?} &
+\cross{MYEXPR}{squareFree} &
+\cross{MYEXPR}{squareFreePart} &
+\cross{MYEXPR}{subst} \\
+\cross{MYEXPR}{subtractIfCan} &
+\cross{MYEXPR}{summation} &
+\cross{MYEXPR}{tower} &
+\cross{MYEXPR}{unit?} \\
+\cross{MYEXPR}{unitCanonical} &
+\cross{MYEXPR}{unitNormal} &
+\cross{MYEXPR}{univariate} &
+\cross{MYEXPR}{variables} \\
+\cross{MYEXPR}{zero?} &
+\cross{MYEXPR}{?*?} &
+\cross{MYEXPR}{?**?} &
+\cross{MYEXPR}{?+?} \\
+\cross{MYEXPR}{-?} &
+\cross{MYEXPR}{?-?} &
+\cross{MYEXPR}{?/?} &
+\cross{MYEXPR}{?$<$?} \\
+\cross{MYEXPR}{?$<=$?} &
+\cross{MYEXPR}{?=?} &
+\cross{MYEXPR}{?$>$?} &
+\cross{MYEXPR}{?$>=$?} \\
+\cross{MYEXPR}{?\^{}?} &
+\cross{MYEXPR}{?\~{}=?} &
+\cross{MYEXPR}{?quo?} &
+\cross{MYEXPR}{?rem?} 
+\end{tabular}
+
 <<domain MYEXPR MyExpression>>=
 )abbrev domain MYEXPR MyExpression
 MyExpression(q: Symbol, R): Exports == Implementation where
@@ -57862,6 +58873,125 @@ MyExpression(q: Symbol, R): Exports == Implementation where
 \pagepic{ps/v103myunivariatepolynomial.ps}{MYUP}{1.00}
 {\bf See}\\
 \pageto{MyExpression}{MYEXPR}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{MYUP}{0} &
+\cross{MYUP}{1} &
+\cross{MYUP}{associates?} \\
+\cross{MYUP}{binomThmExpt} &
+\cross{MYUP}{characteristic} &
+\cross{MYUP}{charthRoot} \\
+\cross{MYUP}{coefficient} &
+\cross{MYUP}{coefficients} &
+\cross{MYUP}{coerce} \\
+\cross{MYUP}{composite} &
+\cross{MYUP}{conditionP} &
+\cross{MYUP}{content} \\
+\cross{MYUP}{convert} &
+\cross{MYUP}{D} &
+\cross{MYUP}{degree} \\
+\cross{MYUP}{differentiate} &
+\cross{MYUP}{discriminant} &
+\cross{MYUP}{divide} \\
+\cross{MYUP}{divideExponents} &
+\cross{MYUP}{elt} &
+\cross{MYUP}{euclideanSize} \\
+\cross{MYUP}{eval} &
+\cross{MYUP}{expressIdealMember} &
+\cross{MYUP}{exquo} \\
+\cross{MYUP}{extendedEuclidean} &
+\cross{MYUP}{factor} &
+\cross{MYUP}{factorPolynomial} \\
+\cross{MYUP}{factorSquareFreePolynomial} &
+\cross{MYUP}{fmecg} &
+\cross{MYUP}{gcd} \\
+\cross{MYUP}{gcdPolynomial} &
+\cross{MYUP}{ground} &
+\cross{MYUP}{ground?} \\
+\cross{MYUP}{hash} &
+\cross{MYUP}{init} &
+\cross{MYUP}{integrate} \\
+\cross{MYUP}{isExpt} &
+\cross{MYUP}{isPlus} &
+\cross{MYUP}{isTimes} \\
+\cross{MYUP}{karatsubaDivide} &
+\cross{MYUP}{latex} &
+\cross{MYUP}{lcm} \\
+\cross{MYUP}{leadingCoefficient} &
+\cross{MYUP}{leadingMonomial} &
+\cross{MYUP}{mainVariable} \\
+\cross{MYUP}{makeSUP} &
+\cross{MYUP}{map} &
+\cross{MYUP}{mapExponents} \\
+\cross{MYUP}{max} &
+\cross{MYUP}{min} &
+\cross{MYUP}{minimumDegree} \\
+\cross{MYUP}{monicDivide} &
+\cross{MYUP}{monomial} &
+\cross{MYUP}{monomial?} \\
+\cross{MYUP}{monomials} &
+\cross{MYUP}{multiEuclidean} &
+\cross{MYUP}{multiplyExponents} \\
+\cross{MYUP}{multivariate} &
+\cross{MYUP}{nextItem} &
+\cross{MYUP}{numberOfMonomials} \\
+\cross{MYUP}{one?} &
+\cross{MYUP}{order} &
+\cross{MYUP}{patternMatch} \\
+\cross{MYUP}{pomopo!} &
+\cross{MYUP}{prime?} &
+\cross{MYUP}{primitiveMonomials} \\
+\cross{MYUP}{primitivePart} &
+\cross{MYUP}{principalIdeal} &
+\cross{MYUP}{pseudoDivide} \\
+\cross{MYUP}{pseudoQuotient} &
+\cross{MYUP}{pseudoRemainder} &
+\cross{MYUP}{recip} \\
+\cross{MYUP}{reducedSystem} &
+\cross{MYUP}{reductum} &
+\cross{MYUP}{resultant} \\
+\cross{MYUP}{retract} &
+\cross{MYUP}{retractIfCan} &
+\cross{MYUP}{sample} \\
+\cross{MYUP}{separate} &
+\cross{MYUP}{shiftLeft} &
+\cross{MYUP}{shiftRight} \\
+\cross{MYUP}{sizeLess?} &
+\cross{MYUP}{solveLinearPolynomialEquation} &
+\cross{MYUP}{squareFree} \\
+\cross{MYUP}{squareFreePart} &
+\cross{MYUP}{squareFreePolynomial} &
+\cross{MYUP}{subResultantGcd} \\
+\cross{MYUP}{subtractIfCan} &
+\cross{MYUP}{totalDegree} &
+\cross{MYUP}{unit?} \\
+\cross{MYUP}{unitCanonical} &
+\cross{MYUP}{unitNormal} &
+\cross{MYUP}{univariate} \\
+\cross{MYUP}{unmakeSUP} &
+\cross{MYUP}{variables} &
+\cross{MYUP}{vectorise} \\
+\cross{MYUP}{zero?} &
+\cross{MYUP}{?*?} &
+\cross{MYUP}{?**?} \\
+\cross{MYUP}{?+?} &
+\cross{MYUP}{?-?} &
+\cross{MYUP}{-?} \\
+\cross{MYUP}{?=?} &
+\cross{MYUP}{?\^{}?} &
+\cross{MYUP}{?.?} \\
+\cross{MYUP}{?\~{}=?} &
+\cross{MYUP}{?/?} &
+\cross{MYUP}{?$<$?} \\
+\cross{MYUP}{?$<=$?} &
+\cross{MYUP}{?$>$?} &
+\cross{MYUP}{?$>=$?} \\
+\cross{MYUP}{?\^{}?} &
+\cross{MYUP}{?quo?} &
+\cross{MYUP}{?rem?} 
+\end{tabular}
+
 <<domain MYUP MyUnivariatePolynomial>>=
 )abbrev domain MYUP MyUnivariatePolynomial
 MyUnivariatePolynomial(x:Symbol, R:Ring):
@@ -57912,6 +59042,144 @@ by means of triangular sets.
 \pagepic{ps/v103newsparsemultivariatepolynomial.ps}{NSMP}{1.00}
 {\bf See}\\
 \pageto{NewSparseUnivariatePolynomial}{NSUP}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{NSMP}{0} &
+\cross{NSMP}{1} &
+\cross{NSMP}{associates?} \\
+\cross{NSMP}{binomThmExpt} &
+\cross{NSMP}{characteristic} &
+\cross{NSMP}{charthRoot} \\
+\cross{NSMP}{coefficient} &
+\cross{NSMP}{coefficients} &
+\cross{NSMP}{coerce} \\
+\cross{NSMP}{conditionP} &
+\cross{NSMP}{content} &
+\cross{NSMP}{D} \\
+\cross{NSMP}{degree} &
+\cross{NSMP}{deepestInitial} &
+\cross{NSMP}{deepestTail} \\
+\cross{NSMP}{differentiate} &
+\cross{NSMP}{discriminant} &
+\cross{NSMP}{eval} \\
+\cross{NSMP}{exactQuotient} &
+\cross{NSMP}{exactQuotient!} &
+\cross{NSMP}{exquo} \\
+\cross{NSMP}{extendedSubResultantGcd} &
+\cross{NSMP}{factor} &
+\cross{NSMP}{factorPolynomial} \\
+\cross{NSMP}{factorSquareFreePolynomial} &
+\cross{NSMP}{gcd} &
+\cross{NSMP}{gcdPolynomial} \\
+\cross{NSMP}{ground} &
+\cross{NSMP}{ground?} &
+\cross{NSMP}{halfExtendedSubResultantGcd1} \\
+\cross{NSMP}{halfExtendedSubResultantGcd2} &
+\cross{NSMP}{hash} &
+\cross{NSMP}{head} \\
+\cross{NSMP}{headReduce} &
+\cross{NSMP}{headReduced?} &
+\cross{NSMP}{infRittWu?} \\
+\cross{NSMP}{init} &
+\cross{NSMP}{initiallyReduce} &
+\cross{NSMP}{initiallyReduced?} \\
+\cross{NSMP}{isExpt} &
+\cross{NSMP}{isPlus} &
+\cross{NSMP}{isTimes} \\
+\cross{NSMP}{iteratedInitials} &
+\cross{NSMP}{lastSubResultant} &
+\cross{NSMP}{latex} \\
+\cross{NSMP}{LazardQuotient} &
+\cross{NSMP}{LazardQuotient2} &
+\cross{NSMP}{lazyPremWithDefault} \\
+\cross{NSMP}{lazyPquo} &
+\cross{NSMP}{lazyPrem} &
+\cross{NSMP}{lazyPseudoDivide} \\
+\cross{NSMP}{lazyResidueClass} &
+\cross{NSMP}{lcm} &
+\cross{NSMP}{leadingCoefficient} \\
+\cross{NSMP}{leadingMonomial} &
+\cross{NSMP}{leastMonomial} &
+\cross{NSMP}{mainCoefficients} \\
+\cross{NSMP}{mainContent} &
+\cross{NSMP}{mainMonomial} &
+\cross{NSMP}{mainMonomials} \\
+\cross{NSMP}{mainPrimitivePart} &
+\cross{NSMP}{mainSquareFreePart} &
+\cross{NSMP}{mainVariable} \\
+\cross{NSMP}{map} &
+\cross{NSMP}{mapExponents} &
+\cross{NSMP}{max} \\
+\cross{NSMP}{mdeg} &
+\cross{NSMP}{min} &
+\cross{NSMP}{minimumDegree} \\
+\cross{NSMP}{monic?} &
+\cross{NSMP}{monicDivide} &
+\cross{NSMP}{monicModulo} \\
+\cross{NSMP}{monomial} &
+\cross{NSMP}{monomial?} &
+\cross{NSMP}{monomials} \\
+\cross{NSMP}{multivariate} &
+\cross{NSMP}{mvar} &
+\cross{NSMP}{nextsubResultant2} \\
+\cross{NSMP}{normalized?} &
+\cross{NSMP}{numberOfMonomials} &
+\cross{NSMP}{one?} \\
+\cross{NSMP}{patternMatch} &
+\cross{NSMP}{pomopo!} &
+\cross{NSMP}{pquo} \\
+\cross{NSMP}{prem} &
+\cross{NSMP}{primPartElseUnitCanonical} &
+\cross{NSMP}{primPartElseUnitCanonical!} \\
+\cross{NSMP}{prime?} &
+\cross{NSMP}{primitiveMonomials} &
+\cross{NSMP}{primitivePart} \\
+\cross{NSMP}{primitivePart!} &
+\cross{NSMP}{pseudoDivide} &
+\cross{NSMP}{reducedSystem} \\
+\cross{NSMP}{resultant} &
+\cross{NSMP}{retract} &
+\cross{NSMP}{retractIfCan} \\
+\cross{NSMP}{RittWuCompare} &
+\cross{NSMP}{quasiMonic?} &
+\cross{NSMP}{recip} \\
+\cross{NSMP}{reduced?} &
+\cross{NSMP}{reductum} &
+\cross{NSMP}{retract} \\
+\cross{NSMP}{sample} &
+\cross{NSMP}{solveLinearPolynomialEquation} &
+\cross{NSMP}{squareFree} \\
+\cross{NSMP}{squareFreePart} &
+\cross{NSMP}{squareFreePolynomial} &
+\cross{NSMP}{subResultantChain} \\
+\cross{NSMP}{subResultantGcd} &
+\cross{NSMP}{supRittWu?} &
+\cross{NSMP}{subtractIfCan} \\
+\cross{NSMP}{tail} &
+\cross{NSMP}{totalDegree} &
+\cross{NSMP}{unit?} \\
+\cross{NSMP}{unitCanonical} &
+\cross{NSMP}{unitNormal} &
+\cross{NSMP}{univariate} \\
+\cross{NSMP}{univariate} &
+\cross{NSMP}{variables} &
+\cross{NSMP}{zero?} \\
+\cross{NSMP}{?*?} &
+\cross{NSMP}{?**?} &
+\cross{NSMP}{?+?} \\
+\cross{NSMP}{?-?} &
+\cross{NSMP}{-?} &
+\cross{NSMP}{?=?} \\
+\cross{NSMP}{?\^{}?} &
+\cross{NSMP}{?\~{}=?} &
+\cross{NSMP}{?/?} \\
+\cross{NSMP}{?$<$?} &
+\cross{NSMP}{?$<=$?} &
+\cross{NSMP}{?$>$?} \\
+\cross{NSMP}{?$>=$?} &&
+\end{tabular}
+
 <<domain NSMP NewSparseMultivariatePolynomial>>=
 )abbrev domain NSMP NewSparseMultivariatePolynomial
 ++ Author: Marc Moreno Maza
@@ -58326,6 +59594,138 @@ constructur {\bf SparseUnivariatePolynomial}.
 \pagepic{ps/v103newsparseunivariatepolynomial.ps}{NSUP}{1.00}
 {\bf See}\\
 \pageto{NewSparseMultivariatePolynomial}{NSMP}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{NSUP}{0} &
+\cross{NSUP}{1} \\
+\cross{NSUP}{associates?} &
+\cross{NSUP}{binomThmExpt} \\
+\cross{NSUP}{characteristic} &
+\cross{NSUP}{charthRoot} \\
+\cross{NSUP}{coefficient} &
+\cross{NSUP}{coefficients} \\
+\cross{NSUP}{coerce} &
+\cross{NSUP}{composite} \\
+\cross{NSUP}{conditionP} &
+\cross{NSUP}{content} \\
+\cross{NSUP}{convert} &
+\cross{NSUP}{D} \\
+\cross{NSUP}{degree} &
+\cross{NSUP}{differentiate} \\
+\cross{NSUP}{discriminant} &
+\cross{NSUP}{divide} \\
+\cross{NSUP}{divideExponents} &
+\cross{NSUP}{elt} \\
+\cross{NSUP}{euclideanSize} &
+\cross{NSUP}{eval} \\
+\cross{NSUP}{expressIdealMember} &
+\cross{NSUP}{exquo} \\
+\cross{NSUP}{extendedEuclidean} &
+\cross{NSUP}{extendedResultant} \\
+\cross{NSUP}{extendedSubResultantGcd} &
+\cross{NSUP}{factor} \\
+\cross{NSUP}{factorPolynomial} &
+\cross{NSUP}{factorSquareFreePolynomial} \\
+\cross{NSUP}{fmecg} &
+\cross{NSUP}{gcd} \\
+\cross{NSUP}{gcdPolynomial} &
+\cross{NSUP}{ground} \\
+\cross{NSUP}{ground?} &
+\cross{NSUP}{halfExtendedResultant1} \\
+\cross{NSUP}{halfExtendedResultant2} &
+\cross{NSUP}{halfExtendedSubResultantGcd1} \\
+\cross{NSUP}{halfExtendedSubResultantGcd2} &
+\cross{NSUP}{hash} \\
+\cross{NSUP}{init} &
+\cross{NSUP}{integrate} \\
+\cross{NSUP}{isExpt} &
+\cross{NSUP}{isPlus} \\
+\cross{NSUP}{isTimes} &
+\cross{NSUP}{karatsubaDivide} \\
+\cross{NSUP}{lastSubResultant} &
+\cross{NSUP}{latex} \\
+\cross{NSUP}{lazyPseudoDivide} &
+\cross{NSUP}{lazyPseudoQuotient} \\
+\cross{NSUP}{lazyPseudoRemainder} &
+\cross{NSUP}{lazyResidueClass} \\
+\cross{NSUP}{lcm} &
+\cross{NSUP}{leadingCoefficient} \\
+\cross{NSUP}{leadingMonomial} &
+\cross{NSUP}{mainVariable} \\
+\cross{NSUP}{makeSUP} &
+\cross{NSUP}{map} \\
+\cross{NSUP}{mapExponents} &
+\cross{NSUP}{max} \\
+\cross{NSUP}{min} &
+\cross{NSUP}{minimumDegree} \\
+\cross{NSUP}{monicDivide} &
+\cross{NSUP}{monicModulo} \\
+\cross{NSUP}{monomial} &
+\cross{NSUP}{monomial?} \\
+\cross{NSUP}{monomials} &
+\cross{NSUP}{multiEuclidean} \\
+\cross{NSUP}{multiplyExponents} &
+\cross{NSUP}{multivariate} \\
+\cross{NSUP}{nextItem} &
+\cross{NSUP}{numberOfMonomials} \\
+\cross{NSUP}{one?} &
+\cross{NSUP}{order} \\
+\cross{NSUP}{patternMatch} &
+\cross{NSUP}{pomopo!} \\
+\cross{NSUP}{prime?} &
+\cross{NSUP}{primitiveMonomials} \\
+\cross{NSUP}{primitivePart} &
+\cross{NSUP}{principalIdeal} \\
+\cross{NSUP}{pseudoDivide} &
+\cross{NSUP}{pseudoQuotient} \\
+\cross{NSUP}{pseudoRemainder} &
+\cross{NSUP}{recip} \\
+\cross{NSUP}{reducedSystem} &
+\cross{NSUP}{reductum} \\
+\cross{NSUP}{resultant} &
+\cross{NSUP}{retract} \\
+\cross{NSUP}{retractIfCan} &
+\cross{NSUP}{sample} \\
+\cross{NSUP}{separate} &
+\cross{NSUP}{shiftLeft} \\
+\cross{NSUP}{shiftRight} &
+\cross{NSUP}{sizeLess?} \\
+\cross{NSUP}{solveLinearPolynomialEquation} &
+\cross{NSUP}{squareFree} \\
+\cross{NSUP}{squareFreePart} &
+\cross{NSUP}{squareFreePolynomial} \\
+\cross{NSUP}{subResultantGcd} &
+\cross{NSUP}{subResultantsChain} \\
+\cross{NSUP}{subtractIfCan} &
+\cross{NSUP}{totalDegree} \\
+\cross{NSUP}{totalDegree} &
+\cross{NSUP}{unit?} \\
+\cross{NSUP}{unitCanonical} &
+\cross{NSUP}{unitNormal} \\
+\cross{NSUP}{univariate} &
+\cross{NSUP}{unmakeSUP} \\
+\cross{NSUP}{variables} &
+\cross{NSUP}{vectorise} \\
+\cross{NSUP}{zero?} &
+\cross{NSUP}{?*?} \\
+\cross{NSUP}{?**?} &
+\cross{NSUP}{?+?} \\
+\cross{NSUP}{?-?} &
+\cross{NSUP}{-?} \\
+\cross{NSUP}{?=?} &
+\cross{NSUP}{?\^{}?} \\
+\cross{NSUP}{?.?} &
+\cross{NSUP}{?\~{}=?} \\
+\cross{NSUP}{?/?} &
+\cross{NSUP}{?$<$?} \\
+\cross{NSUP}{?$<=$?} &
+\cross{NSUP}{?$>$?} \\
+\cross{NSUP}{?$>=$?} &
+\cross{NSUP}{?quo?} \\
+\cross{NSUP}{?rem?} &
+\end{tabular}
+
 <<domain NSUP NewSparseUnivariatePolynomial>>=
 )abbrev domain NSUP NewSparseUnivariatePolynomial
 ++ Author: Marc Moreno Maza
@@ -58658,6 +60058,16 @@ o )show None
 \pagepic{ps/v103none.ps}{NONE}{1.00}
 {\bf See}\\
 \pageto{Any}{ANY}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{NONE}{coerce} &
+\cross{NONE}{hash} &
+\cross{NONE}{latex} &
+\cross{NONE}{?=?} &
+\cross{NONE}{?\~{}=?} 
+\end{tabular}
+
 <<domain NONE None>>=
 )abbrev domain NONE None
 ++ Author:
@@ -58695,6 +60105,41 @@ None():SetCategory == add
 \pageto{Integer}{INT}
 \pageto{PositiveInteger}{PI}
 \pageto{RomanNumeral}{ROMAN}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{NNI}{0} &
+\cross{NNI}{1} &
+\cross{NNI}{coerce} &
+\cross{NNI}{divide} &
+\cross{NNI}{exquo} \\
+\cross{NNI}{gcd} &
+\cross{NNI}{hash} &
+\cross{NNI}{latex} &
+\cross{NNI}{max} &
+\cross{NNI}{min} \\
+\cross{NNI}{one?} &
+\cross{NNI}{random} &
+\cross{NNI}{recip} &
+\cross{NNI}{sample} &
+\cross{NNI}{shift} \\
+\cross{NNI}{subtractIfCan} &
+\cross{NNI}{sup} &
+\cross{NNI}{zero?} &
+\cross{NNI}{?\~{}=?} &
+\cross{NNI}{?*?} \\
+\cross{NNI}{?**?} &
+\cross{NNI}{?\^{}?} &
+\cross{NNI}{?+?} &
+\cross{NNI}{?$<$?} &
+\cross{NNI}{?$<=$?} \\
+\cross{NNI}{?=?} &
+\cross{NNI}{?$>$?} &
+\cross{NNI}{?$>=$?} &
+\cross{NNI}{?quo?} &
+\cross{NNI}{?rem?} 
+\end{tabular}
+
 <<domain NNI NonNegativeInteger>>=
 )abbrev domain NNI NonNegativeInteger
 ++ Author:
@@ -58747,6 +60192,17 @@ NonNegativeInteger: Join(OrderedAbelianMonoidSup,Monoid) with
 \section{domain NIPROB NumericalIntegrationProblem}
 \pagehead{NumericalIntegrationProblem}{NIPROB}
 \pagepic{ps/v103numericalintegrationproblem.ps}{NIPROB}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{NIPROB}{coerce} &
+\cross{NIPROB}{hash} &
+\cross{NIPROB}{latex} &
+\cross{NIPROB}{retract} &
+\cross{NIPROB}{?=?} &
+\cross{NIPROB}{?\~{}=?} 
+\end{tabular}
+
 <<domain NIPROB NumericalIntegrationProblem>>=
 )abbrev domain NIPROB NumericalIntegrationProblem
 ++ Author: Brian Dupee
@@ -58822,6 +60278,17 @@ NumericalIntegrationProblem():SetCategory with
 \section{domain ODEPROB NumericalODEProblem}
 \pagehead{NumericalODEProblem}{ODEPROB}
 \pagepic{ps/v103numericalodeproblem.ps}{ODEPROB}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{ODEPROB}{coerce} &
+\cross{ODEPROB}{hash} &
+\cross{ODEPROB}{latex} &
+\cross{ODEPROB}{retract} &
+\cross{ODEPROB}{?=?} &
+\cross{ODEPROB}{?\~{}=?} 
+\end{tabular}
+
 <<domain ODEPROB NumericalODEProblem>>=
 )abbrev domain ODEPROB NumericalODEProblem
 ++ Author: Brian Dupee
@@ -58881,6 +60348,17 @@ NumericalODEProblem():SetCategory with
 \section{domain OPTPROB NumericalOptimizationProblem}
 \pagehead{NumericalOptimizationProblem}{OPTPROB}
 \pagepic{ps/v103numericaloptimizationproblem.ps}{OPTPROB}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{OPTPROB}{coerce} &
+\cross{OPTPROB}{hash} &
+\cross{OPTPROB}{latex} &
+\cross{OPTPROB}{retract} &
+\cross{OPTPROB}{?=?} &
+\cross{OPTPROB}{?\~{}=?} 
+\end{tabular}
+
 <<domain OPTPROB NumericalOptimizationProblem>>=
 )abbrev domain OPTPROB NumericalOptimizationProblem
 ++ Author: Brian Dupee
@@ -58958,6 +60436,17 @@ NumericalOptimizationProblem():SetCategory with
 \section{domain PDEPROB NumericalPDEProblem}
 \pagehead{NumericalPDEProblem}{PDEPROB}
 \pagepic{ps/v103numericalpdeproblem.ps}{PDEPROB}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{PDEPROB}{coerce} &
+\cross{PDEPROB}{hash} &
+\cross{PDEPROB}{latex} &
+\cross{PDEPROB}{retract} &
+\cross{PDEPROB}{?=?} &
+\cross{PDEPROB}{?\~{}=?} 
+\end{tabular}
+
 <<domain PDEPROB NumericalPDEProblem>>=
 )abbrev domain PDEPROB NumericalPDEProblem
 ++ Author: Brian Dupee
@@ -59310,6 +60799,63 @@ o )show Octonion
 @
 \pagehead{Octonion}{OCT}
 \pagepic{ps/v103octonion.ps}{OCT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OCT}{0} &
+\cross{OCT}{1} &
+\cross{OCT}{abs} &
+\cross{OCT}{characteristic} &
+\cross{OCT}{charthRoot} \\
+\cross{OCT}{coerce} &
+\cross{OCT}{conjugate} &
+\cross{OCT}{convert} &
+\cross{OCT}{eval} &
+\cross{OCT}{hash} \\
+\cross{OCT}{imagE} &
+\cross{OCT}{imagI} &
+\cross{OCT}{imagJ} &
+\cross{OCT}{imagK} &
+\cross{OCT}{imagi} \\
+\cross{OCT}{imagj} &
+\cross{OCT}{imagk} &
+\cross{OCT}{index} &
+\cross{OCT}{inv} &
+\cross{OCT}{latex} \\
+\cross{OCT}{lookup} &
+\cross{OCT}{map} &
+\cross{OCT}{max} &
+\cross{OCT}{min} &
+\cross{OCT}{norm} \\
+\cross{OCT}{octon} &
+\cross{OCT}{one?} &
+\cross{OCT}{random} &
+\cross{OCT}{rational} &
+\cross{OCT}{rational?} \\
+\cross{OCT}{rationalIfCan} &
+\cross{OCT}{real} &
+\cross{OCT}{recip} &
+\cross{OCT}{retract} &
+\cross{OCT}{retractIfCan} \\
+\cross{OCT}{sample} &
+\cross{OCT}{size} &
+\cross{OCT}{subtractIfCan} &
+\cross{OCT}{zero?} &
+\cross{OCT}{?*?} \\
+\cross{OCT}{?**?} &
+\cross{OCT}{?+?} &
+\cross{OCT}{?-?} &
+\cross{OCT}{-?} &
+\cross{OCT}{?=?} \\
+\cross{OCT}{?\^{}?} &
+\cross{OCT}{?\~{}=?} &
+\cross{OCT}{?$<$?} &
+\cross{OCT}{?$<=$?} &
+\cross{OCT}{?$>$?} \\
+\cross{OCT}{?$>=$?} &
+\cross{OCT}{?.?} &&&
+\end{tabular}
+
 <<domain OCT Octonion>>=
 )abbrev domain OCT Octonion
 ++ Author: R. Wisbauer, J. Grabmeier
@@ -59387,6 +60933,17 @@ Octonion(R:CommutativeRing): export == impl where
 \section{domain ODEIFTBL ODEIntensityFunctionsTable}
 \pagehead{ODEIntensityFunctionsTable}{ODEIFTBL}
 \pagepic{ps/v103odeintensityfunctionstable.ps}{ODEIFTBL}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{ODEIFTBL}{clearTheIFTable} &
+\cross{ODEIFTBL}{iFTable} &
+\cross{ODEIFTBL}{insert!} &
+\cross{ODEIFTBL}{keys} &
+\cross{ODEIFTBL}{showIntensityFunctions} &
+\cross{ODEIFTBL}{showTheIFTable} 
+\end{tabular}
+
 <<domain ODEIFTBL ODEIntensityFunctionsTable>>=
 )abbrev domain ODEIFTBL ODEIntensityFunctionsTable
 ++ Author: Brian Dupee
@@ -59635,6 +61192,74 @@ o )show OneDimensionalArray
 \pageto{IndexedFlexibleArray}{IFARRAY}
 \pageto{FlexibleArray}{FARRAY}
 \pageto{IndexedOneDimensionalArray}{IARRAY1}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ARRAY1}{any?} &
+\cross{ARRAY1}{coerce} &
+\cross{ARRAY1}{concat} &
+\cross{ARRAY1}{construct} &
+\cross{ARRAY1}{convert} \\
+\cross{ARRAY1}{copy} &
+\cross{ARRAY1}{copyInto!} &
+\cross{ARRAY1}{count} &
+\cross{ARRAY1}{delete} &
+\cross{ARRAY1}{elt} \\
+\cross{ARRAY1}{empty} &
+\cross{ARRAY1}{empty?} &
+\cross{ARRAY1}{entries} &
+\cross{ARRAY1}{entry?} &
+\cross{ARRAY1}{eq?} \\
+\cross{ARRAY1}{eval} &
+\cross{ARRAY1}{every?} &
+\cross{ARRAY1}{fill!} &
+\cross{ARRAY1}{find} &
+\cross{ARRAY1}{first} \\
+\cross{ARRAY1}{hash} &
+\cross{ARRAY1}{index?} &
+\cross{ARRAY1}{indices} &
+\cross{ARRAY1}{insert} &
+\cross{ARRAY1}{latex} \\
+\cross{ARRAY1}{less?} &
+\cross{ARRAY1}{map} &
+\cross{ARRAY1}{map!} &
+\cross{ARRAY1}{max} &
+\cross{ARRAY1}{maxIndex} \\
+\cross{ARRAY1}{member?} &
+\cross{ARRAY1}{members} &
+\cross{ARRAY1}{merge} &
+\cross{ARRAY1}{min} &
+\cross{ARRAY1}{minIndex} \\
+\cross{ARRAY1}{more?} &
+\cross{ARRAY1}{new} &
+\cross{ARRAY1}{oneDimensionalArray} &
+\cross{ARRAY1}{parts} &
+\cross{ARRAY1}{position} \\
+\cross{ARRAY1}{qelt} &
+\cross{ARRAY1}{qsetelt!} &
+\cross{ARRAY1}{reduce} &
+\cross{ARRAY1}{remove} &
+\cross{ARRAY1}{removeDuplicates} \\
+\cross{ARRAY1}{reverse} &
+\cross{ARRAY1}{reverse!} &
+\cross{ARRAY1}{sample} &
+\cross{ARRAY1}{select} &
+\cross{ARRAY1}{setelt} \\
+\cross{ARRAY1}{size?} &
+\cross{ARRAY1}{sort} &
+\cross{ARRAY1}{sort!} &
+\cross{ARRAY1}{sorted?} &
+\cross{ARRAY1}{swap!} \\
+\cross{ARRAY1}{\#{}?} &
+\cross{ARRAY1}{?$<$?} &
+\cross{ARRAY1}{?$<=$?} &
+\cross{ARRAY1}{?=?} &
+\cross{ARRAY1}{?$>$?} \\
+\cross{ARRAY1}{?$>=$?} &
+\cross{ARRAY1}{?\~{}=?} &
+\cross{ARRAY1}{?.?} &&
+\end{tabular}
+
 <<domain ARRAY1 OneDimensionalArray>>=
 )abbrev domain ARRAY1 OneDimensionalArray
 ++ This is the domain of 1-based one dimensional arrays
@@ -59674,6 +61299,49 @@ OneDimensionalArray(S:Type): Exports == Implementation where
 \pagepic{ps/v103onepointcompletion.ps}{ONECOMP}{1.00}
 {\bf See}\\
 \pageto{OrderedCompletion}{ORDCOMP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ONECOMP}{0} &
+\cross{ONECOMP}{1} &
+\cross{ONECOMP}{abs} &
+\cross{ONECOMP}{characteristic} &
+\cross{ONECOMP}{coerce} \\
+\cross{ONECOMP}{coerce} &
+\cross{ONECOMP}{finite?} &
+\cross{ONECOMP}{hash} &
+\cross{ONECOMP}{infinite?} &
+\cross{ONECOMP}{infinity} \\
+\cross{ONECOMP}{latex} &
+\cross{ONECOMP}{max} &
+\cross{ONECOMP}{min} &
+\cross{ONECOMP}{negative?} &
+\cross{ONECOMP}{one?} \\
+\cross{ONECOMP}{positive?} &
+\cross{ONECOMP}{rational} &
+\cross{ONECOMP}{rational?} &
+\cross{ONECOMP}{rationalIfCan} &
+\cross{ONECOMP}{recip} \\
+\cross{ONECOMP}{retract} &
+\cross{ONECOMP}{retractIfCan} &
+\cross{ONECOMP}{sample} &
+\cross{ONECOMP}{sign} &
+\cross{ONECOMP}{subtractIfCan} \\
+\cross{ONECOMP}{zero?} &
+\cross{ONECOMP}{-?} &
+\cross{ONECOMP}{?=?} &
+\cross{ONECOMP}{?\~{}=?} &
+\cross{ONECOMP}{?*?} \\
+\cross{ONECOMP}{?**?} &
+\cross{ONECOMP}{?+?} &
+\cross{ONECOMP}{?-?} &
+\cross{ONECOMP}{?$<$?} &
+\cross{ONECOMP}{?$<=$?} \\
+\cross{ONECOMP}{?$>$?} &
+\cross{ONECOMP}{?$>=$?} &
+\cross{ONECOMP}{?\^{}?} &&
+\end{tabular}
+
 <<domain ONECOMP OnePointCompletion>>=
 )abbrev domain ONECOMP OnePointCompletion
 ++ Completion with infinity
@@ -59790,6 +61458,17 @@ OnePointCompletion(R:SetCategory): Exports == Implementation where
 {\bf See}\\
 \pageto{OpenMathEncoding}{OMENC}
 \pageto{OpenMathDevice}{OMDEV}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{OMCONN}{OMbindTCP} &
+\cross{OMCONN}{OMcloseConn} &
+\cross{OMCONN}{OMconnectTCP} &
+\cross{OMCONN}{OMconnInDevice} &
+\cross{OMCONN}{OMconnOutDevice} &
+\cross{OMCONN}{OMmakeConn} 
+\end{tabular}
+
 <<domain OMCONN OpenMathConnection>>=
 )abbrev domain OMCONN OpenMathConnection
 ++ Author: Vilya Harvey
@@ -59839,6 +61518,54 @@ OpenMathConnection(): with
 {\bf See}\\
 \pageto{OpenMathEncoding}{OMENC}
 \pageto{OpenMathConnection}{OMCONN}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OMDEV}{OMclose} &
+\cross{OMDEV}{OMgetApp} &
+\cross{OMDEV}{OMgetAtp} &
+\cross{OMDEV}{OMgetAttr} &
+\cross{OMDEV}{OMgetBVar} \\
+\cross{OMDEV}{OMgetBind} &
+\cross{OMDEV}{OMgetEndApp} &
+\cross{OMDEV}{OMgetEndAtp} &
+\cross{OMDEV}{OMgetEndAttr} &
+\cross{OMDEV}{OMgetEndBVar} \\
+\cross{OMDEV}{OMgetEndBind} &
+\cross{OMDEV}{OMgetEndError} &
+\cross{OMDEV}{OMgetEndObject} &
+\cross{OMDEV}{OMgetError} &
+\cross{OMDEV}{OMgetFloat} \\
+\cross{OMDEV}{OMgetInteger} &
+\cross{OMDEV}{OMgetObject} &
+\cross{OMDEV}{OMgetString} &
+\cross{OMDEV}{OMgetType} &
+\cross{OMDEV}{OMgetVariable} \\
+\cross{OMDEV}{OMputApp} &
+\cross{OMDEV}{OMputAtp} &
+\cross{OMDEV}{OMputAttr} &
+\cross{OMDEV}{OMputBVar} &
+\cross{OMDEV}{OMputBind} \\
+\cross{OMDEV}{OMputEndApp} &
+\cross{OMDEV}{OMputEndAtp} &
+\cross{OMDEV}{OMputEndAttr} &
+\cross{OMDEV}{OMputEndBVar} &
+\cross{OMDEV}{OMputEndBind} \\
+\cross{OMDEV}{OMputEndError} &
+\cross{OMDEV}{OMputEndObject} &
+\cross{OMDEV}{OMputError} &
+\cross{OMDEV}{OMputObject} &
+\cross{OMDEV}{OMputString} \\
+\cross{OMDEV}{OMgetSymbol} &
+\cross{OMDEV}{OMopenFile} &
+\cross{OMDEV}{OMopenString} &
+\cross{OMDEV}{OMputFloat} &
+\cross{OMDEV}{OMputInteger} \\
+\cross{OMDEV}{OMputSymbol} &
+\cross{OMDEV}{OMputVariable} &
+\cross{OMDEV}{OMsetEncoding} &&
+\end{tabular}
+
 <<domain OMDEV OpenMathDevice>>=
 )abbrev domain OMDEV OpenMathDevice
 ++ Author: Vilya Harvey
@@ -60017,6 +61744,20 @@ OpenMathDevice(): with
 {\bf See}\\
 \pageto{OpenMathDevice}{OMDEV}
 \pageto{OpenMathConnection}{OMCONN}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllllll}
+\cross{OMENC}{coerce} &
+\cross{OMENC}{hash} &
+\cross{OMENC}{latex} &
+\cross{OMENC}{OMencodingBinary} &
+\cross{OMENC}{OMencodingSGML} &
+\cross{OMENC}{OMencodingUnknown} &
+\cross{OMENC}{OMencodingXML} &
+\cross{OMENC}{?=?} &
+\cross{OMENC}{?\~{}=?} 
+\end{tabular}
+
 <<domain OMENC OpenMathEncoding>>=
 )abbrev domain OMENC OpenMathEncoding
 ++ Author: Vilya Harvey
@@ -60075,6 +61816,19 @@ OpenMathEncoding(): SetCategory with
 \pagepic{ps/v103openmatherror.ps}{OMERR}{1.00}
 {\bf See}\\
 \pageto{OpenMathErrorKind}{OMERRK}
+
+{\bf Exports:}\\
+\begin{tabular}{llllllll}
+\cross{OMERR}{coerce} &
+\cross{OMERR}{errorInfo} &
+\cross{OMERR}{errorKind} &
+\cross{OMERR}{hash} &
+\cross{OMERR}{latex} &
+\cross{OMERR}{omError} &
+\cross{OMERR}{?=?} &
+\cross{OMERR}{?~=?} 
+\end{tabular}
+
 <<domain OMERR OpenMathError>>=
 )abbrev domain OMERR OpenMathError
 ++ Author: Vilya Harvey
@@ -60132,6 +61886,20 @@ OpenMathError() : SetCategory with
 \pagepic{ps/v103openmatherrorkind.ps}{OMERRK}{1.00}
 {\bf See}\\
 \pageto{OpenMathError}{OMERR}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllllll}
+\cross{OMERRK}{OMParseError?} &
+\cross{OMERRK}{OMReadError?} &
+\cross{OMERRK}{OMUnknownCD?} &
+\cross{OMERRK}{OMUnknownSymbol?} &
+\cross{OMERRK}{coerce} &
+\cross{OMERRK}{hash} &
+\cross{OMERRK}{latex} &
+\cross{OMERRK}{?=?} &
+\cross{OMERRK}{?\~{}=?} 
+\end{tabular}
+
 <<domain OMERRK OpenMathErrorKind>>=
 )abbrev domain OMERRK OpenMathErrorKind
 ++ Author: Vilya Harvey
@@ -60578,6 +62346,40 @@ o )show Operator
 \pagepic{ps/v103operator.ps}{OP}{1.00}
 {\bf See}\\
 \pageto{ModuleOperator}{MODOP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MODOP}{0} &
+\cross{MODOP}{1} &
+\cross{MODOP}{adjoint} &
+\cross{MODOP}{characteristic} &
+\cross{MODOP}{charthRoot} \\
+\cross{MODOP}{coerce} &
+\cross{MODOP}{conjug} &
+\cross{MODOP}{evaluate} &
+\cross{MODOP}{evaluateInverse} &
+\cross{MODOP}{makeop} \\
+\cross{MODOP}{hash} &
+\cross{MODOP}{latex} &
+\cross{MODOP}{one?} &
+\cross{MODOP}{opeval} &
+\cross{MODOP}{recip} \\
+\cross{MODOP}{retract} &
+\cross{MODOP}{retractIfCan} &
+\cross{MODOP}{sample} &
+\cross{MODOP}{subtractIfCan} &
+\cross{MODOP}{zero?} \\
+\cross{MODOP}{?\~{}=?} &
+\cross{MODOP}{?*?} &
+\cross{MODOP}{?**?} &
+\cross{MODOP}{?\^{}?} &
+\cross{MODOP}{?.?} \\
+\cross{MODOP}{?+?} &
+\cross{MODOP}{?-?} &
+\cross{MODOP}{-?} &
+\cross{MODOP}{?=?} &
+\end{tabular}
+
 <<domain OP Operator>>=
 )abbrev domain OP Operator
 ++ Author: Manuel Bronstein
@@ -60602,6 +62404,40 @@ Operator(R: Ring) == ModuleOperator(R,R)
 \pageto{OrdinaryDifferentialRing}{ODR}
 \pageto{DirectProductModule}{DPMO}
 \pageto{DirectProductMatrixModule}{DPMM}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OMLO}{0} &
+\cross{OMLO}{1} &
+\cross{OMLO}{characteristic} &
+\cross{OMLO}{coefficient} &
+\cross{OMLO}{coerce} \\
+\cross{OMLO}{D} &
+\cross{OMLO}{degree} &
+\cross{OMLO}{differentiate} &
+\cross{OMLO}{hash} &
+\cross{OMLO}{latex} \\
+\cross{OMLO}{leadingCoefficient} &
+\cross{OMLO}{minimumDegree} &
+\cross{OMLO}{monomial} &
+\cross{OMLO}{one?} &
+\cross{OMLO}{op} \\
+\cross{OMLO}{po} &
+\cross{OMLO}{recip} &
+\cross{OMLO}{reductum} &
+\cross{OMLO}{sample} &
+\cross{OMLO}{subtractIfCan} \\
+\cross{OMLO}{zero?} &
+\cross{OMLO}{?\^{}?} &
+\cross{OMLO}{?\~{}=?} &
+\cross{OMLO}{?*?} &
+\cross{OMLO}{?**?} \\
+\cross{OMLO}{?+?} &
+\cross{OMLO}{?-?} &
+\cross{OMLO}{-?} &
+\cross{OMLO}{?=?} &
+\end{tabular}
+
 <<domain OMLO OppositeMonogenicLinearOperator>>=
 )abbrev domain OMLO OppositeMonogenicLinearOperator
 ++ Author: Stephen M. Watt
@@ -60651,6 +62487,50 @@ OppositeMonogenicLinearOperator(P, R): OPRcat == OPRdef where
 \pagepic{ps/v103orderedcompletion.ps}{ORDCOMP}{1.00}
 {\bf See}\\
 \pageto{OnePointCompletion}{ONECOMP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ORDCOMP}{0} &
+\cross{ORDCOMP}{1} &
+\cross{ORDCOMP}{abs} &
+\cross{ORDCOMP}{characteristic} &
+\cross{ORDCOMP}{coerce} \\
+\cross{ORDCOMP}{finite?} &
+\cross{ORDCOMP}{hash} &
+\cross{ORDCOMP}{infinite?} &
+\cross{ORDCOMP}{latex} &
+\cross{ORDCOMP}{max} \\
+\cross{ORDCOMP}{min} &
+\cross{ORDCOMP}{minusInfinity} &
+\cross{ORDCOMP}{negative?} &
+\cross{ORDCOMP}{one?} &
+\cross{ORDCOMP}{plusInfinity} \\
+\cross{ORDCOMP}{positive?} &
+\cross{ORDCOMP}{rational} &
+\cross{ORDCOMP}{rational?} &
+\cross{ORDCOMP}{rationalIfCan} &
+\cross{ORDCOMP}{recip} \\
+\cross{ORDCOMP}{retract} &
+\cross{ORDCOMP}{retractIfCan} &
+\cross{ORDCOMP}{sample} &
+\cross{ORDCOMP}{sign} &
+\cross{ORDCOMP}{subtractIfCan} \\
+\cross{ORDCOMP}{whatInfinity} &
+\cross{ORDCOMP}{zero?} &
+\cross{ORDCOMP}{?\~{}=?} &
+\cross{ORDCOMP}{?*?} &
+\cross{ORDCOMP}{?**?} \\
+\cross{ORDCOMP}{?+?} &
+\cross{ORDCOMP}{?-?} &
+\cross{ORDCOMP}{?$<$?} &
+\cross{ORDCOMP}{?$<=$?} &
+\cross{ORDCOMP}{?$>$?} \\
+\cross{ORDCOMP}{?$>=$?} &
+\cross{ORDCOMP}{?\^{}?} &
+\cross{ORDCOMP}{-?} &
+\cross{ORDCOMP}{?=?} &
+\end{tabular}
+
 <<domain ORDCOMP OrderedCompletion>>=
 )abbrev domain ORDCOMP OrderedCompletion
 ++ Completion with + and - infinity
@@ -60793,6 +62673,86 @@ OrderedCompletion(R:SetCategory): Exports == Implementation where
 {\bf See}\\
 \pageto{HomogeneousDirectProduct}{HDP}
 \pageto{SplitHomogeneousDirectProduct}{SHDP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ODP}{0} &
+\cross{ODP}{1} &
+\cross{ODP}{abs} &
+\cross{ODP}{any?} &
+\cross{ODP}{characteristic} \\
+\cross{ODP}{coerce} &
+\cross{ODP}{copy} &
+\cross{ODP}{count} &
+\cross{ODP}{D} &
+\cross{ODP}{differentiate} \\
+\cross{ODP}{dimension} &
+\cross{ODP}{directProduct} &
+\cross{ODP}{dot} &
+\cross{ODP}{elt} &
+\cross{ODP}{empty} \\
+\cross{ODP}{empty?} &
+\cross{ODP}{entries} &
+\cross{ODP}{entry?} &
+\cross{ODP}{eq?} &
+\cross{ODP}{eval} \\
+\cross{ODP}{every?} &
+\cross{ODP}{fill!} &
+\cross{ODP}{first} &
+\cross{ODP}{hash} &
+\cross{ODP}{index} \\
+\cross{ODP}{index?} &
+\cross{ODP}{indices} &
+\cross{ODP}{latex} &
+\cross{ODP}{less?} &
+\cross{ODP}{lookup} \\
+\cross{ODP}{map} &
+\cross{ODP}{map!} &
+\cross{ODP}{max} &
+\cross{ODP}{maxIndex} &
+\cross{ODP}{member?} \\
+\cross{ODP}{members} &
+\cross{ODP}{min} &
+\cross{ODP}{minIndex} &
+\cross{ODP}{more?} &
+\cross{ODP}{negative?} \\
+\cross{ODP}{one?} &
+\cross{ODP}{parts} &
+\cross{ODP}{positive?} &
+\cross{ODP}{qelt} &
+\cross{ODP}{qsetelt!} \\
+\cross{ODP}{random} &
+\cross{ODP}{recip} &
+\cross{ODP}{reducedSystem} &
+\cross{ODP}{retract} &
+\cross{ODP}{retractIfCan} \\
+\cross{ODP}{sample} &
+\cross{ODP}{setelt} &
+\cross{ODP}{sign} &
+\cross{ODP}{size} &
+\cross{ODP}{size?} \\
+\cross{ODP}{subtractIfCan} &
+\cross{ODP}{sup} &
+\cross{ODP}{swap!} &
+\cross{ODP}{unitVector} &
+\cross{ODP}{zero?} \\
+\cross{ODP}{\#{}?} &
+\cross{ODP}{?*?} &
+\cross{ODP}{?**?} &
+\cross{ODP}{?+?} &
+\cross{ODP}{?-?} \\
+\cross{ODP}{?/?} &
+\cross{ODP}{?$<$?} &
+\cross{ODP}{?$<=$?} &
+\cross{ODP}{?=?} &
+\cross{ODP}{?$>$?} \\
+\cross{ODP}{?$>=$?} &
+\cross{ODP}{?\^{}?} &
+\cross{ODP}{?\~{}=?} &
+\cross{ODP}{-?} &
+\cross{ODP}{?.?} 
+\end{tabular}
+
 <<domain ODP OrderedDirectProduct>>=
 )abbrev domain ODP OrderedDirectProduct
 -- all direct product category domains must be compiled
@@ -60835,6 +62795,47 @@ OrderedDirectProduct(dim:NonNegativeInteger,
 \section{domain OFMONOID OrderedFreeMonoid}
 \pagehead{OrderedFreeMonoid}{OFMONOID}
 \pagepic{ps/v103orderedfreemonoid.ps}{OFMONOID}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OFMONOID}{1} &
+\cross{OFMONOID}{coerce} &
+\cross{OFMONOID}{factors} &
+\cross{OFMONOID}{first} &
+\cross{OFMONOID}{hash} \\
+\cross{OFMONOID}{hclf} &
+\cross{OFMONOID}{hcrf} &
+\cross{OFMONOID}{latex} &
+\cross{OFMONOID}{length} &
+\cross{OFMONOID}{lexico} \\
+\cross{OFMONOID}{lquo} &
+\cross{OFMONOID}{max} &
+\cross{OFMONOID}{min} &
+\cross{OFMONOID}{mirror} &
+\cross{OFMONOID}{nthExpon} \\
+\cross{OFMONOID}{nthFactor} &
+\cross{OFMONOID}{one?} &
+\cross{OFMONOID}{overlap} &
+\cross{OFMONOID}{recip} &
+\cross{OFMONOID}{rest} \\
+\cross{OFMONOID}{retract} &
+\cross{OFMONOID}{retractIfCan} &
+\cross{OFMONOID}{rquo} &
+\cross{OFMONOID}{sample} &
+\cross{OFMONOID}{size} \\
+\cross{OFMONOID}{varList} &
+\cross{OFMONOID}{?*?} &
+\cross{OFMONOID}{?**?} &
+\cross{OFMONOID}{?$<$?} &
+\cross{OFMONOID}{?$<=$?} \\
+\cross{OFMONOID}{?=?} &
+\cross{OFMONOID}{?$>$?} &
+\cross{OFMONOID}{?$>=$?} &
+\cross{OFMONOID}{?\^{}?} &
+\cross{OFMONOID}{?\~{}=?} \\
+\cross{OFMONOID}{?div?} &&&&
+\end{tabular}
+
 <<domain OFMONOID OrderedFreeMonoid>>=
 )abbrev domain OFMONOID OrderedFreeMonoid
 ++ Author: Michel Petitot petitot@lifl.fr
@@ -61093,6 +63094,28 @@ o )show OrderedVariableList
 @
 \pagehead{OrderedVariableList}{OVAR}
 \pagepic{ps/v103orderedvariablelist.ps}{OVAR}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OVAR}{coerce} &
+\cross{OVAR}{convert} &
+\cross{OVAR}{hash} &
+\cross{OVAR}{index} &
+\cross{OVAR}{latex} \\
+\cross{OVAR}{lookup} &
+\cross{OVAR}{max} &
+\cross{OVAR}{min} &
+\cross{OVAR}{random} &
+\cross{OVAR}{size} \\
+\cross{OVAR}{variable} &
+\cross{OVAR}{?\~{}=?} &
+\cross{OVAR}{?$<$?} &
+\cross{OVAR}{?$<=$?} &
+\cross{OVAR}{?=?} \\
+\cross{OVAR}{?$>$?} &
+\cross{OVAR}{?$>=$?} &&&
+\end{tabular}
+
 <<domain OVAR OrderedVariableList>>=
 )abbrev domain OVAR OrderedVariableList
 ++ Description:
@@ -61789,6 +63812,103 @@ o )show OrderlyDifferentialPolynomial
 @
 \pagehead{OrderlyDifferentialPolynomial}{ODPOL}
 \pagepic{ps/v103orderlydifferentialpolynomial.ps}{ODPOL}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{ODPOL}{0} &
+\cross{ODPOL}{1} &
+\cross{ODPOL}{associates?} \\
+\cross{ODPOL}{binomThmExpt} &
+\cross{ODPOL}{characteristic} &
+\cross{ODPOL}{charthRoot} \\
+\cross{ODPOL}{coefficient} &
+\cross{ODPOL}{coefficients} &
+\cross{ODPOL}{coerce} \\
+\cross{ODPOL}{conditionP} &
+\cross{ODPOL}{content} &
+\cross{ODPOL}{D} \\
+\cross{ODPOL}{degree} &
+\cross{ODPOL}{differentialVariables} &
+\cross{ODPOL}{differentiate} \\
+\cross{ODPOL}{discriminant} &
+\cross{ODPOL}{eval} &
+\cross{ODPOL}{exquo} \\
+\cross{ODPOL}{factor} &
+\cross{ODPOL}{factorPolynomial} &
+\cross{ODPOL}{factorSquareFreePolynomial} \\
+\cross{ODPOL}{gcd} &
+\cross{ODPOL}{gcdPolynomial} &
+\cross{ODPOL}{ground} \\
+\cross{ODPOL}{ground?} &
+\cross{ODPOL}{hash} &
+\cross{ODPOL}{initial} \\
+\cross{ODPOL}{isExpt} &
+\cross{ODPOL}{isobaric?} &
+\cross{ODPOL}{isPlus} \\
+\cross{ODPOL}{isTimes} &
+\cross{ODPOL}{latex} &
+\cross{ODPOL}{lcm} \\
+\cross{ODPOL}{leader} &
+\cross{ODPOL}{leadingCoefficient} &
+\cross{ODPOL}{leadingMonomial} \\
+\cross{ODPOL}{mainVariable} &
+\cross{ODPOL}{map} &
+\cross{ODPOL}{mapExponents} \\
+\cross{ODPOL}{max} &
+\cross{ODPOL}{min} &
+\cross{ODPOL}{minimumDegree} \\
+\cross{ODPOL}{monicDivide} &
+\cross{ODPOL}{monomial} &
+\cross{ODPOL}{monomial?} \\
+\cross{ODPOL}{monomials} &
+\cross{ODPOL}{multivariate} &
+\cross{ODPOL}{numberOfMonomials} \\
+\cross{ODPOL}{one?} &
+\cross{ODPOL}{order} &
+\cross{ODPOL}{patternMatch} \\
+\cross{ODPOL}{pomopo!} &
+\cross{ODPOL}{prime?} &
+\cross{ODPOL}{primitiveMonomials} \\
+\cross{ODPOL}{primitivePart} &
+\cross{ODPOL}{recip} &
+\cross{ODPOL}{reducedSystem} \\
+\cross{ODPOL}{reductum} &
+\cross{ODPOL}{resultant} &
+\cross{ODPOL}{retract} \\
+\cross{ODPOL}{retractIfCan} &
+\cross{ODPOL}{sample} &
+\cross{ODPOL}{separant} \\
+\cross{ODPOL}{solveLinearPolynomialEquation} &
+\cross{ODPOL}{squareFree} &
+\cross{ODPOL}{squareFreePart} \\
+\cross{ODPOL}{squareFreePolynomial} &
+\cross{ODPOL}{subtractIfCan} &
+\cross{ODPOL}{totalDegree} \\
+\cross{ODPOL}{totalDegree} &
+\cross{ODPOL}{unit?} &
+\cross{ODPOL}{unitCanonical} \\
+\cross{ODPOL}{unitNormal} &
+\cross{ODPOL}{univariate} &
+\cross{ODPOL}{univariate} \\
+\cross{ODPOL}{variables} &
+\cross{ODPOL}{weight} &
+\cross{ODPOL}{weights} \\
+\cross{ODPOL}{zero?} &
+\cross{ODPOL}{?*?} &
+\cross{ODPOL}{?**?} \\
+\cross{ODPOL}{?+?} &
+\cross{ODPOL}{?-?} &
+\cross{ODPOL}{-?} \\
+\cross{ODPOL}{?=?} &
+\cross{ODPOL}{?\^{}?} &
+\cross{ODPOL}{?\~{}=?} \\
+\cross{ODPOL}{?/?} &
+\cross{ODPOL}{?$<$?} &
+\cross{ODPOL}{?$<=$?} \\
+\cross{ODPOL}{?$>$?} &
+\cross{ODPOL}{?$>=$?} &
+\end{tabular}
+
 <<domain ODPOL OrderlyDifferentialPolynomial>>=
 )abbrev domain ODPOL OrderlyDifferentialPolynomial
 ++ Author:  William Sit
@@ -61838,6 +63958,29 @@ OrderlyDifferentialPolynomial(R):
 \pageto{DifferentialSparseMultivariatePolynomial}{DSMP}
 \pageto{OrderlyDifferentialPolynomial}{ODPOL}
 \pageto{SequentialDifferentialPolynomial}{SDPOL}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ODVAR}{coerce} &
+\cross{ODVAR}{differentiate} &
+\cross{ODVAR}{hash} &
+\cross{ODVAR}{latex} &
+\cross{ODVAR}{makeVariable} \\
+\cross{ODVAR}{max} &
+\cross{ODVAR}{min} &
+\cross{ODVAR}{order} &
+\cross{ODVAR}{retract} &
+\cross{ODVAR}{retractIfCan} \\
+\cross{ODVAR}{variable} &
+\cross{ODVAR}{weight} &
+\cross{ODVAR}{?\~{}=?} &
+\cross{ODVAR}{?$<$?} &
+\cross{ODVAR}{?$<=$?} \\
+\cross{ODVAR}{?=?} &
+\cross{ODVAR}{?$>$?} &
+\cross{ODVAR}{?$>=$?} &&
+\end{tabular}
+
 <<domain ODVAR OrderlyDifferentialVariable>>=
 )abbrev domain ODVAR OrderlyDifferentialVariable
 ++ Author:  William Sit
@@ -61887,6 +64030,55 @@ OrderlyDifferentialVariable(S:OrderedSet):DifferentialVariableCategory(S)
 \pageto{OppositeMonogenicLinearOperator}{OMLO}
 \pageto{DirectProductModule}{DPMO}
 \pageto{DirectProductMatrixModule}{DPMM}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ODR}{0} &
+\cross{ODR}{1} &
+\cross{ODR}{associates?} &
+\cross{ODR}{characteristic} \\
+\cross{ODR}{coerce} &
+\cross{ODR}{D} &
+\cross{ODR}{differentiate} &
+\cross{ODR}{divide} \\
+\cross{ODR}{euclideanSize} &
+\cross{ODR}{expressIdealMember} &
+\cross{ODR}{exquo} &
+\cross{ODR}{extendedEuclidean} \\
+\cross{ODR}{factor} &
+\cross{ODR}{gcd} &
+\cross{ODR}{gcdPolynomial} &
+\cross{ODR}{hash} \\
+\cross{ODR}{inv} &
+\cross{ODR}{latex} &
+\cross{ODR}{lcm} &
+\cross{ODR}{multiEuclidean} \\
+\cross{ODR}{one?} &
+\cross{ODR}{prime?} &
+\cross{ODR}{principalIdeal} &
+\cross{ODR}{recip} \\
+\cross{ODR}{sample} &
+\cross{ODR}{sizeLess?} &
+\cross{ODR}{squareFree} &
+\cross{ODR}{squareFreePart} \\
+\cross{ODR}{subtractIfCan} &
+\cross{ODR}{unit?} &
+\cross{ODR}{unitCanonical} &
+\cross{ODR}{unitNormal} \\
+\cross{ODR}{zero?} &
+\cross{ODR}{?*?} &
+\cross{ODR}{?**?} &
+\cross{ODR}{?+?} \\
+\cross{ODR}{?-?} &
+\cross{ODR}{-?} &
+\cross{ODR}{?=?} &
+\cross{ODR}{?\^{}?} \\
+\cross{ODR}{?\~{}=?} &
+\cross{ODR}{?/?} &
+\cross{ODR}{?quo?} &
+\cross{ODR}{?rem?} 
+\end{tabular}
+
 <<domain ODR OrdinaryDifferentialRing>>=
 )abbrev domain ODR OrdinaryDifferentialRing
 ++ Author: Stephen M. Watt
@@ -61936,6 +64128,32 @@ OrdinaryDifferentialRing(Kernels,R,var): DRcategory == DRcapsule where
 \section{domain OWP OrdinaryWeightedPolynomials}
 \pagehead{OrdinaryWeightedPolynomials}{OWP}
 \pagepic{ps/v103ordinaryweightedpolynomials.ps}{OWP}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OWP}{0} &
+\cross{OWP}{1} &
+\cross{OWP}{changeWeightLevel} &
+\cross{OWP}{characteristic} &
+\cross{OWP}{coerce} \\
+\cross{OWP}{hash} &
+\cross{OWP}{latex} &
+\cross{OWP}{one?} &
+\cross{OWP}{recip} &
+\cross{OWP}{sample} \\
+\cross{OWP}{subtractIfCan} &
+\cross{OWP}{zero?} &
+\cross{OWP}{?*?} &
+\cross{OWP}{?**?} &
+\cross{OWP}{?+?} \\
+\cross{OWP}{?-?} &
+\cross{OWP}{-?} &
+\cross{OWP}{?=?} &
+\cross{OWP}{?\^{}?} &
+\cross{OWP}{?\~{}=?} \\
+\cross{OWP}{?/?} &&&&
+\end{tabular}
+
 <<domain OWP OrdinaryWeightedPolynomials>>=
 )abbrev domain OWP OrdinaryWeightedPolynomials
 ++ Author: James Davenport
@@ -61988,6 +64206,23 @@ OrdinaryWeightedPolynomials(R:Ring,
 {\bf See}\\
 \pageto{Commutator}{COMM}
 \pageto{FreeNilpotentLie}{FNLA}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OSI}{coerce} &
+\cross{OSI}{hash} &
+\cross{OSI}{latex} &
+\cross{OSI}{max} &
+\cross{OSI}{min} \\
+\cross{OSI}{value} &
+\cross{OSI}{?\~{}=?} &
+\cross{OSI}{?$<$?} &
+\cross{OSI}{?$<=$?} &
+\cross{OSI}{?=?} \\
+\cross{OSI}{?$>$?} &
+\cross{OSI}{?$>=$?} &&&
+\end{tabular}
+
 <<domain OSI OrdSetInts>>=
 )abbrev domain OSI OrdSetInts
 ++  Author : Larry Lambe
@@ -62032,6 +64267,91 @@ OrdSetInts: Export == Implement where
 \section{domain OUTFORM OutputForm}
 \pagehead{OutputForm}{OUTFORM}
 \pagepic{ps/v103outputform.ps}{OUTFORM}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OUTFORM}{assign} &
+\cross{OUTFORM}{binomial} &
+\cross{OUTFORM}{blankSeparate} &
+\cross{OUTFORM}{box} &
+\cross{OUTFORM}{brace} \\
+\cross{OUTFORM}{bracket} &
+\cross{OUTFORM}{center} &
+\cross{OUTFORM}{coerce} &
+\cross{OUTFORM}{commaSeparate} &
+\cross{OUTFORM}{differentiate} \\
+\cross{OUTFORM}{dot} &
+\cross{OUTFORM}{empty} &
+\cross{OUTFORM}{exquo} &
+\cross{OUTFORM}{hash} &
+\cross{OUTFORM}{hconcat} \\
+\cross{OUTFORM}{height} &
+\cross{OUTFORM}{hspace} &
+\cross{OUTFORM}{infix} &
+\cross{OUTFORM}{infix?} &
+\cross{OUTFORM}{int} \\
+\cross{OUTFORM}{label} &
+\cross{OUTFORM}{latex} &
+\cross{OUTFORM}{left} &
+\cross{OUTFORM}{matrix} &
+\cross{OUTFORM}{message} \\
+\cross{OUTFORM}{messagePrint} &
+\cross{OUTFORM}{not?} &
+\cross{OUTFORM}{outputForm} &
+\cross{OUTFORM}{over} &
+\cross{OUTFORM}{overbar} \\
+\cross{OUTFORM}{overlabel} &
+\cross{OUTFORM}{paren} &
+\cross{OUTFORM}{pile} &
+\cross{OUTFORM}{postfix} &
+\cross{OUTFORM}{prefix} \\
+\cross{OUTFORM}{presub} &
+\cross{OUTFORM}{presuper} &
+\cross{OUTFORM}{prime} &
+\cross{OUTFORM}{print} &
+\cross{OUTFORM}{prod} \\
+\cross{OUTFORM}{quote} &
+\cross{OUTFORM}{rarrow} &
+\cross{OUTFORM}{right} &
+\cross{OUTFORM}{root} &
+\cross{OUTFORM}{rspace} \\
+\cross{OUTFORM}{scripts} &
+\cross{OUTFORM}{semicolonSeparate} &
+\cross{OUTFORM}{slash} &
+\cross{OUTFORM}{string} &
+\cross{OUTFORM}{sub} \\
+\cross{OUTFORM}{subHeight} &
+\cross{OUTFORM}{sum} &
+\cross{OUTFORM}{super} &
+\cross{OUTFORM}{superHeight} &
+\cross{OUTFORM}{supersub} \\
+\cross{OUTFORM}{vconcat} &
+\cross{OUTFORM}{vspace} &
+\cross{OUTFORM}{width} &
+\cross{OUTFORM}{zag} &
+\cross{OUTFORM}{?*?} \\
+\cross{OUTFORM}{?**?} &
+\cross{OUTFORM}{?+?} &
+\cross{OUTFORM}{-?} &
+\cross{OUTFORM}{?-?} &
+\cross{OUTFORM}{?/?} \\
+\cross{OUTFORM}{?$<$?} &
+\cross{OUTFORM}{?$<=$?} &
+\cross{OUTFORM}{?=?} &
+\cross{OUTFORM}{?$>$?} &
+\cross{OUTFORM}{?$>=$?} \\
+\cross{OUTFORM}{?SEGMENT} &
+\cross{OUTFORM}{?..?} &
+\cross{OUTFORM}{?\^{}=?} &
+\cross{OUTFORM}{?and?} &
+\cross{OUTFORM}{?div?} \\
+\cross{OUTFORM}{?.?} &
+\cross{OUTFORM}{?or?} &
+\cross{OUTFORM}{?quo?} &
+\cross{OUTFORM}{?rem?} &
+\cross{OUTFORM}{?\~{}=?} 
+\end{tabular}
+
 <<domain OUTFORM OutputForm>>=
 )abbrev domain OUTFORM OutputForm
 ++ Keywords: output, I/O, expression
@@ -62504,6 +64824,58 @@ OutputForm(): SetCategory with
 \pageto{PAdicRationalConstructor}{PADICRC}
 \pageto{PAdicRational}{PADICRAT}
 \pageto{BalancedPAdicRational}{BPADICRT}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PADIC}{0} &
+\cross{PADIC}{1} &
+\cross{PADIC}{approximate} &
+\cross{PADIC}{associates?} &
+\cross{PADIC}{characteristic} \\
+\cross{PADIC}{coerce} &
+\cross{PADIC}{complete} &
+\cross{PADIC}{digits} &
+\cross{PADIC}{divide} &
+\cross{PADIC}{euclideanSize} \\
+\cross{PADIC}{expressIdealMember} &
+\cross{PADIC}{exquo} &
+\cross{PADIC}{extend} &
+\cross{PADIC}{extendedEuclidean} &
+\cross{PADIC}{gcd} \\
+\cross{PADIC}{gcdPolynomial} &
+\cross{PADIC}{hash} &
+\cross{PADIC}{latex} &
+\cross{PADIC}{lcm} &
+\cross{PADIC}{lcm} \\
+\cross{PADIC}{moduloP} &
+\cross{PADIC}{modulus} &
+\cross{PADIC}{multiEuclidean} &
+\cross{PADIC}{one?} &
+\cross{PADIC}{order} \\
+\cross{PADIC}{principalIdeal} &
+\cross{PADIC}{quotientByP} &
+\cross{PADIC}{recip} &
+\cross{PADIC}{root} &
+\cross{PADIC}{sample} \\
+\cross{PADIC}{sizeLess?} &
+\cross{PADIC}{sqrt} &
+\cross{PADIC}{subtractIfCan} &
+\cross{PADIC}{unit?} &
+\cross{PADIC}{unitCanonical} \\
+\cross{PADIC}{unitNormal} &
+\cross{PADIC}{zero?} &
+\cross{PADIC}{?*?} &
+\cross{PADIC}{?**?} &
+\cross{PADIC}{?+?} \\
+\cross{PADIC}{?-?} &
+\cross{PADIC}{-?} &
+\cross{PADIC}{?=?} &
+\cross{PADIC}{?\^{}?} &
+\cross{PADIC}{?\~{}=?} \\
+\cross{PADIC}{?quo?} &
+\cross{PADIC}{?rem?} &&&
+\end{tabular}
+
 <<domain PADIC PAdicInteger>>=
 )abbrev domain PADIC PAdicInteger
 ++ Author: Clifton J. Williamson
@@ -62539,6 +64911,93 @@ PAdicInteger(p:Integer) == InnerPAdicInteger(p,true$Boolean)
 \pageto{BalancedPAdicInteger}{BPADIC}
 \pageto{PAdicRationalConstructor}{PADICRC}
 \pageto{BalancedPAdicRational}{BPADICRT}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{PADICRAT}{0} &
+\cross{PADICRAT}{1} &
+\cross{PADICRAT}{abs} \\
+\cross{PADICRAT}{approximate} &
+\cross{PADICRAT}{associates?} &
+\cross{PADICRAT}{ceiling} \\
+\cross{PADICRAT}{characteristic} &
+\cross{PADICRAT}{charthRoot} &
+\cross{PADICRAT}{coerce} \\
+\cross{PADICRAT}{conditionP} &
+\cross{PADICRAT}{continuedFraction} &
+\cross{PADICRAT}{convert} \\
+\cross{PADICRAT}{D} &
+\cross{PADICRAT}{denom} &
+\cross{PADICRAT}{denominator} \\
+\cross{PADICRAT}{differentiate} &
+\cross{PADICRAT}{divide} &
+\cross{PADICRAT}{euclideanSize} \\
+\cross{PADICRAT}{eval} &
+\cross{PADICRAT}{expressIdealMember} &
+\cross{PADICRAT}{exquo} \\
+\cross{PADICRAT}{extendedEuclidean} &
+\cross{PADICRAT}{factor} &
+\cross{PADICRAT}{factorPolynomial} \\
+\cross{PADICRAT}{factorSquareFreePolynomial} &
+\cross{PADICRAT}{floor} &
+\cross{PADICRAT}{fractionPart} \\
+\cross{PADICRAT}{gcd} &
+\cross{PADICRAT}{gcdPolynomial} &
+\cross{PADICRAT}{hash} \\
+\cross{PADICRAT}{init} &
+\cross{PADICRAT}{inv} &
+\cross{PADICRAT}{latex} \\
+\cross{PADICRAT}{lcm} &
+\cross{PADICRAT}{map} &
+\cross{PADICRAT}{max} \\
+\cross{PADICRAT}{min} &
+\cross{PADICRAT}{multiEuclidean} &
+\cross{PADICRAT}{negative?} \\
+\cross{PADICRAT}{nextItem} &
+\cross{PADICRAT}{numer} &
+\cross{PADICRAT}{numerator} \\
+\cross{PADICRAT}{one?} &
+\cross{PADICRAT}{patternMatch} &
+\cross{PADICRAT}{positive?} \\
+\cross{PADICRAT}{prime?} &
+\cross{PADICRAT}{principalIdeal} &
+\cross{PADICRAT}{random} \\
+\cross{PADICRAT}{recip} &
+\cross{PADICRAT}{reducedSystem} &
+\cross{PADICRAT}{removeZeroes} \\
+\cross{PADICRAT}{retract} &
+\cross{PADICRAT}{retractIfCan} &
+\cross{PADICRAT}{sample} \\
+\cross{PADICRAT}{sign} &
+\cross{PADICRAT}{sizeLess?} &
+\cross{PADICRAT}{solveLinearPolynomialEquation} \\
+\cross{PADICRAT}{squareFree} &
+\cross{PADICRAT}{squareFreePart} &
+\cross{PADICRAT}{squareFreePolynomial} \\
+\cross{PADICRAT}{subtractIfCan} &
+\cross{PADICRAT}{unit?} &
+\cross{PADICRAT}{unitCanonical} \\
+\cross{PADICRAT}{unitNormal} &
+\cross{PADICRAT}{wholePart} &
+\cross{PADICRAT}{zero?} \\
+\cross{PADICRAT}{?*?} &
+\cross{PADICRAT}{?**?} &
+\cross{PADICRAT}{?+?} \\
+\cross{PADICRAT}{?-?} &
+\cross{PADICRAT}{-?} &
+\cross{PADICRAT}{?/?} \\
+\cross{PADICRAT}{?=?} &
+\cross{PADICRAT}{?\^{}?} &
+\cross{PADICRAT}{?\~{}=?} \\
+\cross{PADICRAT}{?$<$?} &
+\cross{PADICRAT}{?$<=$?} &
+\cross{PADICRAT}{?$>$?} \\
+\cross{PADICRAT}{?$>=$?} &
+\cross{PADICRAT}{?.?} &
+\cross{PADICRAT}{?quo?} \\
+\cross{PADICRAT}{?rem?} &&
+\end{tabular}
+
 <<domain PADICRAT PAdicRational>>=
 )abbrev domain PADICRAT PAdicRational
 ++ Author: Clifton J. Williamson
@@ -62574,6 +65033,94 @@ PAdicRational(p:Integer) == PAdicRationalConstructor(p,PAdicInteger p)
 \pageto{BalancedPAdicInteger}{BPADIC}
 \pageto{PAdicRational}{PADICRAT}
 \pageto{BalancedPAdicRational}{BPADICRT}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{PADICRC}{0} &
+\cross{PADICRC}{1} &
+\cross{PADICRC}{abs} &
+\cross{PADICRC}{approximate} \\
+\cross{PADICRC}{associates?} &
+\cross{PADICRC}{ceiling} &
+\cross{PADICRC}{characteristic} &
+\cross{PADICRC}{charthRoot} \\
+\cross{PADICRC}{coerce} &
+\cross{PADICRC}{conditionP} &
+\cross{PADICRC}{continuedFraction} &
+\cross{PADICRC}{convert} \\
+\cross{PADICRC}{D} &
+\cross{PADICRC}{denom} &
+\cross{PADICRC}{denominator} &
+\cross{PADICRC}{differentiate} \\
+\cross{PADICRC}{divide} &
+\cross{PADICRC}{euclideanSize} &
+\cross{PADICRC}{eval} &
+\cross{PADICRC}{expressIdealMember} \\
+\cross{PADICRC}{exquo} &
+\cross{PADICRC}{extendedEuclidean} &
+\cross{PADICRC}{factor} &
+\cross{PADICRC}{factorPolynomial} \\
+\cross{PADICRC}{factorSquareFreePolynomial} &
+\cross{PADICRC}{floor} &
+\cross{PADICRC}{fractionPart} &
+\cross{PADICRC}{gcd} \\
+\cross{PADICRC}{gcdPolynomial} &
+\cross{PADICRC}{gcd} &
+\cross{PADICRC}{hash} &
+\cross{PADICRC}{init} \\
+\cross{PADICRC}{inv} &
+\cross{PADICRC}{latex} &
+\cross{PADICRC}{lcm} &
+\cross{PADICRC}{map} \\
+\cross{PADICRC}{max} &
+\cross{PADICRC}{min} &
+\cross{PADICRC}{multiEuclidean} &
+\cross{PADICRC}{negative?} \\
+\cross{PADICRC}{nextItem} &
+\cross{PADICRC}{numer} &
+\cross{PADICRC}{numerator} &
+\cross{PADICRC}{one?} \\
+\cross{PADICRC}{patternMatch} &
+\cross{PADICRC}{positive?} &
+\cross{PADICRC}{prime?} &
+\cross{PADICRC}{principalIdeal} \\
+\cross{PADICRC}{random} &
+\cross{PADICRC}{recip} &
+\cross{PADICRC}{reducedSystem} &
+\cross{PADICRC}{removeZeroes} \\
+\cross{PADICRC}{retract} &
+\cross{PADICRC}{retractIfCan} &
+\cross{PADICRC}{sample} &
+\cross{PADICRC}{sign} \\
+\cross{PADICRC}{sizeLess?} &
+\cross{PADICRC}{solveLinearPolynomialEquation} &
+\cross{PADICRC}{squareFree} &
+\cross{PADICRC}{squareFreePart} \\
+\cross{PADICRC}{squareFreePolynomial} &
+\cross{PADICRC}{subtractIfCan} &
+\cross{PADICRC}{unit?} &
+\cross{PADICRC}{unitCanonical} \\
+\cross{PADICRC}{unitNormal} &
+\cross{PADICRC}{wholePart} &
+\cross{PADICRC}{zero?} &
+\cross{PADICRC}{?*?} \\
+\cross{PADICRC}{?**?} &
+\cross{PADICRC}{?+?} &
+\cross{PADICRC}{?-?} &
+\cross{PADICRC}{-?} \\
+\cross{PADICRC}{?/?} &
+\cross{PADICRC}{?=?} &
+\cross{PADICRC}{?\^{}?} &
+\cross{PADICRC}{?\~{}=?} \\
+\cross{PADICRC}{?$<$?} &
+\cross{PADICRC}{?$<=$?} &
+\cross{PADICRC}{?$>$?} &
+\cross{PADICRC}{?$>=$?} \\
+\cross{PADICRC}{?.?} &
+\cross{PADICRC}{?quo?} &
+\cross{PADICRC}{?rem?} &
+\end{tabular}
+
 <<domain PADICRC PAdicRationalConstructor>>=
 )abbrev domain PADICRC PAdicRationalConstructor
 ++ Author: Clifton J. Williamson
@@ -62768,6 +65315,23 @@ PAdicRationalConstructor(p,PADIC): Exports == Implementation where
 \pagepic{ps/v103palette.ps}{PALETTE}{1.00}
 {\bf See}\\
 \pageto{Color}{COLOR}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PALETTE}{bright} &
+\cross{PALETTE}{coerce} &
+\cross{PALETTE}{dark} &
+\cross{PALETTE}{dim} &
+\cross{PALETTE}{hash} \\
+\cross{PALETTE}{hue} &
+\cross{PALETTE}{latex} &
+\cross{PALETTE}{light} &
+\cross{PALETTE}{pastel} &
+\cross{PALETTE}{shade} \\
+\cross{PALETTE}{?\~{}=?} &
+\cross{PALETTE}{?=?} &&&
+\end{tabular}
+
 <<domain PALETTE Palette>>=
 )abbrev domain PALETTE Palette
 ++ Author: Jim Wen
@@ -62837,6 +65401,13 @@ Palette(): Exports == Implementation where
 {\bf See}\\
 \pageto{ParametricSpaceCurve}{PARSCURV}
 \pageto{ParametricSurface}{PARSURF}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{PARPCURV}{coordinate} &
+\cross{PARPCURV}{curve} 
+\end{tabular}
+
 <<domain PARPCURV ParametricPlaneCurve>>=
 )abbrev domain PARPCURV ParametricPlaneCurve
 ++ Author: Clifton J. Williamson
@@ -62888,6 +65459,13 @@ ParametricPlaneCurve(ComponentFunction): Exports == Implementation where
 {\bf See}\\
 \pageto{ParametricPlaneCurve}{PARPCURV}
 \pageto{ParametricSurface}{PARSURF}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{PARSCURV}{coordinate} &
+\cross{PARSCURV}{curve} 
+\end{tabular}
+
 <<domain PARSCURV ParametricSpaceCurve>>=
 )abbrev domain PARSCURV ParametricSpaceCurve
 ++ Author: Clifton J. Williamson
@@ -62942,6 +65520,13 @@ ParametricSpaceCurve(ComponentFunction): Exports == Implementation where
 {\bf See}\\
 \pageto{ParametricPlaneCurve}{PARPCURV}
 \pageto{ParametricSpaceCurve}{PARSCURV}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PARSURF}{coordinate} &
+\cross{PARSURF}{surface} 
+\end{tabular}
+
 <<domain PARSURF ParametricSurface>>=
 )abbrev domain PARSURF ParametricSurface
 ++ Author: Clifton J. Williamson
@@ -63265,6 +65850,63 @@ o )show PartialFraction
 @
 \pagehead{PartialFraction}{PFR}
 \pagepic{ps/v103partialfraction.ps}{PFR}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{PFR}{0} &
+\cross{PFR}{1} &
+\cross{PFR}{associates?} &
+\cross{PFR}{characteristic} \\
+\cross{PFR}{coerce} &
+\cross{PFR}{compactFraction} &
+\cross{PFR}{divide} &
+\cross{PFR}{euclideanSize} \\
+\cross{PFR}{expressIdealMember} &
+\cross{PFR}{exquo} &
+\cross{PFR}{extendedEuclidean} &
+\cross{PFR}{extendedEuclidean} \\
+\cross{PFR}{factor} &
+\cross{PFR}{firstDenom} &
+\cross{PFR}{firstNumer} &
+\cross{PFR}{gcd} \\
+\cross{PFR}{gcdPolynomial} &
+\cross{PFR}{hash} &
+\cross{PFR}{inv} &
+\cross{PFR}{latex} \\
+\cross{PFR}{lcm} &
+\cross{PFR}{multiEuclidean} &
+\cross{PFR}{nthFractionalTerm} &
+\cross{PFR}{numberOfFractionalTerms} \\
+\cross{PFR}{one?} &
+\cross{PFR}{padicallyExpand} &
+\cross{PFR}{padicFraction} &
+\cross{PFR}{partialFraction} \\
+\cross{PFR}{prime?} &
+\cross{PFR}{principalIdeal} &
+\cross{PFR}{recip} &
+\cross{PFR}{sample} \\
+\cross{PFR}{sizeLess?} &
+\cross{PFR}{squareFree} &
+\cross{PFR}{squareFreePart} &
+\cross{PFR}{subtractIfCan} \\
+\cross{PFR}{unit?} &
+\cross{PFR}{unitCanonical} &
+\cross{PFR}{unitNormal} &
+\cross{PFR}{wholePart} \\
+\cross{PFR}{zero?} &
+\cross{PFR}{?*?} &
+\cross{PFR}{?**?} &
+\cross{PFR}{?+?} \\
+\cross{PFR}{?-?} &
+\cross{PFR}{-?} &
+\cross{PFR}{?/?} &
+\cross{PFR}{?=?} \\
+\cross{PFR}{?\^{}?} &
+\cross{PFR}{?\~{}=?} &
+\cross{PFR}{?quo?} &
+\cross{PFR}{?rem?} 
+\end{tabular}
+
 <<domain PFR PartialFraction>>=
 )abbrev domain PFR PartialFraction
 ++ Author: Robert S. Sutor
@@ -63609,6 +66251,33 @@ PartialFraction(R: EuclideanDomain): Cat == Capsule where
 \pagepic{ps/v103partition.ps}{PRTITION}{1.00}
 {\bf See}\\
 \pageto{SymmetricPolynomial}{SYMPOLY}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PRTITION}{0} &
+\cross{PRTITION}{coerce} &
+\cross{PRTITION}{conjugate} &
+\cross{PRTITION}{convert} &
+\cross{PRTITION}{hash} \\
+\cross{PRTITION}{latex} &
+\cross{PRTITION}{max} &
+\cross{PRTITION}{min} &
+\cross{PRTITION}{partition} &
+\cross{PRTITION}{pdct} \\
+\cross{PRTITION}{powers} &
+\cross{PRTITION}{sample} &
+\cross{PRTITION}{subtractIfCan} &
+\cross{PRTITION}{zero?} &
+\cross{PRTITION}{?\~{}=?} \\
+\cross{PRTITION}{?*?} &
+\cross{PRTITION}{?+?} &
+\cross{PRTITION}{?$<$?} &
+\cross{PRTITION}{?$<=$?} &
+\cross{PRTITION}{?=?} \\
+\cross{PRTITION}{?$>$?} &
+\cross{PRTITION}{?$>=$?} &&&
+\end{tabular}
+
 <<domain PRTITION Partition>>=
 )abbrev domain PRTITION Partition
 ++ Domain for partitions of positive integers
@@ -63748,6 +66417,56 @@ Partition: Exports == Implementation where
 \section{domain PATTERN Pattern}
 \pagehead{Pattern}{PATTERN}
 \pagepic{ps/v103pattern.ps}{PATTERN}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PATTERN}{0} &
+\cross{PATTERN}{1} &
+\cross{PATTERN}{addBadValue} &
+\cross{PATTERN}{coerce} &
+\cross{PATTERN}{constant?} \\
+\cross{PATTERN}{convert} &
+\cross{PATTERN}{copy} &
+\cross{PATTERN}{depth} &
+\cross{PATTERN}{elt} &
+\cross{PATTERN}{generic?} \\
+\cross{PATTERN}{getBadValues} &
+\cross{PATTERN}{hasPredicate?} &
+\cross{PATTERN}{hasTopPredicate?} &
+\cross{PATTERN}{hash} &
+\cross{PATTERN}{inR?} \\
+\cross{PATTERN}{isExpt} &
+\cross{PATTERN}{isList} &
+\cross{PATTERN}{isOp} &
+\cross{PATTERN}{isOp} &
+\cross{PATTERN}{isPlus} \\
+\cross{PATTERN}{isPower} &
+\cross{PATTERN}{isQuotient} &
+\cross{PATTERN}{isTimes} &
+\cross{PATTERN}{latex} &
+\cross{PATTERN}{multiple?} \\
+\cross{PATTERN}{optional?} &
+\cross{PATTERN}{optpair} &
+\cross{PATTERN}{patternVariable} &
+\cross{PATTERN}{predicates} &
+\cross{PATTERN}{quoted?} \\
+\cross{PATTERN}{resetBadValues} &
+\cross{PATTERN}{retract} &
+\cross{PATTERN}{retractIfCan} &
+\cross{PATTERN}{setPredicates} &
+\cross{PATTERN}{setTopPredicate} \\
+\cross{PATTERN}{symbol?} &
+\cross{PATTERN}{topPredicate} &
+\cross{PATTERN}{variables} &
+\cross{PATTERN}{withPredicates} &
+\cross{PATTERN}{?*?} \\
+\cross{PATTERN}{?**?} &
+\cross{PATTERN}{?+?} &
+\cross{PATTERN}{?/?} &
+\cross{PATTERN}{?=?} &
+\cross{PATTERN}{?\~{}=?} 
+\end{tabular}
+
 <<domain PATTERN Pattern>>=
 )abbrev domain PATTERN Pattern
 ++ Patterns for use by the pattern matcher
@@ -64135,6 +66854,22 @@ Pattern(R:SetCategory): Exports == Implementation where
 \pagepic{ps/v103patternmatchlistresult.ps}{PATLRES}{1.00}
 {\bf See}\\
 \pageto{PatternMatchResult}{PATRES}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PATLRES}{atoms} &
+\cross{PATLRES}{coerce} &
+\cross{PATLRES}{failed} &
+\cross{PATLRES}{failed?} &
+\cross{PATLRES}{hash} \\
+\cross{PATLRES}{latex} &
+\cross{PATLRES}{lists} &
+\cross{PATLRES}{makeResult} &
+\cross{PATLRES}{new} &
+\cross{PATLRES}{?=?} \\
+\cross{PATLRES}{?\~{}=?} &&&&
+\end{tabular}
+
 <<domain PATLRES PatternMatchListResult>>=
 )abbrev domain PATLRES PatternMatchListResult
 ++ Result returned by the pattern matcher when using lists
@@ -64194,6 +66929,27 @@ PatternMatchListResult(R:SetCategory, S:SetCategory, L:ListAggregate S):
 \pagepic{ps/v103patternmatchresult.ps}{PATRES}{1.00}
 {\bf See}\\
 \pageto{PatternMatchListResult}{PATLRES}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PATRES}{addMatch} &
+\cross{PATRES}{addMatchRestricted} &
+\cross{PATRES}{coerce} &
+\cross{PATRES}{construct} &
+\cross{PATRES}{destruct} \\
+\cross{PATRES}{failed} &
+\cross{PATRES}{failed?} &
+\cross{PATRES}{getMatch} &
+\cross{PATRES}{hash} &
+\cross{PATRES}{insertMatch} \\
+\cross{PATRES}{latex} &
+\cross{PATRES}{new} &
+\cross{PATRES}{satisfy?} &
+\cross{PATRES}{union} &
+\cross{PATRES}{?=?} \\
+\cross{PATRES}{?\~{}=?} &&&&
+\end{tabular}
+
 <<domain PATRES PatternMatchResult>>=
 )abbrev domain PATRES PatternMatchResult
 ++ Result returned by the pattern matcher
@@ -64314,6 +67070,54 @@ a left and a right both PendantTree(S)'s
 \pageto{BinarySearchTree}{BSTREE}
 \pageto{BinaryTournament}{BTOURN}
 \pageto{BalancedBinaryTree}{BBTREE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PENDTREE}{any?} &
+\cross{PENDTREE}{child?} &
+\cross{PENDTREE}{children} &
+\cross{PENDTREE}{coerce} &
+\cross{PENDTREE}{copy} \\
+\cross{PENDTREE}{count} &
+\cross{PENDTREE}{cyclic?} &
+\cross{PENDTREE}{distance} &
+\cross{PENDTREE}{empty} &
+\cross{PENDTREE}{empty?} \\
+\cross{PENDTREE}{eq?} &
+\cross{PENDTREE}{eval} &
+\cross{PENDTREE}{every?} &
+\cross{PENDTREE}{hash} &
+\cross{PENDTREE}{latex} \\
+\cross{PENDTREE}{leaf?} &
+\cross{PENDTREE}{leaves} &
+\cross{PENDTREE}{left} &
+\cross{PENDTREE}{less?} &
+\cross{PENDTREE}{map} \\
+\cross{PENDTREE}{map!} &
+\cross{PENDTREE}{member?} &
+\cross{PENDTREE}{members} &
+\cross{PENDTREE}{more?} &
+\cross{PENDTREE}{node?} \\
+\cross{PENDTREE}{nodes} &
+\cross{PENDTREE}{parts} &
+\cross{PENDTREE}{ptree} &
+\cross{PENDTREE}{right} &
+\cross{PENDTREE}{sample} \\
+\cross{PENDTREE}{setchildren!} &
+\cross{PENDTREE}{setelt} &
+\cross{PENDTREE}{setleft!} &
+\cross{PENDTREE}{setright!} &
+\cross{PENDTREE}{setvalue!} \\
+\cross{PENDTREE}{size?} &
+\cross{PENDTREE}{value} &
+\cross{PENDTREE}{\#{}?} &
+\cross{PENDTREE}{?=?} &
+\cross{PENDTREE}{?\~{}=?} \\
+\cross{PENDTREE}{?.right} &
+\cross{PENDTREE}{?.left} &
+\cross{PENDTREE}{?.value} &&
+\end{tabular}
+
 <<domain PENDTREE PendantTree>>=
 )abbrev domain PENDTREE PendantTree
 PendantTree(S: SetCategory): T == C where
@@ -64368,6 +67172,52 @@ PendantTree(S: SetCategory): T == C where
 \section{domain PERM Permutation}
 \pagehead{Permutation}{PERM}
 \pagepic{ps/v103permutation.ps}{PERM}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{PERM}{1} &
+\cross{PERM}{coerce} &
+\cross{PERM}{coerceImages} \\
+\cross{PERM}{coerceListOfPairs} &
+\cross{PERM}{coercePreimagesImages} &
+\cross{PERM}{commutator} \\
+\cross{PERM}{conjugate} &
+\cross{PERM}{cycle} &
+\cross{PERM}{cyclePartition} \\
+\cross{PERM}{cycles} &
+\cross{PERM}{degree} &
+\cross{PERM}{eval} \\
+\cross{PERM}{even?} &
+\cross{PERM}{fixedPoints} &
+\cross{PERM}{hash} \\
+\cross{PERM}{inv} &
+\cross{PERM}{latex} &
+\cross{PERM}{listRepresentation} \\
+\cross{PERM}{max} &
+\cross{PERM}{min} &
+\cross{PERM}{movedPoints} \\
+\cross{PERM}{numberOfCycles} &
+\cross{PERM}{odd?} &
+\cross{PERM}{one?} \\
+\cross{PERM}{orbit} &
+\cross{PERM}{order} &
+\cross{PERM}{recip} \\
+\cross{PERM}{sample} &
+\cross{PERM}{sign} &
+\cross{PERM}{sort} \\
+\cross{PERM}{?*?} &
+\cross{PERM}{?**?} &
+\cross{PERM}{?/?} \\
+\cross{PERM}{?$<$?} &
+\cross{PERM}{?=?} &
+\cross{PERM}{?\^{}?} \\
+\cross{PERM}{?.?} &
+\cross{PERM}{?\~{}=?} &
+\cross{PERM}{?$<=$?} \\
+\cross{PERM}{?$>$?} &
+\cross{PERM}{?$>=$?} &
+\end{tabular}
+
 <<domain PERM Permutation>>=
 )abbrev domain PERM Permutation
 ++ Authors: Johannes Grabmeier, Holger Gollan, Martin Rubey
@@ -64731,6 +67581,8 @@ causing bugs when computing [[movedPoints]], [[fixedPoints]], [[even?]],
 The other coercion facilities check for fixed points. It also seems that [[*]]
 removes fixed points from its result.
 
+Up to [[patch--50]] we did not check for duplicates.
+ 
 <<domain PERM Permutation>>=
 
     movedPoints p == construct p.1
@@ -64879,21 +67731,13 @@ removes fixed points from its result.
       coerceImages (image) ==
         preImage : L S := [i::S for i in 1..maxIndex image]
         coercePreimagesImages [preImage,image]
-@
 
-Up to [[patch--50]] we did not check for duplicates.
- 
-<<domain PERM Permutation>>=
     if S has Finite then
 
       coerceImages (image) ==
         preImage : L S := [index(i::PI)::S for i in 1..maxIndex image]
         coercePreimagesImages [preImage,image]
-@
 
-Up to [[patch--50]] we did not check for duplicates.
- 
-<<domain PERM Permutation>>=
       fixedPoints ( p ) == complement movedPoints p
 
       cyclePartition p ==
@@ -64911,6 +67755,35 @@ Up to [[patch--50]] we did not check for duplicates.
 \section{domain PERMGRP PermutationGroup}
 \pagehead{PermutationGroup}{PERMGRP}
 \pagepic{ps/v103permutationgroup.ps}{PERMGRP}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{PERMGRP}{base} &
+\cross{PERMGRP}{coerce} &
+\cross{PERMGRP}{degree} \\
+\cross{PERMGRP}{hash} &
+\cross{PERMGRP}{latex} &
+\cross{PERMGRP}{movedPoints} \\
+\cross{PERMGRP}{orbit} &
+\cross{PERMGRP}{orbits} &
+\cross{PERMGRP}{order} \\
+\cross{PERMGRP}{random} &
+\cross{PERMGRP}{generators} &
+\cross{PERMGRP}{initializeGroupForWordProblem} \\
+\cross{PERMGRP}{member?} &
+\cross{PERMGRP}{permutationGroup} &
+\cross{PERMGRP}{random} \\
+\cross{PERMGRP}{strongGenerators} &
+\cross{PERMGRP}{wordInGenerators} &
+\cross{PERMGRP}{wordInStrongGenerators} \\
+\cross{PERMGRP}{wordsForStrongGenerators} &
+\cross{PERMGRP}{?\~{}=?} &
+\cross{PERMGRP}{?.?} \\
+\cross{PERMGRP}{?$<$?} &
+\cross{PERMGRP}{?$<=$?} &
+\cross{PERMGRP}{?=?} 
+\end{tabular}
+
 <<domain PERMGRP PermutationGroup>>=
 )abbrev domain PERMGRP PermutationGroup
 ++ Authors: G. Schneider, H. Gollan, J. Grabmeier
@@ -65681,6 +68554,59 @@ PermutationGroup(S:SetCategory): public == private where
 \pagepic{ps/v103pi.ps}{HACKPI}{1.00}
 {\bf See}\\
 \pageto{Expression}{EXPR}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{HACKPI}{0} &
+\cross{HACKPI}{1} &
+\cross{HACKPI}{associates?} &
+\cross{HACKPI}{characteristic} &
+\cross{HACKPI}{coerce} \\
+\cross{HACKPI}{convert} &
+\cross{HACKPI}{divide} &
+\cross{HACKPI}{euclideanSize} &
+\cross{HACKPI}{expressIdealMember} &
+\cross{HACKPI}{exquo} \\
+\cross{HACKPI}{extendedEuclidean} &
+\cross{HACKPI}{extendedEuclidean} &
+\cross{HACKPI}{factor} &
+\cross{HACKPI}{gcd} &
+\cross{HACKPI}{gcdPolynomial} \\
+\cross{HACKPI}{hash} &
+\cross{HACKPI}{inv} &
+\cross{HACKPI}{latex} &
+\cross{HACKPI}{lcm} &
+\cross{HACKPI}{multiEuclidean} \\
+\cross{HACKPI}{one?} &
+\cross{HACKPI}{pi} &
+\cross{HACKPI}{prime?} &
+\cross{HACKPI}{principalIdeal} &
+\cross{HACKPI}{recip} \\
+\cross{HACKPI}{retract} &
+\cross{HACKPI}{retractIfCan} &
+\cross{HACKPI}{retractIfCan} &
+\cross{HACKPI}{sample} &
+\cross{HACKPI}{sizeLess?} \\
+\cross{HACKPI}{squareFree} &
+\cross{HACKPI}{squareFreePart} &
+\cross{HACKPI}{subtractIfCan} &
+\cross{HACKPI}{unit?} &
+\cross{HACKPI}{unitCanonical} \\
+\cross{HACKPI}{unitNormal} &
+\cross{HACKPI}{zero?} &
+\cross{HACKPI}{?*?} &
+\cross{HACKPI}{?**?} &
+\cross{HACKPI}{?+?} \\
+\cross{HACKPI}{?-?} &
+\cross{HACKPI}{-?} &
+\cross{HACKPI}{?/?} &
+\cross{HACKPI}{?=?} &
+\cross{HACKPI}{?\^{}?} \\
+\cross{HACKPI}{?\~{}=?} &
+\cross{HACKPI}{?quo?} &
+\cross{HACKPI}{?rem?} &&
+\end{tabular}
+
 <<domain HACKPI Pi>>=
 )abbrev domain HACKPI Pi
 ++ Expressions in %pi only
@@ -65785,6 +68711,17 @@ o )show PlaneAlgebraicCurvePlot
 @
 \pagehead{PlaneAlgebraicCurvePlot}{ACPLOT}
 \pagepic{ps/v103planealgebraiccurveplot.ps}{ACPLOT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{ACPLOT}{coerce} &
+\cross{ACPLOT}{listBranches} &
+\cross{ACPLOT}{makeSketch} &
+\cross{ACPLOT}{refine} &
+\cross{ACPLOT}{xRange} &
+\cross{ACPLOT}{yRange} 
+\end{tabular}
+
 <<domain ACPLOT PlaneAlgebraicCurvePlot>>=
 )abbrev domain ACPLOT PlaneAlgebraicCurvePlot
 --% PlaneAlgebraicCurvePlot
@@ -67102,6 +70039,32 @@ o )show Plot
 @
 \pagehead{Plot}{PLOT}
 \pagepic{ps/v103plot.ps}{PLOT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PLOT}{adaptive?} &
+\cross{PLOT}{coerce} &
+\cross{PLOT}{debug} &
+\cross{PLOT}{listBranches} &
+\cross{PLOT}{maxPoints} \\
+\cross{PLOT}{minPoints} &
+\cross{PLOT}{numFunEvals} &
+\cross{PLOT}{parametric?} &
+\cross{PLOT}{plot} &
+\cross{PLOT}{plotPolar} \\
+\cross{PLOT}{pointPlot} &
+\cross{PLOT}{refine} &
+\cross{PLOT}{screenResolution} &
+\cross{PLOT}{setAdaptive} &
+\cross{PLOT}{setMaxPoints} \\
+\cross{PLOT}{setMinPoints} &
+\cross{PLOT}{setScreenResolution} &
+\cross{PLOT}{tRange} &
+\cross{PLOT}{xRange} &
+\cross{PLOT}{yRange} \\
+\cross{PLOT}{zoom} &&&&
+\end{tabular}
+
 <<domain PLOT Plot>>=
 )abbrev domain PLOT Plot
 ++ Author: Michael Monagan (revised by Clifton J. Williamson)
@@ -67675,6 +70638,32 @@ Plot(): Exports == Implementation where
 \section{domain PLOT3D Plot3D}
 \pagehead{Plot3D}{PLOT3D}
 \pagepic{ps/v103plot3d.ps}{PLOT3D}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PLOT3D}{adaptive3D?} &
+\cross{PLOT3D}{coerce} &
+\cross{PLOT3D}{debug3D} &
+\cross{PLOT3D}{listBranches} &
+\cross{PLOT3D}{maxPoints3D} \\
+\cross{PLOT3D}{minPoints3D} &
+\cross{PLOT3D}{numFunEvals3D} &
+\cross{PLOT3D}{plot} &
+\cross{PLOT3D}{pointPlot} &
+\cross{PLOT3D}{refine} \\
+\cross{PLOT3D}{screenResolution3D} &
+\cross{PLOT3D}{setAdaptive3D} &
+\cross{PLOT3D}{setMaxPoints3D} &
+\cross{PLOT3D}{setMinPoints3D} &
+\cross{PLOT3D}{setScreenResolution3D} \\
+\cross{PLOT3D}{tRange} &
+\cross{PLOT3D}{tValues} &
+\cross{PLOT3D}{xRange} &
+\cross{PLOT3D}{yRange} &
+\cross{PLOT3D}{zRange} \\
+\cross{PLOT3D}{zoom} &&&&
+\end{tabular}
+
 <<domain PLOT3D Plot3D>>=
 )abbrev domain PLOT3D Plot3D
 ++ Author: Clifton J. Williamson based on code by Michael Monagan
@@ -68171,6 +71160,31 @@ Plot3D(): Exports == Implementation where
 \section{domain PBWLB PoincareBirkhoffWittLyndonBasis}
 \pagehead{PoincareBirkhoffWittLyndonBasis}{PBWLB}
 \pagepic{ps/v103poincarebirkhoffwittlyndonbasis.ps}{PBWLB}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PBWLB}{1} &
+\cross{PBWLB}{coerce} &
+\cross{PBWLB}{first} &
+\cross{PBWLB}{hash} &
+\cross{PBWLB}{latex} \\
+\cross{PBWLB}{length} &
+\cross{PBWLB}{ListOfTerms} &
+\cross{PBWLB}{max} &
+\cross{PBWLB}{min} &
+\cross{PBWLB}{rest} \\
+\cross{PBWLB}{retract} &
+\cross{PBWLB}{retractable?} &
+\cross{PBWLB}{retractIfCan} &
+\cross{PBWLB}{varList} &
+\cross{PBWLB}{?\~{}=?} \\
+\cross{PBWLB}{?$<$?} &
+\cross{PBWLB}{?$<=$?} &
+\cross{PBWLB}{?=?} &
+\cross{PBWLB}{?$>$?} &
+\cross{PBWLB}{?$>=$?} 
+\end{tabular}
+
 <<domain PBWLB PoincareBirkhoffWittLyndonBasis>>=
 )abbrev domain PBWLB PoincareBirkhoffWittLyndonBasis
 ++ Author: Michel Petitot (petitot@lifl.fr).
@@ -68294,6 +71308,90 @@ PoincareBirkhoffWittLyndonBasis(VarSet: OrderedSet): Public == Private where
 {\bf See}\\
 \pageto{SubSpaceComponentProperty}{COMPPROP}
 \pageto{SubSpace}{SUBSPACE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{POINT}{any?} &
+\cross{POINT}{coerce} &
+\cross{POINT}{concat} &
+\cross{POINT}{construct} &
+\cross{POINT}{convert} \\
+\cross{POINT}{copy} &
+\cross{POINT}{copyInto!} &
+\cross{POINT}{count} &
+\cross{POINT}{count} &
+\cross{POINT}{cross} \\
+\cross{POINT}{delete} &
+\cross{POINT}{dimension} &
+\cross{POINT}{dot} &
+\cross{POINT}{elt} &
+\cross{POINT}{empty} \\
+\cross{POINT}{empty?} &
+\cross{POINT}{entries} &
+\cross{POINT}{entry?} &
+\cross{POINT}{eq?} &
+\cross{POINT}{eval} \\
+\cross{POINT}{every?} &
+\cross{POINT}{extend} &
+\cross{POINT}{fill!} &
+\cross{POINT}{find} &
+\cross{POINT}{first} \\
+\cross{POINT}{hash} &
+\cross{POINT}{index?} &
+\cross{POINT}{indices} &
+\cross{POINT}{insert} &
+\cross{POINT}{insert} \\
+\cross{POINT}{latex} &
+\cross{POINT}{length} &
+\cross{POINT}{less?} &
+\cross{POINT}{magnitude} &
+\cross{POINT}{map} \\
+\cross{POINT}{map!} &
+\cross{POINT}{max} &
+\cross{POINT}{maxIndex} &
+\cross{POINT}{member?} &
+\cross{POINT}{members} \\
+\cross{POINT}{merge} &
+\cross{POINT}{merge} &
+\cross{POINT}{min} &
+\cross{POINT}{minIndex} &
+\cross{POINT}{more?} \\
+\cross{POINT}{new} &
+\cross{POINT}{outerProduct} &
+\cross{POINT}{parts} &
+\cross{POINT}{point} &
+\cross{POINT}{position} \\
+\cross{POINT}{qelt} &
+\cross{POINT}{qsetelt!} &
+\cross{POINT}{reduce} &
+\cross{POINT}{remove} &
+\cross{POINT}{removeDuplicates} \\
+\cross{POINT}{reverse} &
+\cross{POINT}{reverse!} &
+\cross{POINT}{sample} &
+\cross{POINT}{select} &
+\cross{POINT}{setelt} \\
+\cross{POINT}{size?} &
+\cross{POINT}{sort} &
+\cross{POINT}{sort!} &
+\cross{POINT}{sorted?} &
+\cross{POINT}{swap!} \\
+\cross{POINT}{zero} &
+\cross{POINT}{\#{}?} &
+\cross{POINT}{?*?} &
+\cross{POINT}{?+?} &
+\cross{POINT}{?-?} \\
+\cross{POINT}{?$<$?} &
+\cross{POINT}{?$<=$?} &
+\cross{POINT}{?=?} &
+\cross{POINT}{?$>$?} &
+\cross{POINT}{?$>=$?} \\
+\cross{POINT}{?.?} &
+\cross{POINT}{?\~{}=?} &
+\cross{POINT}{-?} &
+\cross{POINT}{?.?} &
+\end{tabular}
+
 <<domain POINT Point>>=
 )abbrev domain POINT Point
 ++ Description:
@@ -69128,6 +72226,96 @@ o )show Polynomial
 \pageto{MultivariatePolynomial}{MPOLY}
 \pageto{SparseMultivariatePolynomial}{SMP}
 \pageto{IndexedExponents}{INDE}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{POLY}{0} &
+\cross{POLY}{1} &
+\cross{POLY}{associates?} \\
+\cross{POLY}{binomThmExpt} &
+\cross{POLY}{characteristic} &
+\cross{POLY}{charthRoot} \\
+\cross{POLY}{coefficient} &
+\cross{POLY}{coefficients} &
+\cross{POLY}{coerce} \\
+\cross{POLY}{conditionP} &
+\cross{POLY}{content} &
+\cross{POLY}{convert} \\
+\cross{POLY}{D} &
+\cross{POLY}{degree} &
+\cross{POLY}{differentiate} \\
+\cross{POLY}{discriminant} &
+\cross{POLY}{eval} &
+\cross{POLY}{exquo} \\
+\cross{POLY}{factor} &
+\cross{POLY}{factorPolynomial} &
+\cross{POLY}{factorSquareFreePolynomial} \\
+\cross{POLY}{gcd} &
+\cross{POLY}{gcdPolynomial} &
+\cross{POLY}{ground} \\
+\cross{POLY}{ground?} &
+\cross{POLY}{hash} &
+\cross{POLY}{integrate} \\
+\cross{POLY}{isExpt} &
+\cross{POLY}{isPlus} &
+\cross{POLY}{isTimes} \\
+\cross{POLY}{latex} &
+\cross{POLY}{lcm} &
+\cross{POLY}{leadingCoefficient} \\
+\cross{POLY}{leadingMonomial} &
+\cross{POLY}{mainVariable} &
+\cross{POLY}{map} \\
+\cross{POLY}{mapExponents} &
+\cross{POLY}{max} &
+\cross{POLY}{min} \\
+\cross{POLY}{minimumDegree} &
+\cross{POLY}{monicDivide} &
+\cross{POLY}{monomial} \\
+\cross{POLY}{monomial?} &
+\cross{POLY}{monomials} &
+\cross{POLY}{multivariate} \\
+\cross{POLY}{one?} &
+\cross{POLY}{numberOfMonomials} &
+\cross{POLY}{patternMatch} \\
+\cross{POLY}{pomopo!} &
+\cross{POLY}{prime?} &
+\cross{POLY}{primitiveMonomials} \\
+\cross{POLY}{primitivePart} &
+\cross{POLY}{recip} &
+\cross{POLY}{reducedSystem} \\
+\cross{POLY}{reductum} &
+\cross{POLY}{resultant} &
+\cross{POLY}{retract} \\
+\cross{POLY}{retractIfCan} &
+\cross{POLY}{sample} &
+\cross{POLY}{solveLinearPolynomialEquation} \\
+\cross{POLY}{squareFree} &
+\cross{POLY}{squareFreePart} &
+\cross{POLY}{squareFreePolynomial} \\
+\cross{POLY}{subtractIfCan} &
+\cross{POLY}{totalDegree} &
+\cross{POLY}{totalDegree} \\
+\cross{POLY}{unit?} &
+\cross{POLY}{unitCanonical} &
+\cross{POLY}{unitNormal} \\
+\cross{POLY}{univariate} &
+\cross{POLY}{variables} &
+\cross{POLY}{zero?} \\
+\cross{POLY}{?*?} &
+\cross{POLY}{?**?} &
+\cross{POLY}{?+?} \\
+\cross{POLY}{?-?} &
+\cross{POLY}{-?} &
+\cross{POLY}{?=?} \\
+\cross{POLY}{?\^{}?} &
+\cross{POLY}{?\~{}=?} &
+\cross{POLY}{?/?} \\
+\cross{POLY}{?$<$?} &
+\cross{POLY}{?$<=$?} &
+\cross{POLY}{?$>$?} \\
+\cross{POLY}{?$>=$?} &&
+\end{tabular}
+
 <<domain POLY Polynomial>>=
 )abbrev domain POLY Polynomial
 ++ Author: Dave Barton, Barry Trager
@@ -69178,6 +72366,38 @@ Polynomial(R:Ring):
 \section{domain IDEAL PolynomialIdeals}
 \pagehead{PolynomialIdeals}{IDEAL}
 \pagepic{ps/v103polynomialideals.ps}{IDEAL}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IDEAL}{backOldPos} &
+\cross{IDEAL}{coerce} &
+\cross{IDEAL}{dimension} &
+\cross{IDEAL}{element?} &
+\cross{IDEAL}{generalPosition} \\
+\cross{IDEAL}{generators} &
+\cross{IDEAL}{groebner} &
+\cross{IDEAL}{groebner?} &
+\cross{IDEAL}{groebnerIdeal} &
+\cross{IDEAL}{hash} \\
+\cross{IDEAL}{ideal} &
+\cross{IDEAL}{in?} &
+\cross{IDEAL}{inRadical?} &
+\cross{IDEAL}{intersect} &
+\cross{IDEAL}{latex} \\
+\cross{IDEAL}{leadingIdeal} &
+\cross{IDEAL}{one?} &
+\cross{IDEAL}{quotient} &
+\cross{IDEAL}{relationsIdeal} &
+\cross{IDEAL}{saturate} \\
+\cross{IDEAL}{zero?} &
+\cross{IDEAL}{zeroDim?} &
+\cross{IDEAL}{?\~{}=?} &
+\cross{IDEAL}{?**?} &
+\cross{IDEAL}{?*?} \\
+\cross{IDEAL}{?+?} &
+\cross{IDEAL}{?=?} &&&
+\end{tabular}
+
 <<domain IDEAL PolynomialIdeals>>=
 )abbrev domain IDEAL PolynomialIdeals
 ++ Author: P. Gianni
@@ -69611,6 +72831,59 @@ PolynomialIdeals(F,Expon,VarSet,DPoly) : C == T
 \pageto{FreeModule}{FM}
 \pageto{SparseUnivariatePolynomial}{SUP}
 \pageto{UnivariatePolynomial}{UP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PR}{0} &
+\cross{PR}{1} &
+\cross{PR}{associates?} &
+\cross{PR}{binomThmExpt} &
+\cross{PR}{characteristic} \\
+\cross{PR}{charthRoot} &
+\cross{PR}{coerce} &
+\cross{PR}{coefficient} &
+\cross{PR}{coefficients} &
+\cross{PR}{content} \\
+\cross{PR}{degree} &
+\cross{PR}{exquo} &
+\cross{PR}{exquo} &
+\cross{PR}{fmecg} &
+\cross{PR}{ground} \\
+\cross{PR}{ground?} &
+\cross{PR}{hash} &
+\cross{PR}{latex} &
+\cross{PR}{leadingCoefficient} &
+\cross{PR}{leadingMonomial} \\
+\cross{PR}{map} &
+\cross{PR}{mapExponents} &
+\cross{PR}{minimumDegree} &
+\cross{PR}{monomial} &
+\cross{PR}{monomial?} \\
+\cross{PR}{numberOfMonomials} &
+\cross{PR}{one?} &
+\cross{PR}{pomopo!} &
+\cross{PR}{primitivePart} &
+\cross{PR}{recip} \\
+\cross{PR}{reductum} &
+\cross{PR}{retract} &
+\cross{PR}{retractIfCan} &
+\cross{PR}{sample} &
+\cross{PR}{subtractIfCan} \\
+\cross{PR}{unit?} &
+\cross{PR}{unitCanonical} &
+\cross{PR}{unitNormal} &
+\cross{PR}{zero?} &
+\cross{PR}{?*?} \\
+\cross{PR}{?**?} &
+\cross{PR}{?+?} &
+\cross{PR}{?-?} &
+\cross{PR}{-?} &
+\cross{PR}{?=?} \\
+\cross{PR}{?\^{}?} &
+\cross{PR}{?\~{}=?} &
+\cross{PR}{?/?} &&
+\end{tabular}
+
 <<domain PR PolynomialRing>>=
 )abbrev domain PR PolynomialRing
 ++ Author: Dave Barton, James Davenport, Barry Trager
@@ -69931,6 +73204,31 @@ PolynomialRing(R:Ring,E:OrderedAbelianMonoid): T == C
 \pageto{Integer}{INT}
 \pageto{NonNegativeInteger}{NNI}
 \pageto{RomanNumeral}{ROMAN}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PI}{1} &
+\cross{PI}{coerce} &
+\cross{PI}{gcd} &
+\cross{PI}{hash} &
+\cross{PI}{latex} \\
+\cross{PI}{max} &
+\cross{PI}{min} &
+\cross{PI}{one?} &
+\cross{PI}{recip} &
+\cross{PI}{sample} \\
+\cross{PI}{?\^{}?} &
+\cross{PI}{?\~{}=?} &
+\cross{PI}{?**?} &
+\cross{PI}{?*?} &
+\cross{PI}{?+?} \\
+\cross{PI}{?$<$?} &
+\cross{PI}{?$<=$?} &
+\cross{PI}{?=?} &
+\cross{PI}{?$>$?} &
+\cross{PI}{?$>=$?} 
+\end{tabular}
+
 <<domain PI PositiveInteger>>=
 )abbrev domain PI PositiveInteger
 ++ Author:
@@ -69966,6 +73264,99 @@ PositiveInteger: Join(AbelianSemiGroup,OrderedSet,Monoid) with
 \pagepic{ps/v103primefield.ps}{PF}{1.00}
 {\bf See}\\
 \pageto{InnerPrimeField}{IPF}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{PF}{0} &
+\cross{PF}{1} &
+\cross{PF}{algebraic?} \\
+\cross{PF}{associates?} &
+\cross{PF}{basis} &
+\cross{PF}{characteristic} \\
+\cross{PF}{charthRoot} &
+\cross{PF}{conditionP} &
+\cross{PF}{coordinates} \\
+\cross{PF}{coerce} &
+\cross{PF}{convert} &
+\cross{PF}{coordinates} \\
+\cross{PF}{createPrimitiveElement} &
+\cross{PF}{createNormalElement} &
+\cross{PF}{D} \\
+\cross{PF}{definingPolynomial} &
+\cross{PF}{degree} &
+\cross{PF}{differentiate} \\
+\cross{PF}{dimension} &
+\cross{PF}{discreteLog} &
+\cross{PF}{discreteLog} \\
+\cross{PF}{divide} &
+\cross{PF}{euclideanSize} &
+\cross{PF}{expressIdealMember} \\
+\cross{PF}{exquo} &
+\cross{PF}{extendedEuclidean} &
+\cross{PF}{extensionDegree} \\
+\cross{PF}{factor} &
+\cross{PF}{factorsOfCyclicGroupSize} &
+\cross{PF}{Frobenius} \\
+\cross{PF}{gcd} &
+\cross{PF}{gcdPolynomial} &
+\cross{PF}{generator} \\
+\cross{PF}{hash} &
+\cross{PF}{inGroundField?} &
+\cross{PF}{index} \\
+\cross{PF}{init} &
+\cross{PF}{inv} &
+\cross{PF}{latex} \\
+\cross{PF}{lcm} &
+\cross{PF}{linearAssociatedExp} &
+\cross{PF}{linearAssociatedLog} \\
+\cross{PF}{linearAssociatedOrder} &
+\cross{PF}{lookup} &
+\cross{PF}{minimalPolynomial} \\
+\cross{PF}{multiEuclidean} &
+\cross{PF}{nextItem} &
+\cross{PF}{norm} \\
+\cross{PF}{normal?} &
+\cross{PF}{normalElement} &
+\cross{PF}{one?} \\
+\cross{PF}{order} &
+\cross{PF}{prime?} &
+\cross{PF}{primeFrobenius} \\
+\cross{PF}{primitive?} &
+\cross{PF}{primitiveElement} &
+\cross{PF}{principalIdeal} \\
+\cross{PF}{random} &
+\cross{PF}{recip} &
+\cross{PF}{representationType} \\
+\cross{PF}{represents} &
+\cross{PF}{retract} &
+\cross{PF}{retractIfCan} \\
+\cross{PF}{sample} &
+\cross{PF}{size} &
+\cross{PF}{sizeLess?} \\
+\cross{PF}{squareFree} &
+\cross{PF}{squareFreePart} &
+\cross{PF}{subtractIfCan} \\
+\cross{PF}{tableForDiscreteLogarithm} &
+\cross{PF}{trace} &
+\cross{PF}{transcendenceDegree} \\
+\cross{PF}{transcendent?} &
+\cross{PF}{unit?} &
+\cross{PF}{unitCanonical} \\
+\cross{PF}{unitNormal} &
+\cross{PF}{zero?} &
+\cross{PF}{?*?} \\
+\cross{PF}{?**?} &
+\cross{PF}{?+?} &
+\cross{PF}{?-?} \\
+\cross{PF}{-?} &
+\cross{PF}{?/?} &
+\cross{PF}{?=?} \\
+\cross{PF}{?\^{}?} &
+\cross{PF}{?\~{}=?} &
+\cross{PF}{?quo?} \\
+\cross{PF}{?rem?} &&
+\end{tabular}
+
 <<domain PF PrimeField>>=
 )abbrev domain PF PrimeField
 ++ Authors: N.N.,
@@ -70009,6 +73400,74 @@ PrimeField(p:PositiveInteger): Exp == Impl where
 \pageto{FlexibleArray}{FARRAY}
 \pageto{IndexedOneDimensionalArray}{IARRAY1}
 \pageto{OneDimensionalArray}{ARRAY1}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PRIMARR}{any?} &
+\cross{PRIMARR}{coerce} &
+\cross{PRIMARR}{concat} &
+\cross{PRIMARR}{construct} &
+\cross{PRIMARR}{convert} \\
+\cross{PRIMARR}{copy} &
+\cross{PRIMARR}{copyInto!} &
+\cross{PRIMARR}{count} &
+\cross{PRIMARR}{delete} &
+\cross{PRIMARR}{entry?} \\
+\cross{PRIMARR}{elt} &
+\cross{PRIMARR}{empty} &
+\cross{PRIMARR}{empty?} &
+\cross{PRIMARR}{entries} &
+\cross{PRIMARR}{eq?} \\
+\cross{PRIMARR}{eval} &
+\cross{PRIMARR}{every?} &
+\cross{PRIMARR}{fill!} &
+\cross{PRIMARR}{find} &
+\cross{PRIMARR}{first} \\
+\cross{PRIMARR}{hash} &
+\cross{PRIMARR}{index?} &
+\cross{PRIMARR}{indices} &
+\cross{PRIMARR}{insert} &
+\cross{PRIMARR}{insert} \\
+\cross{PRIMARR}{latex} &
+\cross{PRIMARR}{less?} &
+\cross{PRIMARR}{map} &
+\cross{PRIMARR}{map!} &
+\cross{PRIMARR}{max} \\
+\cross{PRIMARR}{maxIndex} &
+\cross{PRIMARR}{member?} &
+\cross{PRIMARR}{members} &
+\cross{PRIMARR}{merge} &
+\cross{PRIMARR}{min} \\
+\cross{PRIMARR}{minIndex} &
+\cross{PRIMARR}{more?} &
+\cross{PRIMARR}{new} &
+\cross{PRIMARR}{parts} &
+\cross{PRIMARR}{position} \\
+\cross{PRIMARR}{qelt} &
+\cross{PRIMARR}{qsetelt!} &
+\cross{PRIMARR}{reduce} &
+\cross{PRIMARR}{remove} &
+\cross{PRIMARR}{removeDuplicates} \\
+\cross{PRIMARR}{reverse} &
+\cross{PRIMARR}{reverse!} &
+\cross{PRIMARR}{sample} &
+\cross{PRIMARR}{select} &
+\cross{PRIMARR}{setelt} \\
+\cross{PRIMARR}{size?} &
+\cross{PRIMARR}{sort} &
+\cross{PRIMARR}{sort!} &
+\cross{PRIMARR}{sorted?} &
+\cross{PRIMARR}{swap!} \\
+\cross{PRIMARR}{\#{}?} &
+\cross{PRIMARR}{?.?} &
+\cross{PRIMARR}{?\~{}=?} &
+\cross{PRIMARR}{?$<$?} &
+\cross{PRIMARR}{?$<=$?} \\
+\cross{PRIMARR}{?=?} &
+\cross{PRIMARR}{?$>$?} &
+\cross{PRIMARR}{?$>=$?} &&
+\end{tabular}
+
 <<domain PRIMARR PrimitiveArray>>=
 )abbrev domain PRIMARR PrimitiveArray
 ++ This provides a fast array type with no bound checking on elt's.
@@ -70044,6 +73503,47 @@ PrimitiveArray(S:Type): OneDimensionalArrayAggregate S == add
 \section{domain PRODUCT Product}
 \pagehead{Product}{PRODUCT}
 \pagepic{ps/v103product.ps}{PRODUCT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PRODUCT}{0} &
+\cross{PRODUCT}{1} &
+\cross{PRODUCT}{coerce} &
+\cross{PRODUCT}{commutator} &
+\cross{PRODUCT}{conjugate} \\
+\cross{PRODUCT}{hash} &
+\cross{PRODUCT}{index} &
+\cross{PRODUCT}{inv} &
+\cross{PRODUCT}{latex} &
+\cross{PRODUCT}{lookup} \\
+\cross{PRODUCT}{makeprod} &
+\cross{PRODUCT}{max} &
+\cross{PRODUCT}{min} &
+\cross{PRODUCT}{one?} &
+\cross{PRODUCT}{random} \\
+\cross{PRODUCT}{recip} &
+\cross{PRODUCT}{sample} &
+\cross{PRODUCT}{selectfirst} &
+\cross{PRODUCT}{selectsecond} &
+\cross{PRODUCT}{size} \\
+\cross{PRODUCT}{subtractIfCan} &
+\cross{PRODUCT}{sup} &
+\cross{PRODUCT}{zero?} &
+\cross{PRODUCT}{?=?} &
+\cross{PRODUCT}{?\~{}=?} \\
+\cross{PRODUCT}{?*?} &
+\cross{PRODUCT}{?**?} &
+\cross{PRODUCT}{?+?} &
+\cross{PRODUCT}{-?} &
+\cross{PRODUCT}{?-?} \\
+\cross{PRODUCT}{?/?} &
+\cross{PRODUCT}{?$<$?} &
+\cross{PRODUCT}{?$<=$?} &
+\cross{PRODUCT}{?$>$?} &
+\cross{PRODUCT}{?$>=$?} \\
+\cross{PRODUCT}{?\^{}?} &&&&
+\end{tabular}
+
 <<domain PRODUCT Product>>=
 )abbrev domain PRODUCT Product
 ++ Description:
diff --git a/changelog b/changelog
index fefc30f..0ae872c 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20090116 tpd src/axiom-website/patches.html 20090116.03.tpd.patch
+20090116 tpd books/bookvol10.3 add exports
 20090116 tpd src/axiom-website/patches.html 20090116.02.tpd.patch
 20090116 tpd books/bookvol10.3 add exports
 20090116 tpd src/axiom-website/patches.html 20090116.01.tpd.patch
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 5290bbe..5ed39a1 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -885,6 +885,8 @@ bookvol10.3 add exports<br/>
 bookvol10.3 add exports<br/>
 <a href="patches/20090116.02.tpd.patch">20090116.02.tpd.patch</a>
 bookvol10.3 add exports<br/>
+<a href="patches/20090116.03.tpd.patch">20090116.03.tpd.patch</a>
+bookvol10.3 add exports<br/>
 
  </body>
 </html>

\start
Date: Sun, 18 Jan 2009 18:27:03 -0600
From: Tim Daly
To: list
Subject: 20090117.01.tpd.patch (bookvol10.3 add exports)

Add exports for chapters Q and R
===================================================================
diff --git a/books/bookvol10.3.pamphlet b/books/bookvol10.3.pamphlet
index 8b136ee..0ecf180 100644
--- a/books/bookvol10.3.pamphlet
+++ b/books/bookvol10.3.pamphlet
@@ -73654,6 +73654,27 @@ Product (A:SetCategory,B:SetCategory) : C == T
 \pagepic{ps/v103quadraticform.ps}{QFORM}{1.00}
 {\bf See}\\
 \pageto{CliffordAlgebra}{CLIF}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{QFORM}{0} &
+\cross{QFORM}{coerce} &
+\cross{QFORM}{hash} &
+\cross{QFORM}{latex} &
+\cross{QFORM}{matrix} \\
+\cross{QFORM}{quadraticForm} &
+\cross{QFORM}{sample} &
+\cross{QFORM}{subtractIfCan} &
+\cross{QFORM}{zero?} &
+\cross{QFORM}{?\~{}=?} \\
+\cross{QFORM}{?*?} &
+\cross{QFORM}{?.?} &
+\cross{QFORM}{?+?} &
+\cross{QFORM}{?-?} &
+\cross{QFORM}{-?} \\
+\cross{QFORM}{?=?} &&&&
+\end{tabular}
+
 <<domain QFORM QuadraticForm>>=
 )abbrev domain QFORM QuadraticForm
 ++ Author: Stephen M. Watt
@@ -73706,6 +73727,25 @@ QuadraticForm(n, K): T == Impl where
 \section{domain QALGSET QuasiAlgebraicSet}
 \pagehead{QuasiAlgebraicSet}{QALGSET}
 \pagepic{ps/v103quasialgebraicset.ps}{QALGSET}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{QALGSET}{coerce} &
+\cross{QALGSET}{definingEquations} &
+\cross{QALGSET}{definingInequation} &
+\cross{QALGSET}{empty} \\
+\cross{QALGSET}{empty?} &
+\cross{QALGSET}{hash} &
+\cross{QALGSET}{idealSimplify} &
+\cross{QALGSET}{latex} \\
+\cross{QALGSET}{quasiAlgebraicSet} &
+\cross{QALGSET}{setStatus} &
+\cross{QALGSET}{simplify} &
+\cross{QALGSET}{status} \\
+\cross{QALGSET}{?=?} &
+\cross{QALGSET}{?\~{}=?} &&
+\end{tabular}
+
 <<domain QALGSET QuasiAlgebraicSet>>=
 )abbrev domain QALGSET QuasiAlgebraicSet
 ++ Author:  William Sit
@@ -74140,6 +74180,58 @@ o )show Quaternion
 @
 \pagehead{Quaternion}{QUAT}
 \pagepic{ps/v103quaternion.ps}{QUAT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{QUAT}{0} &
+\cross{QUAT}{1} &
+\cross{QUAT}{abs} &
+\cross{QUAT}{characteristic} &
+\cross{QUAT}{charthRoot} \\
+\cross{QUAT}{coerce} &
+\cross{QUAT}{conjugate} &
+\cross{QUAT}{convert} &
+\cross{QUAT}{D} &
+\cross{QUAT}{differentiate} \\
+\cross{QUAT}{eval} &
+\cross{QUAT}{hash} &
+\cross{QUAT}{imagI} &
+\cross{QUAT}{imagJ} &
+\cross{QUAT}{imagK} \\
+\cross{QUAT}{inv} &
+\cross{QUAT}{latex} &
+\cross{QUAT}{map} &
+\cross{QUAT}{max} &
+\cross{QUAT}{min} \\
+\cross{QUAT}{norm} &
+\cross{QUAT}{one?} &
+\cross{QUAT}{quatern} &
+\cross{QUAT}{rational} &
+\cross{QUAT}{rational?} \\
+\cross{QUAT}{rationalIfCan} &
+\cross{QUAT}{real} &
+\cross{QUAT}{recip} &
+\cross{QUAT}{reducedSystem} &
+\cross{QUAT}{retract} \\
+\cross{QUAT}{retractIfCan} &
+\cross{QUAT}{sample} &
+\cross{QUAT}{subtractIfCan} &
+\cross{QUAT}{zero?} &
+\cross{QUAT}{?*?} \\
+\cross{QUAT}{?**?} &
+\cross{QUAT}{?+?} &
+\cross{QUAT}{?-?} &
+\cross{QUAT}{-?} &
+\cross{QUAT}{?=?} \\
+\cross{QUAT}{?\^{}?} &
+\cross{QUAT}{?\~{}=?} &
+\cross{QUAT}{?$<$?} &
+\cross{QUAT}{?$<=$?} &
+\cross{QUAT}{?$>$?} \\
+\cross{QUAT}{?$>=$?} &
+\cross{QUAT}{?.?} &&&
+\end{tabular}
+
 <<domain QUAT Quaternion>>=
 )abbrev domain QUAT Quaternion
 ++ Author: Robert S. Sutor
@@ -74194,6 +74286,15 @@ Quaternion(R:CommutativeRing): QuaternionCategory(R) == add
 \pageto{DataList}{DLIST}
 \pageto{IndexCard}{ICARD}
 \pageto{Database}{DBASE}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{QEQUAT}{coerce} &
+\cross{QEQUAT}{equation} &
+\cross{QEQUAT}{value} &
+\cross{QEQUAT}{variable} 
+\end{tabular}
+
 <<domain QEQUAT QueryEquation>>=
 )abbrev domain QEQUAT QueryEquation
 ++ This domain implements simple database queries 
@@ -74228,6 +74329,45 @@ QueryEquation(): Exports == Implementation where
 \pageto{ArrayStack}{ASTACK}
 \pageto{Dequeue}{DEQUEUE}
 \pageto{Heap}{HEAP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{QUEUE}{any?} &
+\cross{QUEUE}{back} &
+\cross{QUEUE}{bag} &
+\cross{QUEUE}{coerce} &
+\cross{QUEUE}{copy} \\
+\cross{QUEUE}{count} &
+\cross{QUEUE}{dequeue!} &
+\cross{QUEUE}{empty} &
+\cross{QUEUE}{empty?} &
+\cross{QUEUE}{enqueue!} \\
+\cross{QUEUE}{eq?} &
+\cross{QUEUE}{eval} &
+\cross{QUEUE}{every?} &
+\cross{QUEUE}{extract!} &
+\cross{QUEUE}{front} \\
+\cross{QUEUE}{hash} &
+\cross{QUEUE}{insert!} &
+\cross{QUEUE}{inspect} &
+\cross{QUEUE}{latex} &
+\cross{QUEUE}{length} \\
+\cross{QUEUE}{less?} &
+\cross{QUEUE}{map} &
+\cross{QUEUE}{map!} &
+\cross{QUEUE}{member?} &
+\cross{QUEUE}{members} \\
+\cross{QUEUE}{more?} &
+\cross{QUEUE}{parts} &
+\cross{QUEUE}{queue} &
+\cross{QUEUE}{rotate!} &
+\cross{QUEUE}{sample} \\
+\cross{QUEUE}{size?} &
+\cross{QUEUE}{\#{}?} &
+\cross{QUEUE}{?=?} &
+\cross{QUEUE}{?\~{}=?} &
+\end{tabular}
+
 <<domain QUEUE Queue>>=
 )abbrev domain QUEUE Queue
 ++ Author: Michael Monagan and Stephen Watt
@@ -74290,6 +74430,125 @@ Queue(S:SetCategory): QueueAggregate S with
 \pagepic{ps/v103radicalfunctionfield.ps}{RADFF}{1.00}
 {\bf See}\\
 \pageto{AlgebraicFunctionField}{ALGFF}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{RADFF}{0} &
+\cross{RADFF}{1} &
+\cross{RADFF}{absolutelyIrreducible?} \\
+\cross{RADFF}{algSplitSimple} &
+\cross{RADFF}{associates?} &
+\cross{RADFF}{basis} \\
+\cross{RADFF}{branchPoint?} &
+\cross{RADFF}{branchPointAtInfinity?} &
+\cross{RADFF}{characteristic} \\
+\cross{RADFF}{characteristicPolynomial} &
+\cross{RADFF}{charthRoot} &
+\cross{RADFF}{coerce} \\
+\cross{RADFF}{complementaryBasis} &
+\cross{RADFF}{conditionP} &
+\cross{RADFF}{convert} \\
+\cross{RADFF}{coordinates} &
+\cross{RADFF}{createPrimitiveElement} &
+\cross{RADFF}{D} \\
+\cross{RADFF}{derivationCoordinates} &
+\cross{RADFF}{definingPolynomial} &
+\cross{RADFF}{differentiate} \\
+\cross{RADFF}{discreteLog} &
+\cross{RADFF}{discriminant} &
+\cross{RADFF}{divide} \\
+\cross{RADFF}{elliptic} &
+\cross{RADFF}{elt} &
+\cross{RADFF}{euclideanSize} \\
+\cross{RADFF}{expressIdealMember} &
+\cross{RADFF}{exquo} &
+\cross{RADFF}{extendedEuclidean} \\
+\cross{RADFF}{factor} &
+\cross{RADFF}{factorsOfCyclicGroupSize} &
+\cross{RADFF}{gcd} \\
+\cross{RADFF}{gcdPolynomial} &
+\cross{RADFF}{generator} &
+\cross{RADFF}{genus} \\
+\cross{RADFF}{hash} &
+\cross{RADFF}{hyperelliptic} &
+\cross{RADFF}{index} \\
+\cross{RADFF}{init} &
+\cross{RADFF}{integral?} &
+\cross{RADFF}{integralAtInfinity?} \\
+\cross{RADFF}{integralBasis} &
+\cross{RADFF}{integralBasisAtInfinity} &
+\cross{RADFF}{integralCoordinates} \\
+\cross{RADFF}{integralDerivationMatrix} &
+\cross{RADFF}{integralMatrix} &
+\cross{RADFF}{integralMatrixAtInfinity} \\
+\cross{RADFF}{integralRepresents} &
+\cross{RADFF}{inv} &
+\cross{RADFF}{inverseIntegralMatrix} \\
+\cross{RADFF}{inverseIntegralMatrixAtInfinity} &
+\cross{RADFF}{latex} &
+\cross{RADFF}{lcm} \\
+\cross{RADFF}{lift} &
+\cross{RADFF}{lookup} &
+\cross{RADFF}{minimalPolynomial} \\
+\cross{RADFF}{multiEuclidean} &
+\cross{RADFF}{nextItem} &
+\cross{RADFF}{nonSingularModel} \\
+\cross{RADFF}{norm} &
+\cross{RADFF}{normalizeAtInfinity} &
+\cross{RADFF}{numberOfComponents} \\
+\cross{RADFF}{one?} &
+\cross{RADFF}{order} &
+\cross{RADFF}{prime?} \\
+\cross{RADFF}{primeFrobenius} &
+\cross{RADFF}{primitive?} &
+\cross{RADFF}{primitiveElement} \\
+\cross{RADFF}{primitivePart} &
+\cross{RADFF}{principalIdeal} &
+\cross{RADFF}{ramified?} \\
+\cross{RADFF}{ramifiedAtInfinity?} &
+\cross{RADFF}{random} &
+\cross{RADFF}{rank} \\
+\cross{RADFF}{rationalPoint?} &
+\cross{RADFF}{rationalPoints} &
+\cross{RADFF}{recip} \\
+\cross{RADFF}{reduce} &
+\cross{RADFF}{reduce} &
+\cross{RADFF}{reduceBasisAtInfinity} \\
+\cross{RADFF}{reducedSystem} &
+\cross{RADFF}{regularRepresentation} &
+\cross{RADFF}{representationType} \\
+\cross{RADFF}{represents} &
+\cross{RADFF}{retract} &
+\cross{RADFF}{retractIfCan} \\
+\cross{RADFF}{sample} &
+\cross{RADFF}{singular?} &
+\cross{RADFF}{singularAtInfinity?} \\
+\cross{RADFF}{size} &
+\cross{RADFF}{sizeLess?} &
+\cross{RADFF}{squareFree} \\
+\cross{RADFF}{squareFreePart} &
+\cross{RADFF}{subtractIfCan} &
+\cross{RADFF}{tableForDiscreteLogarithm} \\
+\cross{RADFF}{trace} &
+\cross{RADFF}{traceMatrix} &
+\cross{RADFF}{unit?} \\
+\cross{RADFF}{unitCanonical} &
+\cross{RADFF}{unitNormal} &
+\cross{RADFF}{yCoordinates} \\
+\cross{RADFF}{zero?} &
+\cross{RADFF}{?*?} &
+\cross{RADFF}{?**?} \\
+\cross{RADFF}{?+?} &
+\cross{RADFF}{?-?} &
+\cross{RADFF}{-?} \\
+\cross{RADFF}{?=?} &
+\cross{RADFF}{?\^{}?} &
+\cross{RADFF}{?\~{}=?} \\
+\cross{RADFF}{?/?} &
+\cross{RADFF}{?quo?} &
+\cross{RADFF}{?rem?} 
+\end{tabular}
+
 <<domain RADFF RadicalFunctionField>>=
 )abbrev domain RADFF RadicalFunctionField
 ++ Function field defined by y**n = f(x)
@@ -74783,6 +75042,96 @@ o )show RadixExpansion
 \pageto{BinaryExpansion}{BINARY}
 \pageto{DecimalExpansion}{DECIMAL}
 \pageto{HexadecimalExpansion}{HEXADEC}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{RADIX}{0} &
+\cross{RADIX}{1} &
+\cross{RADIX}{abs} \\
+\cross{RADIX}{associates?} &
+\cross{RADIX}{ceiling} &
+\cross{RADIX}{characteristic} \\
+\cross{RADIX}{charthRoot} &
+\cross{RADIX}{coerce} &
+\cross{RADIX}{conditionP} \\
+\cross{RADIX}{convert} &
+\cross{RADIX}{cycleRagits} &
+\cross{RADIX}{D} \\
+\cross{RADIX}{denom} &
+\cross{RADIX}{denominator} &
+\cross{RADIX}{differentiate} \\
+\cross{RADIX}{divide} &
+\cross{RADIX}{euclideanSize} &
+\cross{RADIX}{eval} \\
+\cross{RADIX}{expressIdealMember} &
+\cross{RADIX}{exquo} &
+\cross{RADIX}{extendedEuclidean} \\
+\cross{RADIX}{factor} &
+\cross{RADIX}{factorPolynomial} &
+\cross{RADIX}{factorSquareFreePolynomial} \\
+\cross{RADIX}{floor} &
+\cross{RADIX}{fractRadix} &
+\cross{RADIX}{fractRagits} \\
+\cross{RADIX}{fractionPart} &
+\cross{RADIX}{gcd} &
+\cross{RADIX}{gcdPolynomial} \\
+\cross{RADIX}{hash} &
+\cross{RADIX}{init} &
+\cross{RADIX}{inv} \\
+\cross{RADIX}{latex} &
+\cross{RADIX}{lcm} &
+\cross{RADIX}{map} \\
+\cross{RADIX}{max} &
+\cross{RADIX}{min} &
+\cross{RADIX}{multiEuclidean} \\
+\cross{RADIX}{negative?} &
+\cross{RADIX}{nextItem} &
+\cross{RADIX}{numer} \\
+\cross{RADIX}{numerator} &
+\cross{RADIX}{one?} &
+\cross{RADIX}{patternMatch} \\
+\cross{RADIX}{positive?} &
+\cross{RADIX}{prefixRagits} &
+\cross{RADIX}{prime?} \\
+\cross{RADIX}{principalIdeal} &
+\cross{RADIX}{random} &
+\cross{RADIX}{recip} \\
+\cross{RADIX}{reducedSystem} &
+\cross{RADIX}{retract} &
+\cross{RADIX}{retractIfCan} \\
+\cross{RADIX}{sample} &
+\cross{RADIX}{sign} &
+\cross{RADIX}{sizeLess?} \\
+\cross{RADIX}{solveLinearPolynomialEquation} &
+\cross{RADIX}{squareFree} &
+\cross{RADIX}{squareFreePart} \\
+\cross{RADIX}{squareFreePolynomial} &
+\cross{RADIX}{subtractIfCan} &
+\cross{RADIX}{unit?} \\
+\cross{RADIX}{unitCanonical} &
+\cross{RADIX}{unitNormal} &
+\cross{RADIX}{wholePart} \\
+\cross{RADIX}{wholeRadix} &
+\cross{RADIX}{wholeRagits} &
+\cross{RADIX}{zero?} \\
+\cross{RADIX}{?.?} &
+\cross{RADIX}{?*?} &
+\cross{RADIX}{?**?} \\
+\cross{RADIX}{?+?} &
+\cross{RADIX}{?-?} &
+\cross{RADIX}{-?} \\
+\cross{RADIX}{?/?} &
+\cross{RADIX}{?=?} &
+\cross{RADIX}{?\^{}?} \\
+\cross{RADIX}{?\~{}=?} &
+\cross{RADIX}{?$<$?} &
+\cross{RADIX}{?$<=$?} \\
+\cross{RADIX}{?$>$?} &
+\cross{RADIX}{?$>=$?} &
+\cross{RADIX}{?quo?} \\
+\cross{RADIX}{?rem?} &&
+\end{tabular}
+
 <<domain RADIX RadixExpansion>>=
 )abbrev domain RADIX RadixExpansion
 ++ Author: Stephen M. Watt
@@ -76266,6 +76615,78 @@ o )show RealClosure
 \pagepic{ps/v103realclosure.ps}{RECLOS}{1.00}
 {\bf See}\\
 \pageto{RightOpenIntervalRootCharacterization}{ROIRC}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{RECLOS}{0} &
+\cross{RECLOS}{1} &
+\cross{RECLOS}{abs} &
+\cross{RECLOS}{algebraicOf} \\
+\cross{RECLOS}{allRootsOf} &
+\cross{RECLOS}{approximate} &
+\cross{RECLOS}{associates?} &
+\cross{RECLOS}{characteristic} \\
+\cross{RECLOS}{coerce} &
+\cross{RECLOS}{divide} &
+\cross{RECLOS}{euclideanSize} &
+\cross{RECLOS}{expressIdealMember} \\
+\cross{RECLOS}{exquo} &
+\cross{RECLOS}{extendedEuclidean} &
+\cross{RECLOS}{factor} &
+\cross{RECLOS}{gcd} \\
+\cross{RECLOS}{gcdPolynomial} &
+\cross{RECLOS}{hash} &
+\cross{RECLOS}{inv} &
+\cross{RECLOS}{latex} \\
+\cross{RECLOS}{lcm} &
+\cross{RECLOS}{mainCharacterization} &
+\cross{RECLOS}{mainDefiningPolynomial} &
+\cross{RECLOS}{mainForm} \\
+\cross{RECLOS}{mainValue} &
+\cross{RECLOS}{max} &
+\cross{RECLOS}{multiEuclidean} &
+\cross{RECLOS}{min} \\
+\cross{RECLOS}{negative?} &
+\cross{RECLOS}{nthRoot} &
+\cross{RECLOS}{one?} &
+\cross{RECLOS}{positive?} \\
+\cross{RECLOS}{prime?} &
+\cross{RECLOS}{principalIdeal} &
+\cross{RECLOS}{recip} &
+\cross{RECLOS}{relativeApprox} \\
+\cross{RECLOS}{rename} &
+\cross{RECLOS}{rename!} &
+\cross{RECLOS}{retract} &
+\cross{RECLOS}{retractIfCan} \\
+\cross{RECLOS}{rootOf} &
+\cross{RECLOS}{sample} &
+\cross{RECLOS}{sign} &
+\cross{RECLOS}{sizeLess?} \\
+\cross{RECLOS}{sqrt} &
+\cross{RECLOS}{squareFree} &
+\cross{RECLOS}{squareFreePart} &
+\cross{RECLOS}{subtractIfCan} \\
+\cross{RECLOS}{unit?} &
+\cross{RECLOS}{unitCanonical} &
+\cross{RECLOS}{unitNormal} &
+\cross{RECLOS}{zero?} \\
+\cross{RECLOS}{?*?} &
+\cross{RECLOS}{?**?} &
+\cross{RECLOS}{?+?} &
+\cross{RECLOS}{?-?} \\
+\cross{RECLOS}{-?} &
+\cross{RECLOS}{?/?} &
+\cross{RECLOS}{?$<$?} &
+\cross{RECLOS}{?$<=$?} \\
+\cross{RECLOS}{?=?} &
+\cross{RECLOS}{?$>$?} &
+\cross{RECLOS}{?$>=$?} &
+\cross{RECLOS}{?\^{}?} \\
+\cross{RECLOS}{?\~{}=?} &
+\cross{RECLOS}{?quo?} &
+\cross{RECLOS}{?rem?} &
+\end{tabular}
+
 <<domain RECLOS RealClosure>>=
 )abbrev domain RECLOS RealClosure
 ++ Author: Renaud Rioboo
@@ -76592,6 +77013,66 @@ RealClosure(TheField): PUB == PRIV where
 \pageto{IndexedMatrix}{IMATRIX}
 \pageto{Matrix}{MATRIX}
 \pageto{SquareMatrix}{SQMATRIX}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{RMATRIX}{0} &
+\cross{RMATRIX}{antisymmetric?} &
+\cross{RMATRIX}{any?} &
+\cross{RMATRIX}{coerce} &
+\cross{RMATRIX}{column} \\
+\cross{RMATRIX}{convert} &
+\cross{RMATRIX}{copy} &
+\cross{RMATRIX}{count} &
+\cross{RMATRIX}{diagonal?} &
+\cross{RMATRIX}{dimension} \\
+\cross{RMATRIX}{elt} &
+\cross{RMATRIX}{empty} &
+\cross{RMATRIX}{empty?} &
+\cross{RMATRIX}{eq?} &
+\cross{RMATRIX}{eval} \\
+\cross{RMATRIX}{every?} &
+\cross{RMATRIX}{exquo} &
+\cross{RMATRIX}{hash} &
+\cross{RMATRIX}{latex} &
+\cross{RMATRIX}{less?} \\
+\cross{RMATRIX}{listOfLists} &
+\cross{RMATRIX}{map} &
+\cross{RMATRIX}{map!} &
+\cross{RMATRIX}{matrix} &
+\cross{RMATRIX}{maxColIndex} \\
+\cross{RMATRIX}{maxRowIndex} &
+\cross{RMATRIX}{member?} &
+\cross{RMATRIX}{members} &
+\cross{RMATRIX}{minColIndex} &
+\cross{RMATRIX}{minRowIndex} \\
+\cross{RMATRIX}{more?} &
+\cross{RMATRIX}{ncols} &
+\cross{RMATRIX}{nrows} &
+\cross{RMATRIX}{nullSpace} &
+\cross{RMATRIX}{nullity} \\
+\cross{RMATRIX}{parts} &
+\cross{RMATRIX}{qelt} &
+\cross{RMATRIX}{rank} &
+\cross{RMATRIX}{rectangularMatrix} &
+\cross{RMATRIX}{row} \\
+\cross{RMATRIX}{rowEchelon} &
+\cross{RMATRIX}{sample} &
+\cross{RMATRIX}{size?} &
+\cross{RMATRIX}{square?} &
+\cross{RMATRIX}{subtractIfCan} \\
+\cross{RMATRIX}{symmetric?} &
+\cross{RMATRIX}{zero?} &
+\cross{RMATRIX}{\#{}?} &
+\cross{RMATRIX}{?\~{}=?} &
+\cross{RMATRIX}{?*?} \\
+\cross{RMATRIX}{?/?} &
+\cross{RMATRIX}{?+?} &
+\cross{RMATRIX}{?-?} &
+\cross{RMATRIX}{-?} &
+\cross{RMATRIX}{?=?} 
+\end{tabular}
+
 <<domain RMATRIX RectangularMatrix>>=
 )abbrev domain RMATRIX RectangularMatrix
 ++ Author: Grabmeier, Gschnitzer, Williamson
@@ -76695,6 +77176,21 @@ RectangularMatrix(m,n,R): Exports == Implementation where
 \pageto{Boolean}{BOOLEAN}
 \pageto{IndexedBits}{IBITS}
 \pageto{Bits}{BITS}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{REF}{coerce} &
+\cross{REF}{deref} &
+\cross{REF}{elt} &
+\cross{REF}{hash} &
+\cross{REF}{latex} \\
+\cross{REF}{ref} &
+\cross{REF}{setelt} &
+\cross{REF}{setref} &
+\cross{REF}{?=?} &
+\cross{REF}{?\~{}=?} 
+\end{tabular}
+
 <<domain REF Reference>>=
 )abbrev domain REF Reference
 ++ Author: Stephen M. Watt
@@ -76751,6 +77247,102 @@ Reference(S:Type): Type with
 \section{domain RGCHAIN RegularChain}
 \pagehead{RegularChain}{RGCHAIN}
 \pagepic{ps/v103regularchain.ps}{RGCHAIN}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{RGCHAIN}{algebraic?} &
+\cross{RGCHAIN}{algebraicCoefficients?} \\
+\cross{RGCHAIN}{algebraicVariables} &
+\cross{RGCHAIN}{any?} \\
+\cross{RGCHAIN}{augment} &
+\cross{RGCHAIN}{autoReduced?} \\
+\cross{RGCHAIN}{basicSet} &
+\cross{RGCHAIN}{coHeight} \\
+\cross{RGCHAIN}{coerce} &
+\cross{RGCHAIN}{collect} \\
+\cross{RGCHAIN}{collectQuasiMonic} &
+\cross{RGCHAIN}{collectUnder} \\
+\cross{RGCHAIN}{collectUpper} &
+\cross{RGCHAIN}{construct} \\
+\cross{RGCHAIN}{convert} &
+\cross{RGCHAIN}{copy} \\
+\cross{RGCHAIN}{count} &
+\cross{RGCHAIN}{degree} \\
+\cross{RGCHAIN}{empty} &
+\cross{RGCHAIN}{empty?} \\
+\cross{RGCHAIN}{eq?} &
+\cross{RGCHAIN}{eval} \\
+\cross{RGCHAIN}{every?} &
+\cross{RGCHAIN}{extend} \\
+\cross{RGCHAIN}{extendIfCan} &
+\cross{RGCHAIN}{find} \\
+\cross{RGCHAIN}{first} &
+\cross{RGCHAIN}{hash} \\
+\cross{RGCHAIN}{headReduce} &
+\cross{RGCHAIN}{headReduced?} \\
+\cross{RGCHAIN}{headRemainder} &
+\cross{RGCHAIN}{infRittWu?} \\
+\cross{RGCHAIN}{initiallyReduce} &
+\cross{RGCHAIN}{initiallyReduced?} \\
+\cross{RGCHAIN}{initials} &
+\cross{RGCHAIN}{internalAugment} \\
+\cross{RGCHAIN}{intersect} &
+\cross{RGCHAIN}{invertible?} \\
+\cross{RGCHAIN}{invertibleElseSplit?} &
+\cross{RGCHAIN}{invertibleSet} \\
+\cross{RGCHAIN}{last} &
+\cross{RGCHAIN}{lastSubResultant} \\
+\cross{RGCHAIN}{lastSubResultantElseSplit} &
+\cross{RGCHAIN}{latex} \\
+\cross{RGCHAIN}{less?} &
+\cross{RGCHAIN}{mainVariable?} \\
+\cross{RGCHAIN}{mainVariables} &
+\cross{RGCHAIN}{map} \\
+\cross{RGCHAIN}{map!} &
+\cross{RGCHAIN}{member?} \\
+\cross{RGCHAIN}{members} &
+\cross{RGCHAIN}{more?} \\
+\cross{RGCHAIN}{mvar} &
+\cross{RGCHAIN}{normalized?} \\
+\cross{RGCHAIN}{parts} &
+\cross{RGCHAIN}{purelyAlgebraic?} \\
+\cross{RGCHAIN}{purelyAlgebraicLeadingMonomial?} &
+\cross{RGCHAIN}{purelyTranscendental?} \\
+\cross{RGCHAIN}{quasiComponent} &
+\cross{RGCHAIN}{reduce} \\
+\cross{RGCHAIN}{reduceByQuasiMonic} &
+\cross{RGCHAIN}{reduced?} \\
+\cross{RGCHAIN}{remainder} &
+\cross{RGCHAIN}{remove} \\
+\cross{RGCHAIN}{removeDuplicates} &
+\cross{RGCHAIN}{removeZero} \\
+\cross{RGCHAIN}{rest} &
+\cross{RGCHAIN}{retract} \\
+\cross{RGCHAIN}{retractIfCan} &
+\cross{RGCHAIN}{rewriteIdealWithHeadRemainder} \\
+\cross{RGCHAIN}{rewriteIdealWithRemainder} &
+\cross{RGCHAIN}{rewriteSetWithReduction} \\
+\cross{RGCHAIN}{roughBase?} &
+\cross{RGCHAIN}{roughEqualIdeals?} \\
+\cross{RGCHAIN}{roughSubIdeal?} &
+\cross{RGCHAIN}{roughUnitIdeal?} \\
+\cross{RGCHAIN}{sample} &
+\cross{RGCHAIN}{select} \\
+\cross{RGCHAIN}{size?} &
+\cross{RGCHAIN}{sort} \\
+\cross{RGCHAIN}{squareFreePart} &
+\cross{RGCHAIN}{stronglyReduce} \\
+\cross{RGCHAIN}{stronglyReduced?} &
+\cross{RGCHAIN}{triangular?} \\
+\cross{RGCHAIN}{trivialIdeal?} &
+\cross{RGCHAIN}{variables} \\
+\cross{RGCHAIN}{zeroSetSplit} &
+\cross{RGCHAIN}{zeroSetSplitIntoTriangularSystems} \\
+\cross{RGCHAIN}{\#{}?} &
+\cross{RGCHAIN}{?\~{}=?} \\
+\cross{RGCHAIN}{?=?} &
+\end{tabular}
+
 <<domain RGCHAIN RegularChain>>=
 )abbrev domain RGCHAIN RegularChain
 ++ Author: Marc Moreno Maza
@@ -78170,6 +78762,104 @@ o )show RegularTriangularSet
 @
 \pagehead{RegularTriangularSet}{REGSET}
 \pagepic{ps/v103regulartriangularset.ps}{REGSET}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{REGSET}{algebraic?} &
+\cross{REGSET}{algebraicCoefficients?} \\
+\cross{REGSET}{algebraicVariables} &
+\cross{REGSET}{any?} \\
+\cross{REGSET}{augment} &
+\cross{REGSET}{autoReduced?} \\
+\cross{REGSET}{basicSet} &
+\cross{REGSET}{coerce} \\
+\cross{REGSET}{coHeight} &
+\cross{REGSET}{collect} \\
+\cross{REGSET}{collectQuasiMonic} &
+\cross{REGSET}{collectUnder} \\
+\cross{REGSET}{collectUpper} &
+\cross{REGSET}{construct} \\
+\cross{REGSET}{convert} &
+\cross{REGSET}{copy} \\
+\cross{REGSET}{count} &
+\cross{REGSET}{degree} \\
+\cross{REGSET}{empty} &
+\cross{REGSET}{empty?} \\
+\cross{REGSET}{eq?} &
+\cross{REGSET}{eval} \\
+\cross{REGSET}{every?} &
+\cross{REGSET}{extend} \\
+\cross{REGSET}{extendIfCan} &
+\cross{REGSET}{find} \\
+\cross{REGSET}{first} &
+\cross{REGSET}{hash} \\
+\cross{REGSET}{headRemainder} &
+\cross{REGSET}{headReduce} \\
+\cross{REGSET}{headReduced?} &
+\cross{REGSET}{infRittWu?} \\
+\cross{REGSET}{initiallyReduce} &
+\cross{REGSET}{initiallyReduced?} \\
+\cross{REGSET}{initials} &
+\cross{REGSET}{internalAugment} \\
+\cross{REGSET}{internalZeroSetSplit} &
+\cross{REGSET}{intersect} \\
+\cross{REGSET}{invertible?} &
+\cross{REGSET}{invertibleElseSplit?} \\
+\cross{REGSET}{invertibleSet} &
+\cross{REGSET}{last} \\
+\cross{REGSET}{lastSubResultant} &
+\cross{REGSET}{lastSubResultantElseSplit} \\
+\cross{REGSET}{latex} &
+\cross{REGSET}{less?} \\
+\cross{REGSET}{mainVariable?} &
+\cross{REGSET}{mainVariables} \\
+\cross{REGSET}{map} &
+\cross{REGSET}{map!} \\
+\cross{REGSET}{member?} &
+\cross{REGSET}{members} \\
+\cross{REGSET}{more?} &
+\cross{REGSET}{mvar} \\
+\cross{REGSET}{normalized?} &
+\cross{REGSET}{parts} \\
+\cross{REGSET}{preprocess} &
+\cross{REGSET}{purelyAlgebraic?} \\
+\cross{REGSET}{purelyAlgebraicLeadingMonomial?} &
+\cross{REGSET}{purelyTranscendental?} \\
+\cross{REGSET}{quasiComponent} &
+\cross{REGSET}{reduce} \\
+\cross{REGSET}{reduced?} &
+\cross{REGSET}{reduceByQuasiMonic} \\
+\cross{REGSET}{remainder} &
+\cross{REGSET}{remove} \\
+\cross{REGSET}{removeDuplicates} &
+\cross{REGSET}{removeZero} \\
+\cross{REGSET}{rest} &
+\cross{REGSET}{retract} \\
+\cross{REGSET}{retractIfCan} &
+\cross{REGSET}{rewriteIdealWithHeadRemainder} \\
+\cross{REGSET}{rewriteIdealWithRemainder} &
+\cross{REGSET}{rewriteSetWithReduction} \\
+\cross{REGSET}{roughBase?} &
+\cross{REGSET}{roughEqualIdeals?} \\
+\cross{REGSET}{roughSubIdeal?} &
+\cross{REGSET}{roughUnitIdeal?} \\
+\cross{REGSET}{sample} &
+\cross{REGSET}{select} \\
+\cross{REGSET}{size?} &
+\cross{REGSET}{sort} \\
+\cross{REGSET}{squareFreePart} &
+\cross{REGSET}{stronglyReduce} \\
+\cross{REGSET}{stronglyReduced?} &
+\cross{REGSET}{triangular?} \\
+\cross{REGSET}{trivialIdeal?} &
+\cross{REGSET}{variables} \\
+\cross{REGSET}{zeroSetSplit} &
+\cross{REGSET}{zeroSetSplitIntoTriangularSystems} \\
+\cross{REGSET}{\#{}?} &
+\cross{REGSET}{?\~{}=?} \\
+\cross{REGSET}{?=?} &
+\end{tabular}
+
 <<domain REGSET RegularTriangularSet>>=
 )abbrev domain REGSET RegularTriangularSet
 ++ Author: Marc Moreno Maza
@@ -78568,6 +79258,32 @@ RegularTriangularSet(R,E,V,P) : Exports == Implementation where
 \section{domain RESRING ResidueRing}
 \pagehead{ResidueRing}{RESRING}
 \pagepic{ps/v103residuering.ps}{RESRING}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{RESRING}{0} &
+\cross{RESRING}{1} &
+\cross{RESRING}{characteristic} &
+\cross{RESRING}{coerce} &
+\cross{RESRING}{hash} \\
+\cross{RESRING}{latex} &
+\cross{RESRING}{lift} &
+\cross{RESRING}{one?} &
+\cross{RESRING}{recip} &
+\cross{RESRING}{reduce} \\
+\cross{RESRING}{sample} &
+\cross{RESRING}{subtractIfCan} &
+\cross{RESRING}{zero?} &
+\cross{RESRING}{?\~{}=?} &
+\cross{RESRING}{?*?} \\
+\cross{RESRING}{?**?} &
+\cross{RESRING}{?\^{}?} &
+\cross{RESRING}{?+?} &
+\cross{RESRING}{?-?} &
+\cross{RESRING}{-?} \\
+\cross{RESRING}{?=?} &&&&
+\end{tabular}
+
 <<domain RESRING ResidueRing>>=
 )abbrev domain RESRING ResidueRing
 ++ Author: P.Gianni
@@ -78640,6 +79356,68 @@ ResidueRing(F,Expon,VarSet,FPol,LFPol) : Dom  == Body
 \pageto{Switch}{SWITCH}
 \pageto{FortranTemplate}{FTEM}
 \pageto{FortranExpression}{FEXPR}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{RESULT}{any?} &
+\cross{RESULT}{bag} &
+\cross{RESULT}{coerce} &
+\cross{RESULT}{construct} &
+\cross{RESULT}{convert} \\
+\cross{RESULT}{copy} &
+\cross{RESULT}{count} &
+\cross{RESULT}{dictionary} &
+\cross{RESULT}{entry?} &
+\cross{RESULT}{elt} \\
+\cross{RESULT}{empty} &
+\cross{RESULT}{empty?} &
+\cross{RESULT}{entries} &
+\cross{RESULT}{eq?} &
+\cross{RESULT}{eval} \\
+\cross{RESULT}{every?} &
+\cross{RESULT}{extract!} &
+\cross{RESULT}{fill!} &
+\cross{RESULT}{find} &
+\cross{RESULT}{first} \\
+\cross{RESULT}{hash} &
+\cross{RESULT}{index?} &
+\cross{RESULT}{indices} &
+\cross{RESULT}{insert!} &
+\cross{RESULT}{inspect} \\
+\cross{RESULT}{key?} &
+\cross{RESULT}{keys} &
+\cross{RESULT}{latex} &
+\cross{RESULT}{less?} &
+\cross{RESULT}{map} \\
+\cross{RESULT}{map!} &
+\cross{RESULT}{maxIndex} &
+\cross{RESULT}{member?} &
+\cross{RESULT}{members} &
+\cross{RESULT}{minIndex} \\
+\cross{RESULT}{more?} &
+\cross{RESULT}{parts} &
+\cross{RESULT}{qelt} &
+\cross{RESULT}{qsetelt!} &
+\cross{RESULT}{reduce} \\
+\cross{RESULT}{remove} &
+\cross{RESULT}{remove!} &
+\cross{RESULT}{removeDuplicates} &
+\cross{RESULT}{sample} &
+\cross{RESULT}{search} \\
+\cross{RESULT}{select} &
+\cross{RESULT}{select!} &
+\cross{RESULT}{setelt} &
+\cross{RESULT}{showArrayValues} &
+\cross{RESULT}{showScalarValues} \\
+\cross{RESULT}{size?} &
+\cross{RESULT}{swap!} &
+\cross{RESULT}{table} &
+\cross{RESULT}{\#{}?} &
+\cross{RESULT}{?=?} \\
+\cross{RESULT}{?\~{}=?} &
+\cross{RESULT}{?.?} &&&
+\end{tabular}
+
 <<domain RESULT Result>>=
 )abbrev domain RESULT Result
 ++ Author: Didier Pinchon and Mike Dewar
@@ -78720,6 +79498,26 @@ Result():Exports==Implementation where
 \pagepic{ps/v103rewriterule.ps}{RULE}{1.00}
 {\bf See}\\
 \pageto{Ruleset}{RULESET}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{RULE}{coerce} &
+\cross{RULE}{elt} &
+\cross{RULE}{hash} &
+\cross{RULE}{latex} &
+\cross{RULE}{lhs} \\
+\cross{RULE}{pattern} &
+\cross{RULE}{quotedOperators} &
+\cross{RULE}{retract} &
+\cross{RULE}{retractIfCan} &
+\cross{RULE}{rhs} \\
+\cross{RULE}{rule} &
+\cross{RULE}{suchThat} &
+\cross{RULE}{?.?} &
+\cross{RULE}{?\~{}=?} &
+\cross{RULE}{?=?} 
+\end{tabular}
+
 <<domain RULE RewriteRule>>=
 )abbrev domain RULE RewriteRule
 ++ Rules for the pattern matcher
@@ -78897,6 +79695,32 @@ depending on several "real roots".
 \pagepic{ps/v103rightopenintervalrootcharacterization.ps}{ROIRC}{1.00}
 {\bf See}\\
 \pageto{RealClosure}{RECLOS}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ROIRC}{allRootsOf} &
+\cross{ROIRC}{approximate} &
+\cross{ROIRC}{coerce} &
+\cross{ROIRC}{definingPolynomial} &
+\cross{ROIRC}{hash} \\
+\cross{ROIRC}{latex} &
+\cross{ROIRC}{left} &
+\cross{ROIRC}{middle} &
+\cross{ROIRC}{mightHaveRoots} &
+\cross{ROIRC}{negative?} \\
+\cross{ROIRC}{positive?} &
+\cross{ROIRC}{recip} &
+\cross{ROIRC}{refine} &
+\cross{ROIRC}{relativeApprox} &
+\cross{ROIRC}{right} \\
+\cross{ROIRC}{rootOf} &
+\cross{ROIRC}{sign} &
+\cross{ROIRC}{size} &
+\cross{ROIRC}{zero?} &
+\cross{ROIRC}{?=?} \\
+\cross{ROIRC}{?\~{}=?} &&&&
+\end{tabular}
+
 <<domain ROIRC RightOpenIntervalRootCharacterization>>=
 )abbrev domain ROIRC RightOpenIntervalRootCharacterization 
 ++ Author: Renaud Rioboo
@@ -79654,6 +80478,96 @@ o )show RomanNumeral
 \pageto{Integer}{INT}
 \pageto{NonNegativeInteger}{NNI}
 \pageto{PositiveInteger}{PI}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ROMAN}{0} &
+\cross{ROMAN}{1} &
+\cross{ROMAN}{abs} &
+\cross{ROMAN}{addmod} \\
+\cross{ROMAN}{associates?} &
+\cross{ROMAN}{base} &
+\cross{ROMAN}{binomial} &
+\cross{ROMAN}{bit?} \\
+\cross{ROMAN}{characteristic} &
+\cross{ROMAN}{coerce} &
+\cross{ROMAN}{convert} &
+\cross{ROMAN}{copy} \\
+\cross{ROMAN}{D} &
+\cross{ROMAN}{dec} &
+\cross{ROMAN}{differentiate} &
+\cross{ROMAN}{divide} \\
+\cross{ROMAN}{euclideanSize} &
+\cross{ROMAN}{even?} &
+\cross{ROMAN}{expressIdealMember} &
+\cross{ROMAN}{exquo} \\
+\cross{ROMAN}{extendedEuclidean} &
+\cross{ROMAN}{extendedEuclidean} &
+\cross{ROMAN}{factor} &
+\cross{ROMAN}{factorial} \\
+\cross{ROMAN}{gcd} &
+\cross{ROMAN}{gcdPolynomial} &
+\cross{ROMAN}{hash} &
+\cross{ROMAN}{inc} \\
+\cross{ROMAN}{init} &
+\cross{ROMAN}{invmod} &
+\cross{ROMAN}{latex} &
+\cross{ROMAN}{lcm} \\
+\cross{ROMAN}{length} &
+\cross{ROMAN}{mask} &
+\cross{ROMAN}{max} &
+\cross{ROMAN}{min} \\
+\cross{ROMAN}{mulmod} &
+\cross{ROMAN}{multiEuclidean} &
+\cross{ROMAN}{negative?} &
+\cross{ROMAN}{nextItem} \\
+\cross{ROMAN}{odd?} &
+\cross{ROMAN}{one?} &
+\cross{ROMAN}{patternMatch} &
+\cross{ROMAN}{permutation} \\
+\cross{ROMAN}{positive?} &
+\cross{ROMAN}{positiveRemainder} &
+\cross{ROMAN}{powmod} &
+\cross{ROMAN}{prime?} \\
+\cross{ROMAN}{principalIdeal} &
+\cross{ROMAN}{random} &
+\cross{ROMAN}{rational} &
+\cross{ROMAN}{rational?} \\
+\cross{ROMAN}{rationalIfCan} &
+\cross{ROMAN}{recip} &
+\cross{ROMAN}{reducedSystem} &
+\cross{ROMAN}{retract} \\
+\cross{ROMAN}{retractIfCan} &
+\cross{ROMAN}{roman} &
+\cross{ROMAN}{sample} &
+\cross{ROMAN}{shift} \\
+\cross{ROMAN}{sign} &
+\cross{ROMAN}{sizeLess?} &
+\cross{ROMAN}{squareFree} &
+\cross{ROMAN}{squareFreePart} \\
+\cross{ROMAN}{submod} &
+\cross{ROMAN}{subtractIfCan} &
+\cross{ROMAN}{symmetricRemainder} &
+\cross{ROMAN}{unit?} \\
+\cross{ROMAN}{unitCanonical} &
+\cross{ROMAN}{unitNormal} &
+\cross{ROMAN}{zero?} &
+\cross{ROMAN}{?*?} \\
+\cross{ROMAN}{?**?} &
+\cross{ROMAN}{?+?} &
+\cross{ROMAN}{?-?} &
+\cross{ROMAN}{-?} \\
+\cross{ROMAN}{?$<$?} &
+\cross{ROMAN}{?$<=$?} &
+\cross{ROMAN}{?=?} &
+\cross{ROMAN}{?$>$?} \\
+\cross{ROMAN}{?$>=$?} &
+\cross{ROMAN}{?\^{}?} &
+\cross{ROMAN}{?\~{}=?} &
+\cross{ROMAN}{?quo?} \\
+\cross{ROMAN}{?rem?} &&&
+\end{tabular}
+
 <<domain ROMAN RomanNumeral>>=
 )abbrev domain ROMAN RomanNumeral
 ++ Author:
@@ -79704,6 +80618,83 @@ RomanNumeral(): IntegerNumberSystem with
 \section{domain ROUTINE RoutinesTable}
 \pagehead{RoutinesTable}{ROUTINE}
 \pagepic{ps/v103routinestable.ps}{ROUTINE}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{ROUTINE}{any?} &
+\cross{ROUTINE}{bag} \\
+\cross{ROUTINE}{changeMeasure} &
+\cross{ROUTINE}{changeThreshhold} \\
+\cross{ROUTINE}{coerce} &
+\cross{ROUTINE}{concat} \\
+\cross{ROUTINE}{construct} &
+\cross{ROUTINE}{convert} \\
+\cross{ROUTINE}{copy} &
+\cross{ROUTINE}{count} \\
+\cross{ROUTINE}{deleteRoutine!} &
+\cross{ROUTINE}{dictionary} \\
+\cross{ROUTINE}{elt} &
+\cross{ROUTINE}{empty} \\
+\cross{ROUTINE}{empty?} &
+\cross{ROUTINE}{entries} \\
+\cross{ROUTINE}{entry?} &
+\cross{ROUTINE}{eq?} \\
+\cross{ROUTINE}{eval} &
+\cross{ROUTINE}{every?} \\
+\cross{ROUTINE}{extract!} &
+\cross{ROUTINE}{fill!} \\
+\cross{ROUTINE}{find} &
+\cross{ROUTINE}{first} \\
+\cross{ROUTINE}{getExplanations} &
+\cross{ROUTINE}{getMeasure} \\
+\cross{ROUTINE}{hash} &
+\cross{ROUTINE}{index?} \\
+\cross{ROUTINE}{indices} &
+\cross{ROUTINE}{insert!} \\
+\cross{ROUTINE}{inspect} &
+\cross{ROUTINE}{key?} \\
+\cross{ROUTINE}{keys} &
+\cross{ROUTINE}{latex} \\
+\cross{ROUTINE}{less?} &
+\cross{ROUTINE}{map} \\
+\cross{ROUTINE}{map!} &
+\cross{ROUTINE}{maxIndex} \\
+\cross{ROUTINE}{member?} &
+\cross{ROUTINE}{members} \\
+\cross{ROUTINE}{minIndex} &
+\cross{ROUTINE}{more?} \\
+\cross{ROUTINE}{parts} &
+\cross{ROUTINE}{qelt} \\
+\cross{ROUTINE}{qsetelt!} &
+\cross{ROUTINE}{recoverAfterFail} \\
+\cross{ROUTINE}{reduce} &
+\cross{ROUTINE}{remove} \\
+\cross{ROUTINE}{remove!} &
+\cross{ROUTINE}{removeDuplicates} \\
+\cross{ROUTINE}{routines} &
+\cross{ROUTINE}{sample} \\
+\cross{ROUTINE}{search} &
+\cross{ROUTINE}{select} \\
+\cross{ROUTINE}{select!} &
+\cross{ROUTINE}{selectFiniteRoutines} \\
+\cross{ROUTINE}{selectIntegrationRoutines} &
+\cross{ROUTINE}{selectNonFiniteRoutines} \\
+\cross{ROUTINE}{selectMultiDimensionalRoutines} &
+\cross{ROUTINE}{selectODEIVPRoutines} \\
+\cross{ROUTINE}{selectOptimizationRoutines} &
+\cross{ROUTINE}{selectPDERoutines} \\
+\cross{ROUTINE}{selectSumOfSquaresRoutines} &
+\cross{ROUTINE}{setelt} \\
+\cross{ROUTINE}{showTheRoutinesTable} &
+\cross{ROUTINE}{size?} \\
+\cross{ROUTINE}{swap!} &
+\cross{ROUTINE}{table} \\
+\cross{ROUTINE}{\#{}?} &
+\cross{ROUTINE}{?=?} \\
+\cross{ROUTINE}{?\~{}=?} &
+\cross{ROUTINE}{?.?} 
+\end{tabular}
+
 <<domain ROUTINE RoutinesTable>>=
 )abbrev domain ROUTINE RoutinesTable
 ++ Author: Brian Dupee
@@ -80093,6 +81084,17 @@ RoutinesTable(): E == I where
 \section{domain RULECOLD RuleCalled}
 \pagehead{RuleCalled}{RULECOLD}
 \pagepic{ps/v103rulecalled.ps}{RULECOLD}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{RULECOLD}{coerce} &
+\cross{RULECOLD}{hash} &
+\cross{RULECOLD}{latex} &
+\cross{RULECOLD}{name} &
+\cross{RULECOLD}{?=?} &
+\cross{RULECOLD}{?\~{}=?} 
+\end{tabular}
+
 <<domain RULECOLD RuleCalled>>=
 )abbrev domain RULECOLD RuleCalled
 ++ Description:
@@ -80119,6 +81121,20 @@ RuleCalled(f:Symbol): SetCategory with
 \pagepic{ps/v103ruleset.ps}{RULESET}{1.00}
 {\bf See}\\
 \pageto{RewriteRule}{RULE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{RULESET}{coerce} &
+\cross{RULESET}{elt} &
+\cross{RULESET}{hash} &
+\cross{RULESET}{latex} &
+\cross{RULESET}{rules} \\
+\cross{RULESET}{ruleset} &
+\cross{RULESET}{?=?} &
+\cross{RULESET}{?\~{}=?} &
+\cross{RULESET}{?.?} &
+\end{tabular}
+
 <<domain RULESET Ruleset>>=
 )abbrev domain RULESET Ruleset
 ++ Sets of rules for the pattern matcher
diff --git a/changelog b/changelog
index 0ae872c..0f6549d 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20090117 tpd src/axiom-website/patches.html 20090117.01.tpd.patch
+20090117 tpd books/bookvol10.3 add exports
 20090116 tpd src/axiom-website/patches.html 20090116.03.tpd.patch
 20090116 tpd books/bookvol10.3 add exports
 20090116 tpd src/axiom-website/patches.html 20090116.02.tpd.patch
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 5ed39a1..51a0b36 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -887,6 +887,8 @@ bookvol10.3 add exports<br/>
 bookvol10.3 add exports<br/>
 <a href="patches/20090116.03.tpd.patch">20090116.03.tpd.patch</a>
 bookvol10.3 add exports<br/>
+<a href="patches/20090117.01.tpd.patch">20090117.01.tpd.patch</a>
+bookvol10.3 add exports<br/>
 
  </body>
 </html>

\start
Date: Mon, 19 Jan 2009 16:43:35 -0600
From: Tim Daly
To: list
Subject: 20090118.01.tpd.patch (bookvol10.3 add exports)

The exports have been added to all entries and checked.
Additional documentation was added.
Broken images were fixed.
========================================================================
diff --git a/books/bookvol10.3.pamphlet b/books/bookvol10.3.pamphlet
index 0ecf180..0d1cee4 100644
--- a/books/bookvol10.3.pamphlet
+++ b/books/bookvol10.3.pamphlet
@@ -297,6 +297,13 @@ Each domain has an associated 'dotpic' chunk which only lists the
 domains, categories, and packages that are in the layer immediately
 below in the build order. For the full list see the algebra Makefile
 where this information is maintained.
+
+Each domain is preceded by a picture. The picture indicates several 
+things. The colors indicate whether the name refers to a category,
+domain, or package. An ellipse means that the name refers to something
+in the bootstrap set. Thus,
+
+\includegraphics[scale=0.85]{ps/v103colorchart.ps}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 %\pagehead{Domain}{ABB}
 %\pagepic{ps/v103domain.ps}{ABB}{1.00}
@@ -6570,79 +6577,79 @@ AssociatedJordanAlgebra(R:CommutativeRing,A:NonAssociativeAlgebra R):
 \pageto{LieSquareMatrix}{LSQM}
 
 {\bf Exports:}\\
-\begin{tabular}{lll}
+\begin{tabular}{ll}
 \cross{LIE}{0} &
-\cross{LIE}{alternative?} &
-\cross{LIE}{antiAssociative?} \\
-\cross{LIE}{antiCommutative?} &
+\cross{LIE}{alternative?} \\
+\cross{LIE}{antiAssociative?} &
+\cross{LIE}{antiCommutative?} \\
 \cross{LIE}{antiCommutator} &
 \cross{LIE}{apply} \\
 \cross{LIE}{associative?} &
-\cross{LIE}{associator} &
-\cross{LIE}{associatorDependence} \\
-\cross{LIE}{basis} &
+\cross{LIE}{associator} \\
+\cross{LIE}{associatorDependence} &
+\cross{LIE}{basis} \\
 \cross{LIE}{coerce} &
 \cross{LIE}{commutative?} \\
 \cross{LIE}{commutator} &
-\cross{LIE}{conditionsForIdempotents} &
-\cross{LIE}{convert} \\
-\cross{LIE}{coordinates} &
+\cross{LIE}{conditionsForIdempotents} \\
+\cross{LIE}{convert} &
+\cross{LIE}{coordinates} \\
 \cross{LIE}{flexible?} &
 \cross{LIE}{hash} \\
 \cross{LIE}{jacobiIdentity?} &
-\cross{LIE}{jordanAdmissible?} &
-\cross{LIE}{jordanAlgebra?} \\
-\cross{LIE}{latex} &
+\cross{LIE}{jordanAdmissible?} \\
+\cross{LIE}{jordanAlgebra?} &
+\cross{LIE}{latex} \\
 \cross{LIE}{leftAlternative?} &
 \cross{LIE}{leftCharacteristicPolynomial} \\
 \cross{LIE}{leftDiscriminant} &
-\cross{LIE}{leftMinimalPolynomial} &
-\cross{LIE}{leftNorm} \\
-\cross{LIE}{leftPower} &
+\cross{LIE}{leftMinimalPolynomial} \\
+\cross{LIE}{leftNorm} &
+\cross{LIE}{leftPower} \\
 \cross{LIE}{leftRankPolynomial} &
 \cross{LIE}{leftRecip} \\
 \cross{LIE}{leftRegularRepresentation} &
-\cross{LIE}{leftTrace} &
-\cross{LIE}{leftTraceMatrix} \\
-\cross{LIE}{leftUnit} &
+\cross{LIE}{leftTrace} \\
+\cross{LIE}{leftTraceMatrix} &
+\cross{LIE}{leftUnit} \\
 \cross{LIE}{leftUnits} &
 \cross{LIE}{lieAdmissible?} \\
 \cross{LIE}{lieAlgebra?} &
-\cross{LIE}{noncommutativeJordanAlgebra?} &
-\cross{LIE}{plenaryPower} \\
-\cross{LIE}{powerAssociative?} &
+\cross{LIE}{noncommutativeJordanAlgebra?} \\
+\cross{LIE}{plenaryPower} &
+\cross{LIE}{powerAssociative?} \\
 \cross{LIE}{rank} &
 \cross{LIE}{recip} \\
 \cross{LIE}{represents} &
-\cross{LIE}{represents} &
-\cross{LIE}{rightAlternative?} \\
-\cross{LIE}{rightCharacteristicPolynomial} &
+\cross{LIE}{represents} \\
+\cross{LIE}{rightAlternative?} &
+\cross{LIE}{rightCharacteristicPolynomial} \\
 \cross{LIE}{rightDiscriminant} &
 \cross{LIE}{rightMinimalPolynomial} \\
 \cross{LIE}{rightNorm} &
-\cross{LIE}{rightPower} &
-\cross{LIE}{rightRankPolynomial} \\
-\cross{LIE}{rightRecip} &
+\cross{LIE}{rightPower} \\
+\cross{LIE}{rightRankPolynomial} &
+\cross{LIE}{rightRecip} \\
 \cross{LIE}{rightRegularRepresentation} &
 \cross{LIE}{rightTrace} \\
 \cross{LIE}{rightTraceMatrix} &
-\cross{LIE}{rightUnit} &
-\cross{LIE}{rightUnits} \\
-\cross{LIE}{sample} &
+\cross{LIE}{rightUnit} \\
+\cross{LIE}{rightUnits} &
+\cross{LIE}{sample} \\
 \cross{LIE}{someBasis} &
 \cross{LIE}{structuralConstants} \\
 \cross{LIE}{structuralConstants} &
-\cross{LIE}{subtractIfCan} &
-\cross{LIE}{unit} \\
-\cross{LIE}{zero?} &
+\cross{LIE}{subtractIfCan} \\
+\cross{LIE}{unit} &
+\cross{LIE}{zero?} \\
 \cross{LIE}{?*?} &
 \cross{LIE}{?**?} \\
 \cross{LIE}{?+?} &
-\cross{LIE}{?-?} &
-\cross{LIE}{-?} \\
-\cross{LIE}{?=?} &
+\cross{LIE}{?-?} \\
+\cross{LIE}{-?} &
+\cross{LIE}{?=?} \\
 \cross{LIE}{?\~{}=?} &
-\cross{LIE}{?.?} 
+\cross{LIE}{?.?}
 \end{tabular}
 
 <<domain LIE AssociatedLieAlgebra>>=
@@ -10244,8 +10251,8 @@ o )show CardinalNumber
 \cross{CARD}{countable?} &
 \cross{CARD}{finite?} \\
 \cross{CARD}{generalizedContinuumHypothesisAssumed} &
-\cross{CARD}{generalizedContinuumHypothesisAssumed?} \\
-\cross{CARD}{hash} &
+\cross{CARD}{hash} \\
+\cross{CARD}{generalizedContinuumHypothesisAssumed?} &
 \cross{CARD}{latex} \\
 \cross{CARD}{max} &
 \cross{CARD}{min} \\
@@ -15653,23 +15660,23 @@ Database(S): Exports == Implementation where
 \pageto{QueryEquation}{QEQUAT}
 
 {\bf Exports:}\\
-\begin{tabular}{lllll}
+\begin{tabular}{llll}
 \cross{DLIST}{any?} &
 \cross{DLIST}{child?} &
 \cross{DLIST}{children} &
-\cross{DLIST}{coerce} &
-\cross{DLIST}{concat} \\
+\cross{DLIST}{coerce} \\
+\cross{DLIST}{concat} &
 \cross{DLIST}{concat!} &
 \cross{DLIST}{construct} &
-\cross{DLIST}{convert} &
+\cross{DLIST}{convert} \\
 \cross{DLIST}{copy} &
-\cross{DLIST}{copyInto!} \\
+\cross{DLIST}{copyInto!} &
 \cross{DLIST}{count} &
-\cross{DLIST}{cycleEntry} &
+\cross{DLIST}{cycleEntry} \\
 \cross{DLIST}{cycleLength} &
 \cross{DLIST}{cycleSplit!} &
-\cross{DLIST}{cycleTail} \\
-\cross{DLIST}{cyclic?} &
+\cross{DLIST}{cycleTail} &
+\cross{DLIST}{cyclic?} \\
 \cross{DLIST}{datalist} &
 \cross{DLIST}{delete} &
 \cross{DLIST}{delete!} &
@@ -15677,19 +15684,19 @@ Database(S): Exports == Implementation where
 \cross{DLIST}{elt} &
 \cross{DLIST}{empty} &
 \cross{DLIST}{empty?} &
-\cross{DLIST}{entries} &
-\cross{DLIST}{entry?} \\
+\cross{DLIST}{entries} \\
+\cross{DLIST}{entry?} &
 \cross{DLIST}{eq?} &
 \cross{DLIST}{eval} &
-\cross{DLIST}{every?} &
+\cross{DLIST}{every?} \\
 \cross{DLIST}{explicitlyFinite?} &
-\cross{DLIST}{fill!} \\
+\cross{DLIST}{fill!} &
 \cross{DLIST}{find} &
-\cross{DLIST}{first} &
+\cross{DLIST}{first} \\
 \cross{DLIST}{hash} &
 \cross{DLIST}{index?} &
-\cross{DLIST}{indices} \\
-\cross{DLIST}{insert} &
+\cross{DLIST}{indices} &
+\cross{DLIST}{insert} \\
 \cross{DLIST}{insert!} &
 \cross{DLIST}{last} &
 \cross{DLIST}{latex} &
@@ -15697,19 +15704,19 @@ Database(S): Exports == Implementation where
 \cross{DLIST}{leaves} &
 \cross{DLIST}{less?} &
 \cross{DLIST}{list} &
-\cross{DLIST}{map} &
-\cross{DLIST}{map!} \\
+\cross{DLIST}{map} \\
+\cross{DLIST}{map!} &
 \cross{DLIST}{max} &
 \cross{DLIST}{maxIndex} &
-\cross{DLIST}{member?} &
+\cross{DLIST}{member?} \\
 \cross{DLIST}{members} &
-\cross{DLIST}{merge} \\
+\cross{DLIST}{merge} &
 \cross{DLIST}{merge!} &
-\cross{DLIST}{min} &
+\cross{DLIST}{min} \\
 \cross{DLIST}{minIndex} &
 \cross{DLIST}{more?} &
-\cross{DLIST}{new} \\
-\cross{DLIST}{node?} &
+\cross{DLIST}{new} &
+\cross{DLIST}{node?} \\
 \cross{DLIST}{nodes} &
 \cross{DLIST}{parts} &
 \cross{DLIST}{position} &
@@ -15717,19 +15724,19 @@ Database(S): Exports == Implementation where
 \cross{DLIST}{qelt} &
 \cross{DLIST}{qsetelt!} &
 \cross{DLIST}{reduce} &
-\cross{DLIST}{remove} &
-\cross{DLIST}{remove!} \\
+\cross{DLIST}{remove} \\
+\cross{DLIST}{remove!} &
 \cross{DLIST}{removeDuplicates} &
 \cross{DLIST}{removeDuplicates!} &
-\cross{DLIST}{rest} &
+\cross{DLIST}{rest} \\
 \cross{DLIST}{reverse} &
-\cross{DLIST}{reverse!} \\
+\cross{DLIST}{reverse!} &
 \cross{DLIST}{sample} &
-\cross{DLIST}{second} &
+\cross{DLIST}{second} \\
 \cross{DLIST}{select} &
 \cross{DLIST}{select!} &
-\cross{DLIST}{setchildren!} \\
-\cross{DLIST}{setelt} &
+\cross{DLIST}{setchildren!} &
+\cross{DLIST}{setelt} \\
 \cross{DLIST}{setfirst!} &
 \cross{DLIST}{setlast!} &
 \cross{DLIST}{setrest!} &
@@ -15737,19 +15744,19 @@ Database(S): Exports == Implementation where
 \cross{DLIST}{size?} &
 \cross{DLIST}{sort} &
 \cross{DLIST}{sort!} &
-\cross{DLIST}{sorted?} &
-\cross{DLIST}{split!} \\
+\cross{DLIST}{sorted?} \\
+\cross{DLIST}{split!} &
 \cross{DLIST}{swap!} &
 \cross{DLIST}{tail} &
-\cross{DLIST}{third} &
+\cross{DLIST}{third} \\
 \cross{DLIST}{value} &
-\cross{DLIST}{\#{}?} \\
+\cross{DLIST}{\#{}?} &
 \cross{DLIST}{?$<$?} &
-\cross{DLIST}{?$<=$?} &
+\cross{DLIST}{?$<=$?} \\
 \cross{DLIST}{?=?} &
 \cross{DLIST}{?$>$?} &
-\cross{DLIST}{?$>=$?} \\
-\cross{DLIST}{?.?} &
+\cross{DLIST}{?$>=$?} &
+\cross{DLIST}{?.?} \\
 \cross{DLIST}{?\~{}=?} &
 \cross{DLIST}{?.count} &
 \cross{DLIST}{?.sort} &
@@ -15757,7 +15764,7 @@ Database(S): Exports == Implementation where
 \cross{DLIST}{?.last} &
 \cross{DLIST}{?.rest} &
 \cross{DLIST}{?.first} &
-\cross{DLIST}{?.value} &
+\cross{DLIST}{?.value} 
 \end{tabular}
 
 <<domain DLIST DataList>>=
@@ -19584,11 +19591,11 @@ o )show DistributedMultivariatePolynomial
 \cross{DMP}{retractIfCan} &
 \cross{DMP}{reorder} \\
 \cross{DMP}{retract} &
-\cross{DMP}{sample} &
-\cross{DMP}{solveLinearPolynomialEquation} \\
+\cross{DMP}{solveLinearPolynomialEquation} &
+\cross{DMP}{sample} \\
 \cross{DMP}{squareFree} &
-\cross{DMP}{squareFreePart} &
-\cross{DMP}{squareFreePolynomial} \\
+\cross{DMP}{squareFreePolynomial} &
+\cross{DMP}{squareFreePart} \\
 \cross{DMP}{subtractIfCan} &
 \cross{DMP}{totalDegree} &
 \cross{DMP}{unit?} \\
@@ -23321,6 +23328,16 @@ o )show Exit
 @
 \pagehead{Exit}{EXIT}
 \pagepic{ps/v103exit.ps}{EXIT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{EXIT}{coerce} &
+\cross{EXIT}{hash} &
+\cross{EXIT}{latex} &
+\cross{EXIT}{?=?} &
+\cross{EXIT}{?\~{}=?} 
+\end{tabular}
+
 <<domain EXIT Exit>>=
 )abbrev domain EXIT Exit
 ++ Author: Stephen M. Watt
@@ -23379,13 +23396,13 @@ Exit: SetCategory == add
 \cross{EXPEXPAN}{differentiate} &
 \cross{EXPEXPAN}{divide} \\
 \cross{EXPEXPAN}{euclideanSize} &
-\cross{EXPEXPAN}{eval} &
-\cross{EXPEXPAN}{expressIdealMember} \\
+\cross{EXPEXPAN}{expressIdealMember} &
+\cross{EXPEXPAN}{eval} \\
 \cross{EXPEXPAN}{exquo} &
 \cross{EXPEXPAN}{extendedEuclidean} &
 \cross{EXPEXPAN}{factor} \\
-\cross{EXPEXPAN}{factorPolynomial} &
 \cross{EXPEXPAN}{factorSquareFreePolynomial} &
+\cross{EXPEXPAN}{factorPolynomial} &
 \cross{EXPEXPAN}{floor} \\
 \cross{EXPEXPAN}{fractionPart} &
 \cross{EXPEXPAN}{gcd} &
@@ -33933,23 +33950,23 @@ FortranTemplate() : specification == implementation where
 \pageto{TheSymbolTable}{SYMS}
 
 {\bf Exports:}\\
-\begin{tabular}{lllll}
+\begin{tabular}{llll}
 \cross{FT}{coerce} &
 \cross{FT}{construct} &
 \cross{FT}{dimensionsOf} &
-\cross{FT}{external?} &
-\cross{FT}{fortranCharacter} \\
+\cross{FT}{external?} \\
+\cross{FT}{fortranCharacter} &
 \cross{FT}{fortranComplex} &
 \cross{FT}{fortranDouble} &
-\cross{FT}{fortranDoubleComplex} &
+\cross{FT}{fortranDoubleComplex} \\
 \cross{FT}{fortranInteger} &
-\cross{FT}{fortranLogical} \\
+\cross{FT}{fortranLogical} &
 \cross{FT}{fortranReal} &
-\cross{FT}{hash} &
+\cross{FT}{hash} \\
 \cross{FT}{latex} &
 \cross{FT}{scalarTypeOf} &
-\cross{FT}{?=?} \\
-\cross{FT}{?\~{}=?} &&&&
+\cross{FT}{?=?} &
+\cross{FT}{?\~{}=?} 
 \end{tabular}
 
 <<domain FT FortranType>>=
@@ -34189,13 +34206,15 @@ FourierSeries(R:Join(CommutativeRing,Algebra(Fraction Integer)),
        Algebra(R) with
          if E has canonical and R has canonical then canonical
          coerce: R -> $
-         ++ coerce(r) converts coefficients into Fourier Series
+           ++ coerce(r) converts coefficients into Fourier Series
          coerce: FourierComponent(E) -> $
-         ++ coerce(c) converts sin/cos terms into Fourier Series
+           ++ coerce(c) converts sin/cos terms into Fourier Series
          makeSin: (E,R) -> $
-         ++ makeSin(e,r) makes a sin expression with given argument and coefficient
+           ++ makeSin(e,r) makes a sin expression with given 
+           ++ argument and coefficient
          makeCos: (E,R) -> $
-         ++ makeCos(e,r) makes a sin expression with given argument and coefficient
+           ++ makeCos(e,r) makes a sin expression with given 
+           ++argument and coefficient
     == FreeModule(R,FourierComponent(E))
   add
    --representations
@@ -35290,6 +35309,40 @@ FramedModule(R, F, UP, A, ibasis): Exports == Implementation where
 \pageto{FreeGroup}{FGROUP}
 \pageto{InnerFreeAbelianMonoid}{IFAMON}
 \pageto{FreeAbelianMonoid}{FAMONOID}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FAGROUP}{0} &
+\cross{FAGROUP}{coefficient} &
+\cross{FAGROUP}{coerce} &
+\cross{FAGROUP}{hash} &
+\cross{FAGROUP}{highCommonTerms} \\
+\cross{FAGROUP}{latex} &
+\cross{FAGROUP}{mapCoef} &
+\cross{FAGROUP}{mapGen} &
+\cross{FAGROUP}{max} &
+\cross{FAGROUP}{min} \\
+\cross{FAGROUP}{nthCoef} &
+\cross{FAGROUP}{nthFactor} &
+\cross{FAGROUP}{retract} &
+\cross{FAGROUP}{retractIfCan} &
+\cross{FAGROUP}{sample} \\
+\cross{FAGROUP}{size} &
+\cross{FAGROUP}{subtractIfCan} &
+\cross{FAGROUP}{terms} &
+\cross{FAGROUP}{zero?} &
+\cross{FAGROUP}{?\~{}=?} \\
+\cross{FAGROUP}{?*?} &
+\cross{FAGROUP}{?$<$?} &
+\cross{FAGROUP}{?$<=$?} &
+\cross{FAGROUP}{?$>$?} &
+\cross{FAGROUP}{?$>=$?} \\
+\cross{FAGROUP}{?+?} &
+\cross{FAGROUP}{?-?} &
+\cross{FAGROUP}{-?} &
+\cross{FAGROUP}{?=?} &
+\end{tabular}
+
 <<domain FAGROUP FreeAbelianGroup>>=
 )abbrev domain FAGROUP FreeAbelianGroup
 ++ Free abelian group on any set of generators
@@ -41282,6 +41335,7 @@ IndexedDirectProductOrderedAbelianMonoid(A:OrderedAbelianMonoid,S:OrderedSet):
 @
 <<IDPOAM.dotabb>>=
 "IDPOAM" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IDPOAM"]
+"OAMON" [color="#4488FF",href="bookvol10.2.pdf#nameddest=OAMON"]
 "IDPOAM" -> "OAMON"
 
 @
@@ -42804,6 +42858,7 @@ IndexedTwoDimensionalArray(R,mnRow,mnCol):Exports == Implementation where
 <<IARRAY2.dotabb>>=
 "IARRAY2" [color="#88FF44",href="bookvol10.3.pdf#nameddest=IARRAY2"]
 "A1AGG" [color="#4488FF",href="bookvol10.2.pdf#nameddest=A1AGG"]
+"ARR2CAT" [color="#4488FF",href="bookvol10.2.pdf#nameddest=ARR2CAT"]
 "IARRAY2" -> "ARR2CAT"
 "IARRAY2" -> "A1AGG"
 
@@ -42981,23 +43036,23 @@ InfiniteTuple(S:Type): Exports == Implementation where
 \pageto{AlgebraicNumber}{AN}
 
 {\bf Exports:}\\
-\begin{tabular}{lllll}
+\begin{tabular}{llll}
 \cross{IAN}{0} &
 \cross{IAN}{1} &
 \cross{IAN}{associates?} &
-\cross{IAN}{belong?} &
-\cross{IAN}{box} \\
+\cross{IAN}{belong?} \\
+\cross{IAN}{box} &
 \cross{IAN}{characteristic} &
 \cross{IAN}{coerce} &
-\cross{IAN}{convert} &
+\cross{IAN}{convert} \\
 \cross{IAN}{D} &
-\cross{IAN}{definingPolynomial} \\
+\cross{IAN}{definingPolynomial} &
 \cross{IAN}{denom} &
-\cross{IAN}{differentiate} &
+\cross{IAN}{differentiate} \\
 \cross{IAN}{distribute} &
 \cross{IAN}{divide} &
-\cross{IAN}{elt} \\
-\cross{IAN}{euclideanSize} &
+\cross{IAN}{elt} &
+\cross{IAN}{euclideanSize} \\
 \cross{IAN}{eval} &
 \cross{IAN}{even?} &
 \cross{IAN}{expressIdealMember} &
@@ -43005,19 +43060,19 @@ InfiniteTuple(S:Type): Exports == Implementation where
 \cross{IAN}{extendedEuclidean} &
 \cross{IAN}{factor} &
 \cross{IAN}{freeOf?} &
-\cross{IAN}{gcd} &
-\cross{IAN}{gcdPolynomial} \\
+\cross{IAN}{gcd} \\
+\cross{IAN}{gcdPolynomial} &
 \cross{IAN}{hash} &
 \cross{IAN}{height} &
-\cross{IAN}{inv} &
+\cross{IAN}{inv} \\
 \cross{IAN}{is?} &
-\cross{IAN}{kernel} \\
+\cross{IAN}{kernel} &
 \cross{IAN}{kernels} &
-\cross{IAN}{latex} &
+\cross{IAN}{latex} \\
 \cross{IAN}{lcm} &
 \cross{IAN}{mainKernel} &
-\cross{IAN}{map} \\
-\cross{IAN}{max} &
+\cross{IAN}{map} &
+\cross{IAN}{max} \\
 \cross{IAN}{min} &
 \cross{IAN}{minPoly} &
 \cross{IAN}{multiEuclidean} &
@@ -43025,19 +43080,19 @@ InfiniteTuple(S:Type): Exports == Implementation where
 \cross{IAN}{nthRoot} &
 \cross{IAN}{numer} &
 \cross{IAN}{odd?} &
-\cross{IAN}{one?} &
-\cross{IAN}{operator} \\
+\cross{IAN}{one?} \\
+\cross{IAN}{operator} &
 \cross{IAN}{operators} &
 \cross{IAN}{paren} &
-\cross{IAN}{prime?} &
+\cross{IAN}{prime?} \\
 \cross{IAN}{principalIdeal} &
-\cross{IAN}{recip} \\
+\cross{IAN}{recip} &
 \cross{IAN}{reduce} &
-\cross{IAN}{reducedSystem} &
+\cross{IAN}{reducedSystem} \\
 \cross{IAN}{retract} &
 \cross{IAN}{retractIfCan} &
-\cross{IAN}{rootOf} \\
-\cross{IAN}{rootsOf} &
+\cross{IAN}{rootOf} &
+\cross{IAN}{rootsOf} \\
 \cross{IAN}{sample} &
 \cross{IAN}{sizeLess?} &
 \cross{IAN}{sqrt} &
@@ -43045,19 +43100,19 @@ InfiniteTuple(S:Type): Exports == Implementation where
 \cross{IAN}{squareFreePart} &
 \cross{IAN}{subst} &
 \cross{IAN}{subtractIfCan} &
-\cross{IAN}{tower} &
-\cross{IAN}{trueEqual} \\
+\cross{IAN}{tower} \\
+\cross{IAN}{trueEqual} &
 \cross{IAN}{unit?} &
 \cross{IAN}{unitCanonical} &
-\cross{IAN}{unitNormal} &
+\cross{IAN}{unitNormal} \\
 \cross{IAN}{zero?} &
-\cross{IAN}{zeroOf} \\
+\cross{IAN}{zeroOf} &
 \cross{IAN}{zerosOf} &
-\cross{IAN}{?*?} &
+\cross{IAN}{?*?} \\
 \cross{IAN}{?**?} &
 \cross{IAN}{?+?} &
-\cross{IAN}{-?} \\
-\cross{IAN}{?-?} &
+\cross{IAN}{-?} &
+\cross{IAN}{?-?} \\
 \cross{IAN}{?/?} &
 \cross{IAN}{?$<$?} &
 \cross{IAN}{?$<=$?} &
@@ -43065,11 +43120,11 @@ InfiniteTuple(S:Type): Exports == Implementation where
 \cross{IAN}{?$>$?} &
 \cross{IAN}{?$>=$?} &
 \cross{IAN}{?\^{}?} &
-\cross{IAN}{?\~{}=?} &
-\cross{IAN}{?*?} \\
+\cross{IAN}{?\~{}=?} \\
+\cross{IAN}{?*?} &
 \cross{IAN}{?**?} &
 \cross{IAN}{?quo?} &
-\cross{IAN}{?rem?} &&
+\cross{IAN}{?rem?} 
 \end{tabular}
 
 <<domain IAN InnerAlgebraicNumber>>=
@@ -50100,135 +50155,134 @@ LiePolynomial(VarSet:OrderedSet, R:CommutativeRing) : Public == Private where
 \pageto{AssociatedJordanAlgebra}{JORDAN}
 
 {\bf Exports:}\\
-\begin{tabular}{ll}
+\begin{tabular}{lll}
 \cross{LSQM}{0} &
-\cross{LSQM}{1} \\
-\cross{LSQM}{alternative?} &
-\cross{LSQM}{antiAssociative?} \\
+\cross{LSQM}{1} &
+\cross{LSQM}{alternative?} \\
+\cross{LSQM}{antiAssociative?} &
 \cross{LSQM}{antiCommutator} &
 \cross{LSQM}{antisymmetric?} \\
 \cross{LSQM}{any?} &
-\cross{LSQM}{apply} \\
-\cross{LSQM}{associative?} &
-\cross{LSQM}{associator} \\
+\cross{LSQM}{apply} &
+\cross{LSQM}{associative?} \\
+\cross{LSQM}{associator} &
 \cross{LSQM}{associatorDependence} &
 \cross{LSQM}{basis} \\
 \cross{LSQM}{characteristic} &
-\cross{LSQM}{coerce} \\
-\cross{LSQM}{column} &
-\cross{LSQM}{commutative?} \\
+\cross{LSQM}{coerce} &
+\cross{LSQM}{column} \\
+\cross{LSQM}{commutative?} &
 \cross{LSQM}{commutator} &
 \cross{LSQM}{conditionsForIdempotents} \\
 \cross{LSQM}{convert} &
-\cross{LSQM}{coordinates} \\
-\cross{LSQM}{copy} &
-\cross{LSQM}{count} \\
+\cross{LSQM}{coordinates} &
+\cross{LSQM}{copy} \\
+\cross{LSQM}{count} &
 \cross{LSQM}{D} &
 \cross{LSQM}{determinant} \\
 \cross{LSQM}{diagonal} &
-\cross{LSQM}{diagonal?} \\
-\cross{LSQM}{diagonalMatrix} &
-\cross{LSQM}{diagonalProduct} \\
+\cross{LSQM}{diagonal?} &
+\cross{LSQM}{diagonalMatrix} \\
+\cross{LSQM}{diagonalProduct} &
 \cross{LSQM}{differentiate} &
 \cross{LSQM}{elt} \\
 \cross{LSQM}{empty} &
-\cross{LSQM}{empty?} \\
-\cross{LSQM}{eq?} &
-\cross{LSQM}{eval} \\
+\cross{LSQM}{empty?} &
+\cross{LSQM}{eq?} \\
+\cross{LSQM}{eval} &
 \cross{LSQM}{every?} &
 \cross{LSQM}{exquo} \\
 \cross{LSQM}{flexible?} &
-\cross{LSQM}{hash} \\
-\cross{LSQM}{inverse} &
-\cross{LSQM}{jacobiIdentity?} \\
+\cross{LSQM}{hash} &
+\cross{LSQM}{inverse} \\
+\cross{LSQM}{jacobiIdentity?} &
 \cross{LSQM}{jordanAdmissible?} &
 \cross{LSQM}{jordanAlgebra?} \\
 \cross{LSQM}{latex} &
-\cross{LSQM}{leftAlternative?} \\
-\cross{LSQM}{leftCharacteristicPolynomial} &
-\cross{LSQM}{leftDiscriminant} \\
+\cross{LSQM}{leftAlternative?} &
+\cross{LSQM}{leftCharacteristicPolynomial} \\
+\cross{LSQM}{leftDiscriminant} &
 \cross{LSQM}{leftDiscriminant} &
 \cross{LSQM}{leftMinimalPolynomial} \\
 \cross{LSQM}{leftNorm} &
-\cross{LSQM}{leftPower} \\
-\cross{LSQM}{leftRankPolynomial} &
-\cross{LSQM}{leftRecip} \\
+\cross{LSQM}{leftPower} &
+\cross{LSQM}{leftRankPolynomial} \\
+\cross{LSQM}{leftRecip} &
 \cross{LSQM}{leftRegularRepresentation} &
 \cross{LSQM}{leftRegularRepresentation} \\
 \cross{LSQM}{leftTrace} &
-\cross{LSQM}{leftTraceMatrix} \\
-\cross{LSQM}{leftUnit} &
-\cross{LSQM}{leftUnits} \\
+\cross{LSQM}{leftTraceMatrix} &
+\cross{LSQM}{leftUnit} \\
+\cross{LSQM}{leftUnits} &
 \cross{LSQM}{less?} &
 \cross{LSQM}{lieAdmissible?} \\
 \cross{LSQM}{lieAlgebra?} &
-\cross{LSQM}{listOfLists} \\
-\cross{LSQM}{map} &
-\cross{LSQM}{map!} \\
+\cross{LSQM}{listOfLists} &
+\cross{LSQM}{map} \\
+\cross{LSQM}{map!} &
 \cross{LSQM}{matrix} &
 \cross{LSQM}{maxColIndex} \\
 \cross{LSQM}{maxRowIndex} &
-\cross{LSQM}{member?} \\
-\cross{LSQM}{members} &
-\cross{LSQM}{minColIndex} \\
+\cross{LSQM}{member?} &
+\cross{LSQM}{members} \\
+\cross{LSQM}{minColIndex} &
 \cross{LSQM}{minordet} &
 \cross{LSQM}{minRowIndex} \\
 \cross{LSQM}{more?} &
-\cross{LSQM}{ncols} \\
-\cross{LSQM}{noncommutativeJordanAlgebra?} &
-\cross{LSQM}{nrows} \\
+\cross{LSQM}{ncols} &
+\cross{LSQM}{noncommutativeJordanAlgebra?} \\
+\cross{LSQM}{nrows} &
 \cross{LSQM}{nullSpace} &
 \cross{LSQM}{nullity} \\
 \cross{LSQM}{one?} &
-\cross{LSQM}{parts} \\
-\cross{LSQM}{plenaryPower} &
-\cross{LSQM}{powerAssociative?} \\
+\cross{LSQM}{parts} &
+\cross{LSQM}{plenaryPower} \\
+\cross{LSQM}{powerAssociative?} &
 \cross{LSQM}{qelt} &
 \cross{LSQM}{rank} \\
 \cross{LSQM}{recip} &
-\cross{LSQM}{reducedSystem} \\
-\cross{LSQM}{represents} &
-\cross{LSQM}{retract} \\
+\cross{LSQM}{reducedSystem} &
+\cross{LSQM}{represents} \\
+\cross{LSQM}{retract} &
 \cross{LSQM}{retractIfCan} &
 \cross{LSQM}{rightAlternative?} \\
 \cross{LSQM}{rightCharacteristicPolynomial} &
-\cross{LSQM}{rightDiscriminant} \\
-\cross{LSQM}{rightMinimalPolynomial} &
-\cross{LSQM}{rightNorm} \\
+\cross{LSQM}{rightDiscriminant} &
+\cross{LSQM}{rightMinimalPolynomial} \\
+\cross{LSQM}{rightNorm} &
 \cross{LSQM}{rightPower} &
 \cross{LSQM}{rightRankPolynomial} \\
 \cross{LSQM}{rightRecip} &
-\cross{LSQM}{rightRegularRepresentation} \\
 \cross{LSQM}{rightRegularRepresentation} &
 \cross{LSQM}{rightTrace} \\
 \cross{LSQM}{rightTraceMatrix} &
-\cross{LSQM}{rightUnit} \\
-\cross{LSQM}{rightUnits} &
-\cross{LSQM}{row} \\
+\cross{LSQM}{rightUnit} &
+\cross{LSQM}{rightUnits} \\
+\cross{LSQM}{row} &
 \cross{LSQM}{rowEchelon} &
 \cross{LSQM}{sample} \\
 \cross{LSQM}{scalarMatrix} &
-\cross{LSQM}{size?} \\
-\cross{LSQM}{someBasis} &
-\cross{LSQM}{square?} \\
+\cross{LSQM}{size?} &
+\cross{LSQM}{someBasis} \\
+\cross{LSQM}{square?} &
 \cross{LSQM}{structuralConstants} &
 \cross{LSQM}{structuralConstants} \\
 \cross{LSQM}{subtractIfCan} &
-\cross{LSQM}{symmetric?} \\
-\cross{LSQM}{trace} &
-\cross{LSQM}{unit} \\
+\cross{LSQM}{symmetric?} &
+\cross{LSQM}{trace} \\
+\cross{LSQM}{unit} &
 \cross{LSQM}{zero?} &
 \cross{LSQM}{\#{}?} \\
 \cross{LSQM}{?\~{}=?} &
-\cross{LSQM}{?*?} \\
-\cross{LSQM}{?**?} &
-\cross{LSQM}{?+?} \\
+\cross{LSQM}{?*?} &
+\cross{LSQM}{?**?} \\
+\cross{LSQM}{?+?} &
 \cross{LSQM}{?-?} &
 \cross{LSQM}{-?} \\
 \cross{LSQM}{?/?} &
-\cross{LSQM}{?=?} \\
-\cross{LSQM}{?\^{}?} &
-\cross{LSQM}{?.?} 
+\cross{LSQM}{?=?} &
+\cross{LSQM}{?\^{}?} \\
+\cross{LSQM}{?.?} &&
 \end{tabular}
 
 <<domain LSQM LieSquareMatrix>>=
@@ -53971,143 +54025,143 @@ LyndonWord(VarSet:OrderedSet):Public == Private where
 \pageto{MachineFloat}{MFLOAT}
 
 {\bf Exports:}\\
-\begin{tabular}{ll}
+\begin{tabular}{lll}
 \cross{MCMPLX}{0} &
-\cross{MCMPLX}{1} \\
-\cross{MCMPLX}{abs} &
-\cross{MCMPLX}{acos} \\
+\cross{MCMPLX}{1} &
+\cross{MCMPLX}{abs} \\
+\cross{MCMPLX}{acos} &
 \cross{MCMPLX}{acosh} &
 \cross{MCMPLX}{acot} \\
 \cross{MCMPLX}{acoth} &
-\cross{MCMPLX}{acsc} \\
-\cross{MCMPLX}{acsch} &
-\cross{MCMPLX}{argument} \\
+\cross{MCMPLX}{acsc} &
+\cross{MCMPLX}{acsch} \\
+\cross{MCMPLX}{argument} &
 \cross{MCMPLX}{asec} &
 \cross{MCMPLX}{asech} \\
 \cross{MCMPLX}{asin} &
-\cross{MCMPLX}{asinh} \\
-\cross{MCMPLX}{associates?} &
-\cross{MCMPLX}{atan} \\
+\cross{MCMPLX}{asinh} &
+\cross{MCMPLX}{associates?} \\
+\cross{MCMPLX}{atan} &
 \cross{MCMPLX}{atanh} &
 \cross{MCMPLX}{basis} \\
 \cross{MCMPLX}{characteristic} &
-\cross{MCMPLX}{characteristicPolynomial} \\
-\cross{MCMPLX}{charthRoot} &
-\cross{MCMPLX}{coerce} \\
+\cross{MCMPLX}{characteristicPolynomial} &
+\cross{MCMPLX}{charthRoot} \\
+\cross{MCMPLX}{coerce} &
 \cross{MCMPLX}{complex} &
 \cross{MCMPLX}{conditionP} \\
 \cross{MCMPLX}{conjugate} &
-\cross{MCMPLX}{convert} \\
-\cross{MCMPLX}{coordinates} &
-\cross{MCMPLX}{cos} \\
+\cross{MCMPLX}{convert} &
+\cross{MCMPLX}{coordinates} \\
+\cross{MCMPLX}{cos} &
 \cross{MCMPLX}{cosh} &
 \cross{MCMPLX}{cot} \\
 \cross{MCMPLX}{coth} &
-\cross{MCMPLX}{createPrimitiveElement} \\
-\cross{MCMPLX}{csc} &
-\cross{MCMPLX}{csch} \\
+\cross{MCMPLX}{createPrimitiveElement} &
+\cross{MCMPLX}{csc} \\
+\cross{MCMPLX}{csch} &
 \cross{MCMPLX}{D} &
 \cross{MCMPLX}{definingPolynomial} \\
 \cross{MCMPLX}{derivationCoordinates} &
-\cross{MCMPLX}{differentiate} \\
-\cross{MCMPLX}{discreteLog} &
-\cross{MCMPLX}{discriminant} \\
+\cross{MCMPLX}{differentiate} &
+\cross{MCMPLX}{discreteLog} \\
+\cross{MCMPLX}{discriminant} &
 \cross{MCMPLX}{divide} &
 \cross{MCMPLX}{euclideanSize} \\
 \cross{MCMPLX}{eval} &
-\cross{MCMPLX}{exp} \\
-\cross{MCMPLX}{expressIdealMember} &
-\cross{MCMPLX}{exquo} \\
+\cross{MCMPLX}{exp} &
+\cross{MCMPLX}{expressIdealMember} \\
+\cross{MCMPLX}{exquo} &
 \cross{MCMPLX}{extendedEuclidean} &
 \cross{MCMPLX}{factor} \\
 \cross{MCMPLX}{factorPolynomial} &
-\cross{MCMPLX}{factorSquareFreePolynomial} \\
+\cross{MCMPLX}{factorSquareFreePolynomial} &
+\cross{MCMPLX}{gcdPolynomial} \\
+\cross{MCMPLX}{gcd} &
 \cross{MCMPLX}{factorsOfCyclicGroupSize} &
-\cross{MCMPLX}{gcd} \\
-\cross{MCMPLX}{gcdPolynomial} &
 \cross{MCMPLX}{generator} \\
 \cross{MCMPLX}{hash} &
-\cross{MCMPLX}{imag} \\
-\cross{MCMPLX}{imaginary} &
-\cross{MCMPLX}{index} \\
+\cross{MCMPLX}{imag} &
+\cross{MCMPLX}{imaginary} \\
+\cross{MCMPLX}{index} &
 \cross{MCMPLX}{init} &
 \cross{MCMPLX}{inv} \\
 \cross{MCMPLX}{latex} &
-\cross{MCMPLX}{lcm} \\
-\cross{MCMPLX}{lift} &
-\cross{MCMPLX}{log} \\
+\cross{MCMPLX}{lcm} &
+\cross{MCMPLX}{lift} \\
+\cross{MCMPLX}{log} &
 \cross{MCMPLX}{lookup} &
 \cross{MCMPLX}{map} \\
 \cross{MCMPLX}{max} &
-\cross{MCMPLX}{min} \\
-\cross{MCMPLX}{minimalPolynomial} &
-\cross{MCMPLX}{multiEuclidean} \\
+\cross{MCMPLX}{min} &
+\cross{MCMPLX}{minimalPolynomial} \\
+\cross{MCMPLX}{multiEuclidean} &
 \cross{MCMPLX}{nextItem} &
 \cross{MCMPLX}{norm} \\
 \cross{MCMPLX}{nthRoot} &
-\cross{MCMPLX}{one?} \\
-\cross{MCMPLX}{order} &
-\cross{MCMPLX}{patternMatch} \\
+\cross{MCMPLX}{one?} &
+\cross{MCMPLX}{order} \\
+\cross{MCMPLX}{patternMatch} &
 \cross{MCMPLX}{pi} &
 \cross{MCMPLX}{polarCoordinates} \\
 \cross{MCMPLX}{prime?} &
-\cross{MCMPLX}{primeFrobenius} \\
-\cross{MCMPLX}{primitive?} &
-\cross{MCMPLX}{primitiveElement} \\
+\cross{MCMPLX}{primeFrobenius} &
+\cross{MCMPLX}{primitive?} \\
+\cross{MCMPLX}{primitiveElement} &
 \cross{MCMPLX}{principalIdeal} &
 \cross{MCMPLX}{random} \\
 \cross{MCMPLX}{rank} &
-\cross{MCMPLX}{rational} \\
-\cross{MCMPLX}{rational?} &
-\cross{MCMPLX}{rationalIfCan} \\
+\cross{MCMPLX}{rational} &
+\cross{MCMPLX}{rational?} \\
+\cross{MCMPLX}{rationalIfCan} &
 \cross{MCMPLX}{real} &
 \cross{MCMPLX}{recip} \\
 \cross{MCMPLX}{reduce} &
-\cross{MCMPLX}{reducedSystem} \\
-\cross{MCMPLX}{regularRepresentation} &
-\cross{MCMPLX}{representationType} \\
+\cross{MCMPLX}{reducedSystem} &
+\cross{MCMPLX}{regularRepresentation} \\
+\cross{MCMPLX}{representationType} &
 \cross{MCMPLX}{represents} &
 \cross{MCMPLX}{retract} \\
 \cross{MCMPLX}{retractIfCan} &
-\cross{MCMPLX}{sample} \\
-\cross{MCMPLX}{sec} &
-\cross{MCMPLX}{sech} \\
+\cross{MCMPLX}{sample} &
+\cross{MCMPLX}{sec} \\
+\cross{MCMPLX}{sech} &
 \cross{MCMPLX}{sin} &
 \cross{MCMPLX}{sinh} \\
 \cross{MCMPLX}{size} &
-\cross{MCMPLX}{sizeLess?} \\
 \cross{MCMPLX}{solveLinearPolynomialEquation} &
-\cross{MCMPLX}{sqrt} \\
+\cross{MCMPLX}{sizeLess?} \\
+\cross{MCMPLX}{sqrt} &
 \cross{MCMPLX}{squareFree} &
 \cross{MCMPLX}{squareFreePart} \\
 \cross{MCMPLX}{squareFreePolynomial} &
-\cross{MCMPLX}{subtractIfCan} \\
 \cross{MCMPLX}{tableForDiscreteLogarithm} &
-\cross{MCMPLX}{tan} \\
+\cross{MCMPLX}{subtractIfCan} \\
+\cross{MCMPLX}{tan} &
 \cross{MCMPLX}{tanh} &
 \cross{MCMPLX}{trace} \\
 \cross{MCMPLX}{traceMatrix} &
-\cross{MCMPLX}{traceMatrix} \\
-\cross{MCMPLX}{unit?} &
-\cross{MCMPLX}{unitCanonical} \\
+\cross{MCMPLX}{traceMatrix} &
+\cross{MCMPLX}{unit?} \\
+\cross{MCMPLX}{unitCanonical} &
 \cross{MCMPLX}{unitNormal} &
 \cross{MCMPLX}{zero?} \\
 \cross{MCMPLX}{?*?} &
-\cross{MCMPLX}{?**?} \\
-\cross{MCMPLX}{?+?} &
-\cross{MCMPLX}{?-?} \\
+\cross{MCMPLX}{?**?} &
+\cross{MCMPLX}{?+?} \\
+\cross{MCMPLX}{?-?} &
 \cross{MCMPLX}{-?} &
 \cross{MCMPLX}{?$<$?} \\
 \cross{MCMPLX}{?$<=$?} &
-\cross{MCMPLX}{?=?} \\
-\cross{MCMPLX}{?$>$?} &
-\cross{MCMPLX}{?$>=$?} \\
+\cross{MCMPLX}{?=?} &
+\cross{MCMPLX}{?$>$?} \\
+\cross{MCMPLX}{?$>=$?} &
 \cross{MCMPLX}{?\^{}?} &
 \cross{MCMPLX}{?\~{}=?} \\
 \cross{MCMPLX}{?/?} &
-\cross{MCMPLX}{?.?} \\
-\cross{MCMPLX}{?quo?} &
-\cross{MCMPLX}{?rem?} 
+\cross{MCMPLX}{?.?} &
+\cross{MCMPLX}{?quo?} \\
+\cross{MCMPLX}{?rem?} &&
 \end{tabular}
 
 <<domain MCMPLX MachineComplex>>=
@@ -55060,7 +55114,7 @@ o )show Magma
 ++ Description:
 ++ This type is the basic representation of 
 ++ parenthesized words (binary trees over arbitrary symbols)
-++ useful in \spadtype{LiePolynomial}. \newline Author: Michel Petitot (petitot@lifl.fr).
+++ useful in \spadtype{LiePolynomial}. 
 
 Magma(VarSet:OrderedSet):Public == Private where
    WORD ==> OrderedFreeMonoid(VarSet)
@@ -55070,7 +55124,8 @@ Magma(VarSet:OrderedSet):Public == Private where
       "*"           : ($,$) -> $
         ++ \axiom{x*y} returns the tree \axiom{[x,y]}.
       coerce        : $ -> WORD
-        ++ \axiom{coerce(x)} returns the element of \axiomType{OrderedFreeMonoid}(VarSet) 
+        ++ \axiom{coerce(x)} returns the element of 
+        ++\axiomType{OrderedFreeMonoid}(VarSet) 
         ++ corresponding to \axiom{x} by removing parentheses.
       first         : $ -> VarSet
         ++ \axiom{first(x)} returns the first entry of the tree \axiom{x}.
@@ -55086,7 +55141,8 @@ Magma(VarSet:OrderedSet):Public == Private where
         ++ its arguments. Thus this is not a total ordering.
       mirror        : $ -> $
         ++ \axiom{mirror(x)} returns the reversed word of \axiom{x}. 
-        ++ That is \axiom{x} itself if \axiomOpFrom{retractable?}{Magma}(\axiom{x}) is true and
+        ++ That is \axiom{x} itself if 
+        ++ \axiomOpFrom{retractable?}{Magma}(\axiom{x}) is true and
         ++ \axiom{mirror(z) * mirror(y)} if \axiom{x} is \axiom{y*z}.
       rest          : $ -> $
         ++ \axiom{rest(x)} return \axiom{x} without the first entry or 
@@ -57529,7 +57585,8 @@ MonoidRing(R: Ring, M: Monoid): MRcategory == MRdefinition where
           ++ coefficient(f,m) extracts the coefficient of m in f with respect
           ++ to the canonical basis M.
         coerce:   List Term -> %
-          ++ coerce(lt) converts a list of terms and coefficients to a member of the domain.
+          ++ coerce(lt) converts a list of terms and 
+          ++ coefficients to a member of the domain.
         terms       : % -> List Term
           ++ terms(f) gives the list of non-zero coefficients combined
           ++ with their corresponding basis element as records.
@@ -58583,88 +58640,88 @@ o )show MultivariatePolynomial
 \pageto{IndexedExponents}{INDE}
 
 {\bf Exports:}\\
-\begin{tabular}{llll}
+\begin{tabular}{lll}
 \cross{MPOLY}{0} &
 \cross{MPOLY}{1} &
-\cross{MPOLY}{associates?} &
-\cross{MPOLY}{binomThmExpt} \\
+\cross{MPOLY}{associates?} \\
+\cross{MPOLY}{binomThmExpt} &
 \cross{MPOLY}{characteristic} &
-\cross{MPOLY}{charthRoot} &
+\cross{MPOLY}{charthRoot} \\
 \cross{MPOLY}{coefficient} &
-\cross{MPOLY}{coefficients} \\
-\cross{MPOLY}{coerce} &
+\cross{MPOLY}{coefficients} &
+\cross{MPOLY}{coerce} \\
 \cross{MPOLY}{conditionP} &
 \cross{MPOLY}{content} &
 \cross{MPOLY}{convert} \\
 \cross{MPOLY}{D} &
 \cross{MPOLY}{degree} &
-\cross{MPOLY}{differentiate} &
-\cross{MPOLY}{discriminant} \\
+\cross{MPOLY}{differentiate} \\
+\cross{MPOLY}{discriminant} &
 \cross{MPOLY}{eval} &
-\cross{MPOLY}{exquo} &
+\cross{MPOLY}{exquo} \\
 \cross{MPOLY}{factor} &
-\cross{MPOLY}{factorPolynomial} \\
-\cross{MPOLY}{factorSquareFreePolynomial} &
+\cross{MPOLY}{factorPolynomial} &
+\cross{MPOLY}{factorSquareFreePolynomial} \\
 \cross{MPOLY}{gcd} &
 \cross{MPOLY}{gcdPolynomial} &
 \cross{MPOLY}{ground} \\
 \cross{MPOLY}{ground?} &
 \cross{MPOLY}{hash} &
-\cross{MPOLY}{isExpt} &
-\cross{MPOLY}{isPlus} \\
+\cross{MPOLY}{isExpt} \\
+\cross{MPOLY}{isPlus} &
 \cross{MPOLY}{isTimes} &
-\cross{MPOLY}{latex} &
+\cross{MPOLY}{latex} \\
 \cross{MPOLY}{lcm} &
-\cross{MPOLY}{leadingCoefficient} \\
-\cross{MPOLY}{leadingMonomial} &
+\cross{MPOLY}{leadingCoefficient} &
+\cross{MPOLY}{leadingMonomial} \\
 \cross{MPOLY}{mainVariable} &
 \cross{MPOLY}{map} &
 \cross{MPOLY}{mapExponents} \\
 \cross{MPOLY}{max} &
 \cross{MPOLY}{min} &
-\cross{MPOLY}{minimumDegree} &
-\cross{MPOLY}{monicDivide} \\
+\cross{MPOLY}{minimumDegree} \\
+\cross{MPOLY}{monicDivide} &
 \cross{MPOLY}{monomial} &
-\cross{MPOLY}{monomial?} &
+\cross{MPOLY}{monomial?} \\
 \cross{MPOLY}{monomials} &
-\cross{MPOLY}{multivariate} \\
-\cross{MPOLY}{numberOfMonomials} &
+\cross{MPOLY}{multivariate} &
+\cross{MPOLY}{numberOfMonomials} \\
 \cross{MPOLY}{one?} &
 \cross{MPOLY}{patternMatch} &
 \cross{MPOLY}{pomopo!} \\
 \cross{MPOLY}{prime?} &
 \cross{MPOLY}{primitivePart} &
-\cross{MPOLY}{primitiveMonomials} &
-\cross{MPOLY}{recip} \\
+\cross{MPOLY}{primitiveMonomials} \\
+\cross{MPOLY}{recip} &
 \cross{MPOLY}{reducedSystem} &
-\cross{MPOLY}{reductum} &
+\cross{MPOLY}{reductum} \\
 \cross{MPOLY}{resultant} &
-\cross{MPOLY}{retract} \\
-\cross{MPOLY}{retractIfCan} &
+\cross{MPOLY}{retract} &
+\cross{MPOLY}{retractIfCan} \\
 \cross{MPOLY}{sample} &
 \cross{MPOLY}{solveLinearPolynomialEquation} &
 \cross{MPOLY}{squareFree} \\
 \cross{MPOLY}{squareFreePart} &
 \cross{MPOLY}{squareFreePolynomial} &
-\cross{MPOLY}{subtractIfCan} &
-\cross{MPOLY}{totalDegree} \\
+\cross{MPOLY}{subtractIfCan} \\
+\cross{MPOLY}{totalDegree} &
 \cross{MPOLY}{unit?} &
-\cross{MPOLY}{unitCanonical} &
+\cross{MPOLY}{unitCanonical} \\
 \cross{MPOLY}{unitNormal} &
-\cross{MPOLY}{univariate} \\
-\cross{MPOLY}{variables} &
+\cross{MPOLY}{univariate} &
+\cross{MPOLY}{variables} \\
 \cross{MPOLY}{zero?} &
 \cross{MPOLY}{?*?} &
 \cross{MPOLY}{?**?} \\
 \cross{MPOLY}{?+?} &
 \cross{MPOLY}{?-?} &
-\cross{MPOLY}{-?} &
-\cross{MPOLY}{?=?} \\
+\cross{MPOLY}{-?} \\
+\cross{MPOLY}{?=?} &
 \cross{MPOLY}{?\^{}?} &
-\cross{MPOLY}{?\~{}=?} &
+\cross{MPOLY}{?\~{}=?} \\
 \cross{MPOLY}{?/?} &
-\cross{MPOLY}{?$<$?} \\
-\cross{MPOLY}{?$<=$?} &
+\cross{MPOLY}{?$<$?} &
+\cross{MPOLY}{?$<=$?} \\
 \cross{MPOLY}{?$>$?} &
 \cross{MPOLY}{?$>=$?} &
 \end{tabular}
@@ -59072,9 +59129,9 @@ by means of triangular sets.
 \cross{NSMP}{factorSquareFreePolynomial} &
 \cross{NSMP}{gcd} &
 \cross{NSMP}{gcdPolynomial} \\
+\cross{NSMP}{halfExtendedSubResultantGcd1} &
 \cross{NSMP}{ground} &
-\cross{NSMP}{ground?} &
-\cross{NSMP}{halfExtendedSubResultantGcd1} \\
+\cross{NSMP}{ground?} \\
 \cross{NSMP}{halfExtendedSubResultantGcd2} &
 \cross{NSMP}{hash} &
 \cross{NSMP}{head} \\
@@ -59129,9 +59186,9 @@ by means of triangular sets.
 \cross{NSMP}{patternMatch} &
 \cross{NSMP}{pomopo!} &
 \cross{NSMP}{pquo} \\
-\cross{NSMP}{prem} &
+\cross{NSMP}{primPartElseUnitCanonical!} &
 \cross{NSMP}{primPartElseUnitCanonical} &
-\cross{NSMP}{primPartElseUnitCanonical!} \\
+\cross{NSMP}{prem} \\
 \cross{NSMP}{prime?} &
 \cross{NSMP}{primitiveMonomials} &
 \cross{NSMP}{primitivePart} \\
@@ -59596,134 +59653,134 @@ constructur {\bf SparseUnivariatePolynomial}.
 \pageto{NewSparseMultivariatePolynomial}{NSMP}
 
 {\bf Exports:}\\
-\begin{tabular}{ll}
+\begin{tabular}{lll}
 \cross{NSUP}{0} &
-\cross{NSUP}{1} \\
-\cross{NSUP}{associates?} &
-\cross{NSUP}{binomThmExpt} \\
+\cross{NSUP}{1} &
+\cross{NSUP}{associates?} \\
+\cross{NSUP}{binomThmExpt} &
 \cross{NSUP}{characteristic} &
 \cross{NSUP}{charthRoot} \\
 \cross{NSUP}{coefficient} &
-\cross{NSUP}{coefficients} \\
-\cross{NSUP}{coerce} &
-\cross{NSUP}{composite} \\
+\cross{NSUP}{coefficients} &
+\cross{NSUP}{coerce} \\
+\cross{NSUP}{composite} &
 \cross{NSUP}{conditionP} &
 \cross{NSUP}{content} \\
 \cross{NSUP}{convert} &
-\cross{NSUP}{D} \\
-\cross{NSUP}{degree} &
-\cross{NSUP}{differentiate} \\
+\cross{NSUP}{D} &
+\cross{NSUP}{degree} \\
+\cross{NSUP}{differentiate} &
 \cross{NSUP}{discriminant} &
 \cross{NSUP}{divide} \\
 \cross{NSUP}{divideExponents} &
-\cross{NSUP}{elt} \\
-\cross{NSUP}{euclideanSize} &
-\cross{NSUP}{eval} \\
+\cross{NSUP}{elt} &
+\cross{NSUP}{euclideanSize} \\
+\cross{NSUP}{eval} &
 \cross{NSUP}{expressIdealMember} &
 \cross{NSUP}{exquo} \\
 \cross{NSUP}{extendedEuclidean} &
-\cross{NSUP}{extendedResultant} \\
-\cross{NSUP}{extendedSubResultantGcd} &
-\cross{NSUP}{factor} \\
+\cross{NSUP}{extendedResultant} &
+\cross{NSUP}{extendedSubResultantGcd} \\
+\cross{NSUP}{factor} &
 \cross{NSUP}{factorPolynomial} &
 \cross{NSUP}{factorSquareFreePolynomial} \\
 \cross{NSUP}{fmecg} &
-\cross{NSUP}{gcd} \\
-\cross{NSUP}{gcdPolynomial} &
-\cross{NSUP}{ground} \\
+\cross{NSUP}{gcd} &
+\cross{NSUP}{gcdPolynomial} \\
+\cross{NSUP}{ground} &
 \cross{NSUP}{ground?} &
 \cross{NSUP}{halfExtendedResultant1} \\
 \cross{NSUP}{halfExtendedResultant2} &
-\cross{NSUP}{halfExtendedSubResultantGcd1} \\
-\cross{NSUP}{halfExtendedSubResultantGcd2} &
-\cross{NSUP}{hash} \\
+\cross{NSUP}{halfExtendedSubResultantGcd1} &
+\cross{NSUP}{halfExtendedSubResultantGcd2} \\
+\cross{NSUP}{hash} &
 \cross{NSUP}{init} &
 \cross{NSUP}{integrate} \\
 \cross{NSUP}{isExpt} &
-\cross{NSUP}{isPlus} \\
-\cross{NSUP}{isTimes} &
-\cross{NSUP}{karatsubaDivide} \\
+\cross{NSUP}{isPlus} &
+\cross{NSUP}{isTimes} \\
+\cross{NSUP}{karatsubaDivide} &
 \cross{NSUP}{lastSubResultant} &
 \cross{NSUP}{latex} \\
 \cross{NSUP}{lazyPseudoDivide} &
-\cross{NSUP}{lazyPseudoQuotient} \\
-\cross{NSUP}{lazyPseudoRemainder} &
-\cross{NSUP}{lazyResidueClass} \\
+\cross{NSUP}{lazyPseudoQuotient} &
+\cross{NSUP}{lazyPseudoRemainder} \\
+\cross{NSUP}{lazyResidueClass} &
 \cross{NSUP}{lcm} &
 \cross{NSUP}{leadingCoefficient} \\
 \cross{NSUP}{leadingMonomial} &
-\cross{NSUP}{mainVariable} \\
-\cross{NSUP}{makeSUP} &
-\cross{NSUP}{map} \\
+\cross{NSUP}{mainVariable} &
+\cross{NSUP}{makeSUP} \\
+\cross{NSUP}{map} &
 \cross{NSUP}{mapExponents} &
 \cross{NSUP}{max} \\
 \cross{NSUP}{min} &
-\cross{NSUP}{minimumDegree} \\
-\cross{NSUP}{monicDivide} &
-\cross{NSUP}{monicModulo} \\
+\cross{NSUP}{minimumDegree} &
+\cross{NSUP}{monicDivide} \\
+\cross{NSUP}{monicModulo} &
 \cross{NSUP}{monomial} &
 \cross{NSUP}{monomial?} \\
 \cross{NSUP}{monomials} &
-\cross{NSUP}{multiEuclidean} \\
-\cross{NSUP}{multiplyExponents} &
-\cross{NSUP}{multivariate} \\
+\cross{NSUP}{multiEuclidean} &
+\cross{NSUP}{multiplyExponents} \\
+\cross{NSUP}{multivariate} &
 \cross{NSUP}{nextItem} &
 \cross{NSUP}{numberOfMonomials} \\
 \cross{NSUP}{one?} &
-\cross{NSUP}{order} \\
-\cross{NSUP}{patternMatch} &
-\cross{NSUP}{pomopo!} \\
+\cross{NSUP}{order} &
+\cross{NSUP}{patternMatch} \\
+\cross{NSUP}{pomopo!} &
 \cross{NSUP}{prime?} &
 \cross{NSUP}{primitiveMonomials} \\
 \cross{NSUP}{primitivePart} &
-\cross{NSUP}{principalIdeal} \\
-\cross{NSUP}{pseudoDivide} &
-\cross{NSUP}{pseudoQuotient} \\
+\cross{NSUP}{principalIdeal} &
+\cross{NSUP}{pseudoDivide} \\
+\cross{NSUP}{pseudoQuotient} &
 \cross{NSUP}{pseudoRemainder} &
 \cross{NSUP}{recip} \\
 \cross{NSUP}{reducedSystem} &
-\cross{NSUP}{reductum} \\
-\cross{NSUP}{resultant} &
-\cross{NSUP}{retract} \\
+\cross{NSUP}{reductum} &
+\cross{NSUP}{resultant} \\
+\cross{NSUP}{retract} &
 \cross{NSUP}{retractIfCan} &
 \cross{NSUP}{sample} \\
 \cross{NSUP}{separate} &
-\cross{NSUP}{shiftLeft} \\
-\cross{NSUP}{shiftRight} &
-\cross{NSUP}{sizeLess?} \\
+\cross{NSUP}{shiftLeft} &
+\cross{NSUP}{shiftRight} \\
+\cross{NSUP}{sizeLess?} &
 \cross{NSUP}{solveLinearPolynomialEquation} &
 \cross{NSUP}{squareFree} \\
 \cross{NSUP}{squareFreePart} &
-\cross{NSUP}{squareFreePolynomial} \\
-\cross{NSUP}{subResultantGcd} &
-\cross{NSUP}{subResultantsChain} \\
+\cross{NSUP}{squareFreePolynomial} &
+\cross{NSUP}{subResultantGcd} \\
+\cross{NSUP}{subResultantsChain} &
 \cross{NSUP}{subtractIfCan} &
 \cross{NSUP}{totalDegree} \\
 \cross{NSUP}{totalDegree} &
-\cross{NSUP}{unit?} \\
-\cross{NSUP}{unitCanonical} &
-\cross{NSUP}{unitNormal} \\
+\cross{NSUP}{unit?} &
+\cross{NSUP}{unitCanonical} \\
+\cross{NSUP}{unitNormal} &
 \cross{NSUP}{univariate} &
 \cross{NSUP}{unmakeSUP} \\
 \cross{NSUP}{variables} &
-\cross{NSUP}{vectorise} \\
-\cross{NSUP}{zero?} &
-\cross{NSUP}{?*?} \\
+\cross{NSUP}{vectorise} &
+\cross{NSUP}{zero?} \\
+\cross{NSUP}{?*?} &
 \cross{NSUP}{?**?} &
 \cross{NSUP}{?+?} \\
 \cross{NSUP}{?-?} &
-\cross{NSUP}{-?} \\
-\cross{NSUP}{?=?} &
-\cross{NSUP}{?\^{}?} \\
+\cross{NSUP}{-?} &
+\cross{NSUP}{?=?} \\
+\cross{NSUP}{?\^{}?} &
 \cross{NSUP}{?.?} &
 \cross{NSUP}{?\~{}=?} \\
 \cross{NSUP}{?/?} &
-\cross{NSUP}{?$<$?} \\
-\cross{NSUP}{?$<=$?} &
-\cross{NSUP}{?$>$?} \\
+\cross{NSUP}{?$<$?} &
+\cross{NSUP}{?$<=$?} \\
+\cross{NSUP}{?$>$?} &
 \cross{NSUP}{?$>=$?} &
 \cross{NSUP}{?quo?} \\
-\cross{NSUP}{?rem?} &
+\cross{NSUP}{?rem?} &&
 \end{tabular}
 
 <<domain NSUP NewSparseUnivariatePolynomial>>=
@@ -61024,6 +61081,7 @@ ODEIntensityFunctionsTable(): E == I where
 @
 <<ODEIFTBL.dotabb>>=
 "ODEIFTBL" [color="#88FF44",href="bookvol10.3.pdf#nameddest=ODEIFTBL"]
+"Domain" [color="#88FF44"]
 "ODEIFTBL" -> "Domain"
 
 @
@@ -61460,13 +61518,13 @@ OnePointCompletion(R:SetCategory): Exports == Implementation where
 \pageto{OpenMathDevice}{OMDEV}
 
 {\bf Exports:}\\
-\begin{tabular}{llllll}
+\begin{tabular}{llll}
 \cross{OMCONN}{OMbindTCP} &
 \cross{OMCONN}{OMcloseConn} &
 \cross{OMCONN}{OMconnectTCP} &
-\cross{OMCONN}{OMconnInDevice} &
+\cross{OMCONN}{OMconnInDevice} \\
 \cross{OMCONN}{OMconnOutDevice} &
-\cross{OMCONN}{OMmakeConn} 
+\cross{OMCONN}{OMmakeConn} &&
 \end{tabular}
 
 <<domain OMCONN OpenMathConnection>>=
@@ -61508,6 +61566,7 @@ OpenMathConnection(): with
 @
 <<OMCONN.dotabb>>=
 "OMCONN" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OMCONN"]
+"Domain" [color="#88FF44"]
 "OMCONN" -> "Domain"
 
 @
@@ -61520,23 +61579,23 @@ OpenMathConnection(): with
 \pageto{OpenMathConnection}{OMCONN}
 
 {\bf Exports:}\\
-\begin{tabular}{lllll}
+\begin{tabular}{llll}
 \cross{OMDEV}{OMclose} &
 \cross{OMDEV}{OMgetApp} &
 \cross{OMDEV}{OMgetAtp} &
-\cross{OMDEV}{OMgetAttr} &
-\cross{OMDEV}{OMgetBVar} \\
+\cross{OMDEV}{OMgetAttr} \\
+\cross{OMDEV}{OMgetBVar} &
 \cross{OMDEV}{OMgetBind} &
 \cross{OMDEV}{OMgetEndApp} &
-\cross{OMDEV}{OMgetEndAtp} &
+\cross{OMDEV}{OMgetEndAtp} \\
 \cross{OMDEV}{OMgetEndAttr} &
-\cross{OMDEV}{OMgetEndBVar} \\
+\cross{OMDEV}{OMgetEndBVar} &
 \cross{OMDEV}{OMgetEndBind} &
-\cross{OMDEV}{OMgetEndError} &
+\cross{OMDEV}{OMgetEndError} \\
 \cross{OMDEV}{OMgetEndObject} &
 \cross{OMDEV}{OMgetError} &
-\cross{OMDEV}{OMgetFloat} \\
-\cross{OMDEV}{OMgetInteger} &
+\cross{OMDEV}{OMgetFloat} &
+\cross{OMDEV}{OMgetInteger} \\
 \cross{OMDEV}{OMgetObject} &
 \cross{OMDEV}{OMgetString} &
 \cross{OMDEV}{OMgetType} &
@@ -61544,26 +61603,26 @@ OpenMathConnection(): with
 \cross{OMDEV}{OMputApp} &
 \cross{OMDEV}{OMputAtp} &
 \cross{OMDEV}{OMputAttr} &
-\cross{OMDEV}{OMputBVar} &
-\cross{OMDEV}{OMputBind} \\
+\cross{OMDEV}{OMputBVar} \\
+\cross{OMDEV}{OMputBind} &
 \cross{OMDEV}{OMputEndApp} &
 \cross{OMDEV}{OMputEndAtp} &
-\cross{OMDEV}{OMputEndAttr} &
+\cross{OMDEV}{OMputEndAttr} \\
 \cross{OMDEV}{OMputEndBVar} &
-\cross{OMDEV}{OMputEndBind} \\
+\cross{OMDEV}{OMputEndBind} &
 \cross{OMDEV}{OMputEndError} &
-\cross{OMDEV}{OMputEndObject} &
+\cross{OMDEV}{OMputEndObject} \\
 \cross{OMDEV}{OMputError} &
 \cross{OMDEV}{OMputObject} &
-\cross{OMDEV}{OMputString} \\
-\cross{OMDEV}{OMgetSymbol} &
+\cross{OMDEV}{OMputString} &
+\cross{OMDEV}{OMgetSymbol} \\
 \cross{OMDEV}{OMopenFile} &
 \cross{OMDEV}{OMopenString} &
 \cross{OMDEV}{OMputFloat} &
 \cross{OMDEV}{OMputInteger} \\
 \cross{OMDEV}{OMputSymbol} &
 \cross{OMDEV}{OMputVariable} &
-\cross{OMDEV}{OMsetEncoding} &&
+\cross{OMDEV}{OMsetEncoding} &
 \end{tabular}
 
 <<domain OMDEV OpenMathDevice>>=
@@ -61734,6 +61793,7 @@ OpenMathDevice(): with
 @
 <<OMDEV.dotabb>>=
 "OMDEV" [color="#88FF44",href="bookvol10.3.pdf#nameddest=OMDEV"]
+"Domain" [color="#88FF44"]
 "OMDEV" -> "Domain"
 
 @
@@ -61746,16 +61806,16 @@ OpenMathDevice(): with
 \pageto{OpenMathConnection}{OMCONN}
 
 {\bf Exports:}\\
-\begin{tabular}{lllllllll}
+\begin{tabular}{lllll}
 \cross{OMENC}{coerce} &
 \cross{OMENC}{hash} &
 \cross{OMENC}{latex} &
 \cross{OMENC}{OMencodingBinary} &
-\cross{OMENC}{OMencodingSGML} &
+\cross{OMENC}{OMencodingSGML} \\
 \cross{OMENC}{OMencodingUnknown} &
 \cross{OMENC}{OMencodingXML} &
 \cross{OMENC}{?=?} &
-\cross{OMENC}{?\~{}=?} 
+\cross{OMENC}{?\~{}=?} &
 \end{tabular}
 
 <<domain OMENC OpenMathEncoding>>=
@@ -61818,12 +61878,12 @@ OpenMathEncoding(): SetCategory with
 \pageto{OpenMathErrorKind}{OMERRK}
 
 {\bf Exports:}\\
-\begin{tabular}{llllllll}
+\begin{tabular}{lllll}
 \cross{OMERR}{coerce} &
 \cross{OMERR}{errorInfo} &
 \cross{OMERR}{errorKind} &
 \cross{OMERR}{hash} &
-\cross{OMERR}{latex} &
+\cross{OMERR}{latex} \\
 \cross{OMERR}{omError} &
 \cross{OMERR}{?=?} &
 \cross{OMERR}{?~=?} 
@@ -64826,23 +64886,23 @@ OutputForm(): SetCategory with
 \pageto{BalancedPAdicRational}{BPADICRT}
 
 {\bf Exports:}\\
-\begin{tabular}{lllll}
+\begin{tabular}{llll}
 \cross{PADIC}{0} &
 \cross{PADIC}{1} &
 \cross{PADIC}{approximate} &
-\cross{PADIC}{associates?} &
-\cross{PADIC}{characteristic} \\
+\cross{PADIC}{associates?} \\
+\cross{PADIC}{characteristic} &
 \cross{PADIC}{coerce} &
 \cross{PADIC}{complete} &
-\cross{PADIC}{digits} &
+\cross{PADIC}{digits} \\
 \cross{PADIC}{divide} &
-\cross{PADIC}{euclideanSize} \\
+\cross{PADIC}{euclideanSize} &
 \cross{PADIC}{expressIdealMember} &
-\cross{PADIC}{exquo} &
+\cross{PADIC}{exquo} \\
 \cross{PADIC}{extend} &
 \cross{PADIC}{extendedEuclidean} &
-\cross{PADIC}{gcd} \\
-\cross{PADIC}{gcdPolynomial} &
+\cross{PADIC}{gcd} &
+\cross{PADIC}{gcdPolynomial} \\
 \cross{PADIC}{hash} &
 \cross{PADIC}{latex} &
 \cross{PADIC}{lcm} &
@@ -64850,19 +64910,19 @@ OutputForm(): SetCategory with
 \cross{PADIC}{moduloP} &
 \cross{PADIC}{modulus} &
 \cross{PADIC}{multiEuclidean} &
-\cross{PADIC}{one?} &
-\cross{PADIC}{order} \\
+\cross{PADIC}{one?} \\
+\cross{PADIC}{order} &
 \cross{PADIC}{principalIdeal} &
 \cross{PADIC}{quotientByP} &
-\cross{PADIC}{recip} &
+\cross{PADIC}{recip} \\
 \cross{PADIC}{root} &
-\cross{PADIC}{sample} \\
+\cross{PADIC}{sample} &
 \cross{PADIC}{sizeLess?} &
-\cross{PADIC}{sqrt} &
+\cross{PADIC}{sqrt} \\
 \cross{PADIC}{subtractIfCan} &
 \cross{PADIC}{unit?} &
-\cross{PADIC}{unitCanonical} \\
-\cross{PADIC}{unitNormal} &
+\cross{PADIC}{unitCanonical} &
+\cross{PADIC}{unitNormal} \\
 \cross{PADIC}{zero?} &
 \cross{PADIC}{?*?} &
 \cross{PADIC}{?**?} &
@@ -64870,10 +64930,10 @@ OutputForm(): SetCategory with
 \cross{PADIC}{?-?} &
 \cross{PADIC}{-?} &
 \cross{PADIC}{?=?} &
-\cross{PADIC}{?\^{}?} &
-\cross{PADIC}{?\~{}=?} \\
+\cross{PADIC}{?\^{}?} \\
+\cross{PADIC}{?\~{}=?} &
 \cross{PADIC}{?quo?} &
-\cross{PADIC}{?rem?} &&&
+\cross{PADIC}{?rem?} &
 \end{tabular}
 
 <<domain PADIC PAdicInteger>>=
@@ -65035,88 +65095,88 @@ PAdicRational(p:Integer) == PAdicRationalConstructor(p,PAdicInteger p)
 \pageto{BalancedPAdicRational}{BPADICRT}
 
 {\bf Exports:}\\
-\begin{tabular}{llll}
+\begin{tabular}{lll}
 \cross{PADICRC}{0} &
 \cross{PADICRC}{1} &
-\cross{PADICRC}{abs} &
-\cross{PADICRC}{approximate} \\
+\cross{PADICRC}{abs} \\
+\cross{PADICRC}{approximate} &
 \cross{PADICRC}{associates?} &
-\cross{PADICRC}{ceiling} &
+\cross{PADICRC}{ceiling} \\
 \cross{PADICRC}{characteristic} &
-\cross{PADICRC}{charthRoot} \\
-\cross{PADICRC}{coerce} &
+\cross{PADICRC}{charthRoot} &
+\cross{PADICRC}{coerce} \\
 \cross{PADICRC}{conditionP} &
 \cross{PADICRC}{continuedFraction} &
 \cross{PADICRC}{convert} \\
 \cross{PADICRC}{D} &
 \cross{PADICRC}{denom} &
-\cross{PADICRC}{denominator} &
-\cross{PADICRC}{differentiate} \\
+\cross{PADICRC}{denominator} \\
+\cross{PADICRC}{differentiate} &
 \cross{PADICRC}{divide} &
-\cross{PADICRC}{euclideanSize} &
+\cross{PADICRC}{euclideanSize} \\
 \cross{PADICRC}{eval} &
-\cross{PADICRC}{expressIdealMember} \\
-\cross{PADICRC}{exquo} &
+\cross{PADICRC}{expressIdealMember} &
+\cross{PADICRC}{exquo} \\
 \cross{PADICRC}{extendedEuclidean} &
 \cross{PADICRC}{factor} &
 \cross{PADICRC}{factorPolynomial} \\
 \cross{PADICRC}{factorSquareFreePolynomial} &
 \cross{PADICRC}{floor} &
-\cross{PADICRC}{fractionPart} &
-\cross{PADICRC}{gcd} \\
-\cross{PADICRC}{gcdPolynomial} &
+\cross{PADICRC}{fractionPart} \\
 \cross{PADICRC}{gcd} &
+\cross{PADICRC}{gcdPolynomial} &
+\cross{PADICRC}{gcd} \\
 \cross{PADICRC}{hash} &
-\cross{PADICRC}{init} \\
-\cross{PADICRC}{inv} &
+\cross{PADICRC}{init} &
+\cross{PADICRC}{inv} \\
 \cross{PADICRC}{latex} &
 \cross{PADICRC}{lcm} &
 \cross{PADICRC}{map} \\
 \cross{PADICRC}{max} &
 \cross{PADICRC}{min} &
-\cross{PADICRC}{multiEuclidean} &
-\cross{PADICRC}{negative?} \\
+\cross{PADICRC}{multiEuclidean} \\
+\cross{PADICRC}{negative?} &
 \cross{PADICRC}{nextItem} &
-\cross{PADICRC}{numer} &
+\cross{PADICRC}{numer} \\
 \cross{PADICRC}{numerator} &
-\cross{PADICRC}{one?} \\
-\cross{PADICRC}{patternMatch} &
+\cross{PADICRC}{one?} &
+\cross{PADICRC}{patternMatch} \\
 \cross{PADICRC}{positive?} &
 \cross{PADICRC}{prime?} &
 \cross{PADICRC}{principalIdeal} \\
 \cross{PADICRC}{random} &
 \cross{PADICRC}{recip} &
-\cross{PADICRC}{reducedSystem} &
-\cross{PADICRC}{removeZeroes} \\
+\cross{PADICRC}{reducedSystem} \\
+\cross{PADICRC}{removeZeroes} &
 \cross{PADICRC}{retract} &
-\cross{PADICRC}{retractIfCan} &
+\cross{PADICRC}{retractIfCan} \\
 \cross{PADICRC}{sample} &
-\cross{PADICRC}{sign} \\
-\cross{PADICRC}{sizeLess?} &
+\cross{PADICRC}{sign} &
+\cross{PADICRC}{sizeLess?} \\
 \cross{PADICRC}{solveLinearPolynomialEquation} &
 \cross{PADICRC}{squareFree} &
 \cross{PADICRC}{squareFreePart} \\
 \cross{PADICRC}{squareFreePolynomial} &
 \cross{PADICRC}{subtractIfCan} &
-\cross{PADICRC}{unit?} &
-\cross{PADICRC}{unitCanonical} \\
+\cross{PADICRC}{unit?} \\
+\cross{PADICRC}{unitCanonical} &
 \cross{PADICRC}{unitNormal} &
-\cross{PADICRC}{wholePart} &
+\cross{PADICRC}{wholePart} \\
 \cross{PADICRC}{zero?} &
-\cross{PADICRC}{?*?} \\
-\cross{PADICRC}{?**?} &
+\cross{PADICRC}{?*?} &
+\cross{PADICRC}{?**?} \\
 \cross{PADICRC}{?+?} &
 \cross{PADICRC}{?-?} &
 \cross{PADICRC}{-?} \\
 \cross{PADICRC}{?/?} &
 \cross{PADICRC}{?=?} &
-\cross{PADICRC}{?\^{}?} &
-\cross{PADICRC}{?\~{}=?} \\
+\cross{PADICRC}{?\^{}?} \\
+\cross{PADICRC}{?\~{}=?} &
 \cross{PADICRC}{?$<$?} &
-\cross{PADICRC}{?$<=$?} &
+\cross{PADICRC}{?$<=$?} \\
 \cross{PADICRC}{?$>$?} &
-\cross{PADICRC}{?$>=$?} \\
-\cross{PADICRC}{?.?} &
+\cross{PADICRC}{?$>=$?} &
+\cross{PADICRC}{?.?} \\
 \cross{PADICRC}{?quo?} &
 \cross{PADICRC}{?rem?} &
 \end{tabular}
@@ -81186,6 +81246,25 @@ Ruleset(Base, R, F): Exports == Implementation where
 \section{domain FORMULA ScriptFormulaFormat}
 \pagehead{ScriptFormulaFormat}{FORMULA}
 \pagepic{ps/v103scriptformulaformat.ps}{FORMULA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{FORMULA}{coerce} &
+\cross{FORMULA}{display} &
+\cross{FORMULA}{epilogue} &
+\cross{FORMULA}{formula} &
+\cross{FORMULA}{hash} \\
+\cross{FORMULA}{latex} &
+\cross{FORMULA}{new} &
+\cross{FORMULA}{prologue} &
+\cross{FORMULA}{convert} &
+\cross{FORMULA}{setEpilogue!} \\
+\cross{FORMULA}{setFormula!} &
+\cross{FORMULA}{setPrologue!} &
+\cross{FORMULA}{?=?} &
+\cross{FORMULA}{?\~{}=?} &
+\end{tabular}
+
 <<domain FORMULA ScriptFormulaFormat>>=
 )abbrev domain FORMULA ScriptFormulaFormat
 ++ Author: Robert S. Sutor
@@ -81796,6 +81875,27 @@ o )show Segment
 {\bf See}\\
 \pageto{SegmentBinding}{SEGBIND}
 \pageto{UniversalSegment}{UNISEG}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SEG}{BY} &
+\cross{SEG}{coerce} &
+\cross{SEG}{convert} &
+\cross{SEG}{expand} &
+\cross{SEG}{hash} \\
+\cross{SEG}{hi} &
+\cross{SEG}{high} &
+\cross{SEG}{incr} &
+\cross{SEG}{latex} &
+\cross{SEG}{lo} \\
+\cross{SEG}{low} &
+\cross{SEG}{map} &
+\cross{SEG}{segment} &
+\cross{SEG}{?=?} &
+\cross{SEG}{?\~{}=?} \\
+\cross{SEG}{?..?} &&&&
+\end{tabular}
+
 <<domain SEG Segment>>=
 )abbrev domain SEG Segment
 ++ Author:  Stephen M. Watt
@@ -81997,6 +82097,19 @@ o )show SegmentBinding
 {\bf See}\\
 \pageto{Segment}{SEG}
 \pageto{UniversalSegment}{UNISEG}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SEGBIND}{coerce} &
+\cross{SEGBIND}{equation} &
+\cross{SEGBIND}{hash} &
+\cross{SEGBIND}{latex} &
+\cross{SEGBIND}{segment} \\
+\cross{SEGBIND}{variable} &
+\cross{SEGBIND}{?=?} &
+\cross{SEGBIND}{?\~{}=?} &&
+\end{tabular}
+
 <<domain SEGBIND SegmentBinding>>=
 )abbrev domain SEGBIND SegmentBinding
 ++ Author:
@@ -82358,6 +82471,65 @@ o )show Set
 @
 \pagehead{Set}{SET}
 \pagepic{ps/v103set.ps}{SET}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SET}{any?} &
+\cross{SET}{bag} &
+\cross{SET}{brace} &
+\cross{SET}{cardinality} &
+\cross{SET}{coerce} \\
+\cross{SET}{complement} &
+\cross{SET}{construct} &
+\cross{SET}{convert} &
+\cross{SET}{copy} &
+\cross{SET}{count} \\
+\cross{SET}{dictionary} &
+\cross{SET}{difference} &
+\cross{SET}{empty} &
+\cross{SET}{empty?} &
+\cross{SET}{eq?} \\
+\cross{SET}{eval} &
+\cross{SET}{every?} &
+\cross{SET}{extract!} &
+\cross{SET}{find} &
+\cross{SET}{hash} \\
+\cross{SET}{index} &
+\cross{SET}{insert!} &
+\cross{SET}{inspect} &
+\cross{SET}{intersect} &
+\cross{SET}{latex} \\
+\cross{SET}{less?} &
+\cross{SET}{lookup} &
+\cross{SET}{map} &
+\cross{SET}{map!} &
+\cross{SET}{max} \\
+\cross{SET}{member?} &
+\cross{SET}{members} &
+\cross{SET}{min} &
+\cross{SET}{more?} &
+\cross{SET}{parts} \\
+\cross{SET}{random} &
+\cross{SET}{reduce} &
+\cross{SET}{remove} &
+\cross{SET}{remove!} &
+\cross{SET}{removeDuplicates} \\
+\cross{SET}{sample} &
+\cross{SET}{select} &
+\cross{SET}{select!} &
+\cross{SET}{set} &
+\cross{SET}{size} \\
+\cross{SET}{size?} &
+\cross{SET}{subset?} &
+\cross{SET}{symmetricDifference} &
+\cross{SET}{union} &
+\cross{SET}{universe} \\
+\cross{SET}{\#{}?} &
+\cross{SET}{?\~{}=?} &
+\cross{SET}{?$<$?} &
+\cross{SET}{?=?} &
+\end{tabular}
+
 <<domain SET Set>>=
 )abbrev domain SET Set
 ++ Author: Michael Monagan; revised by Richard Jenks
@@ -82546,6 +82718,27 @@ Set(S:SetCategory): FiniteSetAggregate S == add
 \section{domain SETMN SetOfMIntegersInOneToN}
 \pagehead{SetOfMIntegersInOneToN}{SETMN}
 \pagepic{ps/v103setofmintegersinoneton.ps}{SETMN}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SETMN}{coerce} &
+\cross{SETMN}{delta} &
+\cross{SETMN}{elements} &
+\cross{SETMN}{enumerate} &
+\cross{SETMN}{hash} \\
+\cross{SETMN}{incrementKthElement} &
+\cross{SETMN}{index} &
+\cross{SETMN}{latex} &
+\cross{SETMN}{lookup} &
+\cross{SETMN}{member?} \\
+\cross{SETMN}{random} &
+\cross{SETMN}{replaceKthElement} &
+\cross{SETMN}{setOfMinN} &
+\cross{SETMN}{size} &
+\cross{SETMN}{?=?} \\
+\cross{SETMN}{?\~{}=?} &&&&
+\end{tabular}
+
 <<domain SETMN SetOfMIntegersInOneToN>>=
 )abbrev domain SETMN SetOfMIntegersInOneToN
 ++ Author: Manuel Bronstein
@@ -82707,6 +82900,103 @@ SetOfMIntegersInOneToN(m, n): Exports == Implementation where
 \pageto{SequentialDifferentialVariable}{SDVAR}
 \pageto{DifferentialSparseMultivariatePolynomial}{DSMP}
 \pageto{OrderlyDifferentialPolynomial}{ODPOL}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{SDPOL}{0} &
+\cross{SDPOL}{1} &
+\cross{SDPOL}{associates?} \\
+\cross{SDPOL}{binomThmExpt} &
+\cross{SDPOL}{characteristic} &
+\cross{SDPOL}{charthRoot} \\
+\cross{SDPOL}{coefficient} &
+\cross{SDPOL}{coefficients} &
+\cross{SDPOL}{coerce} \\
+\cross{SDPOL}{conditionP} &
+\cross{SDPOL}{content} &
+\cross{SDPOL}{convert} \\
+\cross{SDPOL}{D} &
+\cross{SDPOL}{degree} &
+\cross{SDPOL}{differentialVariables} \\
+\cross{SDPOL}{differentiate} &
+\cross{SDPOL}{discriminant} &
+\cross{SDPOL}{eval} \\
+\cross{SDPOL}{exquo} &
+\cross{SDPOL}{factor} &
+\cross{SDPOL}{factorPolynomial} \\
+\cross{SDPOL}{factorSquareFreePolynomial} &
+\cross{SDPOL}{gcd} &
+\cross{SDPOL}{gcdPolynomial} \\
+\cross{SDPOL}{ground} &
+\cross{SDPOL}{ground?} &
+\cross{SDPOL}{hash} \\
+\cross{SDPOL}{initial} &
+\cross{SDPOL}{isExpt} &
+\cross{SDPOL}{isobaric?} \\
+\cross{SDPOL}{isPlus} &
+\cross{SDPOL}{isTimes} &
+\cross{SDPOL}{latex} \\
+\cross{SDPOL}{lcm} &
+\cross{SDPOL}{leader} &
+\cross{SDPOL}{leadingCoefficient} \\
+\cross{SDPOL}{leadingMonomial} &
+\cross{SDPOL}{mainVariable} &
+\cross{SDPOL}{makeVariable} \\
+\cross{SDPOL}{map} &
+\cross{SDPOL}{mapExponents} &
+\cross{SDPOL}{max} \\
+\cross{SDPOL}{min} &
+\cross{SDPOL}{minimumDegree} &
+\cross{SDPOL}{monicDivide} \\
+\cross{SDPOL}{monomial} &
+\cross{SDPOL}{monomial?} &
+\cross{SDPOL}{monomials} \\
+\cross{SDPOL}{multivariate} &
+\cross{SDPOL}{numberOfMonomials} &
+\cross{SDPOL}{one?} \\
+\cross{SDPOL}{order} &
+\cross{SDPOL}{patternMatch} &
+\cross{SDPOL}{pomopo!} \\
+\cross{SDPOL}{prime?} &
+\cross{SDPOL}{primitiveMonomials} &
+\cross{SDPOL}{primitivePart} \\
+\cross{SDPOL}{recip} &
+\cross{SDPOL}{reducedSystem} &
+\cross{SDPOL}{reductum} \\
+\cross{SDPOL}{resultant} &
+\cross{SDPOL}{retract} &
+\cross{SDPOL}{retractIfCan} \\
+\cross{SDPOL}{sample} &
+\cross{SDPOL}{separant} &
+\cross{SDPOL}{solveLinearPolynomialEquation} \\
+\cross{SDPOL}{squareFree} &
+\cross{SDPOL}{squareFreePart} &
+\cross{SDPOL}{squareFreePolynomial} \\
+\cross{SDPOL}{subtractIfCan} &
+\cross{SDPOL}{totalDegree} &
+\cross{SDPOL}{unit?} \\
+\cross{SDPOL}{unitCanonical} &
+\cross{SDPOL}{unitNormal} &
+\cross{SDPOL}{univariate} \\
+\cross{SDPOL}{variables} &
+\cross{SDPOL}{weight} &
+\cross{SDPOL}{weights} \\
+\cross{SDPOL}{zero?} &
+\cross{SDPOL}{?\^{}?} &
+\cross{SDPOL}{?*?} \\
+\cross{SDPOL}{?**?} &
+\cross{SDPOL}{?+?} &
+\cross{SDPOL}{?-?} \\
+\cross{SDPOL}{-?} &
+\cross{SDPOL}{?=?} &
+\cross{SDPOL}{?\~{}=?} \\
+\cross{SDPOL}{?/?} &
+\cross{SDPOL}{?$<$?} &
+\cross{SDPOL}{?$<=$?} \\
+\cross{SDPOL}{?$>$?} &
+\cross{SDPOL}{?$>=$?} &
+\end{tabular}
+
 <<domain SDPOL SequentialDifferentialPolynomial>>=
 )abbrev domain SDPOL SequentialDifferentialPolynomial
 ++ Author:  William Sit
@@ -82755,6 +83045,29 @@ SequentialDifferentialPolynomial(R):
 \pageto{DifferentialSparseMultivariatePolynomial}{DSMP}
 \pageto{OrderlyDifferentialPolynomial}{ODPOL}
 \pageto{SequentialDifferentialPolynomial}{SDPOL}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SDVAR}{coerce} &
+\cross{SDVAR}{differentiate} &
+\cross{SDVAR}{hash} &
+\cross{SDVAR}{latex} &
+\cross{SDVAR}{makeVariable} \\
+\cross{SDVAR}{max} &
+\cross{SDVAR}{min} &
+\cross{SDVAR}{order} &
+\cross{SDVAR}{retract} &
+\cross{SDVAR}{retractIfCan} \\
+\cross{SDVAR}{variable} &
+\cross{SDVAR}{weight} &
+\cross{SDVAR}{?\~{}=?} &
+\cross{SDVAR}{?$<$?} &
+\cross{SDVAR}{?$<=$?} \\
+\cross{SDVAR}{?=?} &
+\cross{SDVAR}{?$>$?} &
+\cross{SDVAR}{?$>=$?} &&
+\end{tabular}
+
 <<domain SDVAR SequentialDifferentialVariable>>=
 )abbrev domain SDVAR SequentialDifferentialVariable
 ++ Author:  William Sit
@@ -82805,6 +83118,36 @@ SequentialDifferentialVariable(S:OrderedSet):DifferentialVariableCategory(S)
 \pagepic{ps/v103sexpression.ps}{SEX}{1.00}
 {\bf See}\\
 \pageto{SExpressionOf}{SEXOF}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SEX}{atom?} &
+\cross{SEX}{car} &
+\cross{SEX}{cdr} &
+\cross{SEX}{coerce} &
+\cross{SEX}{convert} \\
+\cross{SEX}{destruct} &
+\cross{SEX}{eq} &
+\cross{SEX}{expr} &
+\cross{SEX}{float} &
+\cross{SEX}{float?} \\
+\cross{SEX}{hash} &
+\cross{SEX}{integer} &
+\cross{SEX}{integer?} &
+\cross{SEX}{latex} &
+\cross{SEX}{list?} \\
+\cross{SEX}{null?} &
+\cross{SEX}{pair?} &
+\cross{SEX}{string} &
+\cross{SEX}{string?} &
+\cross{SEX}{symbol} \\
+\cross{SEX}{symbol?} &
+\cross{SEX}{\#{}?} &
+\cross{SEX}{?.?} &
+\cross{SEX}{?=?} &
+\cross{SEX}{?\~{}=?} 
+\end{tabular}
+
 <<domain SEX SExpression>>=
 )abbrev domain SEX SExpression
 ++ Domain for the standard Lisp values
@@ -82829,6 +83172,36 @@ SExpression()
 \pagepic{ps/v103sexpressionof.ps}{SEXOF}{1.00}
 {\bf See}\\
 \pageto{SExpression}{SEX}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SEXOF}{atom?} &
+\cross{SEXOF}{car} &
+\cross{SEXOF}{cdr} &
+\cross{SEXOF}{coerce} &
+\cross{SEXOF}{convert} \\
+\cross{SEXOF}{destruct} &
+\cross{SEXOF}{eq} &
+\cross{SEXOF}{expr} &
+\cross{SEXOF}{float} &
+\cross{SEXOF}{float?} \\
+\cross{SEXOF}{hash} &
+\cross{SEXOF}{integer} &
+\cross{SEXOF}{integer?} &
+\cross{SEXOF}{latex} &
+\cross{SEXOF}{list?} \\
+\cross{SEXOF}{null?} &
+\cross{SEXOF}{pair?} &
+\cross{SEXOF}{string} &
+\cross{SEXOF}{string?} &
+\cross{SEXOF}{symbol} \\
+\cross{SEXOF}{symbol?} &
+\cross{SEXOF}{\#{}?} &
+\cross{SEXOF}{?.?} &
+\cross{SEXOF}{?=?} &
+\cross{SEXOF}{?\~{}=?} 
+\end{tabular}
+
 <<domain SEXOF SExpressionOf>>=
 )abbrev domain SEXOF SExpressionOf
 ++ Domain for Lisp values over arbitrary atomic types
@@ -82910,6 +83283,92 @@ SExpressionOf(Str, Sym, Int, Flt, Expr): Decl == Body where
 \section{domain SAE SimpleAlgebraicExtension}
 \pagehead{SimpleAlgebraicExtension}{SAE}
 \pagepic{ps/v103simplealgebraicextension.ps}{SAE}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{SAE}{0} &
+\cross{SAE}{1} &
+\cross{SAE}{associates?} \\
+\cross{SAE}{basis} &
+\cross{SAE}{characteristic} &
+\cross{SAE}{characteristicPolynomial} \\
+\cross{SAE}{charthRoot} &
+\cross{SAE}{coerce} &
+\cross{SAE}{conditionP} \\
+\cross{SAE}{convert} &
+\cross{SAE}{coordinates} &
+\cross{SAE}{createPrimitiveElement} \\
+\cross{SAE}{D} &
+\cross{SAE}{definingPolynomial} &
+\cross{SAE}{derivationCoordinates} \\
+\cross{SAE}{differentiate} &
+\cross{SAE}{discreteLog} &
+\cross{SAE}{discriminant} \\
+\cross{SAE}{divide} &
+\cross{SAE}{euclideanSize} &
+\cross{SAE}{expressIdealMember} \\
+\cross{SAE}{exquo} &
+\cross{SAE}{extendedEuclidean} &
+\cross{SAE}{factor} \\
+\cross{SAE}{factorsOfCyclicGroupSize} &
+\cross{SAE}{gcd} &
+\cross{SAE}{gcdPolynomial} \\
+\cross{SAE}{generator} &
+\cross{SAE}{hash} &
+\cross{SAE}{index} \\
+\cross{SAE}{init} &
+\cross{SAE}{inv} &
+\cross{SAE}{latex} \\
+\cross{SAE}{lcm} &
+\cross{SAE}{lift} &
+\cross{SAE}{lookup} \\
+\cross{SAE}{minimalPolynomial} &
+\cross{SAE}{multiEuclidean} &
+\cross{SAE}{nextItem} \\
+\cross{SAE}{norm} &
+\cross{SAE}{one?} &
+\cross{SAE}{order} \\
+\cross{SAE}{prime?} &
+\cross{SAE}{primeFrobenius} &
+\cross{SAE}{primitive?} \\
+\cross{SAE}{primitiveElement} &
+\cross{SAE}{principalIdeal} &
+\cross{SAE}{random} \\
+\cross{SAE}{rank} &
+\cross{SAE}{recip} &
+\cross{SAE}{reduce} \\
+\cross{SAE}{reducedSystem} &
+\cross{SAE}{regularRepresentation} &
+\cross{SAE}{representationType} \\
+\cross{SAE}{represents} &
+\cross{SAE}{retract} &
+\cross{SAE}{retractIfCan} \\
+\cross{SAE}{sample} &
+\cross{SAE}{size} &
+\cross{SAE}{sizeLess?} \\
+\cross{SAE}{squareFree} &
+\cross{SAE}{squareFreePart} &
+\cross{SAE}{subtractIfCan} \\
+\cross{SAE}{tableForDiscreteLogarithm} &
+\cross{SAE}{trace} &
+\cross{SAE}{traceMatrix} \\
+\cross{SAE}{unit?} &
+\cross{SAE}{unitCanonical} &
+\cross{SAE}{unitNormal} \\
+\cross{SAE}{zero?} &
+\cross{SAE}{?*?} &
+\cross{SAE}{?**?} \\
+\cross{SAE}{?+?} &
+\cross{SAE}{?-?} &
+\cross{SAE}{-?} \\
+\cross{SAE}{?=?} &
+\cross{SAE}{?\^{}?} &
+\cross{SAE}{?\~{}=?} \\
+\cross{SAE}{?/?} &
+\cross{SAE}{?quo?} &
+\cross{SAE}{?rem?} 
+\end{tabular}
+
 <<domain SAE SimpleAlgebraicExtension>>=
 )abbrev domain SAE SimpleAlgebraicExtension
 ++ Algebraic extension of a ring by a single polynomial
@@ -83108,6 +83567,14 @@ SimpleAlgebraicExtension(R:CommutativeRing,
 \pageto{Switch}{SWITCH}
 \pageto{FortranTemplate}{FTEM}
 \pageto{FortranExpression}{FEXPR}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{SFORT}{coerce} &
+\cross{SFORT}{fortran} &
+\cross{SFORT}{outputAsFortran} 
+\end{tabular}
+
 <<domain SFORT SimpleFortranProgram>>=
 )abbrev domain SFORT SimpleFortranProgram
 -- Because of a bug in the compiler:
@@ -83369,6 +83836,103 @@ o )show SingleInteger
 @
 \pagehead{SingleInteger}{SINT}
 \pagepic{ps/v103singleinteger.ps}{SINT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{SINT}{0} &
+\cross{SINT}{1} &
+\cross{SINT}{abs} &
+\cross{SINT}{addmod} \\
+\cross{SINT}{And} &
+\cross{SINT}{associates?} &
+\cross{SINT}{base} &
+\cross{SINT}{binomial} \\
+\cross{SINT}{bit?} &
+\cross{SINT}{characteristic} &
+\cross{SINT}{coerce} &
+\cross{SINT}{convert} \\
+\cross{SINT}{copy} &
+\cross{SINT}{D} &
+\cross{SINT}{dec} &
+\cross{SINT}{differentiate} \\
+\cross{SINT}{divide} &
+\cross{SINT}{euclideanSize} &
+\cross{SINT}{even?} &
+\cross{SINT}{expressIdealMember} \\
+\cross{SINT}{exquo} &
+\cross{SINT}{extendedEuclidean} &
+\cross{SINT}{factor} &
+\cross{SINT}{factorial} \\
+\cross{SINT}{gcd} &
+\cross{SINT}{gcdPolynomial} &
+\cross{SINT}{hash} &
+\cross{SINT}{inc} \\
+\cross{SINT}{init} &
+\cross{SINT}{invmod} &
+\cross{SINT}{latex} &
+\cross{SINT}{lcm} \\
+\cross{SINT}{length} &
+\cross{SINT}{mask} &
+\cross{SINT}{max} &
+\cross{SINT}{min} \\
+\cross{SINT}{mulmod} &
+\cross{SINT}{multiEuclidean} &
+\cross{SINT}{negative?} &
+\cross{SINT}{nextItem} \\
+\cross{SINT}{Not} &
+\cross{SINT}{not?} &
+\cross{SINT}{odd?} &
+\cross{SINT}{OMwrite} \\
+\cross{SINT}{one?} &
+\cross{SINT}{Or} &
+\cross{SINT}{patternMatch} &
+\cross{SINT}{permutation} \\
+\cross{SINT}{principalIdeal} &
+\cross{SINT}{positive?} &
+\cross{SINT}{positiveRemainder} &
+\cross{SINT}{powmod} \\
+\cross{SINT}{prime?} &
+\cross{SINT}{random} &
+\cross{SINT}{rational} &
+\cross{SINT}{rationalIfCan} \\
+\cross{SINT}{rational?} &
+\cross{SINT}{recip} &
+\cross{SINT}{reducedSystem} &
+\cross{SINT}{retract} \\
+\cross{SINT}{retractIfCan} &
+\cross{SINT}{sample} &
+\cross{SINT}{shift} &
+\cross{SINT}{sign} \\
+\cross{SINT}{sizeLess?} &
+\cross{SINT}{squareFree} &
+\cross{SINT}{squareFreePart} &
+\cross{SINT}{subtractIfCan} \\
+\cross{SINT}{submod} &
+\cross{SINT}{symmetricRemainder} &
+\cross{SINT}{unit?} &
+\cross{SINT}{unitCanonical} \\
+\cross{SINT}{unitNormal} &
+\cross{SINT}{xor} &
+\cross{SINT}{zero?} &
+\cross{SINT}{?*?} \\
+\cross{SINT}{?**?} &
+\cross{SINT}{?+?} &
+\cross{SINT}{?-?} &
+\cross{SINT}{-?} \\
+\cross{SINT}{?/$\backslash{}$?} &
+\cross{SINT}{?$<$?} &
+\cross{SINT}{?$<=$?} &
+\cross{SINT}{?=?} \\
+\cross{SINT}{?$>$?} &
+\cross{SINT}{?$>=$?} &
+\cross{SINT}{?$\backslash{}$/?} &
+\cross{SINT}{?\^{}?} \\
+\cross{SINT}{~?} &
+\cross{SINT}{?\~{}=?} &
+\cross{SINT}{?quo?} &
+\cross{SINT}{?rem?}
+\end{tabular}
+
 <<domain SINT SingleInteger>>=
 )abbrev domain SINT SingleInteger
 
@@ -83579,6 +84143,24 @@ SingleInteger(): Join(IntegerNumberSystem,Logic,OpenMath) with
 \section{domain SAOS SingletonAsOrderedSet}
 \pagehead{SingletonAsOrderedSet}{SAOS}
 \pagepic{ps/v103singletonasorderedset.ps}{SAOS}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SAOS}{coerce} &
+\cross{SAOS}{convert} &
+\cross{SAOS}{create} &
+\cross{SAOS}{hash} &
+\cross{SAOS}{latex} \\
+\cross{SAOS}{max} &
+\cross{SAOS}{min} &
+\cross{SAOS}{?\~{}=?} &
+\cross{SAOS}{?$<$?} &
+\cross{SAOS}{?$<=$?} \\
+\cross{SAOS}{?=?} &
+\cross{SAOS}{?$>$?} &
+\cross{SAOS}{?$>=$?} &&
+\end{tabular}
+
 <<domain SAOS SingletonAsOrderedSet>>=
 )abbrev domain SAOS SingletonAsOrderedSet
 ++ This trivial domain lets us build Univariate Polynomials
@@ -83610,6 +84192,94 @@ SingletonAsOrderedSet(): OrderedSet with
 \pageto{Polynomial}{POLY}
 \pageto{MultivariatePolynomial}{MPOLY}
 \pageto{IndexedExponents}{INDE}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{SMP}{0} &
+\cross{SMP}{1} &
+\cross{SMP}{associates?} \\
+\cross{SMP}{binomThmExpt} &
+\cross{SMP}{characteristic} &
+\cross{SMP}{charthRoot} \\
+\cross{SMP}{coefficient} &
+\cross{SMP}{coefficients} &
+\cross{SMP}{coerce} \\
+\cross{SMP}{conditionP} &
+\cross{SMP}{content} &
+\cross{SMP}{convert} \\
+\cross{SMP}{D} &
+\cross{SMP}{degree} &
+\cross{SMP}{differentiate} \\
+\cross{SMP}{discriminant} &
+\cross{SMP}{eval} &
+\cross{SMP}{exquo} \\
+\cross{SMP}{factor} &
+\cross{SMP}{factorPolynomial} &
+\cross{SMP}{factorSquareFreePolynomial} \\
+\cross{SMP}{gcd} &
+\cross{SMP}{gcdPolynomial} &
+\cross{SMP}{ground} \\
+\cross{SMP}{ground?} &
+\cross{SMP}{hash} &
+\cross{SMP}{latex} \\
+\cross{SMP}{isExpt} &
+\cross{SMP}{isPlus} &
+\cross{SMP}{isTimes} \\
+\cross{SMP}{lcm} &
+\cross{SMP}{leadingCoefficient} &
+\cross{SMP}{leadingMonomial} \\
+\cross{SMP}{mainVariable} &
+\cross{SMP}{map} &
+\cross{SMP}{mapExponents} \\
+\cross{SMP}{max} &
+\cross{SMP}{min} &
+\cross{SMP}{minimumDegree} \\
+\cross{SMP}{monicDivide} &
+\cross{SMP}{monomial} &
+\cross{SMP}{monomial?} \\
+\cross{SMP}{monomials} &
+\cross{SMP}{multivariate} &
+\cross{SMP}{numberOfMonomials} \\
+\cross{SMP}{one?} &
+\cross{SMP}{patternMatch} &
+\cross{SMP}{pomopo!} \\
+\cross{SMP}{prime?} &
+\cross{SMP}{primitivePart} &
+\cross{SMP}{primitiveMonomials} \\
+\cross{SMP}{recip} &
+\cross{SMP}{reducedSystem} &
+\cross{SMP}{reductum} \\
+\cross{SMP}{resultant} &
+\cross{SMP}{retract} &
+\cross{SMP}{retractIfCan} \\
+\cross{SMP}{sample} &
+\cross{SMP}{solveLinearPolynomialEquation} &
+\cross{SMP}{squareFree} \\
+\cross{SMP}{squareFreePart} &
+\cross{SMP}{squareFreePolynomial} &
+\cross{SMP}{subtractIfCan} \\
+\cross{SMP}{totalDegree} &
+\cross{SMP}{unit?} &
+\cross{SMP}{unitCanonical} \\
+\cross{SMP}{unitNormal} &
+\cross{SMP}{univariate} &
+\cross{SMP}{variables} \\
+\cross{SMP}{zero?} &
+\cross{SMP}{?*?} &
+\cross{SMP}{?**?} \\
+\cross{SMP}{?+?} &
+\cross{SMP}{?-?} &
+\cross{SMP}{-?} \\
+\cross{SMP}{?=?} &
+\cross{SMP}{?\^{}?} &
+\cross{SMP}{?\~{}=?} \\
+\cross{SMP}{?/?} &
+\cross{SMP}{?$<$?} &
+\cross{SMP}{?$<=$?} \\
+\cross{SMP}{?$>$?} &
+\cross{SMP}{?$>=$?} &
+\end{tabular}
+
 <<domain SMP SparseMultivariatePolynomial>>=
 )abbrev domain SMP SparseMultivariatePolynomial
 ++ Author: Dave Barton, Barry Trager
@@ -84196,6 +84866,85 @@ SparseMultivariatePolynomial(R: Ring,VarSet: OrderedSet): C == T where
 \pagepic{ps/v103sparsemultivariatetaylorseries.ps}{SMTS}{1.00}
 {\bf See}\\
 \pageto{TaylorSeries}{TS}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SMTS}{0} &
+\cross{SMTS}{1} &
+\cross{SMTS}{acos} &
+\cross{SMTS}{acosh} &
+\cross{SMTS}{acot} \\
+\cross{SMTS}{acoth} &
+\cross{SMTS}{acsc} &
+\cross{SMTS}{acsch} &
+\cross{SMTS}{asec} &
+\cross{SMTS}{asech} \\
+\cross{SMTS}{asin} &
+\cross{SMTS}{asinh} &
+\cross{SMTS}{associates?} &
+\cross{SMTS}{atan} &
+\cross{SMTS}{atanh} \\
+\cross{SMTS}{characteristic} &
+\cross{SMTS}{charthRoot} &
+\cross{SMTS}{coefficient} &
+\cross{SMTS}{coerce} &
+\cross{SMTS}{complete} \\
+\cross{SMTS}{cos} &
+\cross{SMTS}{cosh} &
+\cross{SMTS}{cot} &
+\cross{SMTS}{coth} &
+\cross{SMTS}{csc} \\
+\cross{SMTS}{csch} &
+\cross{SMTS}{csubst} &
+\cross{SMTS}{D} &
+\cross{SMTS}{degree} &
+\cross{SMTS}{differentiate} \\
+\cross{SMTS}{eval} &
+\cross{SMTS}{exp} &
+\cross{SMTS}{exquo} &
+\cross{SMTS}{extend} &
+\cross{SMTS}{fintegrate} \\
+\cross{SMTS}{hash} &
+\cross{SMTS}{integrate} &
+\cross{SMTS}{latex} &
+\cross{SMTS}{leadingCoefficient} &
+\cross{SMTS}{leadingMonomial} \\
+\cross{SMTS}{log} &
+\cross{SMTS}{map} &
+\cross{SMTS}{monomial} &
+\cross{SMTS}{monomial?} &
+\cross{SMTS}{nthRoot} \\
+\cross{SMTS}{one?} &
+\cross{SMTS}{order} &
+\cross{SMTS}{pi} &
+\cross{SMTS}{pole?} &
+\cross{SMTS}{polynomial} \\
+\cross{SMTS}{recip} &
+\cross{SMTS}{reductum} &
+\cross{SMTS}{sample} &
+\cross{SMTS}{sec} &
+\cross{SMTS}{sech} \\
+\cross{SMTS}{sin} &
+\cross{SMTS}{sinh} &
+\cross{SMTS}{sqrt} &
+\cross{SMTS}{subtractIfCan} &
+\cross{SMTS}{tan} \\
+\cross{SMTS}{tanh} &
+\cross{SMTS}{unit?} &
+\cross{SMTS}{unitCanonical} &
+\cross{SMTS}{unitNormal} &
+\cross{SMTS}{variables} \\
+\cross{SMTS}{zero?} &
+\cross{SMTS}{?*?} &
+\cross{SMTS}{?**?} &
+\cross{SMTS}{?+?} &
+\cross{SMTS}{?-?} \\
+\cross{SMTS}{-?} &
+\cross{SMTS}{?=?} &
+\cross{SMTS}{?\^{}?} &
+\cross{SMTS}{?\~{}=?} &
+\end{tabular}
+
 <<domain SMTS SparseMultivariateTaylorSeries>>=
 )abbrev domain SMTS SparseMultivariateTaylorSeries
 ++ This domain provides multivariate Taylor series
@@ -84593,6 +85342,66 @@ o )show SparseTable
 \pageto{EqTable}{EQTBL}
 \pageto{StringTable}{STRTBL}
 \pageto{GeneralSparseTable}{GSTBL}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{STBL}{any?} &
+\cross{STBL}{bag} &
+\cross{STBL}{coerce} &
+\cross{STBL}{construct} &
+\cross{STBL}{convert} \\
+\cross{STBL}{copy} &
+\cross{STBL}{count} &
+\cross{STBL}{dictionary} &
+\cross{STBL}{elt} &
+\cross{STBL}{empty} \\
+\cross{STBL}{empty?} &
+\cross{STBL}{entries} &
+\cross{STBL}{entry?} &
+\cross{STBL}{eq?} &
+\cross{STBL}{eval} \\
+\cross{STBL}{every?} &
+\cross{STBL}{extract!} &
+\cross{STBL}{fill!} &
+\cross{STBL}{find} &
+\cross{STBL}{first} \\
+\cross{STBL}{hash} &
+\cross{STBL}{index?} &
+\cross{STBL}{indices} &
+\cross{STBL}{insert!} &
+\cross{STBL}{inspect} \\
+\cross{STBL}{key?} &
+\cross{STBL}{keys} &
+\cross{STBL}{latex} &
+\cross{STBL}{less?} &
+\cross{STBL}{map} \\
+\cross{STBL}{map!} &
+\cross{STBL}{maxIndex} &
+\cross{STBL}{member?} &
+\cross{STBL}{members} &
+\cross{STBL}{minIndex} \\
+\cross{STBL}{more?} &
+\cross{STBL}{parts} &
+\cross{STBL}{qelt} &
+\cross{STBL}{qsetelt!} &
+\cross{STBL}{reduce} \\
+\cross{STBL}{remove} &
+\cross{STBL}{remove!} &
+\cross{STBL}{removeDuplicates} &
+\cross{STBL}{sample} &
+\cross{STBL}{search} \\
+\cross{STBL}{setelt} &
+\cross{STBL}{select} &
+\cross{STBL}{select!} &
+\cross{STBL}{size?} &
+\cross{STBL}{swap!} \\
+\cross{STBL}{table} &
+\cross{STBL}{\#{}?} &
+\cross{STBL}{?=?} &
+\cross{STBL}{?\~{}=?} &
+\cross{STBL}{?.?} 
+\end{tabular}
+
 <<domain STBL SparseTable>>=
 )abbrev domain STBL SparseTable
 ++ Author: Stephen M. Watt
@@ -84623,6 +85432,147 @@ SparseTable(Key:SetCategory, Ent:SetCategory, dent:Ent) ==
 \section{domain SULS SparseUnivariateLaurentSeries}
 \pagehead{SparseUnivariateLaurentSeries}{SULS}
 \pagepic{ps/v103sparseunivariatelaurentseries.ps}{SULS}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{SULS}{0} &
+\cross{SULS}{1} &
+\cross{SULS}{abs} \\
+\cross{SULS}{acos} &
+\cross{SULS}{acosh} &
+\cross{SULS}{acot} \\
+\cross{SULS}{acoth} &
+\cross{SULS}{acsc} &
+\cross{SULS}{acsch} \\
+\cross{SULS}{approximate} &
+\cross{SULS}{asec} &
+\cross{SULS}{asech} \\
+\cross{SULS}{asin} &
+\cross{SULS}{asinh} &
+\cross{SULS}{associates?} \\
+\cross{SULS}{atan} &
+\cross{SULS}{atanh} &
+\cross{SULS}{ceiling} \\
+\cross{SULS}{characteristic} &
+\cross{SULS}{charthRoot} &
+\cross{SULS}{center} \\
+\cross{SULS}{coefficient} &
+\cross{SULS}{coerce} &
+\cross{SULS}{complete} \\
+\cross{SULS}{conditionP} &
+\cross{SULS}{convert} &
+\cross{SULS}{cos} \\
+\cross{SULS}{cosh} &
+\cross{SULS}{cot} &
+\cross{SULS}{coth} \\
+\cross{SULS}{csc} &
+\cross{SULS}{csch} &
+\cross{SULS}{D} \\
+\cross{SULS}{degree} &
+\cross{SULS}{denom} &
+\cross{SULS}{denominator} \\
+\cross{SULS}{differentiate} &
+\cross{SULS}{divide} &
+\cross{SULS}{euclideanSize} \\
+\cross{SULS}{eval} &
+\cross{SULS}{exp} &
+\cross{SULS}{expressIdealMember} \\
+\cross{SULS}{exquo} &
+\cross{SULS}{extend} &
+\cross{SULS}{extendedEuclidean} \\
+\cross{SULS}{factor} &
+\cross{SULS}{factorPolynomial} &
+\cross{SULS}{factorSquareFreePolynomial} \\
+\cross{SULS}{floor} &
+\cross{SULS}{fractionPart} &
+\cross{SULS}{gcd} \\
+\cross{SULS}{gcdPolynomial} &
+\cross{SULS}{hash} &
+\cross{SULS}{init} \\
+\cross{SULS}{integrate} &
+\cross{SULS}{inv} &
+\cross{SULS}{latex} \\
+\cross{SULS}{laurent} &
+\cross{SULS}{lcm} &
+\cross{SULS}{leadingCoefficient} \\
+\cross{SULS}{leadingMonomial} &
+\cross{SULS}{log} &
+\cross{SULS}{map} \\
+\cross{SULS}{max} &
+\cross{SULS}{min} &
+\cross{SULS}{monomial} \\
+\cross{SULS}{monomial?} &
+\cross{SULS}{multiEuclidean} &
+\cross{SULS}{multiplyCoefficients} \\
+\cross{SULS}{multiplyExponents} &
+\cross{SULS}{negative?} &
+\cross{SULS}{nextItem} \\
+\cross{SULS}{nthRoot} &
+\cross{SULS}{numer} &
+\cross{SULS}{numerator} \\
+\cross{SULS}{one?} &
+\cross{SULS}{order} &
+\cross{SULS}{patternMatch} \\
+\cross{SULS}{pi} &
+\cross{SULS}{pole?} &
+\cross{SULS}{positive?} \\
+\cross{SULS}{prime?} &
+\cross{SULS}{principalIdeal} &
+\cross{SULS}{random} \\
+\cross{SULS}{rationalFunction} &
+\cross{SULS}{recip} &
+\cross{SULS}{reducedSystem} \\
+\cross{SULS}{reductum} &
+\cross{SULS}{removeZeroes} &
+\cross{SULS}{retract} \\
+\cross{SULS}{retractIfCan} &
+\cross{SULS}{sample} &
+\cross{SULS}{sec} \\
+\cross{SULS}{sech} &
+\cross{SULS}{series} &
+\cross{SULS}{sign} \\
+\cross{SULS}{sin} &
+\cross{SULS}{sinh} &
+\cross{SULS}{sizeLess?} \\
+\cross{SULS}{solveLinearPolynomialEquation} &
+\cross{SULS}{sqrt} &
+\cross{SULS}{squareFree} \\
+\cross{SULS}{squareFreePart} &
+\cross{SULS}{squareFreePolynomial} &
+\cross{SULS}{subtractIfCan} \\
+\cross{SULS}{tan} &
+\cross{SULS}{tanh} &
+\cross{SULS}{taylor} \\
+\cross{SULS}{taylorIfCan} &
+\cross{SULS}{taylorRep} &
+\cross{SULS}{terms} \\
+\cross{SULS}{truncate} &
+\cross{SULS}{unit?} &
+\cross{SULS}{unitCanonical} \\
+\cross{SULS}{unitNormal} &
+\cross{SULS}{variable} &
+\cross{SULS}{variables} \\
+\cross{SULS}{wholePart} &
+\cross{SULS}{zero?} &
+\cross{SULS}{?*?} \\
+\cross{SULS}{?**?} &
+\cross{SULS}{?+?} &
+\cross{SULS}{?-?} \\
+\cross{SULS}{-?} &
+\cross{SULS}{?=?} &
+\cross{SULS}{?\^{}?} \\
+\cross{SULS}{?.?} &
+\cross{SULS}{?\~{}=?} &
+\cross{SULS}{?/?} \\
+\cross{SULS}{?$<$?} &
+\cross{SULS}{?$<=$?} &
+\cross{SULS}{?$>$?} \\
+\cross{SULS}{?$>=$?} &
+\cross{SULS}{?\^{}?} &
+\cross{SULS}{?quo?} \\
+\cross{SULS}{?rem?} &&
+\end{tabular}
+
 <<domain SULS SparseUnivariateLaurentSeries>>=
 )abbrev domain SULS SparseUnivariateLaurentSeries
 ++ Author: Clifton J. Williamson
@@ -84832,6 +85782,127 @@ SparseUnivariateLaurentSeries(Coef,var,cen): Exports == Implementation where
 \pageto{FreeModule}{FM}
 \pageto{PolynomialRing}{PR}
 \pageto{UnivariatePolynomial}{UP}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{SUP}{0} &
+\cross{SUP}{1} \\
+\cross{SUP}{associates?} &
+\cross{SUP}{binomThmExpt} \\
+\cross{SUP}{characteristic} &
+\cross{SUP}{charthRoot} \\
+\cross{SUP}{coefficient} &
+\cross{SUP}{coefficients} \\
+\cross{SUP}{coerce} &
+\cross{SUP}{composite} \\
+\cross{SUP}{conditionP} &
+\cross{SUP}{content} \\
+\cross{SUP}{convert} &
+\cross{SUP}{D} \\
+\cross{SUP}{degree} &
+\cross{SUP}{differentiate} \\
+\cross{SUP}{discriminant} &
+\cross{SUP}{divide} \\
+\cross{SUP}{divideExponents} &
+\cross{SUP}{elt} \\
+\cross{SUP}{euclideanSize} &
+\cross{SUP}{eval} \\
+\cross{SUP}{expressIdealMember} &
+\cross{SUP}{exquo} \\
+\cross{SUP}{extendedEuclidean} &
+\cross{SUP}{factor} \\
+\cross{SUP}{factorPolynomial} &
+\cross{SUP}{factorSquareFreePolynomial} \\
+\cross{SUP}{fmecg} &
+\cross{SUP}{gcd} \\
+\cross{SUP}{gcdPolynomial} &
+\cross{SUP}{ground} \\
+\cross{SUP}{ground?} &
+\cross{SUP}{hash} \\
+\cross{SUP}{init} &
+\cross{SUP}{integrate} \\
+\cross{SUP}{isExpt} &
+\cross{SUP}{isPlus} \\
+\cross{SUP}{isTimes} &
+\cross{SUP}{karatsubaDivide} \\
+\cross{SUP}{latex} &
+\cross{SUP}{lcm} \\
+\cross{SUP}{leadingCoefficient} &
+\cross{SUP}{leadingMonomial} \\
+\cross{SUP}{mainVariable} &
+\cross{SUP}{makeSUP} \\
+\cross{SUP}{map} &
+\cross{SUP}{mapExponents} \\
+\cross{SUP}{max} &
+\cross{SUP}{min} \\
+\cross{SUP}{minimumDegree} &
+\cross{SUP}{monicDivide} \\
+\cross{SUP}{monomial} &
+\cross{SUP}{monomial?} \\
+\cross{SUP}{monomials} &
+\cross{SUP}{multiEuclidean} \\
+\cross{SUP}{multiplyExponents} &
+\cross{SUP}{multivariate} \\
+\cross{SUP}{nextItem} &
+\cross{SUP}{numberOfMonomials} \\
+\cross{SUP}{one?} &
+\cross{SUP}{order} \\
+\cross{SUP}{outputForm} &
+\cross{SUP}{patternMatch} \\
+\cross{SUP}{pomopo!} &
+\cross{SUP}{prime?} \\
+\cross{SUP}{primitiveMonomials} &
+\cross{SUP}{primitivePart} \\
+\cross{SUP}{principalIdeal} &
+\cross{SUP}{pseudoDivide} \\
+\cross{SUP}{pseudoQuotient} &
+\cross{SUP}{pseudoRemainder} \\
+\cross{SUP}{recip} &
+\cross{SUP}{reducedSystem} \\
+\cross{SUP}{reductum} &
+\cross{SUP}{resultant} \\
+\cross{SUP}{retract} &
+\cross{SUP}{retractIfCan} \\
+\cross{SUP}{sample} &
+\cross{SUP}{separate} \\
+\cross{SUP}{shiftLeft} &
+\cross{SUP}{shiftRight} \\
+\cross{SUP}{sizeLess?} &
+\cross{SUP}{solveLinearPolynomialEquation} \\
+\cross{SUP}{squareFree} &
+\cross{SUP}{squareFreePart} \\
+\cross{SUP}{squareFreePolynomial} &
+\cross{SUP}{subResultantGcd} \\
+\cross{SUP}{subtractIfCan} &
+\cross{SUP}{totalDegree} \\
+\cross{SUP}{totalDegree} &
+\cross{SUP}{unit?} \\
+\cross{SUP}{unitCanonical} &
+\cross{SUP}{unitNormal} \\
+\cross{SUP}{univariate} &
+\cross{SUP}{univariate} \\
+\cross{SUP}{unmakeSUP} &
+\cross{SUP}{variables} \\
+\cross{SUP}{vectorise} &
+\cross{SUP}{zero?} \\
+\cross{SUP}{?*?} &
+\cross{SUP}{?**?} \\
+\cross{SUP}{?+?} &
+\cross{SUP}{?-?} \\
+\cross{SUP}{-?} &
+\cross{SUP}{?=?} \\
+\cross{SUP}{?\^{}?} &
+\cross{SUP}{?.?} \\
+\cross{SUP}{?\~{}=?} &
+\cross{SUP}{?/?} \\
+\cross{SUP}{?$<$?} &
+\cross{SUP}{?$<=$?} \\
+\cross{SUP}{?$>$?} &
+\cross{SUP}{?$>=$?} \\
+\cross{SUP}{?quo?} &
+\cross{SUP}{?rem?} 
+\end{tabular}
+
 <<domain SUP SparseUnivariatePolynomial>>=
 )abbrev domain SUP SparseUnivariatePolynomial
 ++ Author: Dave Barton, Barry Trager
@@ -85198,6 +86269,150 @@ unfortunately.
 
 \pagehead{SparseUnivariatePolynomialExpressions}{SUPEXPR}
 \pagepic{ps/v103sparseunivariatepolynomialexpressions.ps}{SUPEXPR}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{SUPEXPR}{0} &
+\cross{SUPEXPR}{1} &
+\cross{SUPEXPR}{acos} \\
+\cross{SUPEXPR}{acosh} &
+\cross{SUPEXPR}{acot} &
+\cross{SUPEXPR}{acoth} \\
+\cross{SUPEXPR}{acsc} &
+\cross{SUPEXPR}{acsch} &
+\cross{SUPEXPR}{asec} \\
+\cross{SUPEXPR}{asech} &
+\cross{SUPEXPR}{asin} &
+\cross{SUPEXPR}{asinh} \\
+\cross{SUPEXPR}{associates?} &
+\cross{SUPEXPR}{atan} &
+\cross{SUPEXPR}{atanh} \\
+\cross{SUPEXPR}{binomThmExpt} &
+\cross{SUPEXPR}{characteristic} &
+\cross{SUPEXPR}{charthRoot} \\
+\cross{SUPEXPR}{coefficient} &
+\cross{SUPEXPR}{coefficients} &
+\cross{SUPEXPR}{coerce} \\
+\cross{SUPEXPR}{composite} &
+\cross{SUPEXPR}{conditionP} &
+\cross{SUPEXPR}{content} \\
+\cross{SUPEXPR}{convert} &
+\cross{SUPEXPR}{cos} &
+\cross{SUPEXPR}{cosh} \\
+\cross{SUPEXPR}{cot} &
+\cross{SUPEXPR}{coth} &
+\cross{SUPEXPR}{csc} \\
+\cross{SUPEXPR}{csch} &
+\cross{SUPEXPR}{D} &
+\cross{SUPEXPR}{degree} \\
+\cross{SUPEXPR}{differentiate} &
+\cross{SUPEXPR}{discriminant} &
+\cross{SUPEXPR}{divide} \\
+\cross{SUPEXPR}{divideExponents} &
+\cross{SUPEXPR}{elt} &
+\cross{SUPEXPR}{euclideanSize} \\
+\cross{SUPEXPR}{eval} &
+\cross{SUPEXPR}{exp} &
+\cross{SUPEXPR}{expressIdealMember} \\
+\cross{SUPEXPR}{exquo} &
+\cross{SUPEXPR}{extendedEuclidean} &
+\cross{SUPEXPR}{factor} \\
+\cross{SUPEXPR}{factorPolynomial} &
+\cross{SUPEXPR}{factorSquareFreePolynomial} &
+\cross{SUPEXPR}{gcd} \\
+\cross{SUPEXPR}{gcdPolynomial} &
+\cross{SUPEXPR}{ground} &
+\cross{SUPEXPR}{ground?} \\
+\cross{SUPEXPR}{hash} &
+\cross{SUPEXPR}{init} &
+\cross{SUPEXPR}{integrate} \\
+\cross{SUPEXPR}{isExpt} &
+\cross{SUPEXPR}{isPlus} &
+\cross{SUPEXPR}{isTimes} \\
+\cross{SUPEXPR}{karatsubaDivide} &
+\cross{SUPEXPR}{latex} &
+\cross{SUPEXPR}{lcm} \\
+\cross{SUPEXPR}{leadingCoefficient} &
+\cross{SUPEXPR}{leadingMonomial} &
+\cross{SUPEXPR}{log} \\
+\cross{SUPEXPR}{mainVariable} &
+\cross{SUPEXPR}{makeSUP} &
+\cross{SUPEXPR}{map} \\
+\cross{SUPEXPR}{mapExponents} &
+\cross{SUPEXPR}{max} &
+\cross{SUPEXPR}{min} \\
+\cross{SUPEXPR}{minimumDegree} &
+\cross{SUPEXPR}{monicDivide} &
+\cross{SUPEXPR}{monomial} \\
+\cross{SUPEXPR}{monomial?} &
+\cross{SUPEXPR}{monomials} &
+\cross{SUPEXPR}{multiEuclidean} \\
+\cross{SUPEXPR}{multiplyExponents} &
+\cross{SUPEXPR}{multivariate} &
+\cross{SUPEXPR}{nextItem} \\
+\cross{SUPEXPR}{numberOfMonomials} &
+\cross{SUPEXPR}{one?} &
+\cross{SUPEXPR}{order} \\
+\cross{SUPEXPR}{patternMatch} &
+\cross{SUPEXPR}{pi} &
+\cross{SUPEXPR}{pomopo!} \\
+\cross{SUPEXPR}{prime?} &
+\cross{SUPEXPR}{primitiveMonomials} &
+\cross{SUPEXPR}{primitivePart} \\
+\cross{SUPEXPR}{principalIdeal} &
+\cross{SUPEXPR}{pseudoDivide} &
+\cross{SUPEXPR}{pseudoQuotient} \\
+\cross{SUPEXPR}{pseudoRemainder} &
+\cross{SUPEXPR}{recip} &
+\cross{SUPEXPR}{reducedSystem} \\
+\cross{SUPEXPR}{reductum} &
+\cross{SUPEXPR}{resultant} &
+\cross{SUPEXPR}{retract} \\
+\cross{SUPEXPR}{retractIfCan} &
+\cross{SUPEXPR}{sample} &
+\cross{SUPEXPR}{sec} \\
+\cross{SUPEXPR}{sech} &
+\cross{SUPEXPR}{separate} &
+\cross{SUPEXPR}{shiftLeft} \\
+\cross{SUPEXPR}{shiftRight} &
+\cross{SUPEXPR}{sin} &
+\cross{SUPEXPR}{sinh} \\
+\cross{SUPEXPR}{sizeLess?} &
+\cross{SUPEXPR}{solveLinearPolynomialEquation} &
+\cross{SUPEXPR}{squareFree} \\
+\cross{SUPEXPR}{squareFreePart} &
+\cross{SUPEXPR}{squareFreePolynomial} &
+\cross{SUPEXPR}{subResultantGcd} \\
+\cross{SUPEXPR}{subtractIfCan} &
+\cross{SUPEXPR}{tan} &
+\cross{SUPEXPR}{tanh} \\
+\cross{SUPEXPR}{totalDegree} &
+\cross{SUPEXPR}{unit?} &
+\cross{SUPEXPR}{unitCanonical} \\
+\cross{SUPEXPR}{unitNormal} &
+\cross{SUPEXPR}{univariate} &
+\cross{SUPEXPR}{unmakeSUP} \\
+\cross{SUPEXPR}{variables} &
+\cross{SUPEXPR}{vectorise} &
+\cross{SUPEXPR}{zero?} \\
+\cross{SUPEXPR}{?*?} &
+\cross{SUPEXPR}{?**?} &
+\cross{SUPEXPR}{?+?} \\
+\cross{SUPEXPR}{?-?} &
+\cross{SUPEXPR}{-?} &
+\cross{SUPEXPR}{?=?} \\
+\cross{SUPEXPR}{?\^{}?} &
+\cross{SUPEXPR}{?.?} &
+\cross{SUPEXPR}{?\~{}=?} \\
+\cross{SUPEXPR}{?/?} &
+\cross{SUPEXPR}{?$<$?} &
+\cross{SUPEXPR}{?$<=$?} \\
+\cross{SUPEXPR}{?$>$?} &
+\cross{SUPEXPR}{?$>=$?} &
+\cross{SUPEXPR}{?quo?} \\
+\cross{SUPEXPR}{?rem?} &&
+\end{tabular}
+
 <<domain SUPEXPR SparseUnivariatePolynomialExpressions>>=
 )abb domain SUPEXPR SparseUnivariatePolynomialExpressions
 SparseUnivariatePolynomialExpressions(R: Ring): Exports == Implementation where
@@ -85246,6 +86461,115 @@ SparseUnivariatePolynomialExpressions(R: Ring): Exports == Implementation where
 \section{domain SUPXS SparseUnivariatePuiseuxSeries}
 \pagehead{SparseUnivariatePuiseuxSeries}{SUPXS}
 \pagepic{ps/v103sparseunivariatepuiseuxseries.ps}{SUPXS}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{SUPXS}{0} &
+\cross{SUPXS}{1} &
+\cross{SUPXS}{acos} &
+\cross{SUPXS}{acosh} \\
+\cross{SUPXS}{acot} &
+\cross{SUPXS}{acoth} &
+\cross{SUPXS}{acsc} &
+\cross{SUPXS}{acsch} \\
+\cross{SUPXS}{approximate} &
+\cross{SUPXS}{asec} &
+\cross{SUPXS}{asech} &
+\cross{SUPXS}{asin} \\
+\cross{SUPXS}{asinh} &
+\cross{SUPXS}{associates?} &
+\cross{SUPXS}{atan} &
+\cross{SUPXS}{atanh} \\
+\cross{SUPXS}{characteristic} &
+\cross{SUPXS}{charthRoot} &
+\cross{SUPXS}{center} &
+\cross{SUPXS}{coefficient} \\
+\cross{SUPXS}{coerce} &
+\cross{SUPXS}{complete} &
+\cross{SUPXS}{cos} &
+\cross{SUPXS}{cosh} \\
+\cross{SUPXS}{cot} &
+\cross{SUPXS}{coth} &
+\cross{SUPXS}{csc} &
+\cross{SUPXS}{csch} \\
+\cross{SUPXS}{D} &
+\cross{SUPXS}{degree} &
+\cross{SUPXS}{differentiate} &
+\cross{SUPXS}{divide} \\
+\cross{SUPXS}{euclideanSize} &
+\cross{SUPXS}{eval} &
+\cross{SUPXS}{exp} &
+\cross{SUPXS}{expressIdealMember} \\
+\cross{SUPXS}{exquo} &
+\cross{SUPXS}{extend} &
+\cross{SUPXS}{extendedEuclidean} &
+\cross{SUPXS}{factor} \\
+\cross{SUPXS}{gcd} &
+\cross{SUPXS}{gcdPolynomial} &
+\cross{SUPXS}{hash} &
+\cross{SUPXS}{integrate} \\
+\cross{SUPXS}{inv} &
+\cross{SUPXS}{latex} &
+\cross{SUPXS}{laurent} &
+\cross{SUPXS}{laurentIfCan} \\
+\cross{SUPXS}{laurentRep} &
+\cross{SUPXS}{lcm} &
+\cross{SUPXS}{leadingCoefficient} &
+\cross{SUPXS}{leadingMonomial} \\
+\cross{SUPXS}{log} &
+\cross{SUPXS}{map} &
+\cross{SUPXS}{monomial} &
+\cross{SUPXS}{monomial?} \\
+\cross{SUPXS}{multiEuclidean} &
+\cross{SUPXS}{multiplyExponents} &
+\cross{SUPXS}{nthRoot} &
+\cross{SUPXS}{one?} \\
+\cross{SUPXS}{order} &
+\cross{SUPXS}{pi} &
+\cross{SUPXS}{pole?} &
+\cross{SUPXS}{prime?} \\
+\cross{SUPXS}{principalIdeal} &
+\cross{SUPXS}{puiseux} &
+\cross{SUPXS}{rationalPower} &
+\cross{SUPXS}{recip} \\
+\cross{SUPXS}{reductum} &
+\cross{SUPXS}{retract} &
+\cross{SUPXS}{retractIfCan} &
+\cross{SUPXS}{sample} \\
+\cross{SUPXS}{sec} &
+\cross{SUPXS}{sech} &
+\cross{SUPXS}{series} &
+\cross{SUPXS}{sin} \\
+\cross{SUPXS}{sinh} &
+\cross{SUPXS}{sizeLess?} &
+\cross{SUPXS}{sqrt} &
+\cross{SUPXS}{squareFree} \\
+\cross{SUPXS}{squareFreePart} &
+\cross{SUPXS}{subtractIfCan} &
+\cross{SUPXS}{tan} &
+\cross{SUPXS}{tanh} \\
+\cross{SUPXS}{terms} &
+\cross{SUPXS}{truncate} &
+\cross{SUPXS}{unit?} &
+\cross{SUPXS}{unitCanonical} \\
+\cross{SUPXS}{unitNormal} &
+\cross{SUPXS}{variable} &
+\cross{SUPXS}{variables} &
+\cross{SUPXS}{zero?} \\
+\cross{SUPXS}{?.?} &
+\cross{SUPXS}{?*?} &
+\cross{SUPXS}{?**?} &
+\cross{SUPXS}{?+?} \\
+\cross{SUPXS}{?-?} &
+\cross{SUPXS}{-?} &
+\cross{SUPXS}{?=?} &
+\cross{SUPXS}{?\^{}?} \\
+\cross{SUPXS}{?\~{}=?} &
+\cross{SUPXS}{?/?} &
+\cross{SUPXS}{?quo?} &
+\cross{SUPXS}{?rem?} 
+\end{tabular}
+
 <<domain SUPXS SparseUnivariatePuiseuxSeries>>=
 )abbrev domain SUPXS SparseUnivariatePuiseuxSeries
 ++ Author: Clifton J. Williamson
@@ -85346,6 +86670,60 @@ SparseUnivariatePuiseuxSeries(Coef,var,cen): Exports == Implementation where
 {\bf See}\\
 \pageto{Automorphism}{AUTOMOR}
 \pageto{UnivariateSkewPolynomial}{OREUP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ORESUP}{0} &
+\cross{ORESUP}{1} &
+\cross{ORESUP}{apply} &
+\cross{ORESUP}{characteristic} &
+\cross{ORESUP}{coefficient} \\
+\cross{ORESUP}{coefficients} &
+\cross{ORESUP}{coerce} &
+\cross{ORESUP}{content} &
+\cross{ORESUP}{degree} &
+\cross{ORESUP}{exquo} \\
+\cross{ORESUP}{hash} &
+\cross{ORESUP}{latex} &
+\cross{ORESUP}{leadingCoefficient} &
+\cross{ORESUP}{leftDivide} &
+\cross{ORESUP}{leftExactQuotient} \\
+\cross{ORESUP}{leftExtendedGcd} &
+\cross{ORESUP}{leftGcd} &
+\cross{ORESUP}{leftLcm} &
+\cross{ORESUP}{leftQuotient} &
+\cross{ORESUP}{leftRemainder} \\
+\cross{ORESUP}{minimumDegree} &
+\cross{ORESUP}{monicLeftDivide} &
+\cross{ORESUP}{monicRightDivide} &
+\cross{ORESUP}{monomial} &
+\cross{ORESUP}{one?} \\
+\cross{ORESUP}{outputForm} &
+\cross{ORESUP}{primitivePart} &
+\cross{ORESUP}{recip} &
+\cross{ORESUP}{reductum} &
+\cross{ORESUP}{retract} \\
+\cross{ORESUP}{retractIfCan} &
+\cross{ORESUP}{rightDivide} &
+\cross{ORESUP}{rightExactQuotient} &
+\cross{ORESUP}{rightExtendedGcd} &
+\cross{ORESUP}{rightGcd} \\
+\cross{ORESUP}{rightLcm} &
+\cross{ORESUP}{rightQuotient} &
+\cross{ORESUP}{rightRemainder} &
+\cross{ORESUP}{sample} &
+\cross{ORESUP}{subtractIfCan} \\
+\cross{ORESUP}{zero?} &
+\cross{ORESUP}{?*?} &
+\cross{ORESUP}{?**?} &
+\cross{ORESUP}{?+?} &
+\cross{ORESUP}{?-?} \\
+\cross{ORESUP}{-?} &
+\cross{ORESUP}{?=?} &
+\cross{ORESUP}{?\^{}?} &
+\cross{ORESUP}{?\~{}=?} &
+\end{tabular}
+
 <<domain ORESUP SparseUnivariateSkewPolynomial>>=
 )abbrev domain ORESUP SparseUnivariateSkewPolynomial
 ++ Author: Manuel Bronstein
@@ -85385,6 +86763,98 @@ SparseUnivariateSkewPolynomial(R:Ring, sigma:Automorphism R, delta: R -> R):
 \section{domain SUTS SparseUnivariateTaylorSeries}
 \pagehead{SparseUnivariateTaylorSeries}{SUTS}
 \pagepic{ps/v103sparseunivariatetaylorseries.ps}{SUTS}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SUTS}{0} &
+\cross{SUTS}{1} &
+\cross{SUTS}{acos} &
+\cross{SUTS}{acosh} &
+\cross{SUTS}{acot} \\
+\cross{SUTS}{acoth} &
+\cross{SUTS}{acsc} &
+\cross{SUTS}{acsch} &
+\cross{SUTS}{approximate} &
+\cross{SUTS}{asec} \\
+\cross{SUTS}{asech} &
+\cross{SUTS}{asin} &
+\cross{SUTS}{asinh} &
+\cross{SUTS}{associates?} &
+\cross{SUTS}{atan} \\
+\cross{SUTS}{atanh} &
+\cross{SUTS}{center} &
+\cross{SUTS}{characteristic} &
+\cross{SUTS}{charthRoot} &
+\cross{SUTS}{coefficient} \\
+\cross{SUTS}{coefficients} &
+\cross{SUTS}{coerce} &
+\cross{SUTS}{complete} &
+\cross{SUTS}{cos} &
+\cross{SUTS}{cosh} \\
+\cross{SUTS}{cot} &
+\cross{SUTS}{coth} &
+\cross{SUTS}{csc} &
+\cross{SUTS}{csch} &
+\cross{SUTS}{D} \\
+\cross{SUTS}{degree} &
+\cross{SUTS}{differentiate} &
+\cross{SUTS}{eval} &
+\cross{SUTS}{exp} &
+\cross{SUTS}{exquo} \\
+\cross{SUTS}{extend} &
+\cross{SUTS}{hash} &
+\cross{SUTS}{integrate} &
+\cross{SUTS}{latex} &
+\cross{SUTS}{leadingCoefficient} \\
+\cross{SUTS}{leadingMonomial} &
+\cross{SUTS}{log} &
+\cross{SUTS}{map} &
+\cross{SUTS}{monomial} &
+\cross{SUTS}{monomial?} \\
+\cross{SUTS}{multiplyCoefficients} &
+\cross{SUTS}{multiplyExponents} &
+\cross{SUTS}{nthRoot} &
+\cross{SUTS}{one?} &
+\cross{SUTS}{order} \\
+\cross{SUTS}{pole?} &
+\cross{SUTS}{pi} &
+\cross{SUTS}{polynomial} &
+\cross{SUTS}{polynomial} &
+\cross{SUTS}{quoByVar} \\
+\cross{SUTS}{recip} &
+\cross{SUTS}{reductum} &
+\cross{SUTS}{sample} &
+\cross{SUTS}{sec} &
+\cross{SUTS}{sech} \\
+\cross{SUTS}{series} &
+\cross{SUTS}{sin} &
+\cross{SUTS}{sinh} &
+\cross{SUTS}{sqrt} &
+\cross{SUTS}{subtractIfCan} \\
+\cross{SUTS}{tan} &
+\cross{SUTS}{tanh} &
+\cross{SUTS}{terms} &
+\cross{SUTS}{truncate} &
+\cross{SUTS}{truncate} \\
+\cross{SUTS}{unit?} &
+\cross{SUTS}{unitCanonical} &
+\cross{SUTS}{unitNormal} &
+\cross{SUTS}{univariatePolynomial} &
+\cross{SUTS}{variable} \\
+\cross{SUTS}{variables} &
+\cross{SUTS}{zero?} &
+\cross{SUTS}{?*?} &
+\cross{SUTS}{?**?} &
+\cross{SUTS}{?+?} \\
+\cross{SUTS}{?-?} &
+\cross{SUTS}{-?} &
+\cross{SUTS}{?=?} &
+\cross{SUTS}{?\^{}?} &
+\cross{SUTS}{?\~{}=?} \\
+\cross{SUTS}{?/?} &
+\cross{SUTS}{?.?} &&&
+\end{tabular}
+
 <<domain SUTS SparseUnivariateTaylorSeries>>=
 )abbrev domain SUTS SparseUnivariateTaylorSeries
 ++ Author: Clifton J. Williamson
@@ -85782,6 +87252,86 @@ SparseUnivariateTaylorSeries(Coef,var,cen): Exports == Implementation where
 {\bf See}\\
 \pageto{OrderedDirectProduct}{ODP}
 \pageto{HomogeneousDirectProduct}{HDP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SHDP}{0} &
+\cross{SHDP}{1} &
+\cross{SHDP}{abs} &
+\cross{SHDP}{any?} &
+\cross{SHDP}{characteristic} \\
+\cross{SHDP}{coerce} &
+\cross{SHDP}{copy} &
+\cross{SHDP}{count} &
+\cross{SHDP}{D} &
+\cross{SHDP}{differentiate} \\
+\cross{SHDP}{dimension} &
+\cross{SHDP}{directProduct} &
+\cross{SHDP}{dot} &
+\cross{SHDP}{elt} &
+\cross{SHDP}{empty} \\
+\cross{SHDP}{empty?} &
+\cross{SHDP}{entries} &
+\cross{SHDP}{entry?} &
+\cross{SHDP}{eq?} &
+\cross{SHDP}{eval} \\
+\cross{SHDP}{every?} &
+\cross{SHDP}{fill!} &
+\cross{SHDP}{first} &
+\cross{SHDP}{hash} &
+\cross{SHDP}{index} \\
+\cross{SHDP}{index?} &
+\cross{SHDP}{indices} &
+\cross{SHDP}{latex} &
+\cross{SHDP}{less?} &
+\cross{SHDP}{lookup} \\
+\cross{SHDP}{map} &
+\cross{SHDP}{map!} &
+\cross{SHDP}{max} &
+\cross{SHDP}{maxIndex} &
+\cross{SHDP}{member?} \\
+\cross{SHDP}{members} &
+\cross{SHDP}{min} &
+\cross{SHDP}{minIndex} &
+\cross{SHDP}{more?} &
+\cross{SHDP}{negative?} \\
+\cross{SHDP}{one?} &
+\cross{SHDP}{parts} &
+\cross{SHDP}{positive?} &
+\cross{SHDP}{qelt} &
+\cross{SHDP}{qsetelt!} \\
+\cross{SHDP}{random} &
+\cross{SHDP}{recip} &
+\cross{SHDP}{reducedSystem} &
+\cross{SHDP}{retract} &
+\cross{SHDP}{retractIfCan} \\
+\cross{SHDP}{sample} &
+\cross{SHDP}{setelt} &
+\cross{SHDP}{sign} &
+\cross{SHDP}{size} &
+\cross{SHDP}{size?} \\
+\cross{SHDP}{subtractIfCan} &
+\cross{SHDP}{sup} &
+\cross{SHDP}{swap!} &
+\cross{SHDP}{unitVector} &
+\cross{SHDP}{zero?} \\
+\cross{SHDP}{\#{}?} &
+\cross{SHDP}{?*?} &
+\cross{SHDP}{?**?} &
+\cross{SHDP}{?+?} &
+\cross{SHDP}{?-?} \\
+\cross{SHDP}{?/?} &
+\cross{SHDP}{?$<$?} &
+\cross{SHDP}{?$<=$?} &
+\cross{SHDP}{?=?} &
+\cross{SHDP}{?$>$?} \\
+\cross{SHDP}{?$>=$?} &
+\cross{SHDP}{?\^{}?} &
+\cross{SHDP}{?\~{}=?} &
+\cross{SHDP}{-?} &
+\cross{SHDP}{?.?} 
+\end{tabular}
+
 <<domain SHDP SplitHomogeneousDirectProduct>>=
 )abbrev domain SHDP SplitHomogeneousDirectProduct
 ++ Author:
@@ -85843,6 +87393,29 @@ SplitHomogeneousDirectProduct(dimtot,dim1,S) : T == C where
 \pagepic{ps/v103splittingnode.ps}{SPLNODE}{1.00}
 {\bf See}\\
 \pageto{SplittingNode}{SPLNODE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SPLNODE}{coerce} &
+\cross{SPLNODE}{condition} &
+\cross{SPLNODE}{construct} &
+\cross{SPLNODE}{copy} &
+\cross{SPLNODE}{empty} \\
+\cross{SPLNODE}{empty?} &
+\cross{SPLNODE}{hash} &
+\cross{SPLNODE}{infLex?} &
+\cross{SPLNODE}{latex} &
+\cross{SPLNODE}{setCondition!} \\
+\cross{SPLNODE}{setEmpty!} &
+\cross{SPLNODE}{setStatus!} &
+\cross{SPLNODE}{setValue!} &
+\cross{SPLNODE}{status} &
+\cross{SPLNODE}{subNode?} \\
+\cross{SPLNODE}{value} &
+\cross{SPLNODE}{?=?} &
+\cross{SPLNODE}{?\~{}=?} &&
+\end{tabular}
+
 <<domain SPLNODE SplittingNode>>=
 )abbrev domain SPLNODE SplittingNode
 ++ Author: Marc Moereno Maza
@@ -86010,6 +87583,58 @@ SplittingNode(V,C) : Exports == Implementation where
 \pagepic{ps/v103splittingtree.ps}{SPLTREE}{1.00}
 {\bf See}\\
 \pageto{SplittingTree}{SPLTREE}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{SPLTREE}{any?} &
+\cross{SPLTREE}{child?} &
+\cross{SPLTREE}{children} &
+\cross{SPLTREE}{coerce} \\
+\cross{SPLTREE}{conditions} &
+\cross{SPLTREE}{construct} &
+\cross{SPLTREE}{copy} &
+\cross{SPLTREE}{count} \\
+\cross{SPLTREE}{cyclic?} &
+\cross{SPLTREE}{distance} &
+\cross{SPLTREE}{empty} &
+\cross{SPLTREE}{empty?} \\
+\cross{SPLTREE}{eq?} &
+\cross{SPLTREE}{eval} &
+\cross{SPLTREE}{every?} &
+\cross{SPLTREE}{extractSplittingLeaf} \\
+\cross{SPLTREE}{hash} &
+\cross{SPLTREE}{latex} &
+\cross{SPLTREE}{leaf?} &
+\cross{SPLTREE}{leaves} \\
+\cross{SPLTREE}{less?} &
+\cross{SPLTREE}{map} &
+\cross{SPLTREE}{map!} &
+\cross{SPLTREE}{member?} \\
+\cross{SPLTREE}{members} &
+\cross{SPLTREE}{more?} &
+\cross{SPLTREE}{node?} &
+\cross{SPLTREE}{nodeOf?} \\
+\cross{SPLTREE}{nodes} &
+\cross{SPLTREE}{parts} &
+\cross{SPLTREE}{remove} &
+\cross{SPLTREE}{remove!} \\
+\cross{SPLTREE}{result} &
+\cross{SPLTREE}{sample} &
+\cross{SPLTREE}{setchildren!} &
+\cross{SPLTREE}{setelt} \\
+\cross{SPLTREE}{setvalue!} &
+\cross{SPLTREE}{size?} &
+\cross{SPLTREE}{splitNodeOf!} &
+\cross{SPLTREE}{splitNodeOf!} \\
+\cross{SPLTREE}{subNodeOf?} &
+\cross{SPLTREE}{updateStatus!} &
+\cross{SPLTREE}{value} &
+\cross{SPLTREE}{\#{}?} \\
+\cross{SPLTREE}{?=?} &
+\cross{SPLTREE}{?.value} &
+\cross{SPLTREE}{?\~{}=?} &
+\end{tabular}
+
 <<domain SPLTREE SplittingTree>>=
 )abbrev domain SPLTREE SplittingTree
 ++ Author: Marc Moereno Maza
@@ -86797,6 +88422,104 @@ o )show SquareFreeRegularTriangularSet
 @
 \pagehead{SquareFreeRegularTriangularSet}{SREGSET}
 \pagepic{ps/v103squarefreeregulartriangularset.ps}{SREGSET}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{SREGSET}{algebraic?} &
+\cross{SREGSET}{algebraicCoefficients?} \\
+\cross{SREGSET}{algebraicVariables} &
+\cross{SREGSET}{any?} \\
+\cross{SREGSET}{augment} &
+\cross{SREGSET}{autoReduced?} \\
+\cross{SREGSET}{basicSet} &
+\cross{SREGSET}{coerce} \\
+\cross{SREGSET}{coHeight} &
+\cross{SREGSET}{collect} \\
+\cross{SREGSET}{collectQuasiMonic} &
+\cross{SREGSET}{collectUnder} \\
+\cross{SREGSET}{collectUpper} &
+\cross{SREGSET}{convert} \\
+\cross{SREGSET}{construct} &
+\cross{SREGSET}{copy} \\
+\cross{SREGSET}{count} &
+\cross{SREGSET}{degree} \\
+\cross{SREGSET}{empty} &
+\cross{SREGSET}{empty?} \\
+\cross{SREGSET}{eq?} &
+\cross{SREGSET}{eval} \\
+\cross{SREGSET}{every?} &
+\cross{SREGSET}{extend} \\
+\cross{SREGSET}{extendIfCan} &
+\cross{SREGSET}{find} \\
+\cross{SREGSET}{first} &
+\cross{SREGSET}{hash} \\
+\cross{SREGSET}{headReduce} &
+\cross{SREGSET}{headReduced?} \\
+\cross{SREGSET}{headRemainder} &
+\cross{SREGSET}{infRittWu?} \\
+\cross{SREGSET}{initiallyReduce} &
+\cross{SREGSET}{initiallyReduced?} \\
+\cross{SREGSET}{initials} &
+\cross{SREGSET}{internalAugment} \\
+\cross{SREGSET}{internalZeroSetSplit} &
+\cross{SREGSET}{intersect} \\
+\cross{SREGSET}{invertible?} &
+\cross{SREGSET}{invertibleSet} \\
+\cross{SREGSET}{invertibleElseSplit?} &
+\cross{SREGSET}{last} \\
+\cross{SREGSET}{lastSubResultant} &
+\cross{SREGSET}{lastSubResultantElseSplit} \\
+\cross{SREGSET}{less?} &
+\cross{SREGSET}{latex} \\
+\cross{SREGSET}{mainVariable?} &
+\cross{SREGSET}{mainVariables} \\
+\cross{SREGSET}{map} &
+\cross{SREGSET}{map!} \\
+\cross{SREGSET}{member?} &
+\cross{SREGSET}{members} \\
+\cross{SREGSET}{more?} &
+\cross{SREGSET}{mvar} \\
+\cross{SREGSET}{normalized?} &
+\cross{SREGSET}{parts} \\
+\cross{SREGSET}{preprocess} &
+\cross{SREGSET}{purelyAlgebraic?} \\
+\cross{SREGSET}{purelyAlgebraicLeadingMonomial?} &
+\cross{SREGSET}{purelyTranscendental?} \\
+\cross{SREGSET}{quasiComponent} &
+\cross{SREGSET}{reduce} \\
+\cross{SREGSET}{reduceByQuasiMonic} &
+\cross{SREGSET}{reduced?} \\
+\cross{SREGSET}{remainder} &
+\cross{SREGSET}{remove} \\
+\cross{SREGSET}{removeDuplicates} &
+\cross{SREGSET}{removeZero} \\
+\cross{SREGSET}{rest} &
+\cross{SREGSET}{retract} \\
+\cross{SREGSET}{retractIfCan} &
+\cross{SREGSET}{rewriteIdealWithHeadRemainder} \\
+\cross{SREGSET}{rewriteIdealWithRemainder} &
+\cross{SREGSET}{rewriteSetWithReduction} \\
+\cross{SREGSET}{roughBase?} &
+\cross{SREGSET}{roughEqualIdeals?} \\
+\cross{SREGSET}{roughSubIdeal?} &
+\cross{SREGSET}{roughUnitIdeal?} \\
+\cross{SREGSET}{sample} &
+\cross{SREGSET}{select} \\
+\cross{SREGSET}{size?} &
+\cross{SREGSET}{sort} \\
+\cross{SREGSET}{squareFreePart} &
+\cross{SREGSET}{stronglyReduce} \\
+\cross{SREGSET}{stronglyReduced?} &
+\cross{SREGSET}{triangular?} \\
+\cross{SREGSET}{trivialIdeal?} &
+\cross{SREGSET}{variables} \\
+\cross{SREGSET}{zeroSetSplit} &
+\cross{SREGSET}{zeroSetSplitIntoTriangularSystems} \\
+\cross{SREGSET}{\#{}?} &
+\cross{SREGSET}{?=?} \\
+\cross{SREGSET}{?\~{}=?} &
+\end{tabular}
+
 <<domain SREGSET SquareFreeRegularTriangularSet>>=
 )abbrev domain SREGSET SquareFreeRegularTriangularSet
 ++ Author: Marc Moreno Maza
@@ -87351,6 +89074,85 @@ o )show SquareMatrix
 \pageto{IndexedMatrix}{IMATRIX}
 \pageto{Matrix}{MATRIX}
 \pageto{RectangularMatrix}{RMATRIX}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SQMATRIX}{0} &
+\cross{SQMATRIX}{1} &
+\cross{SQMATRIX}{antisymmetric?} &
+\cross{SQMATRIX}{any?} &
+\cross{SQMATRIX}{characteristic} \\
+\cross{SQMATRIX}{coerce} &
+\cross{SQMATRIX}{column} &
+\cross{SQMATRIX}{convert} &
+\cross{SQMATRIX}{copy} &
+\cross{SQMATRIX}{count} \\
+\cross{SQMATRIX}{D} &
+\cross{SQMATRIX}{determinant} &
+\cross{SQMATRIX}{diagonal} &
+\cross{SQMATRIX}{diagonal?} &
+\cross{SQMATRIX}{diagonalMatrix} \\
+\cross{SQMATRIX}{diagonalProduct} &
+\cross{SQMATRIX}{differentiate} &
+\cross{SQMATRIX}{elt} &
+\cross{SQMATRIX}{empty} &
+\cross{SQMATRIX}{empty?} \\
+\cross{SQMATRIX}{eq?} &
+\cross{SQMATRIX}{eval} &
+\cross{SQMATRIX}{every?} &
+\cross{SQMATRIX}{exquo} &
+\cross{SQMATRIX}{hash} \\
+\cross{SQMATRIX}{inverse} &
+\cross{SQMATRIX}{latex} &
+\cross{SQMATRIX}{less?} &
+\cross{SQMATRIX}{listOfLists} &
+\cross{SQMATRIX}{map} \\
+\cross{SQMATRIX}{map!} &
+\cross{SQMATRIX}{matrix} &
+\cross{SQMATRIX}{maxColIndex} &
+\cross{SQMATRIX}{maxRowIndex} &
+\cross{SQMATRIX}{member?} \\
+\cross{SQMATRIX}{members} &
+\cross{SQMATRIX}{minColIndex} &
+\cross{SQMATRIX}{minordet} &
+\cross{SQMATRIX}{minRowIndex} &
+\cross{SQMATRIX}{more?} \\
+\cross{SQMATRIX}{ncols} &
+\cross{SQMATRIX}{nrows} &
+\cross{SQMATRIX}{nullSpace} &
+\cross{SQMATRIX}{nullity} &
+\cross{SQMATRIX}{one?} \\
+\cross{SQMATRIX}{parts} &
+\cross{SQMATRIX}{qelt} &
+\cross{SQMATRIX}{rank} &
+\cross{SQMATRIX}{recip} &
+\cross{SQMATRIX}{reducedSystem} \\
+\cross{SQMATRIX}{retract} &
+\cross{SQMATRIX}{retractIfCan} &
+\cross{SQMATRIX}{row} &
+\cross{SQMATRIX}{rowEchelon} &
+\cross{SQMATRIX}{sample} \\
+\cross{SQMATRIX}{scalarMatrix} &
+\cross{SQMATRIX}{size?} &
+\cross{SQMATRIX}{square?} &
+\cross{SQMATRIX}{squareMatrix} &
+\cross{SQMATRIX}{subtractIfCan} \\
+\cross{SQMATRIX}{symmetric?} &
+\cross{SQMATRIX}{trace} &
+\cross{SQMATRIX}{transpose} &
+\cross{SQMATRIX}{zero?} &
+\cross{SQMATRIX}{\#{}?} \\
+\cross{SQMATRIX}{?*?} &
+\cross{SQMATRIX}{?**?} &
+\cross{SQMATRIX}{?+?} &
+\cross{SQMATRIX}{?-?} &
+\cross{SQMATRIX}{-?} \\
+\cross{SQMATRIX}{?=?} &
+\cross{SQMATRIX}{?\^{}?} &
+\cross{SQMATRIX}{?\~{}=?} &
+\cross{SQMATRIX}{?/?} &
+\end{tabular}
+
 <<domain SQMATRIX SquareMatrix>>=
 )abbrev domain SQMATRIX SquareMatrix
 ++ Author: Grabmeier, Gschnitzer, Williamson
@@ -87504,6 +89306,43 @@ SquareMatrix(ndim,R): Exports == Implementation where
 \pageto{Queue}{QUEUE}
 \pageto{Dequeue}{DEQUEUE}
 \pageto{Heap}{HEAP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{STACK}{any?} &
+\cross{STACK}{bag} &
+\cross{STACK}{coerce} &
+\cross{STACK}{copy} &
+\cross{STACK}{count} \\
+\cross{STACK}{depth} &
+\cross{STACK}{empty} &
+\cross{STACK}{empty?} &
+\cross{STACK}{eq?} &
+\cross{STACK}{eval} \\
+\cross{STACK}{every?} &
+\cross{STACK}{extract!} &
+\cross{STACK}{hash} &
+\cross{STACK}{insert!} &
+\cross{STACK}{inspect} \\
+\cross{STACK}{latex} &
+\cross{STACK}{less?} &
+\cross{STACK}{map} &
+\cross{STACK}{map!} &
+\cross{STACK}{member?} \\
+\cross{STACK}{members} &
+\cross{STACK}{more?} &
+\cross{STACK}{parts} &
+\cross{STACK}{pop!} &
+\cross{STACK}{push!} \\
+\cross{STACK}{sample} &
+\cross{STACK}{size?} &
+\cross{STACK}{stack} &
+\cross{STACK}{top} &
+\cross{STACK}{\#{}?} \\
+\cross{STACK}{?=?} &
+\cross{STACK}{?\~{}=?} &&&
+\end{tabular}
+
 <<domain STACK Stack>>=
 )abbrev domain STACK Stack
 ++ Author: Michael Monagan and Stephen Watt
@@ -87743,6 +89582,114 @@ o )show Stream
 @
 \pagehead{Stream}{STREAM}
 \pagepic{ps/v103stream.ps}{STREAM}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{STREAM}{any?} &
+\cross{STREAM}{child?} &
+\cross{STREAM}{children} \\
+\cross{STREAM}{coerce} &
+\cross{STREAM}{complete} &
+\cross{STREAM}{concat} \\
+\cross{STREAM}{concat!} &
+\cross{STREAM}{cons} &
+\cross{STREAM}{construct} \\
+\cross{STREAM}{convert} &
+\cross{STREAM}{copy} &
+\cross{STREAM}{count} \\
+\cross{STREAM}{cycleEntry} &
+\cross{STREAM}{cycleLength} &
+\cross{STREAM}{cycleSplit!} \\
+\cross{STREAM}{cycleTail} &
+\cross{STREAM}{cyclic?} &
+\cross{STREAM}{delay} \\
+\cross{STREAM}{delete} &
+\cross{STREAM}{distance} &
+\cross{STREAM}{elt} \\
+\cross{STREAM}{empty} &
+\cross{STREAM}{empty?} &
+\cross{STREAM}{entries} \\
+\cross{STREAM}{entry?} &
+\cross{STREAM}{eq?} &
+\cross{STREAM}{eval} \\
+\cross{STREAM}{eval} &
+\cross{STREAM}{eval} &
+\cross{STREAM}{eval} \\
+\cross{STREAM}{every?} &
+\cross{STREAM}{explicitEntries?} &
+\cross{STREAM}{explicitlyEmpty?} \\
+\cross{STREAM}{explicitlyFinite?} &
+\cross{STREAM}{extend} &
+\cross{STREAM}{fill!} \\
+\cross{STREAM}{filterUntil} &
+\cross{STREAM}{filterWhile} &
+\cross{STREAM}{find} \\
+\cross{STREAM}{findCycle} &
+\cross{STREAM}{first} &
+\cross{STREAM}{frst} \\
+\cross{STREAM}{generate} &
+\cross{STREAM}{hash} &
+\cross{STREAM}{index?} \\
+\cross{STREAM}{indices} &
+\cross{STREAM}{insert} &
+\cross{STREAM}{insert} \\
+\cross{STREAM}{last} &
+\cross{STREAM}{latex} &
+\cross{STREAM}{lazy?} \\
+\cross{STREAM}{lazyEvaluate} &
+\cross{STREAM}{leaf?} &
+\cross{STREAM}{leaves} \\
+\cross{STREAM}{less?} &
+\cross{STREAM}{map} &
+\cross{STREAM}{map!} \\
+\cross{STREAM}{maxIndex} &
+\cross{STREAM}{member?} &
+\cross{STREAM}{members} \\
+\cross{STREAM}{minIndex} &
+\cross{STREAM}{more?} &
+\cross{STREAM}{new} \\
+\cross{STREAM}{nodes} &
+\cross{STREAM}{node?} &
+\cross{STREAM}{numberOfComputedEntries} \\
+\cross{STREAM}{output} &
+\cross{STREAM}{parts} &
+\cross{STREAM}{possiblyInfinite?} \\
+\cross{STREAM}{qelt} &
+\cross{STREAM}{qsetelt!} &
+\cross{STREAM}{reduce} \\
+\cross{STREAM}{remove} &
+\cross{STREAM}{removeDuplicates} &
+\cross{STREAM}{repeating} \\
+\cross{STREAM}{repeating?} &
+\cross{STREAM}{rest} &
+\cross{STREAM}{rst} \\
+\cross{STREAM}{sample} &
+\cross{STREAM}{second} &
+\cross{STREAM}{select} \\
+\cross{STREAM}{setchildren!} &
+\cross{STREAM}{setelt} &
+\cross{STREAM}{setfirst!} \\
+\cross{STREAM}{setlast!} &
+\cross{STREAM}{setrest!} &
+\cross{STREAM}{setvalue!} \\
+\cross{STREAM}{showAll?} &
+\cross{STREAM}{showAllElements} &
+\cross{STREAM}{size?} \\
+\cross{STREAM}{split!} &
+\cross{STREAM}{swap!} &
+\cross{STREAM}{tail} \\
+\cross{STREAM}{third} &
+\cross{STREAM}{value} &
+\cross{STREAM}{\#?} \\
+\cross{STREAM}{?=?} &
+\cross{STREAM}{?\~{}=?} &
+\cross{STREAM}{?.?} \\
+\cross{STREAM}{?.last} &
+\cross{STREAM}{?.rest} &
+\cross{STREAM}{?.first} \\
+\cross{STREAM}{?.value} &&
+\end{tabular}
+
 <<domain STREAM Stream>>=
 )abbrev domain STREAM Stream
 ++ Implementation of streams via lazy evaluation
@@ -88908,6 +90855,88 @@ o )show String
 \pageto{Character}{CHAR}
 \pageto{CharacterClass}{CCLASS}
 \pageto{IndexedString}{ISTRING}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{STRING}{any?} &
+\cross{STRING}{coerce} &
+\cross{STRING}{concat} &
+\cross{STRING}{construct} &
+\cross{STRING}{convert} \\
+\cross{STRING}{copy} &
+\cross{STRING}{copyInto!} &
+\cross{STRING}{count} &
+\cross{STRING}{delete} &
+\cross{STRING}{elt} \\
+\cross{STRING}{empty} &
+\cross{STRING}{empty?} &
+\cross{STRING}{entries} &
+\cross{STRING}{entry?} &
+\cross{STRING}{eq?} \\
+\cross{STRING}{eval} &
+\cross{STRING}{every?} &
+\cross{STRING}{fill!} &
+\cross{STRING}{find} &
+\cross{STRING}{first} \\
+\cross{STRING}{hash} &
+\cross{STRING}{index?} &
+\cross{STRING}{indices} &
+\cross{STRING}{insert} &
+\cross{STRING}{latex} \\
+\cross{STRING}{leftTrim} &
+\cross{STRING}{less?} &
+\cross{STRING}{lowerCase} &
+\cross{STRING}{lowerCase!} &
+\cross{STRING}{map} \\
+\cross{STRING}{map!} &
+\cross{STRING}{match} &
+\cross{STRING}{match?} &
+\cross{STRING}{max} &
+\cross{STRING}{maxIndex} \\
+\cross{STRING}{member?} &
+\cross{STRING}{members} &
+\cross{STRING}{merge} &
+\cross{STRING}{min} &
+\cross{STRING}{minIndex} \\
+\cross{STRING}{more?} &
+\cross{STRING}{new} &
+\cross{STRING}{OMwrite} &
+\cross{STRING}{parts} &
+\cross{STRING}{position} \\
+\cross{STRING}{prefix?} &
+\cross{STRING}{qelt} &
+\cross{STRING}{qsetelt!} &
+\cross{STRING}{reduce} &
+\cross{STRING}{removeDuplicates} \\
+\cross{STRING}{replace} &
+\cross{STRING}{reverse} &
+\cross{STRING}{reverse!} &
+\cross{STRING}{rightTrim} &
+\cross{STRING}{sample} \\
+\cross{STRING}{select} &
+\cross{STRING}{setelt} &
+\cross{STRING}{size?} &
+\cross{STRING}{sort} &
+\cross{STRING}{sort!} \\
+\cross{STRING}{sorted?} &
+\cross{STRING}{split} &
+\cross{STRING}{string} &
+\cross{STRING}{substring?} &
+\cross{STRING}{suffix?} \\
+\cross{STRING}{swap!} &
+\cross{STRING}{trim} &
+\cross{STRING}{upperCase} &
+\cross{STRING}{upperCase!} &
+\cross{STRING}{\#{}?} \\
+\cross{STRING}{?=?} &
+\cross{STRING}{?.?} &
+\cross{STRING}{?\~{}=?} &
+\cross{STRING}{?$<$?} &
+\cross{STRING}{?$<=$?} \\
+\cross{STRING}{?$>$?} &
+\cross{STRING}{?$>=$?} &&&
+\end{tabular}
+
 <<domain STRING String>>=
 )abbrev domain STRING String
 ++ Description:
@@ -89042,6 +91071,66 @@ o )show StringTable
 \pageto{EqTable}{EQTBL}
 \pageto{GeneralSparseTable}{GSTBL}
 \pageto{SparseTable}{STBL}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{STRTBL}{any?} &
+\cross{STRTBL}{bag} &
+\cross{STRTBL}{coerce} &
+\cross{STRTBL}{construct} &
+\cross{STRTBL}{convert} \\
+\cross{STRTBL}{copy} &
+\cross{STRTBL}{count} &
+\cross{STRTBL}{dictionary} &
+\cross{STRTBL}{elt} &
+\cross{STRTBL}{empty} \\
+\cross{STRTBL}{empty?} &
+\cross{STRTBL}{entries} &
+\cross{STRTBL}{entry?} &
+\cross{STRTBL}{eq?} &
+\cross{STRTBL}{eval} \\
+\cross{STRTBL}{every?} &
+\cross{STRTBL}{extract!} &
+\cross{STRTBL}{fill!} &
+\cross{STRTBL}{find} &
+\cross{STRTBL}{first} \\
+\cross{STRTBL}{hash} &
+\cross{STRTBL}{index?} &
+\cross{STRTBL}{indices} &
+\cross{STRTBL}{insert!} &
+\cross{STRTBL}{inspect} \\
+\cross{STRTBL}{key?} &
+\cross{STRTBL}{keys} &
+\cross{STRTBL}{latex} &
+\cross{STRTBL}{less?} &
+\cross{STRTBL}{map} \\
+\cross{STRTBL}{map!} &
+\cross{STRTBL}{maxIndex} &
+\cross{STRTBL}{member?} &
+\cross{STRTBL}{members} &
+\cross{STRTBL}{minIndex} \\
+\cross{STRTBL}{more?} &
+\cross{STRTBL}{parts} &
+\cross{STRTBL}{qelt} &
+\cross{STRTBL}{qsetelt!} &
+\cross{STRTBL}{reduce} \\
+\cross{STRTBL}{remove} &
+\cross{STRTBL}{remove!} &
+\cross{STRTBL}{removeDuplicates} &
+\cross{STRTBL}{sample} &
+\cross{STRTBL}{search} \\
+\cross{STRTBL}{select} &
+\cross{STRTBL}{select!} &
+\cross{STRTBL}{setelt} &
+\cross{STRTBL}{size?} &
+\cross{STRTBL}{swap!} \\
+\cross{STRTBL}{table} &
+\cross{STRTBL}{\#{}?} &
+\cross{STRTBL}{?=?} &
+\cross{STRTBL}{?\~{}=?} &
+\cross{STRTBL}{?.?} 
+\end{tabular}
+
 <<domain STRTBL StringTable>>=
 )abbrev domain STRTBL StringTable
 ++ Author: Stephen M. Watt
@@ -89121,6 +91210,44 @@ point.
 {\bf See}\\
 \pageto{Point}{POINT}
 \pageto{SubSpaceComponentProperty}{COMPPROP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SUBSPACE}{addPoint} &
+\cross{SUBSPACE}{addPointLast} &
+\cross{SUBSPACE}{addPoint2} &
+\cross{SUBSPACE}{birth} &
+\cross{SUBSPACE}{child} \\
+\cross{SUBSPACE}{children} &
+\cross{SUBSPACE}{closeComponent} &
+\cross{SUBSPACE}{coerce} &
+\cross{SUBSPACE}{deepCopy} &
+\cross{SUBSPACE}{defineProperty} \\
+\cross{SUBSPACE}{extractClosed} &
+\cross{SUBSPACE}{extractIndex} &
+\cross{SUBSPACE}{extractPoint} &
+\cross{SUBSPACE}{extractProperty} &
+\cross{SUBSPACE}{hash} \\
+\cross{SUBSPACE}{internal?} &
+\cross{SUBSPACE}{latex} &
+\cross{SUBSPACE}{leaf?} &
+\cross{SUBSPACE}{level} &
+\cross{SUBSPACE}{merge} \\
+\cross{SUBSPACE}{merge} &
+\cross{SUBSPACE}{modifyPoint} &
+\cross{SUBSPACE}{new} &
+\cross{SUBSPACE}{numberOfChildren} &
+\cross{SUBSPACE}{parent} \\
+\cross{SUBSPACE}{pointData} &
+\cross{SUBSPACE}{root?} &
+\cross{SUBSPACE}{separate} &
+\cross{SUBSPACE}{shallowCopy} &
+\cross{SUBSPACE}{subspace} \\
+\cross{SUBSPACE}{traverse} &
+\cross{SUBSPACE}{?~=?} &
+\cross{SUBSPACE}{?=?} &&
+\end{tabular}
+
 <<domain SUBSPACE SubSpace>>=
 )abbrev domain SUBSPACE SubSpace
 ++ Description:
@@ -89553,6 +91680,22 @@ SubSpace(n:PI,R:Ring) : Exports == Implementation where
 {\bf See}\\
 \pageto{Point}{POINT}
 \pageto{SubSpace}{SUBSPACE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{COMPPROP}{close} &
+\cross{COMPPROP}{closed?} &
+\cross{COMPPROP}{coerce} &
+\cross{COMPPROP}{copy} &
+\cross{COMPPROP}{hash} \\
+\cross{COMPPROP}{latex} &
+\cross{COMPPROP}{new} &
+\cross{COMPPROP}{solid} &
+\cross{COMPPROP}{solid?} &
+\cross{COMPPROP}{?\~{}=?} \\
+\cross{COMPPROP}{?=?} &&&&
+\end{tabular}
+
 <<domain COMPPROP SubSpaceComponentProperty>>=
 )abbrev domain COMPPROP SubSpaceComponentProperty
 ++ Description:
@@ -89611,6 +91754,19 @@ SubSpaceComponentProperty() : Exports == Implementation where
 \section{domain SUCH SuchThat}
 \pagehead{SuchThat}{SUCH}
 \pagepic{ps/v103suchthat.ps}{SUCH}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SUCH}{coerce} &
+\cross{SUCH}{construct} &
+\cross{SUCH}{hash} &
+\cross{SUCH}{latex} &
+\cross{SUCH}{lhs} \\
+\cross{SUCH}{rhs} &
+\cross{SUCH}{?=?} &
+\cross{SUCH}{?\~{}=?} &&
+\end{tabular}
+
 <<domain SUCH SuchThat>>=
 )abbrev domain SUCH SuchThat
 ++ Description:
@@ -89655,6 +91811,20 @@ SuchThat(S1, S2): Cat == Capsule where
 \pageto{SimpleFortranProgram}{SFORT}
 \pageto{FortranTemplate}{FTEM}
 \pageto{FortranExpression}{FEXPR}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllllll}
+\cross{SWITCH}{coerce} &
+\cross{SWITCH}{AND} &
+\cross{SWITCH}{EQ} &
+\cross{SWITCH}{GE} &
+\cross{SWITCH}{GT} &
+\cross{SWITCH}{LE} &
+\cross{SWITCH}{LT} &
+\cross{SWITCH}{NOT} &
+\cross{SWITCH}{OR} 
+\end{tabular}
+
 <<domain SWITCH Switch>>=
 )abbrev domain SWITCH Switch
 -- Because of a bug in the compiler:
@@ -90134,6 +92304,38 @@ o )show Symbol
 @
 \pagehead{Symbol}{SYMBOL}
 \pagepic{ps/v103symbol.ps}{SYMBOL}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SYMBOL}{argscript} &
+\cross{SYMBOL}{coerce} &
+\cross{SYMBOL}{convert} &
+\cross{SYMBOL}{hash} &
+\cross{SYMBOL}{latex} \\
+\cross{SYMBOL}{list} &
+\cross{SYMBOL}{max} &
+\cross{SYMBOL}{min} &
+\cross{SYMBOL}{name} &
+\cross{SYMBOL}{new} \\
+\cross{SYMBOL}{OMwrite} &
+\cross{SYMBOL}{patternMatch} &
+\cross{SYMBOL}{resetNew} &
+\cross{SYMBOL}{sample} &
+\cross{SYMBOL}{script} \\
+\cross{SYMBOL}{scripts} &
+\cross{SYMBOL}{scripted?} &
+\cross{SYMBOL}{string} &
+\cross{SYMBOL}{subscript} &
+\cross{SYMBOL}{superscript} \\
+\cross{SYMBOL}{?\~{}=?} &
+\cross{SYMBOL}{?.?} &
+\cross{SYMBOL}{?$<$?} &
+\cross{SYMBOL}{?$<=$?} &
+\cross{SYMBOL}{?=?} \\
+\cross{SYMBOL}{?$>$?} &
+\cross{SYMBOL}{?$>=$?} &&&
+\end{tabular}
+
 <<domain SYMBOL Symbol>>=
 )abbrev domain SYMBOL Symbol
 ++ Author: Stephen Watt
@@ -90458,6 +92660,22 @@ Symbol(): Exports == Implementation where
 \pageto{FortranScalarType}{FST}
 \pageto{FortranType}{FT}
 \pageto{TheSymbolTable}{SYMS}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SYMTAB}{coerce} &
+\cross{SYMTAB}{declare!} &
+\cross{SYMTAB}{empty} &
+\cross{SYMTAB}{externalList} &
+\cross{SYMTAB}{fortranTypeOf} \\
+\cross{SYMTAB}{newTypeLists} &
+\cross{SYMTAB}{parametersOf} &
+\cross{SYMTAB}{printTypes} &
+\cross{SYMTAB}{symbolTable} &
+\cross{SYMTAB}{typeList} \\
+\cross{SYMTAB}{typeLists} &&&&
+\end{tabular}
+
 <<domain SYMTAB SymbolTable>>=
 )abbrev domain SYMTAB SymbolTable
 ++ Author: Mike Dewar
@@ -90651,6 +92869,59 @@ SymbolTable() : exports == implementation where
 \pagepic{ps/v103symmetricpolynomial.ps}{SYMPOLY}{1.00}
 {\bf See}\\
 \pageto{Partition}{PRTITION}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{SYMPOLY}{0} &
+\cross{SYMPOLY}{1} &
+\cross{SYMPOLY}{associates?} &
+\cross{SYMPOLY}{binomThmExpt} \\
+\cross{SYMPOLY}{characteristic} &
+\cross{SYMPOLY}{charthRoot} &
+\cross{SYMPOLY}{coefficient} \\
+\cross{SYMPOLY}{coefficients} &
+\cross{SYMPOLY}{coerce} &
+\cross{SYMPOLY}{content} &
+\cross{SYMPOLY}{degree} \\
+\cross{SYMPOLY}{exquo} &
+\cross{SYMPOLY}{exquo} &
+\cross{SYMPOLY}{fmecg} &
+\cross{SYMPOLY}{ground} \\
+\cross{SYMPOLY}{ground?} &
+\cross{SYMPOLY}{hash} &
+\cross{SYMPOLY}{latex} &
+\cross{SYMPOLY}{leadingCoefficient} \\
+\cross{SYMPOLY}{leadingMonomial} &
+\cross{SYMPOLY}{map} &
+\cross{SYMPOLY}{mapExponents} &
+\cross{SYMPOLY}{minimumDegree} \\
+\cross{SYMPOLY}{monomial} &
+\cross{SYMPOLY}{monomial?} &
+\cross{SYMPOLY}{numberOfMonomials} &
+\cross{SYMPOLY}{one?} \\
+\cross{SYMPOLY}{pomopo!} &
+\cross{SYMPOLY}{primitivePart} &
+\cross{SYMPOLY}{recip} &
+\cross{SYMPOLY}{reductum} \\
+\cross{SYMPOLY}{retract} &
+\cross{SYMPOLY}{retractIfCan} &
+\cross{SYMPOLY}{sample} &
+\cross{SYMPOLY}{subtractIfCan} \\
+\cross{SYMPOLY}{unit?} &
+\cross{SYMPOLY}{unitCanonical} &
+\cross{SYMPOLY}{unitNormal} &
+\cross{SYMPOLY}{zero?} \\
+\cross{SYMPOLY}{?\~{}=?} &
+\cross{SYMPOLY}{?**?} &
+\cross{SYMPOLY}{?/?} &
+\cross{SYMPOLY}{?\^{}?} \\
+\cross{SYMPOLY}{?*?} &
+\cross{SYMPOLY}{?+?} &
+\cross{SYMPOLY}{?-?} &
+\cross{SYMPOLY}{-?} \\
+\cross{SYMPOLY}{?=?} &&&
+\end{tabular}
+
 <<domain SYMPOLY SymmetricPolynomial>>=
 )abbrev domain SYMPOLY SymmetricPolynomial
 ++ Description:
@@ -91004,6 +93275,68 @@ o )show Table
 \pageto{StringTable}{STRTBL}
 \pageto{GeneralSparseTable}{GSTBL}
 \pageto{SparseTable}{STBL}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{TABLE}{any?} &
+\cross{TABLE}{bag} &
+\cross{TABLE}{coerce} &
+\cross{TABLE}{construct} &
+\cross{TABLE}{convert} \\
+\cross{TABLE}{copy} &
+\cross{TABLE}{count} &
+\cross{TABLE}{dictionary} &
+\cross{TABLE}{elt} &
+\cross{TABLE}{empty} \\
+\cross{TABLE}{empty?} &
+\cross{TABLE}{entries} &
+\cross{TABLE}{entry?} &
+\cross{TABLE}{eq?} &
+\cross{TABLE}{eval} \\
+\cross{TABLE}{eval} &
+\cross{TABLE}{every?} &
+\cross{TABLE}{extract!} &
+\cross{TABLE}{fill!} &
+\cross{TABLE}{find} \\
+\cross{TABLE}{first} &
+\cross{TABLE}{hash} &
+\cross{TABLE}{index?} &
+\cross{TABLE}{indices} &
+\cross{TABLE}{insert!} \\
+\cross{TABLE}{inspect} &
+\cross{TABLE}{key?} &
+\cross{TABLE}{keys} &
+\cross{TABLE}{latex} &
+\cross{TABLE}{less?} \\
+\cross{TABLE}{map} &
+\cross{TABLE}{map} &
+\cross{TABLE}{map!} &
+\cross{TABLE}{maxIndex} &
+\cross{TABLE}{member?} \\
+\cross{TABLE}{members} &
+\cross{TABLE}{minIndex} &
+\cross{TABLE}{more?} &
+\cross{TABLE}{parts} &
+\cross{TABLE}{qelt} \\
+\cross{TABLE}{qsetelt!} &
+\cross{TABLE}{reduce} &
+\cross{TABLE}{remove} &
+\cross{TABLE}{remove!} &
+\cross{TABLE}{removeDuplicates} \\
+\cross{TABLE}{sample} &
+\cross{TABLE}{search} &
+\cross{TABLE}{select} &
+\cross{TABLE}{select!} &
+\cross{TABLE}{setelt} \\
+\cross{TABLE}{size?} &
+\cross{TABLE}{swap!} &
+\cross{TABLE}{table} &
+\cross{TABLE}{\#{}?} &
+\cross{TABLE}{?=?} \\
+\cross{TABLE}{?\~{}=?} &
+\cross{TABLE}{?.?} &&&
+\end{tabular}
+
 <<domain TABLE Table>>=
 )abbrev domain TABLE Table
 ++ Author: Stephen M. Watt, Barry Trager
@@ -91042,6 +93375,14 @@ Table(Key: SetCategory, Entry: SetCategory):Exports == Implementation where
 \section{domain TABLEAU Tableau}
 \pagehead{Tableau}{TABLEAU}
 \pagepic{ps/v103tableau.ps}{TABLEAU}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{TABLEAU}{coerce} &
+\cross{TABLEAU}{listOfLists} &
+\cross{TABLEAU}{tableau} 
+\end{tabular}
+
 <<domain TABLEAU Tableau>>=
 )abbrev domain TABLEAU Tableau
 ++ Author: William H. Burge
@@ -91106,6 +93447,85 @@ Tableau(S:SetCategory):Exports == Implementation where
 \pagepic{ps/v103taylorseries.ps}{TS}{1.00}
 {\bf See}\\
 \pageto{SparseMultivariateTaylorSeries}{SMTS}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{TS}{0} &
+\cross{TS}{1} &
+\cross{TS}{acos} &
+\cross{TS}{acosh} &
+\cross{TS}{acot} \\
+\cross{TS}{acoth} &
+\cross{TS}{acsc} &
+\cross{TS}{acsch} &
+\cross{TS}{asec} &
+\cross{TS}{asech} \\
+\cross{TS}{asin} &
+\cross{TS}{asinh} &
+\cross{TS}{associates?} &
+\cross{TS}{atan} &
+\cross{TS}{atanh} \\
+\cross{TS}{characteristic} &
+\cross{TS}{charthRoot} &
+\cross{TS}{coefficient} &
+\cross{TS}{coerce} &
+\cross{TS}{complete} \\
+\cross{TS}{cos} &
+\cross{TS}{cosh} &
+\cross{TS}{cot} &
+\cross{TS}{coth} &
+\cross{TS}{csc} \\
+\cross{TS}{csch} &
+\cross{TS}{D} &
+\cross{TS}{degree} &
+\cross{TS}{differentiate} &
+\cross{TS}{eval} \\
+\cross{TS}{exp} &
+\cross{TS}{exquo} &
+\cross{TS}{extend} &
+\cross{TS}{fintegrate} &
+\cross{TS}{hash} \\
+\cross{TS}{integrate} &
+\cross{TS}{latex} &
+\cross{TS}{leadingCoefficient} &
+\cross{TS}{leadingMonomial} &
+\cross{TS}{log} \\
+\cross{TS}{map} &
+\cross{TS}{monomial} &
+\cross{TS}{monomial?} &
+\cross{TS}{nthRoot} &
+\cross{TS}{one?} \\
+\cross{TS}{order} &
+\cross{TS}{pi} &
+\cross{TS}{pole?} &
+\cross{TS}{polynomial} &
+\cross{TS}{recip} \\
+\cross{TS}{reductum} &
+\cross{TS}{sample} &
+\cross{TS}{sec} &
+\cross{TS}{sech} &
+\cross{TS}{sin} \\
+\cross{TS}{sinh} &
+\cross{TS}{sqrt} &
+\cross{TS}{subtractIfCan} &
+\cross{TS}{tan} &
+\cross{TS}{tanh} \\
+\cross{TS}{unit?} &
+\cross{TS}{unitCanonical} &
+\cross{TS}{unitNormal} &
+\cross{TS}{variables} &
+\cross{TS}{zero?} \\
+\cross{TS}{?*?} &
+\cross{TS}{?**?} &
+\cross{TS}{?+?} &
+\cross{TS}{?-?} &
+\cross{TS}{-?} \\
+\cross{TS}{?=?} &
+\cross{TS}{?\^{}?} &
+\cross{TS}{?\~{}=?} &
+\cross{TS}{?/?} &
+\end{tabular}
+
 <<domain TS TaylorSeries>>=
 )abbrev domain TS TaylorSeries
 ++ Authors: Burge, Watt, Williamson
@@ -91203,6 +93623,26 @@ in addition we need to add a line defining [[PI2]] in [[formatPlex]]:
 @
 \pagehead{TexFormat}{TEX}
 \pagepic{ps/v103texformat.ps}{TEX}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{TEX}{coerce} &
+\cross{TEX}{convert} &
+\cross{TEX}{display} &
+\cross{TEX}{epilogue} &
+\cross{TEX}{hash} \\
+\cross{TEX}{latex} &
+\cross{TEX}{new} &
+\cross{TEX}{prologue} &
+\cross{TEX}{setEpilogue!} &
+\cross{TEX}{setPrologue!} \\
+\cross{TEX}{setTex!} &
+\cross{TEX}{tex} &
+\cross{TEX}{convert} &
+\cross{TEX}{?=?} &
+\cross{TEX}{?\~{}=?}
+\end{tabular}
+
 <<domain TEX TexFormat>>=
 )abbrev domain TEX TexFormat
 ++ Author: Robert S. Sutor
@@ -91974,6 +94414,28 @@ o )show TextFile
 \pageto{BinaryFile}{BINFILE}
 \pageto{KeyedAccessFile}{KAFILE}
 \pageto{Library}{LIB}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{TEXTFILE}{close!} &
+\cross{TEXTFILE}{coerce} &
+\cross{TEXTFILE}{endOfFile?} &
+\cross{TEXTFILE}{hash} &
+\cross{TEXTFILE}{iomode} \\
+\cross{TEXTFILE}{latex} &
+\cross{TEXTFILE}{name} &
+\cross{TEXTFILE}{open} &
+\cross{TEXTFILE}{read!} &
+\cross{TEXTFILE}{readIfCan!} \\
+\cross{TEXTFILE}{readLine!} &
+\cross{TEXTFILE}{readLineIfCan!} &
+\cross{TEXTFILE}{reopen!} &
+\cross{TEXTFILE}{write!} &
+\cross{TEXTFILE}{writeLine!} \\
+\cross{TEXTFILE}{?=?} &
+\cross{TEXTFILE}{?\~{}=?} &&&
+\end{tabular}
+
 <<domain TEXTFILE TextFile>>=
 )abbrev domain TEXTFILE TextFile
 ++ Author: Stephen M. Watt
@@ -92075,6 +94537,26 @@ TextFile: Cat == Def where
 \pageto{FortranScalarType}{FST}
 \pageto{FortranType}{FT}
 \pageto{SymbolTable}{SYMTAB}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SYMS}{argumentList!} &
+\cross{SYMS}{argumentListOf} &
+\cross{SYMS}{clearTheSymbolTable} &
+\cross{SYMS}{coerce} &
+\cross{SYMS}{currentSubProgram} \\
+\cross{SYMS}{declare!} &
+\cross{SYMS}{empty} &
+\cross{SYMS}{endSubProgram} &
+\cross{SYMS}{newSubProgram} &
+\cross{SYMS}{printHeader} \\
+\cross{SYMS}{printTypes} &
+\cross{SYMS}{returnType!} &
+\cross{SYMS}{returnTypeOf} &
+\cross{SYMS}{showTheSymbolTable} &
+\cross{SYMS}{symbolTableOf} 
+\end{tabular}
+
 <<domain SYMS TheSymbolTable>>=
 )abbrev domain SYMS TheSymbolTable
 ++ Author: Mike Dewar
@@ -92295,6 +94777,42 @@ TheSymbolTable() : Exports == Implementation where
 \pageto{Switch}{SWITCH}
 \pageto{FortranTemplate}{FTEM}
 \pageto{FortranExpression}{FEXPR}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{M3D}{any?} &
+\cross{M3D}{coerce} &
+\cross{M3D}{construct} &
+\cross{M3D}{copy} &
+\cross{M3D}{count} \\
+\cross{M3D}{elt} &
+\cross{M3D}{empty} &
+\cross{M3D}{empty?} &
+\cross{M3D}{eq?} &
+\cross{M3D}{eval} \\
+\cross{M3D}{every?} &
+\cross{M3D}{hash} &
+\cross{M3D}{identityMatrix} &
+\cross{M3D}{latex} &
+\cross{M3D}{less?} \\
+\cross{M3D}{map} &
+\cross{M3D}{map!} &
+\cross{M3D}{matrixConcat3D} &
+\cross{M3D}{matrixDimensions} &
+\cross{M3D}{member?} \\
+\cross{M3D}{members} &
+\cross{M3D}{more?} &
+\cross{M3D}{parts} &
+\cross{M3D}{plus} &
+\cross{M3D}{sample} \\
+\cross{M3D}{setelt!} &
+\cross{M3D}{size?} &
+\cross{M3D}{zeroMatrix} &
+\cross{M3D}{\#{}?} &
+\cross{M3D}{?=?} \\
+\cross{M3D}{?\~{}=?} &&&&
+\end{tabular}
+
 <<domain M3D ThreeDimensionalMatrix>>=
 )abbrev domain M3D ThreeDimensionalMatrix
 ++ Author: William Naylor
@@ -92553,6 +95071,52 @@ ThreeDimensionalMatrix(R) : Exports == Implementation where
 \section{domain VIEW3D ThreeDimensionalViewport}
 \pagehead{ThreeDimensionalViewport}{VIEW3D}
 \pagepic{ps/v103threedimensionalviewport.ps}{VIEW3D}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{VIEW3D}{axes} &
+\cross{VIEW3D}{clipSurface} &
+\cross{VIEW3D}{colorDef} &
+\cross{VIEW3D}{close} &
+\cross{VIEW3D}{coerce} \\
+\cross{VIEW3D}{controlPanel} &
+\cross{VIEW3D}{diagonals} &
+\cross{VIEW3D}{dimensions} &
+\cross{VIEW3D}{drawStyle} &
+\cross{VIEW3D}{eyeDistance} \\
+\cross{VIEW3D}{hash} &
+\cross{VIEW3D}{hitherPlane} &
+\cross{VIEW3D}{intensity} &
+\cross{VIEW3D}{key} &
+\cross{VIEW3D}{latex} \\
+\cross{VIEW3D}{lighting} &
+\cross{VIEW3D}{makeViewport3D} &
+\cross{VIEW3D}{modifyPointData} &
+\cross{VIEW3D}{move} &
+\cross{VIEW3D}{options} \\
+\cross{VIEW3D}{outlineRender} &
+\cross{VIEW3D}{perspective} &
+\cross{VIEW3D}{reset} &
+\cross{VIEW3D}{resize} &
+\cross{VIEW3D}{rotate} \\
+\cross{VIEW3D}{showClipRegion} &
+\cross{VIEW3D}{showRegion} &
+\cross{VIEW3D}{subspace} &
+\cross{VIEW3D}{title} &
+\cross{VIEW3D}{translate} \\
+\cross{VIEW3D}{viewDeltaXDefault} &
+\cross{VIEW3D}{viewDeltaYDefault} &
+\cross{VIEW3D}{viewPhiDefault} &
+\cross{VIEW3D}{viewpoint} &
+\cross{VIEW3D}{viewThetaDefault} \\
+\cross{VIEW3D}{viewZoomDefault} &
+\cross{VIEW3D}{viewport3D} &
+\cross{VIEW3D}{write} &
+\cross{VIEW3D}{zoom} &
+\cross{VIEW3D}{?=?} \\
+\cross{VIEW3D}{?\~{}=?} &&&&
+\end{tabular}
+
 <<domain VIEW3D ThreeDimensionalViewport>>=
 )abbrev domain VIEW3D ThreeDimensionalViewport
 ++ Author: Jim Wen
@@ -93510,6 +96074,43 @@ ThreeDimensionalViewport(): Exports == Implementation where
 \section{domain SPACE3 ThreeSpace}
 \pagehead{ThreeSpace}{SPACE3}
 \pagepic{ps/v103threespace.ps}{SPACE3}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{SPACE3}{check} &
+\cross{SPACE3}{closedCurve} &
+\cross{SPACE3}{closedCurve?} &
+\cross{SPACE3}{coerce} &
+\cross{SPACE3}{components} \\
+\cross{SPACE3}{composite} &
+\cross{SPACE3}{composites} &
+\cross{SPACE3}{copy} &
+\cross{SPACE3}{create3Space} &
+\cross{SPACE3}{curve} \\
+\cross{SPACE3}{curve?} &
+\cross{SPACE3}{enterPointData} &
+\cross{SPACE3}{hash} &
+\cross{SPACE3}{latex} &
+\cross{SPACE3}{lllip} \\
+\cross{SPACE3}{lllp} &
+\cross{SPACE3}{llprop} &
+\cross{SPACE3}{lprop} &
+\cross{SPACE3}{lp} &
+\cross{SPACE3}{merge} \\
+\cross{SPACE3}{mesh} &
+\cross{SPACE3}{mesh?} &
+\cross{SPACE3}{modifyPointData} &
+\cross{SPACE3}{numberOfComponents} &
+\cross{SPACE3}{objects} \\
+\cross{SPACE3}{point} &
+\cross{SPACE3}{point?} &
+\cross{SPACE3}{polygon} &
+\cross{SPACE3}{polygon?} &
+\cross{SPACE3}{subspace} \\
+\cross{SPACE3}{?=?} &
+\cross{SPACE3}{?\~{}=?} &&&
+\end{tabular}
+
 <<domain SPACE3 ThreeSpace>>=
 )abbrev domain SPACE3 ThreeSpace
 ++ Author: 
@@ -93874,6 +96475,52 @@ ThreeSpace(R:Ring):Exports == Implementation where
 \pageto{BinaryTournament}{BTOURN}
 \pageto{BalancedBinaryTree}{BBTREE}
 \pageto{PendantTree}{PENDTREE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{TREE}{any?} &
+\cross{TREE}{child?} &
+\cross{TREE}{children} &
+\cross{TREE}{coerce} &
+\cross{TREE}{copy} \\
+\cross{TREE}{count} &
+\cross{TREE}{cyclic?} &
+\cross{TREE}{cyclicCopy} &
+\cross{TREE}{cyclicEntries} &
+\cross{TREE}{cyclicEqual?} \\
+\cross{TREE}{cyclicParents} &
+\cross{TREE}{distance} &
+\cross{TREE}{empty} &
+\cross{TREE}{empty?} &
+\cross{TREE}{eq?} \\
+\cross{TREE}{eval} &
+\cross{TREE}{every?} &
+\cross{TREE}{hash} &
+\cross{TREE}{latex} &
+\cross{TREE}{leaf?} \\
+\cross{TREE}{leaves} &
+\cross{TREE}{less?} &
+\cross{TREE}{map} &
+\cross{TREE}{map!} &
+\cross{TREE}{member?} \\
+\cross{TREE}{members} &
+\cross{TREE}{more?} &
+\cross{TREE}{node?} &
+\cross{TREE}{nodes} &
+\cross{TREE}{parts} \\
+\cross{TREE}{sample} &
+\cross{TREE}{setchildren!} &
+\cross{TREE}{setelt} &
+\cross{TREE}{setvalue!} &
+\cross{TREE}{size?} \\
+\cross{TREE}{tree} &
+\cross{TREE}{value} &
+\cross{TREE}{\#{}?} &
+\cross{TREE}{?=?} &
+\cross{TREE}{?\~{}=?} \\
+\cross{TREE}{?.value} &&&&
+\end{tabular}
+
 <<domain TREE Tree>>=
 )abbrev domain TREE Tree
 ++ Author:W. H. Burge
@@ -94219,6 +96866,17 @@ Tree(S: SetCategory): T==C where
 \section{domain TUBE TubePlot}
 \pagehead{TubePlot}{TUBE}
 \pagepic{ps/v103tubeplot.ps}{TUBE}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{TUBE}{closed?} &
+\cross{TUBE}{getCurve} &
+\cross{TUBE}{listLoops} &
+\cross{TUBE}{open?} &
+\cross{TUBE}{setClosed} &
+\cross{TUBE}{tube} 
+\end{tabular}
+
 <<domain TUBE TubePlot>>=
 )abbrev domain TUBE TubePlot
 ++ Author: Clifton J. Williamson
@@ -94291,6 +96949,18 @@ TubePlot(Curve): Exports == Implementation where
 \pageto{FlexibleArray}{FARRAY}
 \pageto{IndexedOneDimensionalArray}{IARRAY1}
 \pageto{OneDimensionalArray}{ARRAY1}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllll}
+\cross{TUPLE}{coerce} &
+\cross{TUPLE}{hash} &
+\cross{TUPLE}{latex} &
+\cross{TUPLE}{length} &
+\cross{TUPLE}{select} &
+\cross{TUPLE}{?=?} &
+\cross{TUPLE}{?\~{}=?} 
+\end{tabular}
+
 <<domain TUPLE Tuple>>=
 )abbrev domain TUPLE Tuple
 ++ This domain is used to interface with the interpreter's notion
@@ -94339,6 +97009,7 @@ Tuple(S:Type): CoercibleTo(PrimitiveArray S) with
 <<TUPLE.dotabb>>=
 "TUPLE" [color="#88FF44",href="bookvol10.3.pdf#nameddest=TUPLE"]
 "A1AGG" [color="#4488FF",href="bookvol10.2.pdf#nameddest=A1AGG"]
+"A1AGG-" [color="#88FF44",href="bookvol10.3.pdf#nameddest=A1AGG"]
 "TUPLE" -> "A1AGG"
 "TUPLE" -> "A1AGG-"
 
@@ -94795,6 +97466,50 @@ o )show TwoDimensionalArray
 {\bf See}\\
 \pageto{InnerIndexedTwoDimensionalArray}{IIARRAY2}
 \pageto{IndexedTwoDimensionalArray}{IARRAY2}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ARRAY2}{any?} &
+\cross{ARRAY2}{coerce} &
+\cross{ARRAY2}{column} &
+\cross{ARRAY2}{copy} &
+\cross{ARRAY2}{count} \\
+\cross{ARRAY2}{elt} &
+\cross{ARRAY2}{empty} &
+\cross{ARRAY2}{empty?} &
+\cross{ARRAY2}{eq?} &
+\cross{ARRAY2}{eval} \\
+\cross{ARRAY2}{every?} &
+\cross{ARRAY2}{fill!} &
+\cross{ARRAY2}{hash} &
+\cross{ARRAY2}{latex} &
+\cross{ARRAY2}{less?} \\
+\cross{ARRAY2}{map} &
+\cross{ARRAY2}{map!} &
+\cross{ARRAY2}{maxColIndex} &
+\cross{ARRAY2}{maxRowIndex} &
+\cross{ARRAY2}{member?} \\
+\cross{ARRAY2}{members} &
+\cross{ARRAY2}{more?} &
+\cross{ARRAY2}{minColIndex} &
+\cross{ARRAY2}{minRowIndex} &
+\cross{ARRAY2}{ncols} \\
+\cross{ARRAY2}{new} &
+\cross{ARRAY2}{nrows} &
+\cross{ARRAY2}{parts} &
+\cross{ARRAY2}{qelt} &
+\cross{ARRAY2}{qsetelt!} \\
+\cross{ARRAY2}{row} &
+\cross{ARRAY2}{sample} &
+\cross{ARRAY2}{setColumn!} &
+\cross{ARRAY2}{setRow!} &
+\cross{ARRAY2}{setelt} \\
+\cross{ARRAY2}{size?} &
+\cross{ARRAY2}{\#{}?} &
+\cross{ARRAY2}{?=?} &
+\cross{ARRAY2}{?\~{}=?} &
+\end{tabular}
+
 <<domain ARRAY2 TwoDimensionalArray>>=
 )abbrev domain ARRAY2 TwoDimensionalArray
 TwoDimensionalArray(R):Exports == Implementation where
@@ -95063,6 +97778,43 @@ o )show TwoDimensionalViewport
 @
 \pagehead{TwoDimensionalViewport}{VIEW2D}
 \pagepic{ps/v103twodimensionalviewport.ps}{VIEW2D}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{VIEW2d}{axes} &
+\cross{VIEW2d}{close} &
+\cross{VIEW2d}{coerce} &
+\cross{VIEW2d}{connect} &
+\cross{VIEW2d}{controlPanel} \\
+\cross{VIEW2d}{dimensions} &
+\cross{VIEW2d}{getGraph} &
+\cross{VIEW2d}{getPickedPoints} &
+\cross{VIEW2d}{graphState} &
+\cross{VIEW2d}{graphStates} \\
+\cross{VIEW2d}{graphs} &
+\cross{VIEW2d}{hash} &
+\cross{VIEW2d}{key} &
+\cross{VIEW2d}{latex} &
+\cross{VIEW2d}{makeViewport2D} \\
+\cross{VIEW2d}{move} &
+\cross{VIEW2d}{options} &
+\cross{VIEW2d}{points} &
+\cross{VIEW2d}{putGraph} &
+\cross{VIEW2d}{region} \\
+\cross{VIEW2d}{reset} &
+\cross{VIEW2d}{resize} &
+\cross{VIEW2d}{scale} &
+\cross{VIEW2d}{show} &
+\cross{VIEW2d}{title} \\
+\cross{VIEW2d}{translate} &
+\cross{VIEW2d}{units} &
+\cross{VIEW2d}{update} &
+\cross{VIEW2d}{viewport2D} &
+\cross{VIEW2d}{write} \\
+\cross{VIEW2d}{?=?} &
+\cross{VIEW2d}{?\~{}=?} &&&
+\end{tabular}
+
 <<domain VIEW2D TwoDimensionalViewport>>=
 )abbrev domain VIEW2D TwoDimensionalViewport
 ++ Author: Jim Wen
@@ -95719,6 +98471,104 @@ TwoDimensionalViewport ():Exports == Implementation where
 \section{domain UFPS UnivariateFormalPowerSeries}
 \pagehead{UnivariateFormalPowerSeries}{UFPS}
 \pagepic{ps/v103univariateformalpowerseries.ps}{UFPS}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{UFPS}{0} &
+\cross{UFPS}{1} &
+\cross{UFPS}{acos} &
+\cross{UFPS}{acosh} \\
+\cross{UFPS}{acot} &
+\cross{UFPS}{acoth} &
+\cross{UFPS}{acsc} &
+\cross{UFPS}{acsch} \\
+\cross{UFPS}{approximate} &
+\cross{UFPS}{asec} &
+\cross{UFPS}{asech} &
+\cross{UFPS}{asin} \\
+\cross{UFPS}{asinh} &
+\cross{UFPS}{associates?} &
+\cross{UFPS}{atan} &
+\cross{UFPS}{atanh} \\
+\cross{UFPS}{center} &
+\cross{UFPS}{characteristic} &
+\cross{UFPS}{charthRoot} &
+\cross{UFPS}{coefficient} \\
+\cross{UFPS}{coefficients} &
+\cross{UFPS}{coerce} &
+\cross{UFPS}{complete} &
+\cross{UFPS}{cos} \\
+\cross{UFPS}{cosh} &
+\cross{UFPS}{cot} &
+\cross{UFPS}{coth} &
+\cross{UFPS}{csc} \\
+\cross{UFPS}{csch} &
+\cross{UFPS}{D} &
+\cross{UFPS}{degree} &
+\cross{UFPS}{differentiate} \\
+\cross{UFPS}{eval} &
+\cross{UFPS}{evenlambert} &
+\cross{UFPS}{exp} &
+\cross{UFPS}{exquo} \\
+\cross{UFPS}{extend} &
+\cross{UFPS}{generalLambert} &
+\cross{UFPS}{hash} &
+\cross{UFPS}{integrate} \\
+\cross{UFPS}{invmultisect} &
+\cross{UFPS}{lagrange} &
+\cross{UFPS}{lambert} &
+\cross{UFPS}{latex} \\
+\cross{UFPS}{leadingCoefficient} &
+\cross{UFPS}{leadingMonomial} &
+\cross{UFPS}{log} &
+\cross{UFPS}{map} \\
+\cross{UFPS}{monomial} &
+\cross{UFPS}{monomial?} &
+\cross{UFPS}{multiplyCoefficients} &
+\cross{UFPS}{multiplyExponents} \\
+\cross{UFPS}{multisect} &
+\cross{UFPS}{nthRoot} &
+\cross{UFPS}{oddlambert} &
+\cross{UFPS}{one?} \\
+\cross{UFPS}{order} &
+\cross{UFPS}{pi} &
+\cross{UFPS}{pole?} &
+\cross{UFPS}{polynomial} \\
+\cross{UFPS}{quoByVar} &
+\cross{UFPS}{recip} &
+\cross{UFPS}{reductum} &
+\cross{UFPS}{revert} \\
+\cross{UFPS}{sample} &
+\cross{UFPS}{sec} &
+\cross{UFPS}{sech} &
+\cross{UFPS}{series} \\
+\cross{UFPS}{sin} &
+\cross{UFPS}{sinh} &
+\cross{UFPS}{sqrt} &
+\cross{UFPS}{subtractIfCan} \\
+\cross{UFPS}{tan} &
+\cross{UFPS}{tanh} &
+\cross{UFPS}{terms} &
+\cross{UFPS}{truncate} \\
+\cross{UFPS}{unit?} &
+\cross{UFPS}{unitCanonical} &
+\cross{UFPS}{unitNormal} &
+\cross{UFPS}{univariatePolynomial} \\
+\cross{UFPS}{variable} &
+\cross{UFPS}{variables} &
+\cross{UFPS}{zero?} &
+\cross{UFPS}{?*?} \\
+\cross{UFPS}{?**?} &
+\cross{UFPS}{?+?} &
+\cross{UFPS}{?-?} &
+\cross{UFPS}{-?} \\
+\cross{UFPS}{?=?} &
+\cross{UFPS}{?\^{}?} &
+\cross{UFPS}{?\~{}=?} &
+\cross{UFPS}{?/?} \\
+\cross{UFPS}{?.?} &&&
+\end{tabular}
+
 <<domain UFPS UnivariateFormalPowerSeries>>=
 )abbrev domain UFPS UnivariateFormalPowerSeries
 UnivariateFormalPowerSeries(Coef: Ring) == 
@@ -95737,6 +98587,149 @@ UnivariateFormalPowerSeries(Coef: Ring) ==
 \pagepic{ps/v103univariatelaurentseries.ps}{ULS}{1.00}
 {\bf See}\\
 \pageto{UnivariateLaurentSeriesConstructor}{ULSCONS}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{ULS}{0} &
+\cross{ULS}{1} &
+\cross{ULS}{abs} \\
+\cross{ULS}{acos} &
+\cross{ULS}{acosh} &
+\cross{ULS}{acot} \\
+\cross{ULS}{acoth} &
+\cross{ULS}{acsc} &
+\cross{ULS}{acsch} \\
+\cross{ULS}{approximate} &
+\cross{ULS}{asec} &
+\cross{ULS}{asech} \\
+\cross{ULS}{asin} &
+\cross{ULS}{asinh} &
+\cross{ULS}{associates?} \\
+\cross{ULS}{atan} &
+\cross{ULS}{atanh} &
+\cross{ULS}{ceiling} \\
+\cross{ULS}{center} &
+\cross{ULS}{characteristic} &
+\cross{ULS}{charthRoot} \\
+\cross{ULS}{coerce} &
+\cross{ULS}{coefficient} &
+\cross{ULS}{coerce} \\
+\cross{ULS}{complete} &
+\cross{ULS}{conditionP} &
+\cross{ULS}{convert} \\
+\cross{ULS}{cos} &
+\cross{ULS}{cosh} &
+\cross{ULS}{cot} \\
+\cross{ULS}{coth} &
+\cross{ULS}{csc} &
+\cross{ULS}{csch} \\
+\cross{ULS}{D} &
+\cross{ULS}{degree} &
+\cross{ULS}{denom} \\
+\cross{ULS}{denominator} &
+\cross{ULS}{differentiate} &
+\cross{ULS}{divide} \\
+\cross{ULS}{euclideanSize} &
+\cross{ULS}{eval} &
+\cross{ULS}{exp} \\
+\cross{ULS}{expressIdealMember} &
+\cross{ULS}{exquo} &
+\cross{ULS}{extend} \\
+\cross{ULS}{extendedEuclidean} &
+\cross{ULS}{factor} &
+\cross{ULS}{factorPolynomial} \\
+\cross{ULS}{factorSquareFreePolynomial} &
+\cross{ULS}{floor} &
+\cross{ULS}{fractionPart} \\
+\cross{ULS}{gcd} &
+\cross{ULS}{gcdPolynomial} &
+\cross{ULS}{hash} \\
+\cross{ULS}{init} &
+\cross{ULS}{integrate} &
+\cross{ULS}{inv} \\
+\cross{ULS}{latex} &
+\cross{ULS}{laurent} &
+\cross{ULS}{leadingCoefficient} \\
+\cross{ULS}{leadingMonomial} &
+\cross{ULS}{lcm} &
+\cross{ULS}{log} \\
+\cross{ULS}{map} &
+\cross{ULS}{max} &
+\cross{ULS}{min} \\
+\cross{ULS}{monomial} &
+\cross{ULS}{monomial?} &
+\cross{ULS}{multiEuclidean} \\
+\cross{ULS}{multiplyCoefficients} &
+\cross{ULS}{multiplyExponents} &
+\cross{ULS}{negative?} \\
+\cross{ULS}{nextItem} &
+\cross{ULS}{nthRoot} &
+\cross{ULS}{numer} \\
+\cross{ULS}{numerator} &
+\cross{ULS}{one?} &
+\cross{ULS}{order} \\
+\cross{ULS}{patternMatch} &
+\cross{ULS}{pi} &
+\cross{ULS}{pole?} \\
+\cross{ULS}{positive?} &
+\cross{ULS}{prime?} &
+\cross{ULS}{principalIdeal} \\
+\cross{ULS}{random} &
+\cross{ULS}{rationalFunction} &
+\cross{ULS}{recip} \\
+\cross{ULS}{reducedSystem} &
+\cross{ULS}{reductum} &
+\cross{ULS}{removeZeroes} \\
+\cross{ULS}{retract} &
+\cross{ULS}{retractIfCan} &
+\cross{ULS}{sample} \\
+\cross{ULS}{sec} &
+\cross{ULS}{sech} &
+\cross{ULS}{series} \\
+\cross{ULS}{sign} &
+\cross{ULS}{sin} &
+\cross{ULS}{sinh} \\
+\cross{ULS}{sizeLess?} &
+\cross{ULS}{solveLinearPolynomialEquation} &
+\cross{ULS}{sqrt} \\
+\cross{ULS}{squareFree} &
+\cross{ULS}{squareFreePart} &
+\cross{ULS}{squareFreePolynomial} \\
+\cross{ULS}{subtractIfCan} &
+\cross{ULS}{tan} &
+\cross{ULS}{tanh} \\
+\cross{ULS}{taylor} &
+\cross{ULS}{taylorIfCan} &
+\cross{ULS}{taylorRep} \\
+\cross{ULS}{terms} &
+\cross{ULS}{truncate} &
+\cross{ULS}{unit?} \\
+\cross{ULS}{unitCanonical} &
+\cross{ULS}{unitNormal} &
+\cross{ULS}{variable} \\
+\cross{ULS}{variables} &
+\cross{ULS}{wholePart} &
+\cross{ULS}{zero?} \\
+\cross{ULS}{?*?} &
+\cross{ULS}{?**?} &
+\cross{ULS}{?+?} \\
+\cross{ULS}{?-?} &
+\cross{ULS}{-?} &
+\cross{ULS}{?=?} \\
+\cross{ULS}{?\^{}?} &
+\cross{ULS}{?.?} &
+\cross{ULS}{?\~{}=?} \\
+\cross{ULS}{?/?} &
+\cross{ULS}{?$<$?} &
+\cross{ULS}{?$<=$?} \\
+\cross{ULS}{?$>$?} &
+\cross{ULS}{?$>=$?} &
+\cross{ULS}{?\^{}?} \\
+\cross{ULS}{?.?} &
+\cross{ULS}{?quo?} &
+\cross{ULS}{?rem?} 
+\end{tabular}
+
 <<domain ULS UnivariateLaurentSeries>>=
 )abbrev domain ULS UnivariateLaurentSeries
 ++ Author: Clifton J. Williamson
@@ -95804,6 +98797,146 @@ UnivariateLaurentSeries(Coef,var,cen): Exports == Implementation where
 \pagepic{ps/v103univariatelaurentseriesconstructor.ps}{ULSCONS}{1.00}
 {\bf See}\\
 \pageto{UnivariateLaurentSeries}{ULS}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{ULSCONS}{0} &
+\cross{ULSCONS}{1} &
+\cross{ULSCONS}{abs} \\
+\cross{ULSCONS}{acos} &
+\cross{ULSCONS}{acosh} &
+\cross{ULSCONS}{acot} \\
+\cross{ULSCONS}{acoth} &
+\cross{ULSCONS}{acsc} &
+\cross{ULSCONS}{acsch} \\
+\cross{ULSCONS}{approximate} &
+\cross{ULSCONS}{asec} &
+\cross{ULSCONS}{asech} \\
+\cross{ULSCONS}{asin} &
+\cross{ULSCONS}{asinh} &
+\cross{ULSCONS}{associates?} \\
+\cross{ULSCONS}{atan} &
+\cross{ULSCONS}{atanh} &
+\cross{ULSCONS}{ceiling} \\
+\cross{ULSCONS}{center} &
+\cross{ULSCONS}{characteristic} &
+\cross{ULSCONS}{charthRoot} \\
+\cross{ULSCONS}{coefficient} &
+\cross{ULSCONS}{coerce} &
+\cross{ULSCONS}{complete} \\
+\cross{ULSCONS}{conditionP} &
+\cross{ULSCONS}{convert} &
+\cross{ULSCONS}{cos} \\
+\cross{ULSCONS}{cosh} &
+\cross{ULSCONS}{cot} &
+\cross{ULSCONS}{coth} \\
+\cross{ULSCONS}{csc} &
+\cross{ULSCONS}{csch} &
+\cross{ULSCONS}{D} \\
+\cross{ULSCONS}{degree} &
+\cross{ULSCONS}{denom} &
+\cross{ULSCONS}{denominator} \\
+\cross{ULSCONS}{differentiate} &
+\cross{ULSCONS}{divide} &
+\cross{ULSCONS}{extend} \\
+\cross{ULSCONS}{euclideanSize} &
+\cross{ULSCONS}{eval} &
+\cross{ULSCONS}{exp} \\
+\cross{ULSCONS}{expressIdealMember} &
+\cross{ULSCONS}{exquo} &
+\cross{ULSCONS}{extendedEuclidean} \\
+\cross{ULSCONS}{factor} &
+\cross{ULSCONS}{factorPolynomial} &
+\cross{ULSCONS}{factorSquareFreePolynomial} \\
+\cross{ULSCONS}{floor} &
+\cross{ULSCONS}{fractionPart} &
+\cross{ULSCONS}{gcd} \\
+\cross{ULSCONS}{gcdPolynomial} &
+\cross{ULSCONS}{hash} &
+\cross{ULSCONS}{init} \\
+\cross{ULSCONS}{integrate} &
+\cross{ULSCONS}{inv} &
+\cross{ULSCONS}{latex} \\
+\cross{ULSCONS}{laurent} &
+\cross{ULSCONS}{lcm} &
+\cross{ULSCONS}{leadingCoefficient} \\
+\cross{ULSCONS}{leadingMonomial} &
+\cross{ULSCONS}{log} &
+\cross{ULSCONS}{map} \\
+\cross{ULSCONS}{max} &
+\cross{ULSCONS}{min} &
+\cross{ULSCONS}{monomial} \\
+\cross{ULSCONS}{monomial?} &
+\cross{ULSCONS}{multiEuclidean} &
+\cross{ULSCONS}{multiplyCoefficients} \\
+\cross{ULSCONS}{multiplyExponents} &
+\cross{ULSCONS}{negative?} &
+\cross{ULSCONS}{nextItem} \\
+\cross{ULSCONS}{nthRoot} &
+\cross{ULSCONS}{numer} &
+\cross{ULSCONS}{numerator} \\
+\cross{ULSCONS}{one?} &
+\cross{ULSCONS}{order} &
+\cross{ULSCONS}{patternMatch} \\
+\cross{ULSCONS}{pi} &
+\cross{ULSCONS}{pole?} &
+\cross{ULSCONS}{positive?} \\
+\cross{ULSCONS}{prime?} &
+\cross{ULSCONS}{principalIdeal} &
+\cross{ULSCONS}{random} \\
+\cross{ULSCONS}{rationalFunction} &
+\cross{ULSCONS}{recip} &
+\cross{ULSCONS}{reducedSystem} \\
+\cross{ULSCONS}{reductum} &
+\cross{ULSCONS}{removeZeroes} &
+\cross{ULSCONS}{retract} \\
+\cross{ULSCONS}{retractIfCan} &
+\cross{ULSCONS}{sample} &
+\cross{ULSCONS}{sec} \\
+\cross{ULSCONS}{sech} &
+\cross{ULSCONS}{series} &
+\cross{ULSCONS}{sign} \\
+\cross{ULSCONS}{sin} &
+\cross{ULSCONS}{sinh} &
+\cross{ULSCONS}{sizeLess?} \\
+\cross{ULSCONS}{solveLinearPolynomialEquation} &
+\cross{ULSCONS}{sqrt} &
+\cross{ULSCONS}{squareFree} \\
+\cross{ULSCONS}{squareFreePart} &
+\cross{ULSCONS}{squareFreePolynomial} &
+\cross{ULSCONS}{subtractIfCan} \\
+\cross{ULSCONS}{tan} &
+\cross{ULSCONS}{tanh} &
+\cross{ULSCONS}{taylor} \\
+\cross{ULSCONS}{taylorIfCan} &
+\cross{ULSCONS}{taylorRep} &
+\cross{ULSCONS}{terms} \\
+\cross{ULSCONS}{truncate} &
+\cross{ULSCONS}{unit?} &
+\cross{ULSCONS}{unitCanonical} \\
+\cross{ULSCONS}{unitNormal} &
+\cross{ULSCONS}{variable} &
+\cross{ULSCONS}{variables} \\
+\cross{ULSCONS}{wholePart} &
+\cross{ULSCONS}{zero?} &
+\cross{ULSCONS}{?*?} \\
+\cross{ULSCONS}{?**?} &
+\cross{ULSCONS}{?+?} &
+\cross{ULSCONS}{?-?} \\
+\cross{ULSCONS}{-?} &
+\cross{ULSCONS}{?=?} &
+\cross{ULSCONS}{?\^{}?} \\
+\cross{ULSCONS}{?.?} &
+\cross{ULSCONS}{?\~{}=?} &
+\cross{ULSCONS}{?/?} \\
+\cross{ULSCONS}{?$<$?} &
+\cross{ULSCONS}{?$<=$?} &
+\cross{ULSCONS}{?$>$?} \\
+\cross{ULSCONS}{?$>=$?} &
+\cross{ULSCONS}{?quo?} &
+\cross{ULSCONS}{?rem?} 
+\end{tabular}
+
 <<domain ULSCONS UnivariateLaurentSeriesConstructor>>=
 )abbrev domain ULSCONS UnivariateLaurentSeriesConstructor
 ++ Authors: Bill Burge, Clifton J. Williamson
@@ -96895,6 +100028,125 @@ o )show UnivariatePolynomial
 \pageto{FreeModule}{FM}
 \pageto{PolynomialRing}{PR}
 \pageto{SparseUnivariatePolynomial}{SUP}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{UP}{0} &
+\cross{UP}{1} \\
+\cross{UP}{associates?} &
+\cross{UP}{binomThmExpt} \\
+\cross{UP}{characteristic} &
+\cross{UP}{charthRoot} \\
+\cross{UP}{coefficient} &
+\cross{UP}{coefficients} \\
+\cross{UP}{coerce} &
+\cross{UP}{composite} \\
+\cross{UP}{conditionP} &
+\cross{UP}{content} \\
+\cross{UP}{convert} &
+\cross{UP}{D} \\
+\cross{UP}{degree} &
+\cross{UP}{differentiate} \\
+\cross{UP}{discriminant} &
+\cross{UP}{divide} \\
+\cross{UP}{divideExponents} &
+\cross{UP}{elt} \\
+\cross{UP}{euclideanSize} &
+\cross{UP}{eval} \\
+\cross{UP}{expressIdealMember} &
+\cross{UP}{exquo} \\
+\cross{UP}{extendedEuclidean} &
+\cross{UP}{factor} \\
+\cross{UP}{factorPolynomial} &
+\cross{UP}{factorSquareFreePolynomial} \\
+\cross{UP}{fmecg} &
+\cross{UP}{gcd} \\
+\cross{UP}{gcdPolynomial} &
+\cross{UP}{ground} \\
+\cross{UP}{ground?} &
+\cross{UP}{hash} \\
+\cross{UP}{init} &
+\cross{UP}{integrate} \\
+\cross{UP}{isExpt} &
+\cross{UP}{isPlus} \\
+\cross{UP}{isTimes} &
+\cross{UP}{karatsubaDivide} \\
+\cross{UP}{latex} &
+\cross{UP}{lcm} \\
+\cross{UP}{leadingCoefficient} &
+\cross{UP}{leadingMonomial} \\
+\cross{UP}{mainVariable} &
+\cross{UP}{makeSUP} \\
+\cross{UP}{mapExponents} &
+\cross{UP}{map} \\
+\cross{UP}{max} &
+\cross{UP}{min} \\
+\cross{UP}{minimumDegree} &
+\cross{UP}{monicDivide} \\
+\cross{UP}{monomial} &
+\cross{UP}{monomial?} \\
+\cross{UP}{monomials} &
+\cross{UP}{multiEuclidean} \\
+\cross{UP}{multiplyExponents} &
+\cross{UP}{multivariate} \\
+\cross{UP}{nextItem} &
+\cross{UP}{numberOfMonomials} \\
+\cross{UP}{one?} &
+\cross{UP}{order} \\
+\cross{UP}{patternMatch} &
+\cross{UP}{pomopo!} \\
+\cross{UP}{prime?} &
+\cross{UP}{primitivePart} \\
+\cross{UP}{primitiveMonomials} &
+\cross{UP}{principalIdeal} \\
+\cross{UP}{pseudoDivide} &
+\cross{UP}{pseudoQuotient} \\
+\cross{UP}{pseudoRemainder} &
+\cross{UP}{recip} \\
+\cross{UP}{reducedSystem} &
+\cross{UP}{reductum} \\
+\cross{UP}{resultant} &
+\cross{UP}{retract} \\
+\cross{UP}{retractIfCan} &
+\cross{UP}{sample} \\
+\cross{UP}{separate} &
+\cross{UP}{shiftLeft} \\
+\cross{UP}{shiftRight} &
+\cross{UP}{sizeLess?} \\
+\cross{UP}{solveLinearPolynomialEquation} &
+\cross{UP}{squareFree} \\
+\cross{UP}{squareFreePart} &
+\cross{UP}{squareFreePolynomial} \\
+\cross{UP}{subResultantGcd} &
+\cross{UP}{subtractIfCan} \\
+\cross{UP}{totalDegree} &
+\cross{UP}{totalDegree} \\
+\cross{UP}{unit?} &
+\cross{UP}{unitCanonical} \\
+\cross{UP}{unitNormal} &
+\cross{UP}{univariate} \\
+\cross{UP}{unmakeSUP} &
+\cross{UP}{variables} \\
+\cross{UP}{vectorise} &
+\cross{UP}{zero?} \\
+\cross{UP}{?*?} &
+\cross{UP}{?**?} \\
+\cross{UP}{?+?} &
+\cross{UP}{?-?} \\
+\cross{UP}{-?} &
+\cross{UP}{?=?} \\
+\cross{UP}{?\^{}?} &
+\cross{UP}{?.?} \\
+\cross{UP}{?\~{}=?} &
+\cross{UP}{?/?} \\
+\cross{UP}{?$<$?} &
+\cross{UP}{?$<=$?} \\
+\cross{UP}{?$>$?} &
+\cross{UP}{?$>=$?} \\
+\cross{UP}{?quo?} &
+\cross{UP}{?rem?} 
+\end{tabular}
+
 <<domain UP UnivariatePolynomial>>=
 )abbrev domain UP UnivariatePolynomial
 ++ Author:
@@ -96938,6 +100190,115 @@ UnivariatePolynomial(x:Symbol, R:Ring):
 \pagepic{ps/v103univariatepuiseuxseries.ps}{UPXS}{1.00}
 {\bf See}\\
 \pageto{UnivariatePuiseuxSeriesConstructor}{UPXSCONS}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{UPXS}{0} &
+\cross{UPXS}{1} &
+\cross{UPXS}{acos} &
+\cross{UPXS}{acosh} \\
+\cross{UPXS}{acot} &
+\cross{UPXS}{acoth} &
+\cross{UPXS}{acsc} &
+\cross{UPXS}{acsch} \\
+\cross{UPXS}{approximate} &
+\cross{UPXS}{asec} &
+\cross{UPXS}{asech} &
+\cross{UPXS}{asin} \\
+\cross{UPXS}{asinh} &
+\cross{UPXS}{associates?} &
+\cross{UPXS}{atan} &
+\cross{UPXS}{atanh} \\
+\cross{UPXS}{center} &
+\cross{UPXS}{characteristic} &
+\cross{UPXS}{charthRoot} &
+\cross{UPXS}{coefficient} \\
+\cross{UPXS}{coerce} &
+\cross{UPXS}{complete} &
+\cross{UPXS}{cos} &
+\cross{UPXS}{cosh} \\
+\cross{UPXS}{cot} &
+\cross{UPXS}{coth} &
+\cross{UPXS}{csc} &
+\cross{UPXS}{csch} \\
+\cross{UPXS}{D} &
+\cross{UPXS}{degree} &
+\cross{UPXS}{differentiate} &
+\cross{UPXS}{divide} \\
+\cross{UPXS}{euclideanSize} &
+\cross{UPXS}{eval} &
+\cross{UPXS}{exp} &
+\cross{UPXS}{expressIdealMember} \\
+\cross{UPXS}{exquo} &
+\cross{UPXS}{extend} &
+\cross{UPXS}{extendedEuclidean} &
+\cross{UPXS}{factor} \\
+\cross{UPXS}{gcd} &
+\cross{UPXS}{gcdPolynomial} &
+\cross{UPXS}{hash} &
+\cross{UPXS}{integrate} \\
+\cross{UPXS}{inv} &
+\cross{UPXS}{latex} &
+\cross{UPXS}{laurent} &
+\cross{UPXS}{laurentIfCan} \\
+\cross{UPXS}{laurentRep} &
+\cross{UPXS}{lcm} &
+\cross{UPXS}{leadingCoefficient} &
+\cross{UPXS}{leadingMonomial} \\
+\cross{UPXS}{log} &
+\cross{UPXS}{map} &
+\cross{UPXS}{monomial} &
+\cross{UPXS}{monomial?} \\
+\cross{UPXS}{multiEuclidean} &
+\cross{UPXS}{multiplyExponents} &
+\cross{UPXS}{nthRoot} &
+\cross{UPXS}{one?} \\
+\cross{UPXS}{order} &
+\cross{UPXS}{pi} &
+\cross{UPXS}{pole?} &
+\cross{UPXS}{prime?} \\
+\cross{UPXS}{principalIdeal} &
+\cross{UPXS}{puiseux} &
+\cross{UPXS}{rationalPower} &
+\cross{UPXS}{recip} \\
+\cross{UPXS}{reductum} &
+\cross{UPXS}{retract} &
+\cross{UPXS}{retractIfCan} &
+\cross{UPXS}{sample} \\
+\cross{UPXS}{sec} &
+\cross{UPXS}{sech} &
+\cross{UPXS}{series} &
+\cross{UPXS}{sin} \\
+\cross{UPXS}{sinh} &
+\cross{UPXS}{sizeLess?} &
+\cross{UPXS}{sqrt} &
+\cross{UPXS}{squareFree} \\
+\cross{UPXS}{squareFreePart} &
+\cross{UPXS}{subtractIfCan} &
+\cross{UPXS}{tan} &
+\cross{UPXS}{tanh} \\
+\cross{UPXS}{terms} &
+\cross{UPXS}{truncate} &
+\cross{UPXS}{unit?} &
+\cross{UPXS}{unitCanonical} \\
+\cross{UPXS}{unitNormal} &
+\cross{UPXS}{variable} &
+\cross{UPXS}{variables} &
+\cross{UPXS}{zero?} \\
+\cross{UPXS}{?*?} &
+\cross{UPXS}{?**?} &
+\cross{UPXS}{?+?} &
+\cross{UPXS}{?-?} \\
+\cross{UPXS}{-?} &
+\cross{UPXS}{?=?} &
+\cross{UPXS}{?\^{}?} &
+\cross{UPXS}{?\~{}=?} \\
+\cross{UPXS}{?/?} &
+\cross{UPXS}{?.?} &
+\cross{UPXS}{?quo?} &
+\cross{UPXS}{?rem?} 
+\end{tabular}
+
 <<domain UPXS UnivariatePuiseuxSeries>>=
 )abbrev domain UPXS UnivariatePuiseuxSeries
 ++ Author: Clifton J. Williamson
@@ -97109,6 +100470,115 @@ UnivariatePuiseuxSeries(Coef,var,cen): Exports == Implementation where
 \pagepic{ps/v103univariatepuiseuxseriesconstructor.ps}{UPXSCONS}{1.00}
 {\bf See}\\
 \pageto{UnivariatePuiseuxSeries}{UPXS}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{UPXSCONS}{0} &
+\cross{UPXSCONS}{1} &
+\cross{UPXSCONS}{acos} &
+\cross{UPXSCONS}{acosh} \\
+\cross{UPXSCONS}{acot} &
+\cross{UPXSCONS}{acoth} &
+\cross{UPXSCONS}{acsc} &
+\cross{UPXSCONS}{acsch} \\
+\cross{UPXSCONS}{approximate} &
+\cross{UPXSCONS}{asec} &
+\cross{UPXSCONS}{asech} &
+\cross{UPXSCONS}{asin} \\
+\cross{UPXSCONS}{asinh} &
+\cross{UPXSCONS}{associates?} &
+\cross{UPXSCONS}{atan} &
+\cross{UPXSCONS}{atanh} \\
+\cross{UPXSCONS}{center} &
+\cross{UPXSCONS}{characteristic} &
+\cross{UPXSCONS}{charthRoot} &
+\cross{UPXSCONS}{coefficient} \\
+\cross{UPXSCONS}{coerce} &
+\cross{UPXSCONS}{complete} &
+\cross{UPXSCONS}{cos} &
+\cross{UPXSCONS}{cosh} \\
+\cross{UPXSCONS}{cot} &
+\cross{UPXSCONS}{coth} &
+\cross{UPXSCONS}{csc} &
+\cross{UPXSCONS}{csch} \\
+\cross{UPXSCONS}{D} &
+\cross{UPXSCONS}{degree} &
+\cross{UPXSCONS}{differentiate} &
+\cross{UPXSCONS}{divide} \\
+\cross{UPXSCONS}{euclideanSize} &
+\cross{UPXSCONS}{eval} &
+\cross{UPXSCONS}{exp} &
+\cross{UPXSCONS}{expressIdealMember} \\
+\cross{UPXSCONS}{exquo} &
+\cross{UPXSCONS}{extend} &
+\cross{UPXSCONS}{extendedEuclidean} &
+\cross{UPXSCONS}{factor} \\
+\cross{UPXSCONS}{gcd} &
+\cross{UPXSCONS}{gcdPolynomial} &
+\cross{UPXSCONS}{hash} &
+\cross{UPXSCONS}{integrate} \\
+\cross{UPXSCONS}{inv} &
+\cross{UPXSCONS}{latex} &
+\cross{UPXSCONS}{laurent} &
+\cross{UPXSCONS}{laurentIfCan} \\
+\cross{UPXSCONS}{laurentRep} &
+\cross{UPXSCONS}{lcm} &
+\cross{UPXSCONS}{leadingCoefficient} &
+\cross{UPXSCONS}{leadingMonomial} \\
+\cross{UPXSCONS}{log} &
+\cross{UPXSCONS}{map} &
+\cross{UPXSCONS}{monomial} &
+\cross{UPXSCONS}{monomial?} \\
+\cross{UPXSCONS}{multiEuclidean} &
+\cross{UPXSCONS}{multiplyExponents} &
+\cross{UPXSCONS}{nthRoot} &
+\cross{UPXSCONS}{one?} \\
+\cross{UPXSCONS}{order} &
+\cross{UPXSCONS}{pi} &
+\cross{UPXSCONS}{pole?} &
+\cross{UPXSCONS}{prime?} \\
+\cross{UPXSCONS}{principalIdeal} &
+\cross{UPXSCONS}{puiseux} &
+\cross{UPXSCONS}{rationalPower} &
+\cross{UPXSCONS}{recip} \\
+\cross{UPXSCONS}{reductum} &
+\cross{UPXSCONS}{retract} &
+\cross{UPXSCONS}{retractIfCan} &
+\cross{UPXSCONS}{sample} \\
+\cross{UPXSCONS}{sec} &
+\cross{UPXSCONS}{sech} &
+\cross{UPXSCONS}{series} &
+\cross{UPXSCONS}{sin} \\
+\cross{UPXSCONS}{sinh} &
+\cross{UPXSCONS}{sizeLess?} &
+\cross{UPXSCONS}{sqrt} &
+\cross{UPXSCONS}{squareFree} \\
+\cross{UPXSCONS}{squareFreePart} &
+\cross{UPXSCONS}{subtractIfCan} &
+\cross{UPXSCONS}{tan} &
+\cross{UPXSCONS}{tanh} \\
+\cross{UPXSCONS}{terms} &
+\cross{UPXSCONS}{truncate} &
+\cross{UPXSCONS}{unit?} &
+\cross{UPXSCONS}{unitCanonical} \\
+\cross{UPXSCONS}{unitNormal} &
+\cross{UPXSCONS}{variable} &
+\cross{UPXSCONS}{variables} &
+\cross{UPXSCONS}{zero?} \\
+\cross{UPXSCONS}{?*?} &
+\cross{UPXSCONS}{?**?} &
+\cross{UPXSCONS}{?+?} &
+\cross{UPXSCONS}{?-?} \\
+\cross{UPXSCONS}{-?} &
+\cross{UPXSCONS}{?=?} &
+\cross{UPXSCONS}{?\^{}?} &
+\cross{UPXSCONS}{?\~{}=?} \\
+\cross{UPXSCONS}{?/?} &
+\cross{UPXSCONS}{?.?} &
+\cross{UPXSCONS}{?quo?} &
+\cross{UPXSCONS}{?rem?} 
+\end{tabular}
+
 <<domain UPXSCONS UnivariatePuiseuxSeriesConstructor>>=
 )abbrev domain UPXSCONS UnivariatePuiseuxSeriesConstructor
 ++ Author: Clifton J. Williamson
@@ -97469,6 +100939,59 @@ UnivariatePuiseuxSeriesConstructor(Coef,ULS):_
 {\bf See}\\
 \pageto{ExponentialOfUnivariatePuiseuxSeries}{EXPUPXS}
 \pageto{ExponentialExpansion}{EXPEXPAN}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{UPXSSING}{0} &
+\cross{UPXSSING}{1} &
+\cross{UPXSSING}{associates?} &
+\cross{UPXSSING}{binomThmExpt} &
+\cross{UPXSSING}{characteristic} \\
+\cross{UPXSSING}{charthRoot} &
+\cross{UPXSSING}{coefficient} &
+\cross{UPXSSING}{coefficients} &
+\cross{UPXSSING}{coerce} &
+\cross{UPXSSING}{content} \\
+\cross{UPXSSING}{degree} &
+\cross{UPXSSING}{dominantTerm} &
+\cross{UPXSSING}{exquo} &
+\cross{UPXSSING}{ground} &
+\cross{UPXSSING}{ground?} \\
+\cross{UPXSSING}{hash} &
+\cross{UPXSSING}{latex} &
+\cross{UPXSSING}{leadingCoefficient} &
+\cross{UPXSSING}{leadingMonomial} &
+\cross{UPXSSING}{limitPlus} \\
+\cross{UPXSSING}{map} &
+\cross{UPXSSING}{mapExponents} &
+\cross{UPXSSING}{minimumDegree} &
+\cross{UPXSSING}{monomial} &
+\cross{UPXSSING}{monomial?} \\
+\cross{UPXSSING}{numberOfMonomials} &
+\cross{UPXSSING}{one?} &
+\cross{UPXSSING}{pomopo!} &
+\cross{UPXSSING}{primitivePart} &
+\cross{UPXSSING}{recip} \\
+\cross{UPXSSING}{reductum} &
+\cross{UPXSSING}{retract} &
+\cross{UPXSSING}{retractIfCan} &
+\cross{UPXSSING}{sample} &
+\cross{UPXSSING}{subtractIfCan} \\
+\cross{UPXSSING}{unit?} &
+\cross{UPXSSING}{unitCanonical} &
+\cross{UPXSSING}{unitNormal} &
+\cross{UPXSSING}{zero?} &
+\cross{UPXSSING}{?*?} \\
+\cross{UPXSSING}{?**?} &
+\cross{UPXSSING}{?+?} &
+\cross{UPXSSING}{?-?} &
+\cross{UPXSSING}{-?} &
+\cross{UPXSSING}{?=?} \\
+\cross{UPXSSING}{?\^{}?} &
+\cross{UPXSSING}{?\~{}=?} &
+\cross{UPXSSING}{?/?} &&
+\end{tabular}
+
 <<domain UPXSSING UnivariatePuiseuxSeriesWithExponentialSingularity>>=
 )abbrev domain UPXSSING UnivariatePuiseuxSeriesWithExponentialSingularity
 ++ Author: Clifton J. Williamson
@@ -97763,6 +101286,59 @@ UnivariatePuiseuxSeriesWithExponentialSingularity(R,FE,var,cen):_
 {\bf See}\\
 \pageto{Automorphism}{AUTOMOR}
 \pageto{SparseUnivariateSkewPolynomial}{ORESUP}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{OREUP}{0} &
+\cross{OREUP}{1} &
+\cross{OREUP}{apply} \\
+\cross{OREUP}{characteristic} &
+\cross{OREUP}{coefficient} &
+\cross{OREUP}{coefficients} \\
+\cross{OREUP}{coerce} &
+\cross{OREUP}{content} &
+\cross{OREUP}{degree} \\
+\cross{OREUP}{exquo} &
+\cross{OREUP}{hash} &
+\cross{OREUP}{latex} \\
+\cross{OREUP}{leadingCoefficient} &
+\cross{OREUP}{leftDivide} &
+\cross{OREUP}{leftExactQuotient} \\
+\cross{OREUP}{leftExtendedGcd} &
+\cross{OREUP}{leftGcd} &
+\cross{OREUP}{leftLcm} \\
+\cross{OREUP}{leftQuotient} &
+\cross{OREUP}{leftRemainder} &
+\cross{OREUP}{minimumDegree} \\
+\cross{OREUP}{monicLeftDivide} &
+\cross{OREUP}{monicRightDivide} &
+\cross{OREUP}{monomial} \\
+\cross{OREUP}{one?} &
+\cross{OREUP}{primitivePart} &
+\cross{OREUP}{recip} \\
+\cross{OREUP}{reductum} &
+\cross{OREUP}{retract} &
+\cross{OREUP}{retractIfCan} \\
+\cross{OREUP}{rightDivide} &
+\cross{OREUP}{rightExactQuotient} &
+\cross{OREUP}{rightExtendedGcd} \\
+\cross{OREUP}{rightGcd} &
+\cross{OREUP}{rightLcm} &
+\cross{OREUP}{rightQuotient} \\
+\cross{OREUP}{rightRemainder} &
+\cross{OREUP}{sample} &
+\cross{OREUP}{subtractIfCan} \\
+\cross{OREUP}{zero?} &
+\cross{OREUP}{?*?} &
+\cross{OREUP}{?**?} \\
+\cross{OREUP}{?+?} &
+\cross{OREUP}{?-?} &
+\cross{OREUP}{-?} \\
+\cross{OREUP}{?=?} &
+\cross{OREUP}{?\^{}?} &
+\cross{OREUP}{?\~{}=?} 
+\end{tabular}
+
 <<domain OREUP UnivariateSkewPolynomial>>=
 )abbrev domain OREUP UnivariateSkewPolynomial
 ++ Author: Manuel Bronstein
@@ -97794,13 +101370,111 @@ UnivariateSkewPolynomial(x:Symbol, R:Ring, sigma:Automorphism R, delta: R -> R):
 \pagepic{ps/v103univariatetaylorseries.ps}{UTS}{1.00}
 {\bf See}\\
 \pageto{InnerTaylorSeries}{ITAYLOR}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{UTS}{0} &
+\cross{UTS}{1} &
+\cross{UTS}{acos} &
+\cross{UTS}{acosh} \\
+\cross{UTS}{acot} &
+\cross{UTS}{acoth} &
+\cross{UTS}{acsc} &
+\cross{UTS}{acsch} \\
+\cross{UTS}{approximate} &
+\cross{UTS}{asec} &
+\cross{UTS}{asech} &
+\cross{UTS}{asin} \\
+\cross{UTS}{asinh} &
+\cross{UTS}{associates?} &
+\cross{UTS}{atan} &
+\cross{UTS}{atanh} \\
+\cross{UTS}{center} &
+\cross{UTS}{characteristic} &
+\cross{UTS}{charthRoot} &
+\cross{UTS}{coefficient} \\
+\cross{UTS}{coefficients} &
+\cross{UTS}{coerce} &
+\cross{UTS}{complete} &
+\cross{UTS}{cos} \\
+\cross{UTS}{cosh} &
+\cross{UTS}{cot} &
+\cross{UTS}{coth} &
+\cross{UTS}{csc} \\
+\cross{UTS}{csch} &
+\cross{UTS}{D} &
+\cross{UTS}{degree} &
+\cross{UTS}{differentiate} \\
+\cross{UTS}{eval} &
+\cross{UTS}{evenlambert} &
+\cross{UTS}{exp} &
+\cross{UTS}{exquo} \\
+\cross{UTS}{extend} &
+\cross{UTS}{generalLambert} &
+\cross{UTS}{hash} &
+\cross{UTS}{integrate} \\
+\cross{UTS}{invmultisect} &
+\cross{UTS}{lagrange} &
+\cross{UTS}{lambert} &
+\cross{UTS}{latex} \\
+\cross{UTS}{leadingCoefficient} &
+\cross{UTS}{leadingMonomial} &
+\cross{UTS}{log} &
+\cross{UTS}{map} \\
+\cross{UTS}{monomial} &
+\cross{UTS}{monomial?} &
+\cross{UTS}{multiplyCoefficients} &
+\cross{UTS}{multiplyExponents} \\
+\cross{UTS}{multisect} &
+\cross{UTS}{nthRoot} &
+\cross{UTS}{oddlambert} &
+\cross{UTS}{one?} \\
+\cross{UTS}{order} &
+\cross{UTS}{pi} &
+\cross{UTS}{pole?} &
+\cross{UTS}{polynomial} \\
+\cross{UTS}{quoByVar} &
+\cross{UTS}{recip} &
+\cross{UTS}{reductum} &
+\cross{UTS}{revert} \\
+\cross{UTS}{sample} &
+\cross{UTS}{sec} &
+\cross{UTS}{sech} &
+\cross{UTS}{series} \\
+\cross{UTS}{sin} &
+\cross{UTS}{sinh} &
+\cross{UTS}{sqrt} &
+\cross{UTS}{subtractIfCan} \\
+\cross{UTS}{tan} &
+\cross{UTS}{tanh} &
+\cross{UTS}{terms} &
+\cross{UTS}{truncate} \\
+\cross{UTS}{unit?} &
+\cross{UTS}{unitCanonical} &
+\cross{UTS}{unitNormal} &
+\cross{UTS}{univariatePolynomial} \\
+\cross{UTS}{variable} &
+\cross{UTS}{variables} &
+\cross{UTS}{zero?} &
+\cross{UTS}{?*?} \\
+\cross{UTS}{?**?} &
+\cross{UTS}{?+?} &
+\cross{UTS}{?-?} &
+\cross{UTS}{-?} \\
+\cross{UTS}{?=?} &
+\cross{UTS}{?\^{}?} &
+\cross{UTS}{?\~{}=?} &
+\cross{UTS}{?.?} 
+\end{tabular}
+
 <<domain UTS UnivariateTaylorSeries>>=
 )abbrev domain UTS UnivariateTaylorSeries
 ++ Author: Clifton J. Williamson
 ++ Date Created: 21 December 1989
 ++ Date Last Updated: 21 September 1993
 ++ Basic Operations:
-++ Related Domains: UnivariateLaurentSeries(Coef,var,cen), UnivariatePuiseuxSeries(Coef,var,cen)
+++ Related Domains: UnivariateLaurentSeries(Coef,var,cen), 
+++ UnivariatePuiseuxSeries(Coef,var,cen)
 ++ Also See:
 ++ AMS Classifications:
 ++ Keywords: dense, Taylor series
@@ -98210,6 +101884,30 @@ o )show UniversalSegment
 {\bf See}\\
 \pageto{Segment}{SEG}
 \pageto{SegmentBinding}{SEGBIND}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{UNISEG}{BY} &
+\cross{UNISEG}{coerce} &
+\cross{UNISEG}{convert} &
+\cross{UNISEG}{expand} &
+\cross{UNISEG}{hasHi} \\
+\cross{UNISEG}{hash} &
+\cross{UNISEG}{hi} &
+\cross{UNISEG}{high} &
+\cross{UNISEG}{incr} &
+\cross{UNISEG}{latex} \\
+\cross{UNISEG}{lo} &
+\cross{UNISEG}{low} &
+\cross{UNISEG}{map} &
+\cross{UNISEG}{segment} &
+\cross{UNISEG}{segment} \\
+\cross{UNISEG}{?=?} &
+\cross{UNISEG}{?SEGMENT} &
+\cross{UNISEG}{?..?} &
+\cross{UNISEG}{?\~{}=?} &
+\end{tabular}
+
 <<domain UNISEG UniversalSegment>>=
 )abbrev domain UNISEG UniversalSegment
 ++ Author:  Robert S. Sutor
@@ -98348,6 +102046,17 @@ UniversalSegment(S: Type): SegmentCategory(S) with
 \section{domain VARIABLE Variable}
 \pagehead{Variable}{VARIABLE}
 \pagepic{ps/v103variable.ps}{VARIABLE}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{VARIABLE}{coerce} &
+\cross{VARIABLE}{hash} &
+\cross{VARIABLE}{latex} &
+\cross{VARIABLE}{variable} &
+\cross{VARIABLE}{?=?} &
+\cross{VARIABLE}{?\~{}=?} 
+\end{tabular}
+
 <<domain VARIABLE Variable>>=
 )abbrev domain VARIABLE Variable
 ++ Description:
@@ -98568,6 +102277,85 @@ o )show Vector
 @
 \pagehead{Vector}{VECTOR}
 \pagepic{ps/v103vector.ps}{VECTOR}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{VECTOR}{any?} &
+\cross{VECTOR}{coerce} &
+\cross{VECTOR}{concat} &
+\cross{VECTOR}{construct} &
+\cross{VECTOR}{convert} \\
+\cross{VECTOR}{copy} &
+\cross{VECTOR}{copyInto!} &
+\cross{VECTOR}{count} &
+\cross{VECTOR}{cross} &
+\cross{VECTOR}{delete} \\
+\cross{VECTOR}{dot} &
+\cross{VECTOR}{elt} &
+\cross{VECTOR}{empty} &
+\cross{VECTOR}{empty?} &
+\cross{VECTOR}{entries} \\
+\cross{VECTOR}{entry?} &
+\cross{VECTOR}{eq?} &
+\cross{VECTOR}{eval} &
+\cross{VECTOR}{every?} &
+\cross{VECTOR}{fill!} \\
+\cross{VECTOR}{find} &
+\cross{VECTOR}{first} &
+\cross{VECTOR}{hash} &
+\cross{VECTOR}{index?} &
+\cross{VECTOR}{indices} \\
+\cross{VECTOR}{insert} &
+\cross{VECTOR}{latex} &
+\cross{VECTOR}{length} &
+\cross{VECTOR}{less?} &
+\cross{VECTOR}{magnitude} \\
+\cross{VECTOR}{map} &
+\cross{VECTOR}{map!} &
+\cross{VECTOR}{max} &
+\cross{VECTOR}{maxIndex} &
+\cross{VECTOR}{member?} \\
+\cross{VECTOR}{members} &
+\cross{VECTOR}{merge} &
+\cross{VECTOR}{min} &
+\cross{VECTOR}{minIndex} &
+\cross{VECTOR}{more?} \\
+\cross{VECTOR}{new} &
+\cross{VECTOR}{outerProduct} &
+\cross{VECTOR}{parts} &
+\cross{VECTOR}{position} &
+\cross{VECTOR}{qelt} \\
+\cross{VECTOR}{qsetelt!} &
+\cross{VECTOR}{reduce} &
+\cross{VECTOR}{remove} &
+\cross{VECTOR}{removeDuplicates} &
+\cross{VECTOR}{reverse} \\
+\cross{VECTOR}{reverse!} &
+\cross{VECTOR}{sample} &
+\cross{VECTOR}{select} &
+\cross{VECTOR}{setelt} &
+\cross{VECTOR}{size?} \\
+\cross{VECTOR}{sort} &
+\cross{VECTOR}{sort!} &
+\cross{VECTOR}{sorted?} &
+\cross{VECTOR}{swap!} &
+\cross{VECTOR}{vector} \\
+\cross{VECTOR}{zero} &
+\cross{VECTOR}{\#{}?} &
+\cross{VECTOR}{?*?} &
+\cross{VECTOR}{?+?} &
+\cross{VECTOR}{?-?} \\
+\cross{VECTOR}{?$<$?} &
+\cross{VECTOR}{?$<=$?} &
+\cross{VECTOR}{?=?} &
+\cross{VECTOR}{?$>$?} &
+\cross{VECTOR}{?$>=$?} \\
+\cross{VECTOR}{?.?} &
+\cross{VECTOR}{?\~{}=?} &
+\cross{VECTOR}{-?} &
+\cross{VECTOR}{?.?} &
+\end{tabular}
+
 <<domain VECTOR Vector>>=
 )abbrev domain VECTOR Vector
 ++ Author:
@@ -98703,6 +102491,13 @@ o )show Void
 @
 \pagehead{Void}{VOID}
 \pagepic{ps/v103void.ps}{VOID}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{VOID}{coerce} &
+\cross{VOID}{void} 
+\end{tabular}
+
 <<domain VOID Void>>=
 )abbrev domain VOID Void
 -- These types act as the top and bottom of the type lattice
@@ -98746,6 +102541,34 @@ Void: with
 \section{domain WP WeightedPolynomials}
 \pagehead{WeightedPolynomials}{WP}
 \pagepic{ps/v103weightedpolynomials.ps}{WP}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{WP}{0} &
+\cross{WP}{1} &
+\cross{WP}{changeWeightLevel} &
+\cross{WP}{characteristic} \\
+\cross{WP}{coerce} &
+\cross{WP}{hash} &
+\cross{WP}{latex} &
+\cross{WP}{one?} \\
+\cross{WP}{recip} &
+\cross{WP}{sample} &
+\cross{WP}{subtractIfCan} &
+\cross{WP}{zero?} \\
+\cross{WP}{?\~{}=?} &
+\cross{WP}{?*?} &
+\cross{WP}{?**?} &
+\cross{WP}{?/?} \\
+\cross{WP}{?\^{}?} &
+\cross{WP}{?*?} &
+\cross{WP}{?**?} &
+\cross{WP}{?+?} \\
+\cross{WP}{?-?} &
+\cross{WP}{-?} &
+\cross{WP}{?=?} &
+\end{tabular}
+
 <<domain WP WeightedPolynomials>>=
 )abbrev domain WP WeightedPolynomials
 ++ Author: James Davenport
@@ -99170,6 +102993,93 @@ o )show WuWenTsunTriangularSet
 \pagepic{ps/v103wuwentsuntriangularset.ps}{WUTSET}{1.00}
 {\bf See}\\
 \pageto{GeneralTriangularSet}{GTSET}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{WUTSET}{algebraic?} &
+\cross{WUTSET}{algebraicVariables} \\
+\cross{WUTSET}{any?} &
+\cross{WUTSET}{autoReduced?} \\
+\cross{WUTSET}{basicSet} &
+\cross{WUTSET}{characteristicSerie} \\
+\cross{WUTSET}{characteristicSet} &
+\cross{WUTSET}{coerce} \\
+\cross{WUTSET}{coHeight} &
+\cross{WUTSET}{collect} \\
+\cross{WUTSET}{collectQuasiMonic} &
+\cross{WUTSET}{collectUnder} \\
+\cross{WUTSET}{collectUpper} &
+\cross{WUTSET}{construct} \\
+\cross{WUTSET}{convert} &
+\cross{WUTSET}{copy} \\
+\cross{WUTSET}{count} &
+\cross{WUTSET}{degree} \\
+\cross{WUTSET}{empty} &
+\cross{WUTSET}{empty?} \\
+\cross{WUTSET}{eq?} &
+\cross{WUTSET}{eval} \\
+\cross{WUTSET}{every?} &
+\cross{WUTSET}{extend} \\
+\cross{WUTSET}{extendIfCan} &
+\cross{WUTSET}{find} \\
+\cross{WUTSET}{first} &
+\cross{WUTSET}{hash} \\
+\cross{WUTSET}{headReduce} &
+\cross{WUTSET}{headReduced?} \\
+\cross{WUTSET}{headRemainder} &
+\cross{WUTSET}{infRittWu?} \\
+\cross{WUTSET}{initiallyReduce} &
+\cross{WUTSET}{initiallyReduced?} \\
+\cross{WUTSET}{initials} &
+\cross{WUTSET}{last} \\
+\cross{WUTSET}{latex} &
+\cross{WUTSET}{less?} \\
+\cross{WUTSET}{mainVariable?} &
+\cross{WUTSET}{mainVariables} \\
+\cross{WUTSET}{map} &
+\cross{WUTSET}{map!} \\
+\cross{WUTSET}{medialSet} &
+\cross{WUTSET}{member?} \\
+\cross{WUTSET}{members} &
+\cross{WUTSET}{more?} \\
+\cross{WUTSET}{mvar} &
+\cross{WUTSET}{normalized?} \\
+\cross{WUTSET}{normalized?} &
+\cross{WUTSET}{parts} \\
+\cross{WUTSET}{quasiComponent} &
+\cross{WUTSET}{reduce} \\
+\cross{WUTSET}{reduceByQuasiMonic} &
+\cross{WUTSET}{reduced?} \\
+\cross{WUTSET}{remainder} &
+\cross{WUTSET}{remove} \\
+\cross{WUTSET}{removeDuplicates} &
+\cross{WUTSET}{removeZero} \\
+\cross{WUTSET}{rest} &
+\cross{WUTSET}{retract} \\
+\cross{WUTSET}{retractIfCan} &
+\cross{WUTSET}{rewriteIdealWithHeadRemainder} \\
+\cross{WUTSET}{rewriteIdealWithRemainder} &
+\cross{WUTSET}{rewriteSetWithReduction} \\
+\cross{WUTSET}{roughBase?} &
+\cross{WUTSET}{roughEqualIdeals?} \\
+\cross{WUTSET}{roughSubIdeal?} &
+\cross{WUTSET}{roughUnitIdeal?} \\
+\cross{WUTSET}{sample} &
+\cross{WUTSET}{select} \\
+\cross{WUTSET}{size?} &
+\cross{WUTSET}{sort} \\
+\cross{WUTSET}{stronglyReduce} &
+\cross{WUTSET}{stronglyReduced?} \\
+\cross{WUTSET}{triangular?} &
+\cross{WUTSET}{trivialIdeal?} \\
+\cross{WUTSET}{variables} &
+\cross{WUTSET}{zeroSetSplit} \\
+\cross{WUTSET}{zeroSetSplitIntoTriangularSystems} &
+\cross{WUTSET}{\#{}?} \\
+\cross{WUTSET}{?=?} &
+\cross{WUTSET}{?\~{}=?} 
+\end{tabular}
+
 <<domain WUTSET WuWenTsunTriangularSet>>=
 )abbrev domain WUTSET WuWenTsunTriangularSet
 ++ Author: Marc Moreno Maza (marc@nag.co.uk)
@@ -99432,6 +103342,59 @@ equivalent for the
 {\bf DistributedMultivariatePolynomial} constructor.
 \pagehead{XDistributedPolynomial}{XDPOLY}
 \pagepic{ps/v103xdistributedpolynomial.ps}{XDPOLY}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{XDPOLY}{0} &
+\cross{XDPOLY}{1} &
+\cross{XDPOLY}{characteristic} &
+\cross{XDPOLY}{coef} \\
+\cross{XDPOLY}{coefficient} &
+\cross{XDPOLY}{coefficients} &
+\cross{XDPOLY}{coerce} &
+\cross{XDPOLY}{constant} \\
+\cross{XDPOLY}{constant?} &
+\cross{XDPOLY}{degree} &
+\cross{XDPOLY}{hash} &
+\cross{XDPOLY}{latex} \\
+\cross{XDPOLY}{leadingCoefficient} &
+\cross{XDPOLY}{ListOfTerms} &
+\cross{XDPOLY}{leadingMonomial} &
+\cross{XDPOLY}{leadingTerm} \\
+\cross{XDPOLY}{lquo} &
+\cross{XDPOLY}{map} &
+\cross{XDPOLY}{mirror} &
+\cross{XDPOLY}{monomial?} \\
+\cross{XDPOLY}{monomials} &
+\cross{XDPOLY}{maxdeg} &
+\cross{XDPOLY}{mindeg} &
+\cross{XDPOLY}{mindegTerm} \\
+\cross{XDPOLY}{monom} &
+\cross{XDPOLY}{numberOfMonomials} &
+\cross{XDPOLY}{one?} &
+\cross{XDPOLY}{quasiRegular} \\
+\cross{XDPOLY}{quasiRegular?} &
+\cross{XDPOLY}{recip} &
+\cross{XDPOLY}{reductum} &
+\cross{XDPOLY}{retract} \\
+\cross{XDPOLY}{retractIfCan} &
+\cross{XDPOLY}{rquo} &
+\cross{XDPOLY}{sample} &
+\cross{XDPOLY}{sh} \\
+\cross{XDPOLY}{subtractIfCan} &
+\cross{XDPOLY}{trunc} &
+\cross{XDPOLY}{varList} &
+\cross{XDPOLY}{zero?} \\
+\cross{XDPOLY}{?*?} &
+\cross{XDPOLY}{?**?} &
+\cross{XDPOLY}{?+?} &
+\cross{XDPOLY}{?-?} \\
+\cross{XDPOLY}{-?} &
+\cross{XDPOLY}{?=?} &
+\cross{XDPOLY}{?\^{}?} &
+\cross{XDPOLY}{?\~{}=?} 
+\end{tabular}
+
 <<domain XDPOLY XDistributedPolynomial>>=
 )abbrev domain XDPOLY XDistributedPolynomial
 ++ Author: Michel Petitot petitot@lifl.fr
@@ -100386,6 +104349,63 @@ o )show XPBWPolynomial
 @
 \pagehead{XPBWPolynomial}{XPBWPOLY}
 \pagepic{ps/v103xpbwpolynomial.ps}{XPBWPOLY}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{XPBWPOLYL}{0} &
+\cross{XPBWPOLYL}{1} &
+\cross{XPBWPOLYL}{characteristic} &
+\cross{XPBWPOLYL}{coef} \\
+\cross{XPBWPOLYL}{coefficient} &
+\cross{XPBWPOLYL}{coefficients} &
+\cross{XPBWPOLYL}{coerce} &
+\cross{XPBWPOLYL}{constant} \\
+\cross{XPBWPOLYL}{constant?} &
+\cross{XPBWPOLYL}{degree} &
+\cross{XPBWPOLYL}{exp} &
+\cross{XPBWPOLYL}{hash} \\
+\cross{XPBWPOLYL}{latex} &
+\cross{XPBWPOLYL}{leadingCoefficient} &
+\cross{XPBWPOLYL}{leadingMonomial} &
+\cross{XPBWPOLYL}{leadingTerm} \\
+\cross{XPBWPOLYL}{LiePolyIfCan} &
+\cross{XPBWPOLYL}{ListOfTerms} &
+\cross{XPBWPOLYL}{log} &
+\cross{XPBWPOLYL}{lquo} \\
+\cross{XPBWPOLYL}{map} &
+\cross{XPBWPOLYL}{maxdeg} &
+\cross{XPBWPOLYL}{mindeg} &
+\cross{XPBWPOLYL}{mindegTerm} \\
+\cross{XPBWPOLYL}{mirror} &
+\cross{XPBWPOLYL}{monom} &
+\cross{XPBWPOLYL}{monomial?} &
+\cross{XPBWPOLYL}{monomials} \\
+\cross{XPBWPOLYL}{numberOfMonomials} &
+\cross{XPBWPOLYL}{one?} &
+\cross{XPBWPOLYL}{product} &
+\cross{XPBWPOLYL}{quasiRegular} \\
+\cross{XPBWPOLYL}{quasiRegular?} &
+\cross{XPBWPOLYL}{recip} &
+\cross{XPBWPOLYL}{reductum} &
+\cross{XPBWPOLYL}{retract} \\
+\cross{XPBWPOLYL}{retractIfCan} &
+\cross{XPBWPOLYL}{rquo} &
+\cross{XPBWPOLYL}{sample} &
+\cross{XPBWPOLYL}{sh} \\
+\cross{XPBWPOLYL}{subtractIfCan} &
+\cross{XPBWPOLYL}{trunc} &
+\cross{XPBWPOLYL}{varList} &
+\cross{XPBWPOLYL}{zero?} \\
+\cross{XPBWPOLYL}{?*?} &
+\cross{XPBWPOLYL}{?**?} &
+\cross{XPBWPOLYL}{?+?} &
+\cross{XPBWPOLYL}{?-?} \\
+\cross{XPBWPOLYL}{-?} &
+\cross{XPBWPOLYL}{?=?} &
+\cross{XPBWPOLYL}{?\^{}?} &
+\cross{XPBWPOLYL}{?\~{}=?} 
+\end{tabular}
+
 <<domain XPBWPOLY XPBWPolynomial>>=
 )abbrev domain XPBWPOLY XPBWPolynomial
 ++ Author: Michel Petitot (petitot@lifl.fr).
@@ -100879,6 +104899,53 @@ o )show XPolynomial
 @
 \pagehead{XPolynomial}{XPOLY}
 \pagepic{ps/v103xpolynomial.ps}{XPOLY}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{XPOLY}{0} &
+\cross{XPOLY}{1} &
+\cross{XPOLY}{characteristic} &
+\cross{XPOLY}{coef} &
+\cross{XPOLY}{coerce} \\
+\cross{XPOLY}{constant} &
+\cross{XPOLY}{constant?} &
+\cross{XPOLY}{degree} &
+\cross{XPOLY}{expand} &
+\cross{XPOLY}{hash} \\
+\cross{XPOLY}{latex} &
+\cross{XPOLY}{lquo} &
+\cross{XPOLY}{map} &
+\cross{XPOLY}{maxdeg} &
+\cross{XPOLY}{mindeg} \\
+\cross{XPOLY}{mindegTerm} &
+\cross{XPOLY}{mirror} &
+\cross{XPOLY}{monom} &
+\cross{XPOLY}{monomial?} &
+\cross{XPOLY}{RemainderList} \\
+\cross{XPOLY}{one?} &
+\cross{XPOLY}{quasiRegular} &
+\cross{XPOLY}{quasiRegular?} &
+\cross{XPOLY}{recip} &
+\cross{XPOLY}{retract} \\
+\cross{XPOLY}{retractIfCan} &
+\cross{XPOLY}{rquo} &
+\cross{XPOLY}{sample} &
+\cross{XPOLY}{sh} &
+\cross{XPOLY}{subtractIfCan} \\
+\cross{XPOLY}{trunc} &
+\cross{XPOLY}{unexpand} &
+\cross{XPOLY}{varList} &
+\cross{XPOLY}{zero?} &
+\cross{XPOLY}{?*?} \\
+\cross{XPOLY}{?**?} &
+\cross{XPOLY}{?+?} &
+\cross{XPOLY}{?-?} &
+\cross{XPOLY}{-?} &
+\cross{XPOLY}{?=?} \\
+\cross{XPOLY}{?\^{}?} &
+\cross{XPOLY}{?\~{}=?} &&&
+\end{tabular}
+
 <<domain XPOLY XPolynomial>>=
 )abbrev domain XPOLY XPolynomial
 ++ Author: Michel Petitot petitot@lifl.fr
@@ -101296,6 +105363,52 @@ o )show XPolynomialRing
 @
 \pagehead{XPolynomialRing}{XPR}
 \pagepic{ps/v103xpolynomialring.ps}{XPR}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{XPR}{0} &
+\cross{XPR}{1} &
+\cross{XPR}{characteristic} &
+\cross{XPR}{coef} \\
+\cross{XPR}{coefficient} &
+\cross{XPR}{coefficients} &
+\cross{XPR}{coerce} &
+\cross{XPR}{constant} \\
+\cross{XPR}{constant?} &
+\cross{XPR}{hash} &
+\cross{XPR}{latex} &
+\cross{XPR}{leadingCoefficient} \\
+\cross{XPR}{leadingMonomial} &
+\cross{XPR}{leadingTerm} &
+\cross{XPR}{ListOfTerms} &
+\cross{XPR}{map} \\
+\cross{XPR}{maxdeg} &
+\cross{XPR}{mindeg} &
+\cross{XPR}{monom} &
+\cross{XPR}{monomial?} \\
+\cross{XPR}{monomials} &
+\cross{XPR}{numberOfMonomials} &
+\cross{XPR}{one?} &
+\cross{XPR}{quasiRegular} \\
+\cross{XPR}{quasiRegular?} &
+\cross{XPR}{recip} &
+\cross{XPR}{reductum} &
+\cross{XPR}{retract} \\
+\cross{XPR}{retractIfCan} &
+\cross{XPR}{sample} &
+\cross{XPR}{subtractIfCan} &
+\cross{XPR}{zero?} \\
+\cross{XPR}{\#{}?} &
+\cross{XPR}{?*?} &
+\cross{XPR}{?**?} &
+\cross{XPR}{?+?} \\
+\cross{XPR}{?-?} &
+\cross{XPR}{-?} &
+\cross{XPR}{?=?} &
+\cross{XPR}{?\^{}?} \\
+\cross{XPR}{?\~{}=?} &
+\end{tabular}
+
 <<domain XPR XPolynomialRing>>=
 )abbrev domain XPR XPolynomialRing
 ++ Author: Michel Petitot petitot@lifl.fr
@@ -101473,6 +105586,53 @@ provides a recursive for these polynomials. It is the non-commutative
 equivalents for the {\bf SparseMultivariatePolynomial} constructor.
 \pagehead{XRecursivePolynomial}{XRPOLY}
 \pagepic{ps/v103xrecursivepolynomial.ps}{XRPOLY}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{XRPOLY}{0} &
+\cross{XRPOLY}{1} &
+\cross{XRPOLY}{characteristic} &
+\cross{XRPOLY}{coef} &
+\cross{XRPOLY}{coerce} \\
+\cross{XRPOLY}{constant} &
+\cross{XRPOLY}{constant?} &
+\cross{XRPOLY}{degree} &
+\cross{XRPOLY}{expand} &
+\cross{XRPOLY}{hash} \\
+\cross{XRPOLY}{latex} &
+\cross{XRPOLY}{lquo} &
+\cross{XRPOLY}{map} &
+\cross{XRPOLY}{maxdeg} &
+\cross{XRPOLY}{mindeg} \\
+\cross{XRPOLY}{mindegTerm} &
+\cross{XRPOLY}{mirror} &
+\cross{XRPOLY}{monom} &
+\cross{XRPOLY}{monomial?} &
+\cross{XRPOLY}{one?} \\
+\cross{XRPOLY}{quasiRegular} &
+\cross{XRPOLY}{quasiRegular?} &
+\cross{XRPOLY}{recip} &
+\cross{XRPOLY}{RemainderList} &
+\cross{XRPOLY}{retract} \\
+\cross{XRPOLY}{retractIfCan} &
+\cross{XRPOLY}{rquo} &
+\cross{XRPOLY}{sample} &
+\cross{XRPOLY}{sh} &
+\cross{XRPOLY}{subtractIfCan} \\
+\cross{XRPOLY}{trunc} &
+\cross{XRPOLY}{unexpand} &
+\cross{XRPOLY}{varList} &
+\cross{XRPOLY}{zero?} &
+\cross{XRPOLY}{?*?} \\
+\cross{XRPOLY}{?**?} &
+\cross{XRPOLY}{?+?} &
+\cross{XRPOLY}{?-?} &
+\cross{XRPOLY}{-?} &
+\cross{XRPOLY}{?=?} \\
+\cross{XRPOLY}{?\^{}?} &
+\cross{XRPOLY}{?\~{}=?} &&&
+\end{tabular}
+
 <<domain XRPOLY XRecursivePolynomial>>=
 )abbrev domain XRPOLY XRecursivePolynomial
 ++ Author: Michel Petitot petitot@lifl.fr
diff --git a/books/ps/v103colorchart.ps b/books/ps/v103colorchart.ps
new file mode 100644
index 0000000..117c8ad
--- /dev/null
+++ b/books/ps/v103colorchart.ps
@@ -0,0 +1,283 @@
+%!PS-Adobe-2.0
+%%Creator: Graphviz version 2.18 (Wed Aug  6 10:29:47 UTC 2008)
+%%For: (root) root
+%%Title: pic
+%%Pages: (atend)
+%%BoundingBox: (atend)
+%%EndComments
+save
+%%BeginProlog
+/DotDict 200 dict def
+DotDict begin
+
+/setupLatin1 {
+mark
+/EncodingVector 256 array def
+ EncodingVector 0
+
+ISOLatin1Encoding 0 255 getinterval putinterval
+EncodingVector 45 /hyphen put
+
+% Set up ISO Latin 1 character encoding
+/starnetISO {
+        dup dup findfont dup length dict begin
+        { 1 index /FID ne { def }{ pop pop } ifelse
+        } forall
+        /Encoding EncodingVector def
+        currentdict end definefont
+} def
+/Times-Roman starnetISO def
+/Times-Italic starnetISO def
+/Times-Bold starnetISO def
+/Times-BoldItalic starnetISO def
+/Helvetica starnetISO def
+/Helvetica-Oblique starnetISO def
+/Helvetica-Bold starnetISO def
+/Helvetica-BoldOblique starnetISO def
+/Courier starnetISO def
+/Courier-Oblique starnetISO def
+/Courier-Bold starnetISO def
+/Courier-BoldOblique starnetISO def
+cleartomark
+} bind def
+
+%%BeginResource: procset graphviz 0 0
+/coord-font-family /Times-Roman def
+/default-font-family /Times-Roman def
+/coordfont coord-font-family findfont 8 scalefont def
+
+/InvScaleFactor 1.0 def
+/set_scale {
+       dup 1 exch div /InvScaleFactor exch def
+       scale
+} bind def
+
+% styles
+/solid { [] 0 setdash } bind def
+/dashed { [9 InvScaleFactor mul dup ] 0 setdash } bind def
+/dotted { [1 InvScaleFactor mul 6 InvScaleFactor mul] 0 setdash } bind def
+/invis {/fill {newpath} def /stroke {newpath} def /show {pop newpath} def} bind def
+/bold { 2 setlinewidth } bind def
+/filled { } bind def
+/unfilled { } bind def
+/rounded { } bind def
+/diagonals { } bind def
+
+% hooks for setting color 
+/nodecolor { sethsbcolor } bind def
+/edgecolor { sethsbcolor } bind def
+/graphcolor { sethsbcolor } bind def
+/nopcolor {pop pop pop} bind def
+
+/beginpage {	% i j npages
+	/npages exch def
+	/j exch def
+	/i exch def
+	/str 10 string def
+	npages 1 gt {
+		gsave
+			coordfont setfont
+			0 0 moveto
+			(\() show i str cvs show (,) show j str cvs show (\)) show
+		grestore
+	} if
+} bind def
+
+/set_font {
+	findfont exch
+	scalefont setfont
+} def
+
+% draw text fitted to its expected width
+/alignedtext {			% width text
+	/text exch def
+	/width exch def
+	gsave
+		width 0 gt {
+			[] 0 setdash
+			text stringwidth pop width exch sub text length div 0 text ashow
+		} if
+	grestore
+} def
+
+/boxprim {				% xcorner ycorner xsize ysize
+		4 2 roll
+		moveto
+		2 copy
+		exch 0 rlineto
+		0 exch rlineto
+		pop neg 0 rlineto
+		closepath
+} bind def
+
+/ellipse_path {
+	/ry exch def
+	/rx exch def
+	/y exch def
+	/x exch def
+	matrix currentmatrix
+	newpath
+	x y translate
+	rx ry scale
+	0 0 1 0 360 arc
+	setmatrix
+} bind def
+
+/endpage { showpage } bind def
+/showpage { } def
+
+/layercolorseq
+	[	% layer color sequence - darkest to lightest
+		[0 0 0]
+		[.2 .8 .8]
+		[.4 .8 .8]
+		[.6 .8 .8]
+		[.8 .8 .8]
+	]
+def
+
+/layerlen layercolorseq length def
+
+/setlayer {/maxlayer exch def /curlayer exch def
+	layercolorseq curlayer 1 sub layerlen mod get
+	aload pop sethsbcolor
+	/nodecolor {nopcolor} def
+	/edgecolor {nopcolor} def
+	/graphcolor {nopcolor} def
+} bind def
+
+/onlayer { curlayer ne {invis} if } def
+
+/onlayers {
+	/myupper exch def
+	/mylower exch def
+	curlayer mylower lt
+	curlayer myupper gt
+	or
+	{invis} if
+} def
+
+/curlayer 0 def
+
+%%EndResource
+%%EndProlog
+%%BeginSetup
+14 default-font-family set_font
+1 setmiterlimit
+% /arrowlength 10 def
+% /arrowwidth 5 def
+
+% make sure pdfmark is harmless for PS-interpreters other than Distiller
+/pdfmark where {pop} {userdict /pdfmark /cleartomark load put} ifelse
+% make '<<' and '>>' safe on PS Level 1 devices
+/languagelevel where {pop languagelevel}{1} ifelse
+2 lt {
+    userdict (<<) cvn ([) cvn load put
+    userdict (>>) cvn ([) cvn load put
+} if
+
+%%EndSetup
+setupLatin1
+%%Page: 1 1
+%%PageBoundingBox: 36 36 390 82
+%%PageOrientation: Portrait
+0 0 1 beginpage
+gsave
+36 36 354 46 boxprim clip newpath
+1 1 set_scale 0 rotate 40 40 translate
+0.167 0.600 1.000 graphcolor
+newpath -4 -4 moveto
+-4 716 lineto
+536 716 lineto
+536 -4 lineto
+closepath fill
+1 setlinewidth
+0.167 0.600 1.000 graphcolor
+newpath -4 -4 moveto
+-4 716 lineto
+536 716 lineto
+536 -4 lineto
+closepath stroke
+% Category
+gsave
+0.606 0.733 1.000 nodecolor
+newpath 66 37 moveto
+0 37 lineto
+0 1 lineto
+66 1 lineto
+closepath fill
+1 setlinewidth
+filled
+0.606 0.733 1.000 nodecolor
+newpath 66 37 moveto
+0 37 lineto
+0 1 lineto
+66 1 lineto
+closepath stroke
+0.000 0.000 0.000 nodecolor
+14 /Times-Roman set_font
+8 15.4 moveto 50 (Category) alignedtext
+grestore
+% Domain
+gsave
+0.273 0.733 1.000 nodecolor
+newpath 144 37 moveto
+84 37 lineto
+84 1 lineto
+144 1 lineto
+closepath fill
+1 setlinewidth
+filled
+0.273 0.733 1.000 nodecolor
+newpath 144 37 moveto
+84 37 lineto
+84 1 lineto
+144 1 lineto
+closepath stroke
+0.000 0.000 0.000 nodecolor
+14 /Times-Roman set_font
+92 15.4 moveto 44 (Domain) alignedtext
+grestore
+% Package
+gsave
+0.939 0.733 1.000 nodecolor
+newpath 222 37 moveto
+162 37 lineto
+162 1 lineto
+222 1 lineto
+closepath fill
+1 setlinewidth
+filled
+0.939 0.733 1.000 nodecolor
+newpath 222 37 moveto
+162 37 lineto
+162 1 lineto
+222 1 lineto
+closepath stroke
+0.000 0.000 0.000 nodecolor
+14 /Times-Roman set_font
+169.5 15.4 moveto 45 (Package) alignedtext
+grestore
+% CABMON
+gsave
+0.606 0.733 1.000 nodecolor
+293 19 53.24 18.38 ellipse_path fill
+1 setlinewidth
+filled
+0.606 0.733 1.000 nodecolor
+293 19 53.24 18.38 ellipse_path stroke
+0.000 0.000 0.000 nodecolor
+14 /Times-Roman set_font
+263 15.4 moveto 60 (CABMON) alignedtext
+grestore
+endpage
+showpage
+grestore
+%%PageTrailer
+%%EndPage: 1
+%%Trailer
+%%Pages: 1
+%%BoundingBox: 36 36 390 82
+end
+restore
+%%EOF
diff --git a/books/ps/v103indexeddirectproductorderedabelianmonoid.ps b/books/ps/v103indexeddirectproductorderedabelianmonoid.ps
index 7a3530c..f307495 100644
--- a/books/ps/v103indexeddirectproductorderedabelianmonoid.ps
+++ b/books/ps/v103indexeddirectproductorderedabelianmonoid.ps
@@ -225,7 +225,12 @@ closepath stroke
 grestore
 % OAMON
 gsave
-0.000 0.000 1.000 nodecolor
+[ /Rect [ 1 0 69 36 ]
+  /Border [ 0 0 0 ]
+  /Action << /Subtype /URI /URI (bookvol10.2.pdf#nameddest=OAMON) >>
+  /Subtype /Link
+/ANN pdfmark
+0.606 0.733 1.000 nodecolor
 newpath 69 36 moveto
 1 36 lineto
 1 0 lineto
@@ -233,7 +238,7 @@ newpath 69 36 moveto
 closepath fill
 1 setlinewidth
 filled
-0.000 0.000 1.000 nodecolor
+0.606 0.733 1.000 nodecolor
 newpath 69 36 moveto
 1 36 lineto
 1 0 lineto
diff --git a/books/ps/v103indexedtwodimensionalarray.ps b/books/ps/v103indexedtwodimensionalarray.ps
index 057319e..6e37218 100644
--- a/books/ps/v103indexedtwodimensionalarray.ps
+++ b/books/ps/v103indexedtwodimensionalarray.ps
@@ -270,7 +270,12 @@ closepath stroke
 grestore
 % ARR2CAT
 gsave
-0.000 0.000 1.000 nodecolor
+[ /Rect [ 80 0 158 36 ]
+  /Border [ 0 0 0 ]
+  /Action << /Subtype /URI /URI (bookvol10.2.pdf#nameddest=ARR2CAT) >>
+  /Subtype /Link
+/ANN pdfmark
+0.606 0.733 1.000 nodecolor
 newpath 158 36 moveto
 80 36 lineto
 80 0 lineto
@@ -278,7 +283,7 @@ newpath 158 36 moveto
 closepath fill
 1 setlinewidth
 filled
-0.000 0.000 1.000 nodecolor
+0.606 0.733 1.000 nodecolor
 newpath 158 36 moveto
 80 36 lineto
 80 0 lineto
diff --git a/books/ps/v103odeintensityfunctionstable.ps b/books/ps/v103odeintensityfunctionstable.ps
index 6b3f157..a5f03fb 100644
--- a/books/ps/v103odeintensityfunctionstable.ps
+++ b/books/ps/v103odeintensityfunctionstable.ps
@@ -225,7 +225,7 @@ closepath stroke
 grestore
 % Domain
 gsave
-0.000 0.000 1.000 nodecolor
+0.273 0.733 1.000 nodecolor
 newpath 70 36 moveto
 10 36 lineto
 10 0 lineto
@@ -233,7 +233,7 @@ newpath 70 36 moveto
 closepath fill
 1 setlinewidth
 filled
-0.000 0.000 1.000 nodecolor
+0.273 0.733 1.000 nodecolor
 newpath 70 36 moveto
 10 36 lineto
 10 0 lineto
diff --git a/books/ps/v103openmathconnection.ps b/books/ps/v103openmathconnection.ps
index 53a7e8b..6609f92 100644
--- a/books/ps/v103openmathconnection.ps
+++ b/books/ps/v103openmathconnection.ps
@@ -225,7 +225,7 @@ closepath stroke
 grestore
 % Domain
 gsave
-0.000 0.000 1.000 nodecolor
+0.273 0.733 1.000 nodecolor
 newpath 68 36 moveto
 8 36 lineto
 8 0 lineto
@@ -233,7 +233,7 @@ newpath 68 36 moveto
 closepath fill
 1 setlinewidth
 filled
-0.000 0.000 1.000 nodecolor
+0.273 0.733 1.000 nodecolor
 newpath 68 36 moveto
 8 36 lineto
 8 0 lineto
diff --git a/books/ps/v103openmathdevice.ps b/books/ps/v103openmathdevice.ps
index d1db846..63c0d4b 100644
--- a/books/ps/v103openmathdevice.ps
+++ b/books/ps/v103openmathdevice.ps
@@ -225,7 +225,7 @@ closepath stroke
 grestore
 % Domain
 gsave
-0.000 0.000 1.000 nodecolor
+0.273 0.733 1.000 nodecolor
 newpath 63 36 moveto
 3 36 lineto
 3 0 lineto
@@ -233,7 +233,7 @@ newpath 63 36 moveto
 closepath fill
 1 setlinewidth
 filled
-0.000 0.000 1.000 nodecolor
+0.273 0.733 1.000 nodecolor
 newpath 63 36 moveto
 3 36 lineto
 3 0 lineto
diff --git a/books/ps/v103tuple.ps b/books/ps/v103tuple.ps
index ed3246e..4208caa 100644
--- a/books/ps/v103tuple.ps
+++ b/books/ps/v103tuple.ps
@@ -270,7 +270,12 @@ closepath stroke
 grestore
 % A1AGG-
 gsave
-0.000 0.000 1.000 nodecolor
+[ /Rect [ 80 0 146 36 ]
+  /Border [ 0 0 0 ]
+  /Action << /Subtype /URI /URI (bookvol10.3.pdf#nameddest=A1AGG) >>
+  /Subtype /Link
+/ANN pdfmark
+0.273 0.733 1.000 nodecolor
 newpath 146 36 moveto
 80 36 lineto
 80 0 lineto
@@ -278,7 +283,7 @@ newpath 146 36 moveto
 closepath fill
 1 setlinewidth
 filled
-0.000 0.000 1.000 nodecolor
+0.273 0.733 1.000 nodecolor
 newpath 146 36 moveto
 80 36 lineto
 80 0 lineto
diff --git a/changelog b/changelog
index 0f6549d..39ca121 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,12 @@
+20090118 tpd src/axiom-website/patches.html 20090118.01.tpd.patch
+20090118 tpd books/bookvol10.3 add exports
+20090118 tpd books/ps/v103colorchart.ps added
+20090118 tpd books/ps/v103tuple.ps fixed
+20090118 tpd books/ps/v103openmathdevice.ps fixed
+20090118 tpd books/ps/v103openmathconnection.ps fixed
+20090118 tpd books/ps/v103odeintensityfunctionstable.ps fixed
+20090118 tpd books/ps/v103indexedtwodimensionalarray.ps fixed
+20090118 tpd books/ps/v103indexeddirectproductorderedabelianmonoid.ps fixed
 20090117 tpd src/axiom-website/patches.html 20090117.01.tpd.patch
 20090117 tpd books/bookvol10.3 add exports
 20090116 tpd src/axiom-website/patches.html 20090116.03.tpd.patch
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 51a0b36..8513efa 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -889,6 +889,8 @@ bookvol10.3 add exports<br/>
 bookvol10.3 add exports<br/>
 <a href="patches/20090117.01.tpd.patch">20090117.01.tpd.patch</a>
 bookvol10.3 add exports<br/>
+<a href="patches/20090118.01.tpd.patch">20090118.01.tpd.patch</a>
+bookvol10.3 add exports<br/>
 
  </body>
 </html>

\start
Date: Fri, 23 Jan 2009 02:51:54 -0600
From: Tim Daly
To: list
Subject: January 2009 Release

All of the repositories except Savannah CVS are up to date.
CVS, as usual, has to give me grief. The fix will take a while.
The release notes are attached.

Binaries will appear on the download website as they are generated.

Tim



=============================================================

January 2009 Release Notes

One major theme of this release was restructuring the system
to move all domains to literate form in book volume 10.3

A second major theme was the first Axiom youtube tutorial video.



Book Volume 0: Axiom Reference

  Remove obsolete references to SmallFloat

Book Volume 1: Axiom Tutorial

  Remove obsolete references to SmallFloat

Book Volume 4: Axiom Developers Guide

  Add section on generating graphviz graphs

Book Volume 7.1: Axiom Hyperdoc

  Give a complete path to htadd

Book Volume 10.3 Axiom Domains

  All domains have been removed from the algebra subdirectory 
  and are now in literate form in book volume 10.3. Some
  domains include a help file, a regression test suite, and
  --X function examples for the )display command. Future work
  will extend this set.

  Each domain has a fully indexed list of functions exported.
  This allows hyperlinked access to functions.

  Each domain includes a graph segment that shows the list of
  categories, domains, and packages that provide immediate
  support in the prior build layer.

  Each domain includes a dotabb chunk which contains the
  source code necessary to recreate the graph.

  Domains which were associated with other domains in the same
  original spad file have hyperlinks to connect them.
  

Book Volume 11: Axiom Browser

  Lighten Bayou theme background image

Axiom Website (src/axiom-website)
  
  The axiom website is now under git control.
  The source tree is in src/axiom-website in the distribution.

  The build order graph exists. It contains a graph of all the
  constraints for each level. A line in the graph connects each
  category, domain, and package to every category, domain, and
  package in the prior layer that is required for the build.
  Multilayer constraints are not shown (although the data is
  in src/algebra/Makefile chunks) because the graph would be 
  too complex. 
    http://axiom-developer.org/axiom-website/hp.svg

  The Computer Algebra Test Suite (CATS) has a new test suite
  for ordinary differential equations (kamke*)
    http://axiom-developer.org/axiom-website/CATS

  The Ubuntu download now advises XTerm*metaSendsEscape: true
  due to misconfiguration of the meta key in emacs.
    http://axiom-developer.org/axiom-website/documentation.html

  A new binary for vector linux was added
    http://axiom-developer.org/axiom-website/download.html

  A new binary for doyen thumbdrive was added
  (work by Jose Alfredo Portes)
    http://axiom-developer.org/axiom-website/download.html

  The screenshots were recreated so the sources would be available.
  for matrixinmatrix.jpg, heatequation.jpg, axiomfirefox.jpg
    http://axiom-developer.org/axiom-website/screenshots.html

  The Axiom Information Sources video page was added, including
  a link to the youtube video, a local copy, and the supporting PDF.
    http://axiom-developer.org/axiom-website/videos.html

  A broken link to Book Volume 0: Axiom Reference was fixed.


Algebra (src/algebra)

  All domains were removed from spad files and moved to 
  Book Volume 10.3 Axiom Domains

  The Makefile now contains the information necessary to
  construct the build order graph as literate chunks.

  The layers were restructured. Files were moved to ensure
  that each file was at its lowest possible layer.

  The Guess package was added. However, due to nonstandard
  package files the guess function does not yet work properly.
  These packages are being rewritten.

  The Guess package has circular references. A new clique
  mechanism was added to the Makefile to handle this.

  Automatic regression test files associated with the algebra
  sources were reviewed for conforming to regression standards.

  integer.spad was reverted to remove an algebra change that
  causes a regression (cherry picked from Fricas in 2007)

Interpreter (src/interp)

  Tim Lahey added to )credits
  Karl Hegbloom added to )credits

  htcheck.boot moves util.ht to the mnt/doc directory

  setq.lisp no longer had redundant release data information
 
  nrunfast.boot Float has exp : Float -> Float now works
  This change was cherry-picked from Fricas.


Testing (src/input)

  All regression test files were reviewed and cleaned to
  conform to a standard setup.

  A parallel build race condition was fixed in the Makefile

  xpbwpoly.input was removed as it is now associated with
  its source domain and automatically generated.

  hyperbolicrules.input was added

  Tim Lahey submitted a fix for bugs in schaum17.input

  A cherry-picked patch from Fricas in 2007 was removed
  because it causes an algebra regression. The regression
  test file was corrected.

  fixed.input was converted to a regression test file


Build process

  The lsp/Makefile was updated for GCL pre3 patches

  An ubuntu64 chunk was added as a system target

  src/Makefile outputs util.ht before compiles (bug 7146)

  books/Makefile uses bash SHELL to fix echo behavior.
  The standard sh echo behaves badly.

  books/Makefile now has amssymb in preamble for toc.tex


GCL (zips)

  Axiom now includes GCL pre3, the latest snapshot of GCL.
  This can be chosen as an option for building in the top
  level Makefile.pamphlet

  The lsp/Makefile was updated for GCL pre3 patches

faq

  FAQ 49: How do I get the lastest GCL?

readme

  Tim Lahey added
  Karl Hegbloom added

  The date information for releases was removed as it is
  available elsewhere

  A John Gorka quote was added:
  "What matters the most is what you do for free" -- John Gorka


Wikipedia

  http://en.wikipedia.org/wiki/Axiom_computer_algebra_system

  Add information about Documentation

  Add link to youtube video
    http://www.youtube.com/watch?v=CV8y3UrpadY

  New screenshots were added


Youtube

  Axiom Information Sources video was created and uploaded
    http://www.youtube.com/watch?v=CV8y3UrpadY
  To date there have been 498 views


Launchpad

  Gain administrative access to launchpad.net for Axiom (Page)
    https://launchpad.net/axiom

\start
Date: Sun, 25 Jan 2009 00:10:02 -0600
From: Tim Daly
To: list
Subject: 20090124.01.tpd.patch (download.html update binary download list)

The page
  http://axiom-developer.org/axiom-website/download.html
has been updated for the latest binaries.

======================================================================
diff --git a/Makefile.pamphlet b/Makefile.pamphlet
index 5cab4a0..25a6672 100644
--- a/Makefile.pamphlet
+++ b/Makefile.pamphlet
@@ -1276,6 +1276,67 @@ all: rootdirs noweb srcsetup lspdir srcdir
 <<clean>>
 
 @
+\subsection{Makefile.vector}
+Annoyingly enough it seems that GCL uses a default extension of .lsp
+rather than .lisp so we add the [[LISP]] variable here. We need to
+depend on the default extension behavior because the system build
+will load either the interpreted or compiled form of a file depending
+on which is available. This varies at different stages of the build.
+
+It turns out that the standard GCL OPTS does not compile with the
+GCL 2.6.8pre version. We changed it from 
+\begin{verbatim}
+@<<GCLOPTS>>
+\end{verbatim}
+to read
+\begin{verbatim}
+@<<GCLOPTS-LOCBFD>>
+\end{verbatim}
+<<Makefile.vector>>=
+# System dependent Makefile for the Intel/Linux platform
+# Platform variable
+PLF=LINUXplatform
+# C compiler flags
+CCF="-O2 -fno-strength-reduce -Wall -D_GNU_SOURCE -D${PLF} -I/usr/X11/include"
+# Loader flags
+LDF=" -L/usr/X11R6/lib ${XLIB}/libXpm.a "
+# C compiler to use
+CC=gcc 
+AWK=gawk
+RANLIB=ranlib
+TOUCH=touch
+TAR=tar
+AXIOMXLROOT=${AXIOM}/compiler
+O=o
+BYE=bye
+LISP=lsp
+DAASE=${SRC}/share
+# where the libXpm.a library lives
+XLIB=/usr/X11R6/lib
+<<GCLOPTS-LOCBFD>>
+<<SRCDIRS>>
+PATCH=patch
+
+ENV=PLF=${PLF} CCF=${CCF} LDF=${LDF} CC=${CC} AWK=${AWK} RANLIB=${RANLIB} \
+    TOUCH=${TOUCH} TAR=${TAR} AXIOMXLROOT=${AXIOMXLROOT} O=${O} BYE=${BYE} \
+    LISP=${LISP} DAASE=${DAASE} XLIB=${XLIB} GCLOPTS=${GCLOPTS} \
+    SRCDIRS=${SRCDIRS} PATCH=${PATCH}
+
+all: rootdirs noweb srcsetup lspdir srcdir
+	@echo 45 Makefile.linux called
+	@echo 46 Environment : ${ENV} 
+	@echo 47 finished system build on `date` | tee >lastBuildDate
+
+<<rootdirs>>
+<<noweb>>
+<<literate commands>>
+<<srcsetup>>
+<<src>>
+<<lsp>>
+<<document>>
+<<clean>>
+
+@
 \subsection{Makefile.redhat72}
 <<Makefile.redhat72>>=
 # System dependent Makefile for the Intel/Linux platform
@@ -2007,6 +2068,81 @@ all: rootdirs noweb srcsetup lspdir srcdir
 <<clean>>
 
 @
+\subsection{Makefile.fedora10}
+On Fedora Core 10 we cannot use the line
+\begin{verbatim}
+  ${XLIB}/libXpm.a
+\end{verbatim}
+to link to the Xpm libraries. Instead We need to use
+\begin{verbatim}
+  -l Xpm
+\end{verbatim}
+These are added onto the end of the LDF variable.
+
+Annoyingly enough it seems that GCL uses a default extension of .lsp
+rather than .lisp so we add the [[LISP]] variable here. We need to
+depend on the default extension behavior because the system build
+will load either the interpreted or compiled form of a file depending
+on which is available. This varies at different stages of the build.
+
+It turns out that the standard GCL OPTS does not compile with the
+GCL 2.6.8pre version. We changed it from 
+\begin{verbatim}
+@<<GCLOPTS>>
+\end{verbatim}
+to read
+\begin{verbatim}
+@<<GCLOPTS-LOCBFD>>
+\end{verbatim}
+
+GCL-2.6.8pre2 will not build successfully on fedora core 10
+so we need to downgrade the GCLVERSION.
+<<Makefile.fedora10>>=
+#GCLVERSION=gcl-2.6.8pre
+# System dependent Makefile for the Intel/Linux platform
+# Platform variable
+PLF=LINUXplatform
+# C compiler flags
+CCF="-O2 -fno-strength-reduce -Wall -D_GNU_SOURCE -D${PLF} -I/usr/X11/include"
+# Loader flags
+LDF=" -L/usr/X11R6/lib -l Xpm "
+# C compiler to use
+CC=gcc 
+AWK=gawk
+RANLIB=ranlib
+TOUCH=touch
+TAR=tar
+AXIOMXLROOT=${AXIOM}/compiler
+O=o
+BYE=bye
+LISP=lsp
+DAASE=${SRC}/share
+# where the libXpm.a library lives
+XLIB=/usr/X11R6/lib
+<<GCLOPTS-LOCBFD>>
+<<SRCDIRS>>
+PATCH=patch
+
+ENV=PLF=${PLF} CCF=${CCF} LDF=${LDF} CC=${CC} AWK=${AWK} RANLIB=${RANLIB} \
+    TOUCH=${TOUCH} TAR=${TAR} AXIOMXLROOT=${AXIOMXLROOT} O=${O} BYE=${BYE} \
+    LISP=${LISP} DAASE=${DAASE} XLIB=${XLIB} GCLOPTS=${GCLOPTS} \
+    SRCDIRS=${SRCDIRS} PATCH=${PATCH}
+
+all: rootdirs noweb srcsetup lspdir srcdir
+	@echo 45 Makefile.linux called
+	@echo 46 Environment : ${ENV} 
+	@echo 47 finished system build on `date` | tee >lastBuildDate
+
+<<rootdirs>>
+<<noweb>>
+<<literate commands>>
+<<srcsetup>>
+<<src>>
+<<lsp>>
+<<document>>
+<<clean>>
+
+@
 \subsection{Makefile.gentoo}
 Annoyingly enough it seems that GCL uses a default extension of .lsp
 rather than .lisp so we add the [[LISP]] variable here. We need to
diff --git a/src/axiom-website/download.html b/src/axiom-website/download.html
index 875d2d3..c6e881a 100644
--- a/src/axiom-website/download.html
+++ b/src/axiom-website/download.html
@@ -126,11 +126,11 @@
        SYSNAME&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
        Nov 2007
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
        Jan 2008
@@ -161,6 +161,11 @@
        Nov 2008
       </font>
      </td>
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+       Jan 2009
+      </font>
+     </td>
     </tr>
 
     <tr>
@@ -169,10 +174,10 @@
        debian
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       <a href="downloads/silver-jan2008-src.tgz">src</a>
@@ -207,6 +212,12 @@
       <a href="downloads/axiom-debian-nov2008-bin.tgz">bin</a>
       </font>
      </td>
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      <a href="downloads/axiom-jan2009-src.tgz">src</a>
+      <a href="downloads/axiom-debian-jan2009-bin.tgz">bin</a>
+      </font>
+     </td>
     </tr>
 
     <tr>
@@ -215,10 +226,10 @@
        Doyen
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       <a href="downloads/silver-jan2008-src.tgz">src</a>
@@ -258,10 +269,10 @@
        Doyen Thumbdrive
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
@@ -295,12 +306,12 @@
        fedora5
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       <a href="downloads/silver-nov2007-src.tgz">src</a>
       <a href="downloads/silver-fedora5-nov182007-bin.tgz">bin</a>
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       <a href="downloads/silver-jan2008-src.tgz">src</a>
@@ -345,12 +356,12 @@
        fedora6
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       <a href="downloads/silver-nov2007-src.tgz">src</a>
       <a href="downloads/silver-fedora6-nov182007-bin.tgz">bin</a>
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       <a href="downloads/silver-jan2008-src.tgz">src</a>
@@ -387,6 +398,12 @@
       <a href="downloads/axiom-fedora6-nov2008-bin.tgz">bin</a>
       </font>
      </td>
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      <a href="downloads/axiom-jan2009-src.tgz">src</a>
+      <a href="downloads/axiom-fedora6-jan2009-bin.tgz">bin</a>
+      </font>
+     </td>
     </tr>
 
     <tr>
@@ -395,10 +412,10 @@
        fedora7
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       <a href="downloads/silver-jan2008-src.tgz">src</a>
@@ -435,6 +452,12 @@
       <a href="downloads/axiom-fedora7-nov2008-bin.tgz">bin</a>
       </font>
      </td>
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      <a href="downloads/axiom-jan2009-src.tgz">src</a>
+      <a href="downloads/axiom-fedora7-jan2009-bin.tgz">bin</a>
+      </font>
+     </td>
     </tr>
 
     <tr>
@@ -443,12 +466,12 @@
        fedora8
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       <a href="downloads/silver-nov2007-src.tgz">src</a>
       <a href="downloads/silver-fedora8-nov182007-bin.tgz">bin</a>
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       <a href="downloads/silver-jan2008-src.tgz">src</a>
@@ -485,6 +508,12 @@
       <a href="downloads/axiom-fedora8-nov2008-bin.tgz">bin</a>
       </font>
      </td>
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      <a href="downloads/axiom-jan2009-src.tgz">src</a>
+      <a href="downloads/axiom-fedora8-jan2009-bin.tgz">bin</a>
+      </font>
+     </td>
     </tr>
 
     <tr>
@@ -493,10 +522,10 @@
        fedora8-64
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
@@ -534,10 +563,10 @@
        fedora9
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
@@ -570,20 +599,69 @@
       <a href="downloads/axiom-fedora9-nov2008-bin.tgz">bin</a>
       </font>
      </td>
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      <a href="downloads/axiom-jan2009-src.tgz">src</a>
+      <a href="downloads/axiom-fedora9-jan2009-bin.tgz">bin</a>
+      </font>
+     </td>
     </tr>
 
+
     <tr>
      <td align="left">
       <font face="Helvetica, Arial, sans-serif" size="+1">
-       macosxppc
+       fedora10
       </font>
      </td>
+     <!--td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      </font>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
      </td>
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
+      </font>
+     </td>
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      </font>
+     </td>
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      </font>
+     </td>
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      </font>
+     </td>
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      </font>
+     </td>
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      <a href="downloads/axiom-jan2009-src.tgz">src</a>
+      <a href="downloads/axiom-fedora10-jan2009-bin.tgz">bin</a>
+      </font>
+     </td>
+    </tr>
+
+    <tr>
+     <td align="left">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+       macosxppc
+      </font>
+     </td>
+     <!--td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      </font>
+     </td-->
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
       <a href="downloads/silver-jan2008-src.tgz">src</a>
       <a href="downloads/silver-macosxppc-jan2008-bin.tgz">bin</a>
       </font>
@@ -618,10 +696,10 @@
        opensuse
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       <a href="downloads/silver-jan2008-src.tgz">src</a>
@@ -657,6 +735,12 @@
       <a href="downloads/axiom-nov2008-src.tgz">src</a>
       </font>
      </td>
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      <a href="downloads/axiom-jan2009-src.tgz">src</a>
+      <a href="downloads/axiom-opensuse-jan2009-bin.tgz">bin</a>
+      </font>
+     </td>
     </tr>
 
     <tr>
@@ -665,10 +749,10 @@
        redhat72
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       <a href="downloads/silver-jan2008-src.tgz">src</a>
@@ -713,10 +797,10 @@
        redhat9
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       <a href="downloads/silver-jan2008-src.tgz">src</a>
@@ -753,6 +837,12 @@
       <a href="downloads/axiom-redhat9-nov2008-bin.tgz">bin</a>
       </font>
      </td>
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      <a href="downloads/axiom-jan2009-src.tgz">src</a>
+      <a href="downloads/axiom-redhat9-jan2009-bin.tgz">bin</a>
+      </font>
+     </td>
     </tr>
 
     <tr>
@@ -761,10 +851,10 @@
        ubuntu
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       <a href="downloads/silver-jan2008-src.tgz">src</a>
@@ -801,6 +891,12 @@
       <a href="downloads/axiom-ubuntu-nov2008-bin.tgz">bin</a>
       </font>
      </td>
+     <td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      <a href="downloads/axiom-jan2009-src.tgz">src</a>
+      <a href="downloads/axiom-ubuntu-jan2009-bin.tgz">bin</a>
+      </font>
+     </td>
     </tr>
 
     <tr>
@@ -809,10 +905,10 @@
        ubuntu64
       </font>
      </td>
-     <td align="center">
+     <!--td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
-     </td>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
@@ -847,6 +943,10 @@
        vector
       </font>
      </td>
+     <!--td align="center">
+      <font face="Helvetica, Arial, sans-serif" size="+1">
+      </font>
+     </td-->
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
       </font>
@@ -869,15 +969,16 @@
      </td>
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
+      <a href="downloads/axiom-vector-nov2008-bin.tgz">bin</a>
       </font>
      </td>
      <td align="center">
       <font face="Helvetica, Arial, sans-serif" size="+1">
-      <a href="downloads/axiom-vector-nov2008-bin.tgz">bin</a>
+      <a href="downloads/axiom-jan2009-src.tgz">src</a>
+      <a href="downloads/axiom-vector-jan2009-bin.tgz">bin</a>
       </font>
      </td>
     </tr>
-
    </tbody>
   </table>
 
@@ -1036,7 +1137,7 @@ apt-get install libxaw7-dev libxdmcp-dev libxext-dev libxmu-dev libxmu-headers
 apt-get install libxpm-dev libxt-dev po-debconf x-dev x11proto-core-dev
 apt-get install x11proto-input-dev x11proto-kb-dev x11proto-xext-dev
 apt-get install xtrans-dev libncurses5-dev libreadline5-dev libsm-dev
-apt-get install libstdc++6-4.1-dev libx11-dev gawk
+apt-get install libstdc++6-4.1-dev libx11-dev gawk texlive-pstricks
 cvs -z3 -d:pserver:anonymous@axiom.cvs.sourceforge.net:/cvsroot/axiom co -P axiom
 cd axiom
 export AXIOM=`pwd`/mnt/debian
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 59cee41..faf325e 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -901,5 +901,7 @@ January 2009 release<br/>
 <a name="latest"/>
 In process, not yet released<br/><br/>
   <hr>
+<a href="patches/20090124.01.tpd.patch">20090124.01.tpd.patch</a>
+download.html update binary download page<br/>
  </body>
 </html>

\start
Date: Sun, 25 Jan 2009 05:26:10 -0600
From: Tim Daly
To: list
Subject: git in Axiom source download

The Axiom source downloads from
  http://axiom-developer.org/axiom-website/downloads/axiom-jan2009-src.tgz
contain not only the sources but a complete git tree. Thus, you can keep up 
to date with the silver development (experimental, pre-release) by doing 
the following:

(get the sources and git tree)
wget http://axiom-developer.org/axiom-website/downloads/axiom-jan2009-src.tgz

(unpack the sources)
tar -zxf axiom-jan2009-src.tgz

(go to the top of Axiom)
cd axiom

(tell git to fetch and merge the latest commit changes)
git pull (the magic word is linus)

Any time a patch is announced you can bring your copy up to date with a
git pull.

In general, I try not to "break the build" so every posted patch is 
compiled from scratch and all tests are run before posting. However,
given that I do this work into the wee hours of the morning I make no
guarantees.

If you fix anything, such as a change to the file src/place/foo.file
you would do:

(make sure you are at the top of axiom)
  cd axiom

(tell git what changed, could be multiple adds)
  git add src/place/foo.file

(tell git to commit the changes)
  git commit -m"fixed foo"

(tell git to make a diff -Naur patch file)
  git diff HEAD^ HEAD >foo.patch

(post it to the list and copy me)
  mail -s "foo fix" -c Tim Daly list <foo.patch


\start
Date: Mon, 26 Jan 2009 20:25:22 -0600
From: Tim Daly
To: list
Subject: 20090125.01.tpd.patch (bookvol10.4 add packages)

Work begins on the next Axiom book, volume 10.4 Packages.

The patch is too large to post. See
http://axiom-developer.org/axiom-website/patches.html#latest

\start
Date: Mon, 26 Jan 2009 20:26:49 -0600
From: Tim Daly
To: list
Subject: 20090126.01.tpd.patch (download.html add binaries)

Binaries for almost all supported systems are now online. See:
  http://axiom-developer.org/axiom-website/download.html

\start
Date: Tue, 27 Jan 2009 05:35:49 -0600
From: Tim Daly
To: list
Subject: 20090126.02.tpd.patch (bookvol10.4 add packages)

More packages were moved from src/algebra into bookvol10.4

The patch is too large to post. See
http://axiom-developer.org/axiom-website/patches.html#latest

\start
Date: Wed, 28 Jan 2009 05:31:24 -0600
From: Tim Daly
To: list
Subject: 20090127.01.tpd.patch (bookvol10.4 add packages)

More packages were removed from src/algebra and moved to book volume 10.4
Axiom Packages.

The patch is too large to post. See
http://axiom-developer.org/axiom-website/patches.html#latest

\start
Date: Thu, 29 Jan 2009 05:34:37 -0600
From: Tim Daly
To: list
Subject: 20090128.01.tpd.patch (bookvol10.4 add packages)

More packages were moved from src/algebra to bookvol10.4

The patch is too large to post. See
http://axiom-developer.org/axiom-website/patches.html#latest

\start
Date: Thu, 29 Jan 2009 18:59:17 +0100 (CET)
From: Helmut Jarausch
To: list
Subject: fricas-1.0.5 fails to build on (my) Gentoo system

Hi,
trying to build fricas-1.0.5 on my Gentoo system,
I get - after some while -
Entering directory `/Obj/OBJ/Math/fricas-1.0.5/src/paste'
for A in ALIST.pht ....

cp: cannot stat `./ALIST.pht': No such file or directory

Here my configure :
CFLAGS='-O3 -march=native' ./configure --prefix=/usr/local \
  --with-lisp=/usr/bin/sbcl --with-lisp-flavor=sbcl 

\start
Date: Thu, 29 Jan 2009 19:44:14 +0100 (CET)
From: Waldek Hebisch
To: list
Subject: Re: fricas-1.0.5 fails to build on (my) Gentoo system

Helmut Jarausch wrote:
> Hi,
> trying to build fricas-1.0.5 on my Gentoo system,

Note that FriCAS and Axiom are separate projects.  For
FriCAS specific topics plase use FriCAS mailing list:

http://groups.google.com/group/fricas-devel?hl=en

I write more in private mail.

\start
Date: Fri, 30 Jan 2009 04:20:57 -0600
From: Tim Daly
To: list
Subject: 20090129.01.mxr.patch (i-funsel.boot document mmCost)

Martin Rubey has posted further documentation on mmCost.
This has been added to the sources.
=======================================================================
diff --git a/changelog b/changelog
index 69b9825..e960397 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20090129 tpd src/axiom-website/patches.html 20090129.01.mxr.patch
+20090129 mxr src/interp/i-funsel.boot document mmCost
 20090128 tpd src/axiom-website/patches.html 20090128.01.tpd.patch
 20090128 tpd src/algebra/Makefile remove spad files
 20090128 tpd src/algebra/funcpkgs.spad removed
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 94f28f0..2897cdd 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -913,5 +913,7 @@ bookvol10.4 add packages<br/>
 bookvol10.4 add packages<br/>
 <a href="patches/20090128.01.tpd.patch">20090128.01.tpd.patch</a>
 bookvol10.4 add packages<br/>
+<a href="patches/20090129.01.mxr.patch">20090129.01.mxr.patch</a>
+i-funsel.boot document mmCost<br/>
  </body>
 </html>
diff --git a/src/interp/i-funsel.boot.pamphlet b/src/interp/i-funsel.boot.pamphlet
index e06d684..b388591 100644
--- a/src/interp/i-funsel.boot.pamphlet
+++ b/src/interp/i-funsel.boot.pamphlet
@@ -631,6 +631,31 @@ getLocalMms(name,types,tar) ==
     mmS := [mm,:mmS]
   nreverse mmS
 
+@
+mmCost assigns a penalty to each signature according to the following
+formula:
+\begin{verbatim}
+  10000*n + 1000*domainDepth(res) + hitListOfTargets(res)
+\end{verbatim}
+where:
+\begin{itemize}
+\item {\bf n} is a penalty taking into account the number of coercions
+necessary to coerce the types of the given arguments to those of the
+signature under consideration.
+\item {\bf res} is the codomain of the signature
+\item {\bf hitListOfTarget} assigns a penalty between 1 and 1600 using
+a short list of constructors: Polynomial (300), List (400), 500 is the
+default, UniversalSegment (501), RationalFunction (900), Matrix (910),
+Union (999), Expression (1600). Note that RationalFunction is actually
+not a domain, so it should never happen.
+\item {\bf domainDepth} calculates the maximal depth of the type
+\item {\bf finally} the preference order of PI, NNI, and DFLOAT as
+targets is done at the very end.
+\end{itemize}
+In particular, note that if we have two signatures taking types A and B,
+and the given argument does not match exactly but has to be coerced, then
+the types A and B themselves are not sorted by preference. 
+<<*>>=
 mmCost(name, sig,cond,tar,args1,args2) ==
   cost := mmCost0(name, sig,cond,tar,args1,args2)
   res := CADR sig

\start
Date: Sat, 31 Jan 2009 11:36:34 -0600
From: Tim Daly
To: list
Subject: 20090130.01.tpd.patch (help documentation fixes and packages)

As part of the literate rewirte all Category, Domains, and Packages
are intended to have corresponding help, regression tests, and 
display-operation example documentation.

New help documentation was added for EuclideanGroebnerBasisPackage
A corresponding regression file was added.
The 
  )d op euclideanGroebner
now shows examples as part of the command output.

The help documentation mechanism has been rearranged.
Details are in Book Volume 4: Developers Guide

Essentially, the list of help files is now automatically added to
the help page at build time.

New packages were added to Book Volume 10.4: Packages

The patch is too large to post. See
http://axiom-developer.org/axiom-website/patches.html#latest

Tim



