* algebra/newdata.spad.pamphlet (SplittingTree): Include

	ShallowlyMutableAggregate S in exports.
	* algebra/polset.spad.pamphlet (GeneralPolynomialSet): Inlcude
	ShallowlyMutableAggregate P.
	* algebra/triset.spad.pamphlet (TriangularSetCategory): Likewise.

4 files changed, 4 insertions, 9 deletions

diff --git a/src/algebra/aggcat.spad.pamphlet b/src/algebra/aggcat.spad.pamphlet
index af8b3dcb..debba8c1 100644
--- a/src/algebra/aggcat.spad.pamphlet
+++ b/src/algebra/aggcat.spad.pamphlet
@@ -1975,7 +1975,7 @@ import FiniteLinearAggregate
 ++ Description:
 ++ One-dimensional-array aggregates serves as models for one-dimensional arrays.
 ++ Categorically, these aggregates are finite linear aggregates
-++ with the \spadatt{shallowlyMutable} property, that is, any component of
+++ with the shallowly mutable property, that is, any component of
 ++ the array may be changed without affecting the
 ++ identity of the overall array.
 ++ Array data structures are typically represented by a fixed area in storage and
diff --git a/src/algebra/newdata.spad.pamphlet b/src/algebra/newdata.spad.pamphlet
index 1cc2f1e4..09484852 100644
--- a/src/algebra/newdata.spad.pamphlet
+++ b/src/algebra/newdata.spad.pamphlet
@@ -361,8 +361,7 @@ SplittingTree(V,C) : Exports == Implementation where
   S ==> SplittingNode(V,C)
   A ==> Record(root:S,subTrees:List(%))
 
-  Exports ==  Join(RecursiveAggregate S,FiniteAggregate S) with
-     shallowlyMutable
+  Exports ==  Join(RecursiveAggregate S,FiniteAggregate S,ShallowlyMutableAggregate S) with
      extractSplittingLeaf : % -> Union(%,"failed")
        ++ \axiom{extractSplittingLeaf(a)} returns the left
        ++ most leaf (as a tree) whose status is false
diff --git a/src/algebra/polset.spad.pamphlet b/src/algebra/polset.spad.pamphlet
index 74d4383c..2752335c 100644
--- a/src/algebra/polset.spad.pamphlet
+++ b/src/algebra/polset.spad.pamphlet
@@ -375,13 +375,11 @@ GeneralPolynomialSet(R,E,VarSet,P) : Exports == Implementation where
   LP ==> List P
   PtoP ==> P -> P
 
-  Exports ==  PolynomialSetCategory(R,E,VarSet,P)  with
+  Exports ==  Join(PolynomialSetCategory(R,E,VarSet,P),ShallowlyMutableAggregate P)  with
      convert : LP -> $
        ++ \axiom{convert(lp)} returns the polynomial set whose members 
        ++ are the polynomials of \axiom{lp}.
 
-     shallowlyMutable
-
   Implementation == add
 
      Rep := List P
diff --git a/src/algebra/triset.spad.pamphlet b/src/algebra/triset.spad.pamphlet
index 8f821470..a5b11680 100644
--- a/src/algebra/triset.spad.pamphlet
+++ b/src/algebra/triset.spad.pamphlet
@@ -51,9 +51,7 @@ import List
 TriangularSetCategory(R:IntegralDomain,E:OrderedAbelianMonoidSup,_
  V:OrderedSet,P:RecursivePolynomialCategory(R,E,V)): 
          Category == 
-   PolynomialSetCategory(R,E,V,P) with 
-     shallowlyMutable
-
+   Join(PolynomialSetCategory(R,E,V,P),ShallowlyMutableAggregate P) with 
      infRittWu? : ($,$) -> Boolean
          ++ \axiom{infRittWu?(ts1,ts2)} returns true iff \axiom{ts2} has higher rank
          ++ than \axiom{ts1} in Wu Wen Tsun sense.