Some doc fixes, see attachment.
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/fricas-devel.
For more options, visit https://groups.google.com/d/optout.
diff --git a/INSTALL.aldor b/INSTALL.aldor
index 46ea8ca6..33f57b91 100644
--- a/INSTALL.aldor
+++ b/INSTALL.aldor
@@ -28,7 +28,7 @@ Suggestion for building the aldor interface:
make
3. If "make" finished successfully then type "make install". Then
- FriCAS and the interface is installed.
+ FriCAS and the Aldor interface is installed.
If something does not work, ask at [email protected].
diff --git a/src/algebra/complet.spad b/src/algebra/complet.spad
index 671d773c..1fbe04dd 100644
--- a/src/algebra/complet.spad
+++ b/src/algebra/complet.spad
@@ -1,5 +1,5 @@
)abbrev domain ORDCOMP OrderedCompletion
-++ Completion with + and - infinity
+++ Completion with +infinity and -infinity.
++ Author: Manuel Bronstein
++ Description: Adjunction of two real infinites quantities to a set.
++ Date Created: 4 Oct 1989
@@ -7,8 +7,10 @@ OrderedCompletion(R : SetCategory) : Exports == Implementation where
B ==> Boolean
Exports ==> Join(SetCategory, FullyRetractableTo R) with
- plusInfinity : () -> % ++ plusInfinity() returns +infinity.
- minusInfinity : () -> % ++ minusInfinity() returns -infinity.
+ plusInfinity : () -> %
+ ++ plusInfinity() returns +infinity.
+ minusInfinity : () -> %
+ ++ minusInfinity() returns -infinity.
finite? : % -> B
++ finite?(x) tests if x is finite.
infinite? : % -> B
diff --git a/src/algebra/computation.spad b/src/algebra/computation.spad
index 66c930be..a3b82033 100644
--- a/src/algebra/computation.spad
+++ b/src/algebra/computation.spad
@@ -452,8 +452,6 @@ VarCat() : Category == Join(Type, CoercibleTo(OutputForm)) with
"=":(x:%, y:%) -> Boolean
++ return true if equal, that is names are equal and if there is
++ a type then they must also be equal
- coerce : (n : %) -> OutputForm
- ++ output
)if false
@@ -955,8 +953,6 @@ Lambda(UT) : Exports == Implementation where
++ notation assumes association to the left, in the absence of
++ brackets, the term to the left binds more tightly than the
++ one on the right.
- coerce : (n : %) -> OutputForm
- ++ output
Implementation == add
@@ -1699,8 +1695,6 @@ SKICombinators(UT) : Exports == Implementation where
++ same effect
toString : (n : %) -> String
++ output
- coerce : (n : %) -> OutputForm
- ++ output
Implementation == add
diff --git a/src/algebra/ffpoly.spad b/src/algebra/ffpoly.spad
index 13e27269..71cc80d1 100644
--- a/src/algebra/ffpoly.spad
+++ b/src/algebra/ffpoly.spad
@@ -13,7 +13,7 @@
++ [LN] Lidl, R. & Niederreiter, H., "Finite Fields",
++ Encycl. of Math. 20, Addison-Wesley, 1983
++ J. Grabmeier, A. Scheerhorn: Finite Fields in Axiom.
-++ Axiom Technical Report Series, to appear.
+++ Axiom Technical Report Series, ATR/5 NP2522.
++ Description:
++ This package provides a number of functions for generating, counting
++ and testing irreducible, normal, primitive, random polynomials
@@ -983,7 +983,8 @@ FiniteFieldPolynomialPackage GF : Exports == Implementation where
++ References:
++ R.Lidl, H.Niederreiter: Finite Field, Encycoldia of Mathematics and
++ Its Applications, Vol. 20, Cambridge Univ. Press, 1983, ISBN 0 521 30240 4
-++ AXIOM Technical Report Series, to appear.
+++ J. Grabmeier, A. Scheerhorn: Finite Fields in Axiom.
+++ Axiom Technical Report Series, ATR/5 NP2522.
++ Description:
++ FiniteFieldPolynomialPackage2(F, GF) exports some functions concerning
++ finite fields, which depend on a finite field {\em GF} and an
diff --git a/src/algebra/indexedp.spad b/src/algebra/indexedp.spad
index 4abaf80e..f80272f0 100644
--- a/src/algebra/indexedp.spad
+++ b/src/algebra/indexedp.spad
@@ -71,7 +71,7 @@ IndexedDirectProductCategory(A : SetCategory, S : Comparable
++ assumend to contain no zero elements.
++ Caution: No checking is performed, so this should only be
++ used in cases where those conditions are assured. If in
- ++ doubt use construct
+ ++ doubt use \spad{construct}.
leadingTerm : % -> Term
++ \spad{leadingTerm(x)} returns the leading
++ (with respect to the ordering on the indexing set) term of z.
diff --git a/src/algebra/logic.spad b/src/algebra/logic.spad
index 2fbc467c..fc98cdd5 100644
--- a/src/algebra/logic.spad
+++ b/src/algebra/logic.spad
@@ -111,7 +111,7 @@ BiCPO & Lattice
Before the code for posets here are some utilities that they use.
ListPackage code is written by Franz Lehner but these notes are written by
-me (Martin Baker) so apologies if if have misinterpreted anything.
+me (Martin Baker) so apologies if I have misinterpreted anything.
ListPackage does topological sort/splitting of lists. Should this code
belong with other list code or should it be defined in terms of graphs?
@@ -317,8 +317,6 @@ IncidenceAlgebra(R : Ring, S : SetCategory): Decl == Impl where
apply : (%, S, S) -> R
++ \spad{A(s, t)} returns $A_{i, j}$, where $i$, $j$ are the positions
++ of $s$ and $t$ in the index list.
- -- output
- coerce : % -> OutputForm
-- manipulations
_* : (Permutation Integer, %) -> %
++ \spad{\pi * A} permutes the indices and the matrix according to the
@@ -2692,8 +2690,6 @@ ILogic() : Exports == Implementation where
toStringUnwrapped : (n : %) -> String
++ similar to 'toString' but does not put outer compound terms
++ in brackets
- coerce : (n : %) -> OutputForm
- ++ output
Implementation == add
@@ -3446,8 +3442,6 @@ LatticeMeetOfJoins() : Exports == Implementation where
toStringUnwrapped : (n : %) -> String
++ similar to 'toString' but does not put outer compound terms
++ in brackets
- coerce : (n : %) -> OutputForm
- ++ output
Implementation == add
@@ -3806,8 +3800,6 @@ LatticeJoinOfMeets() : Exports == Implementation where
toStringUnwrapped : (n : %) -> String
++ similar to 'toString' but does not put outer compound terms
++ in brackets
- coerce : (n : %) -> OutputForm
- ++ output
coerce : (n : %) -> LatticeMeetOfJoins
++ convert lattice from join-of-meets to meet-of-joins
coerce : (n : LatticeMeetOfJoins) -> %
diff --git a/src/algebra/manip.spad b/src/algebra/manip.spad
index de418235..fff77041 100644
--- a/src/algebra/manip.spad
+++ b/src/algebra/manip.spad
@@ -468,7 +468,7 @@ TranscendentalManipulations(R, F) : Exports == Implementation where
Exports ==> with
expand : F -> F
++ expand(f) performs the following expansions on f: \begin{items}
- ++ \item 1. logs of products are expanded into sums of logs,
+ ++ \item 1. logs of products are expanded into sums of logs.
++ \item 2. trigonometric and hyperbolic trigonometric functions
++ of sums are expanded into sums of products of trigonometric
++ and hyperbolic trigonometric functions.
@@ -506,7 +506,7 @@ TranscendentalManipulations(R, F) : Exports == Implementation where
expandLog : F -> F
++ expandLog(f) converts every \spad{log(a/b)} appearing in f into
++ \spad{log(a) - log(b)}, and every \spad{log(a*b)} into
- ++ \spad{log(a) + log(b)}..
+ ++ \spad{log(a) + log(b)}.
cos2sec : F -> F
++ cos2sec(f) converts every \spad{cos(u)} appearing in f into
++ \spad{1/sec(u)}.
diff --git a/src/algebra/nregset.spad b/src/algebra/nregset.spad
index 65e6624b..4f59e49a 100644
--- a/src/algebra/nregset.spad
+++ b/src/algebra/nregset.spad
@@ -19,7 +19,7 @@
++ [1] D. LAZARD "A new method for solving algebraic systems of
++ positive dimension" Discr. App. Math. 33:147-160,1991
++ [2] P. AUBRY, D. LAZARD and M. MORENO MAZA "On the Theories
-++ of Triangular Sets" Journal of Symbol. Comp. (to appear)
+++ of Triangular Sets" Journal of Symbol. Comp. 28:105-124, 1999.
++ [3] M. MORENO MAZA and R. RIOBOO "Computations of gcd over
++ algebraic towers of simple extensions" In proceedings of AAECC11
++ Paris, 1995.
diff --git a/src/algebra/pf.spad b/src/algebra/pf.spad
index 11f1e242..ef7197ce 100644
--- a/src/algebra/pf.spad
+++ b/src/algebra/pf.spad
@@ -1,6 +1,4 @@
)abbrev domain IPF InnerPrimeField
--- Argument MUST be a prime.
--- This domain does not check, PrimeField does.
++ Authors: N.N., J.Grabmeier, A.Scheerhorn
++ Date Created: ?, November 1990, 26.03.1991
++ Basic Operations:
@@ -11,7 +9,8 @@
++ References:
++ R.Lidl, H.Niederreiter: Finite Field, Encycoldia of Mathematics and
++ Its Applications, Vol. 20, Cambridge Univ. Press, 1983, ISBN 0 521 30240 4
-++ AXIOM Technical Report Series, to appear.
+++ J. Grabmeier, A. Scheerhorn: Finite Fields in Axiom.
+++ Axiom Technical Report Series, ATR/5 NP2522.
++ Description:
++ InnerPrimeField(p) implements the field with p elements.
++ Note: argument p MUST be a prime (this domain does not check).
diff --git a/src/algebra/poly.spad b/src/algebra/poly.spad
index da0bc584..4bd775c6 100644
--- a/src/algebra/poly.spad
+++ b/src/algebra/poly.spad
@@ -660,7 +660,7 @@ SparseUnivariatePolynomial(R : Join(SemiRng, AbelianMonoid)
outputForm : (%, OutputForm) -> OutputForm
++ outputForm(p, var) converts the SparseUnivariatePolynomial p to
++ an output form (see \spadtype{OutputForm}) printed as a polynomial in the
- ++ output form variable.
+ ++ output form \spad{var}.
== PolynomialRing(R, NonNegativeInteger)
add
--representations
diff --git a/src/algebra/regset.spad b/src/algebra/regset.spad
index 555fa66d..ea753cdd 100644
--- a/src/algebra/regset.spad
+++ b/src/algebra/regset.spad
@@ -51,7 +51,7 @@
++ [2] M. KALKBRENER "Algorithmic properties of polynomial rings"
++ Journal of Symbol. Comp. 1998
++ [3] P. AUBRY, D. LAZARD and M. MORENO MAZA "On the Theories
-++ of Triangular Sets" Journal of Symbol. Comp. (to appear)
+++ of Triangular Sets" Journal of Symbol. Comp. 28:105-124, 1999.
++ [4] M. MORENO MAZA "A new algorithm for computing triangular
++ decomposition of algebraic varieties" NAG Tech. Rep. 4/98.
++ Version: 2
diff --git a/src/algebra/triset.spad b/src/algebra/triset.spad
index af346ada..93ec6c0f 100644
--- a/src/algebra/triset.spad
+++ b/src/algebra/triset.spad
@@ -25,7 +25,7 @@
++ if it is reduced w.r.t. every polynomial of \spad{T}. \newline
++ References:
++ [1] P. AUBRY, D. LAZARD and M. MORENO MAZA "On the Theories
-++ of Triangular Sets" Journal of Symbol. Comp. (to appear)
+++ of Triangular Sets" Journal of Symbol. Comp. 28:105-124, 1999.
++ Version: 4.
TriangularSetCategory(R : IntegralDomain, E : OrderedAbelianMonoidSup, _
@@ -489,7 +489,7 @@ TriangularSetCategory(R : IntegralDomain, E : OrderedAbelianMonoidSup, _
++ are displayed in reverse order.\newline
++ References:
++ [1] P. AUBRY, D. LAZARD and M. MORENO MAZA "On the Theories
-++ of Triangular Sets" Journal of Symbol. Comp. (to appear)
+++ of Triangular Sets" Journal of Symbol. Comp. 28:105-124, 1999.
++ Version: 1
GeneralTriangularSet(R, E, V, P) : Exports == Implementation where
