passagemath-fricas 10.5.40__cp39-cp39-macosx_14_0_arm64.whl → 10.5.41__cp39-cp39-macosx_14_0_arm64.whl

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/gbintern.spad

@@ -4,8 +4,8 @@
 ++ References:
 ++   R. Gebauer, M. Moeller,  On an Installation of Buchberger's Algorithm,
 ++   JSC (1988) 6, 275-286.
-++ Description
-++ This package provides low level tools for Groebner basis computations
+++ Description:
+++ This package provides low level tools for Groebner basis computations.
 GroebnerInternalPackage(Dom, Expon, Dpol) : T == C where
  Dom :   GcdDomain
  Expon : OrderedAbelianMonoidSup
@@ -200,7 +200,7 @@ GroebnerInternalPackage(Dom, Expon, Dpol) : T == C where
 
              -----------------------------
 
-             --- erase elements in D fullfilling crit B
+             --- erase elements in D fulfilling crit B
 
    critBonD(h : Dpol, D : List(critPair))==
        d := degree(h)

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/geneez.spad

@@ -1,11 +1,10 @@
 )abbrev package GENEEZ GenExEuclid
 ++ Author : P.Gianni.
-++ January 1990
-++ The equation \spad{Af+Bg=h} and its generalization to n polynomials
-++ is solved for solutions over the R, euclidean domain.
+++ Description: The equation \spad{Af+Bg=h} and its generalization to n
+++ polynomials is solved for solutions over the R, euclidean domain.
 ++ A table containing the solutions of \spad{Af+Bg=x^k} is used.
-++ The operations are performed modulus a prime which are in principle big enough,
-++ but the solutions are tested and, in case of failure, a hensel
+++ The operations are performed modulus a prime which are in principle big
+++ enough, but the solutions are tested and, in case of failure, a hensel
 ++ lifting process is used to get to the right solutions.
 ++ It will be used in the factorization of multivariate polynomials
 ++ over finite field, with \spad{R=F[x]}.

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/genser.spad

@@ -1,5 +1,7 @@
 )abbrev package EFGUSER ElementaryFunctionsGeneralizedUnivariatePowerSeries
 ++ Author: Waldek Hebisch
+++ Description: This package implements elementary functions on general
+++  univariate power series.
 ElementaryFunctionsGeneralizedUnivariatePowerSeries(
     Coef : Algebra Fraction Integer,
      Expon : OrderedAbelianMonoid,
@@ -191,6 +193,8 @@ ElementaryFunctionsGeneralizedUnivariatePowerSeries(
 
 )abbrev domain GENUSER GeneralizedUnivariatePowerSeries
 ++ Author: Waldek Hebisch
+++ Description: Domain for univariate power series with variable
+++  coefficients.
 GeneralizedUnivariatePowerSeries(Coef : Ring,
      Expon : Join(OrderedAbelianMonoid, SemiRing),
      var : Symbol, cen : Coef) : Exports == Implementation where

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/ghensel.spad

@@ -1,7 +1,9 @@
 )abbrev package GHENSEL GeneralHenselPackage
 ++ Author : P.Gianni
 ++ General Hensel Lifting
-++ Used for Factorization of bivariate polynomials over a finite field.
+++ Description: This package is used for factorization of bivariate
+++ polynomials over a finite field and univariate polynomials with
+++ integer coefficients.
 GeneralHenselPackage(RP, TP) : C == T where
    RP :   EuclideanDomain
    TP :   UnivariatePolynomialCategory RP

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/gpgcd.spad

@@ -73,7 +73,7 @@ GeneralPolynomialGcdPackage(E, OV, R, P) : C == T where
         (empty?(v1) or not (p1 exquo g) case "failed") and
                      -- if #vi = 0 then pp1 = p1, so we know g divides
               (empty?(v2) or not (p2 exquo g) case "failed")
-            => g*cg  -- divdes them both, so is the gcd
+            => g*cg  -- divides them both, so is the gcd
         -- OK, so it's not the gcd: try again
         v := variables g -- there can be at most these variables in answer
         v1 := setDifference(vp1, v)
@@ -86,7 +86,7 @@ GeneralPolynomialGcdPackage(E, OV, R, P) : C == T where
         (g = 1) => cg
         (empty?(v1) or not (p1 exquo g) case "failed") and
               (empty?(v2) or not (p2 exquo g) case "failed")
-            => g*cg  -- divdes them both, so is the gcd
+            => g*cg  -- divides them both, so is the gcd
         v := variables g -- there can be at most these variables in answer
         v1 := setDifference(vp1, v)
         if empty?(v1) then

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/gpol.spad

@@ -1,7 +1,7 @@
 )abbrev domain LAUPOL LaurentPolynomial
-++ Univariate polynomials with negative and positive exponents.
 ++ Author: Manuel Bronstein
 ++ Date Created: May 1988
+++ Description: Univariate polynomials with negative and positive exponents.
 LaurentPolynomial(R, UP) : Exports == Implementation where
   R : IntegralDomain
   UP : UnivariatePolynomialCategory R

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/gpresent.spad

@@ -281,7 +281,7 @@ generators will be renumbered before doing the product.
 
 We can generate a quotient by removing a generator (more precisely
 adding relation equating this generator to neutral element) or
-more generaly by adding a relation.
+more generally by adding a relation.
 
 A quotient is an example of a surjective mapping
 (epimorphism) on the group. It is easy to work with functions
@@ -545,7 +545,7 @@ GroupPresentation() : Exports == Impl where
        -- print("  groupPresentation construct (" << gens1 << ", "
        --       << rels1<< ")")
        g := construct(gens1)$PrimitiveArray(NNI)
-       --print("groupPresentation constuct : " << rels1)
+       --print("groupPresentation construct : " << rels1)
        -- remove empty relations since this simplifies equality function
        [g, [r for r in rels1 | not(empty?(r))]]
 
@@ -637,11 +637,11 @@ GroupPresentation() : Exports == Impl where
    -- display a relation using alphabetic digits
    outputRel(r : List(Integer)) : OutputForm ==
        eleout : OutputForm := message("")
-       seperator : OutputForm := message(" ")
+       separator : OutputForm := message(" ")
        for ele in r repeat
            newterm : OutputForm := outputGen(ele)
-           eleout := hconcat([eleout, seperator, newterm])$OutputForm
-           seperator := message("*")
+           eleout := hconcat([eleout, separator, newterm])$OutputForm
+           separator := message("*")
        eleout
 
    -- display a list of relations using alphabetic digits
@@ -1538,7 +1538,7 @@ GroupPresentation() : Exports == Impl where
 
 
 )abbrev package GROUPPF1 GroupPresentationFunctions1
-++ Description: This package implements convertion between group
+++ Description: This package implements conversion between group
 ++  presentation given in terms of elements of \spadtype{FreeGroup}
 ++  and \spadtype{GroupPresentation}.
 GroupPresentationFunctions1(S : SetCategory) : with

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/graph.spad

@@ -422,7 +422,7 @@ algorithms.
 for instance, a user could drag a vertex and its arrows would
 move with it. This type of interaction is not possible by
 writing code in SPAD.
-\iten Use node weights, in addition to arrow weights, for routing.
+\item Use node weights, in addition to arrow weights, for routing.
 \item I would also like to experiment with the connection between
 (duality?) this code and the computing framework. That is use graphs
 to implement finite-state machine, Turing machine, etc.
@@ -594,7 +594,7 @@ Or the Cartesian product:
                                                          Type : Void
 \end{verbatim}
 
-In addition to outputing to a diagram we can also output other
+In addition to outputting to a diagram we can also output other
 information about the graph in matrix form:
 
 The incidence matrix represents the graph by a matrix of size

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/groebsol.spad

@@ -1,6 +1,6 @@
 )abbrev package GROEBSOL GroebnerSolve
 ++ Author : P.Gianni, Summer '88, revised November '89
-++ Solve systems of polynomial equations using Groebner bases
+++ Description: Solve systems of polynomial equations using Groebner bases
 ++ Total order Groebner bases are computed and then converted to lex ones
 ++ This package is mostly intended for internal use.
 GroebnerSolve(lv, F, R) : C == T

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/hashstate.spad

@@ -30,14 +30,14 @@ during hashing process -- one has to be careful to avoid overflow
 and since SingleInteger may have limited number of bits mixing
 must be extra good.  Bigger state may allow much easier update.
 
-So I propose the followin protocol : we first create a fresh
-HashState.  Then we walk trough data structure updating state.
+So I propose the following protocol : we first create a fresh
+HashState.  Then we walk through data structure updating state.
 Finally we reduce state to a SingleInteger.  The implementation
 below is intended as a starting point -- I use SingleInteger
 as representation of HashState and 'combine' function is
 probably slow and it is not clear how good it mixes.  But
 if we stick to the protocol we can change representation
-later and add beter 'combine'.  Anyway, given definitions
+later and add better 'combine'.  Anyway, given definitions
 in HashState and SetCategory we can start to modify domains
 like the included example of PrimitiveArray and Integer.
 \end{verbatim}
@@ -58,7 +58,8 @@ HashState() : with
       ++ update!(hs, x) computes new values of HashState from hs
       ++ and x and might destructively operate on its first argument.
     value : % -> SingleInteger
-      ++ value(x) returns a SingleInteger value corresponding to x.
+      ++ value(x) returns a non-negative SingleInteger value
+      ++ corresponding to x.
   == add
     -- These two macros are necessary to distinguish between Rep and \%.
     rep x ==> (x@%) pretend Rep

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/html.spad

@@ -189,7 +189,7 @@ HTMLFormat() : public == private where
       ++ coerceL(o) changes o in the standard output format to html
       ++ format and displays result as one long string.
     exprex :    E -> S
-      ++ exprex(o) coverts \spadtype{OutputForm} to \spadtype{String}
+      ++ exprex(o) converts \spadtype{OutputForm} to \spadtype{String}
     display :   S -> Void
       ++ display(o) prints the string returned by coerce.
 

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/indexedp.spad

@@ -68,7 +68,7 @@ IndexedProductCategory(A : SetCategory, S : SetCategory
              ++ the object with these components.
              ++ The list is assumed to be sorted (in reverse order) with
              ++ respect to the ordering of S.  If R is a monoid, then the
-             ++ list is assumend to contain no zero elements.
+             ++ list is assumed 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 \spad{construct}.

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/intaux.spad

@@ -163,10 +163,10 @@ IntegrationResult(F : Field) : Exports == Implementation where
       int((ne.integrand)::O * hconcat ['d::O, (ne.intvar)::O])
 
 )abbrev package IR2 IntegrationResultFunctions2
-++ Internally used by the integration packages
 ++ Author: Manuel Bronstein
 ++ Date Created: 1987
 ++ Keywords: integration.
+++ Description: Internally used by the integration packages.
 IntegrationResultFunctions2(E, F) : Exports == Implementation where
   E : Field
   F : Field
@@ -225,10 +225,10 @@ IntegrationResultFunctions2(E, F) : Exports == Implementation where
       [lg.scalar, map(func, lg.coeff), map(func, lg.logand)]
 
 )abbrev package INTTOOLS IntegrationTools
-++ Tools for the integrator
 ++ Author: Manuel Bronstein
 ++ Date Created: 25 April 1990
 ++ Keywords: elementary, function, integration.
+++ Description: Tools for the integrator.
 IntegrationTools(R : Comparable, F : FunctionSpace R) : Exp == Impl where
   K   ==> Kernel F
   SY  ==> Symbol

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/intef.spad

@@ -7,7 +7,6 @@
 ++ extended integration and the risch differential equation for
 ++ elemntary functions.
 ++ Keywords: elementary, function, integration.
-++ Examples: )r INTEF INPUT
 ElementaryIntegration(R, F) : Exports == Implementation where
   R : Join(GcdDomain, Comparable, CharacteristicZero,
            PolynomialFactorizationExplicit,

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/integer.spad

@@ -135,7 +135,7 @@ Integer : Join(IntegerNumberSystem, LinearlyExplicitOver Integer,
       x + y == (x+y)$Lisp
       x - y == (x-y)$Lisp
       x * y == (x*y)$Lisp
-      (m : Integer) * (y : %) == (m*y)$Lisp -- for subsumption problem
+      -- (m : Integer) * (y : %) == (m*y)$Lisp -- for subsumption problem
       (m : PositiveInteger) * (y : %) == (m*y)$Lisp
       (m : NonNegativeInteger) * (y : %) == (m*y)$Lisp
       (x : %) ^ (n : NonNegativeInteger) == EXPT(x, n)$Lisp

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/integrat.spad

@@ -120,7 +120,6 @@ FunctionSpaceComplexIntegration(R, F) : Exports == Implementation where
 ++ Description:
 ++   \spadtype{FunctionSpaceIntegration} provides functions for the
 ++   indefinite integration of real-valued functions.
-++ Examples: )r INTEF INPUT
 FunctionSpaceIntegration(R, F) : Exports == Implementation where
   R : Join(GcdDomain, Comparable, CharacteristicZero,
            PolynomialFactorizationExplicit,

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/interval.spad

@@ -7,9 +7,8 @@
 +++ AMS Classifications:
 +++ Keywords:
 +++ References:
-+++ Description:
-+++ This category implements of interval arithmetic and transcendental
-+++ functions over intervals.
++++ Description: This category implements of interval arithmetic and
++++ transcendental functions over intervals.
 IntervalCategory(R : Join(FloatingPointSystem, TranscendentalFunctionCategory)):
  Category == Join(GcdDomain, OrderedSet, TranscendentalFunctionCategory,
                   RadicalCategory, RetractableTo(Integer), Approximate) with
@@ -189,7 +188,7 @@ Interval(R : Join(FloatingPointSystem, TranscendentalFunctionCategory)) : Interv
    qinterval(first vals, last vals)
 
 
-  unit?(u : %) : Boolean == contains?(u, 0)
+  unit?(u : %) : Boolean == not contains?(u, 0)
 
   _exquo(u:%,v:%):Union(%,"failed") ==
    contains?(v,0) => "failed"

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/intfact.spad

@@ -313,7 +313,7 @@ IntegerRoots(I : IntegerNumberSystem) : Exports == Implementation where
 ++ then tests to see if n is a perfect power before using Pollards
 ++ rho method.  Because Pollards method may fail, the result
 ++ of factor may contain composite factors.  We should also employ
-++ Lenstra's eliptic curve method.
+++ Lenstra's elliptic curve method.
 
 IntegerFactorizationPackage(I) : Exports == Implementation where
   I : IntegerNumberSystem

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/intpar.spad

@@ -648,6 +648,7 @@ ParametricTranscendentalIntegration(F, UP) : Exports == Implementation where
         nlba : List(RF)
         for j in d..0 by -1 repeat
             n1 := #cb
+            n1 = 0 => return []
             lgj : List(F) := []
             for i in 1..n repeat
                 gi := vg2(i)
@@ -767,7 +768,7 @@ RDEaux(F) : Exports == Implementation where
     SPDE1 : (UP, UP, UP -> UP) -> RSOL
       ++ SPDE1(b, c, D) solves Q' + b Q = c and returns [Q, r] where
       ++ r = c - ( Q' + b Q).  That is when r is zero then Q is
-      ++ true solution, otherwise r represets unsolved part of c.
+      ++ true solution, otherwise r represents unsolved part of c.
       ++ Moreover def(r) < deg(bQ).  Note: SPDE1 assumes that
       ++ deg(Q') < deg(bQ) for all Q.
 

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/intrf.spad

@@ -121,15 +121,15 @@ MonomialExtensionTools(F, UP) : Exports == Implementation where
   Exports ==> with
     split      : (UP, UP -> UP) -> Record(normal : UP, special : UP)
       ++ split(p, D) returns \spad{[n, s]} such that \spad{p = n s},
-      ++ all the squarefree factors of n are normal w.r.t. D,
-      ++ and s is special w.r.t. D.
+      ++ all the squarefree factors of n are normal with respect to D,
+      ++ and s is special with respect to D.
       ++ D is the derivation to use.
     splitSquarefree : (UP, UP -> UP) -> Record(normal : FR, special : FR)
       ++ splitSquarefree(p, D) returns
       ++ \spad{[n_1 n_2\^2 ... n_m\^m, s_1 s_2\^2 ... s_q\^q]} such that
       ++ \spad{p = n_1 n_2\^2 ... n_m\^m s_1 s_2\^2 ... s_q\^q}, each
-      ++ \spad{n_i} is normal w.r.t. D and each \spad{s_i} is special
-      ++ w.r.t D.
+      ++ \spad{n_i} is normal with respect to D and each \spad{s_i} is
+      ++ special with respect to D.
       ++ D is the derivation to use.
     normalDenom : (RF, UP -> UP) -> UP
       ++ normalDenom(f, D) returns the product of all the normal factors
@@ -137,8 +137,8 @@ MonomialExtensionTools(F, UP) : Exports == Implementation where
       ++ D is the derivation to use.
     decompose  : (RF, UP -> UP) -> Record(poly : UP, normal : RF, special : RF)
       ++ decompose(f, D) returns \spad{[p, n, s]} such that \spad{f = p+n+s},
-      ++ all the squarefree factors of \spad{denom(n)} are normal w.r.t. D,
-      ++ \spad{denom(s)} is special w.r.t. D,
+      ++ all the squarefree factors of \spad{denom(n)} are normal with
+      ++ respect to D, \spad{denom(s)} is special with respect to D,
       ++ and n and s are proper fractions (no pole at infinity).
       ++ D is the derivation to use.
 
@@ -190,8 +190,8 @@ ParallelIntegrationTools(R, V, P) : Exports == Implementation where
     Exports ==> with
         split      : (P, P -> P) -> Record(normal : P, special : P)
           ++ split(p, D) returns \spad{[n,s]} such that \spad{p = n s},
-          ++ all the squarefree factors of n are normal w.r.t. D,
-          ++ and s is special w.r.t. D.
+          ++ all the squarefree factors of n are normal with respect to D,
+          ++ and s is special with respect to D.
           ++ D is the derivation to use.
 
     Implementation ==> add
@@ -228,17 +228,17 @@ TranscendentalHermiteIntegration(F, UP) : Exports == Implementation where
     HermiteIntegrate : (RF, UP -> UP) -> HER
          ++ HermiteIntegrate(f, D) returns \spad{[g, h, s, p]}
          ++ such that \spad{f = Dg + h + s + p},
-         ++ h has a squarefree denominator normal w.r.t. D,
+         ++ h has a squarefree denominator normal with respect to D,
          ++ and all the squarefree factors of the denominator of s are
-         ++ special w.r.t. D. Furthermore, h and s have no polynomial parts.
-         ++ D is the derivation to use on \spadtype{UP}.
+         ++ special with respect to D.  Furthermore, h and s have no
+         ++ polynomial parts.  D is the derivation to use on \spadtype{UP}.
     HermiteIntegrate : (RF, UP -> UP, UP) -> HER
          ++ HermiteIntegrate(f, D, d0) returns \spad{[g, h, s, p]}
          ++ such that \spad{f = Dg + g*d0 + h + s + p},
-         ++ h has a squarefree denominator normal w.r.t. D,
+         ++ h has a squarefree denominator normal with respect to D,
          ++ and all the squarefree factors of the denominator of s are
-         ++ special w.r.t. D. Furthermore, h and s have no polynomial parts.
-         ++ D is the derivation to use on \spadtype{UP}.
+         ++ special with respect to D.  Furthermore, h and s have no
+         ++ polynomial parts.  D is the derivation to use on \spadtype{UP}.
 
   Implementation ==> add
     import from MonomialExtensionTools(F, UP)
@@ -342,7 +342,7 @@ TranscendentalIntegration(F, UP) : Exports == Implementation where
     monomialIntegrate : (RF, UP -> UP) -> REC
       ++ monomialIntegrate(f, ') returns \spad{[ir, s, p]} such that
       ++ \spad{f = ir' + s + p} and all the squarefree factors of the
-      ++ denominator of s are special w.r.t the derivation '.
+      ++ denominator of s are special with respect to the derivation '.
     monomialIntPoly   : (UP, UP -> UP) -> Record(answer : UP, polypart : UP)
       ++ monomialIntPoly(p, ') returns [q, r] such that
       ++ \spad{p = q' + r} and \spad{degree(r) < degree(t')}.
@@ -600,7 +600,6 @@ RationalIntegration(F, UP) : Exports == Implementation where
 ++ Description:
 ++   This package provides functions for the integration
 ++   of rational functions.
-++ Examples: )r INTRF INPUT
 RationalFunctionIntegration(F) : Exports == Implementation where
   F : Join(IntegralDomain, RetractableTo Integer, CharacteristicZero)
 

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/intspec.spad

@@ -5,7 +5,7 @@
 ++ This package provides support functions for generating elliptic
 ++ integrals.
 GenerateEllipticIntegrals(F, UP, UPUP, R) : Exports == Implementation where
-  F : Field
+  F : Join(Field, RetractableTo(Fraction(Integer)))
   UP : UnivariatePolynomialCategory(F)
   RF ==> Fraction(UP)
   UPUP : UnivariatePolynomialCategory(RF)
@@ -95,6 +95,11 @@ GenerateEllipticIntegrals(F, UP, UPUP, R) : Exports == Implementation where
 
     if F has SpecialFunctionCategory then
 
+      negative?(a : F) : Boolean ==
+          ru := retractIfCan(a)@Union(Fraction(Integer), "failed")
+          ru case "failed" => false
+          (ru@Fraction(Integer)) < 0
+
       gen_ef4l(f_var : F, f_pol : UP, cf : F, ce : F) : F ==
         A := coefficient(f_pol, 0)
         B := coefficient(f_pol, 2)/A
@@ -122,6 +127,12 @@ GenerateEllipticIntegrals(F, UP, UPUP, R) : Exports == Implementation where
 
       gen_ef3(f_var : F, f_pol : UP, cf : F, ce : F) : F ==
         A := leadingCoefficient(f_pol)
+        s : F := 1
+        if negative?(A) then
+            A := -A
+            s := -1
+            cf := -cf
+            f_pol := eval(f_pol, d_var, monomial(s, 1)$UP)
         B := coefficient(f_pol, 2)
         shift := B/((3::F)*A)
         f_pol2 := eval(f_pol, d_var, monomial(1,1)$UP - shift::UP)
@@ -129,7 +140,7 @@ GenerateEllipticIntegrals(F, UP, UPUP, R) : Exports == Implementation where
         g2 := -coefficient(f_pol2, 1)
         g3 := -coefficient(f_pol2, 0)
         ca := (2::F)/fsqrt(A)
-        p_inv := weierstrassPInverse(g2, g3, f_var+shift)
+        p_inv := weierstrassPInverse(g2, g3, s*f_var + shift)
         fi := ca*((cf - ce*shift)*p_inv - ce*weierstrassZeta(g2, g3, p_inv))
         fi
 

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/jet.spad

@@ -2543,7 +2543,7 @@ JetBundleExpression(JB : JBC) : Cat == Def where
             mainVariable(lc) case "failed" =>
                 --print("End simpSMP")$OUT
                 monomial(1, v, 1)
-            --print("End simpSMP (Rekursion)")$OUT
+            --print("End simpSMP (Recursion)")$OUT
             monomial(simpSMP lc, v, 1)
         (md := minimumDegree up) > 0 =>
             --print("  reduce degree")$OUT
@@ -4812,6 +4812,8 @@ CartanKuranishi(JB : JBC, D : JBFC) : Cat == Def where
 
       remember : Table(NREC, NNI) := dictionary()
 
+      import from List(NNI)
+
       stirling(i : NNI, k : NNI, q : NNI) : NNI ==
           -- Evaluates the symmetric polynomial of degree k in i variables
           -- for the values q+1, ..., q+i.

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/kl.spad

@@ -32,10 +32,10 @@ SortedCache(S : CachableSet) : Exports == Implementation where
       ++ enterInCache(x, f) enters x in the cache, calling \spad{f(y)} to
       ++ determine whether x is equal to y. It returns x with an integer
       ++ associated with it.
-    linearSearch : (S, S -> Boolean) -> Union(S, "failed")
-      ++ linearSearch(x, f) searches x in the cache, calling \spad{f(y)}
-      ++ to determine whether x is equal to y.  It returns y from cache
-      ++ if f(y) is true or "failed" if no such y exists.
+    linearSearch : (S -> Boolean) -> Union(S, "failed")
+      ++ linearSearch(f) searches the cache, calling \spad{f(y)} find
+      ++ desired y.  It returns y from cache if f(y) is true or "failed"
+      ++ if no such y exists.
     enterInCache : (S, (S, S) -> Integer) -> S
       ++ enterInCache(x, f) enters x in the cache, calling \spad{f(x, y)} to
       ++ determine whether \spad{x < y (f(x, y) < 0), x = y (f(x, y) = 0)}, or
@@ -100,7 +100,7 @@ SortedCache(S : CachableSet) : Exports == Implementation where
         cache_use := cache_use + 1
         void
 
-    linearSearch(x : S, equal? : S -> Boolean) ==
+    linearSearch(equal? : S -> Boolean) ==
         k : Integer := 0
         -- Can not use for loop because equal? can insert new elements
         -- and change cache_use
@@ -115,7 +115,7 @@ SortedCache(S : CachableSet) : Exports == Implementation where
         return "failed"
 
     enterInCache(x : S, equal? : S -> Boolean) ==
-        (res := linearSearch(x, equal?)) case S => res
+        (res := linearSearch(equal?)) case S => res
         setPosition(x, 1 + cache_use)
         insertAtEnd(x)
         x
@@ -327,10 +327,10 @@ Kernel(S : Comparable) : Exports == Implementation where
         (res := binarySearch(k, triage)) case % => res
         if (f0 := property(operator k, SPECIALEQUAL)) case None then
             f1 := (f0@None) pretend ((%, %) -> Boolean)
-            (res := linearSearch(k, y +-> kerEqual(k, y, f1))) case % =>
+            (res := linearSearch(y +-> kerEqual(k, y, f1))) case % =>
                 return res
         else
-            (res := linearSearch(k, y +-> kerEqual0(k, y))) case % =>
+            (res := linearSearch(y +-> kerEqual0(k, y))) case % =>
                 return res
         enterInCache(k, triage)
 

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/linpen.spad

@@ -16,7 +16,7 @@
 ++ AMS Classifications:
 ++ Keywords:
 ++ References:
-++ Description:
+++ Description: Linear matrix pencil with multivariate coefficients.
 
 LinearMultivariateMatrixPencil(R) : Exports == Implementation where
   R : Ring
@@ -50,7 +50,7 @@ LinearMultivariateMatrixPencil(R) : Exports == Implementation where
 
     equal? : (%, List(NNI), %, List(NNI)) -> Boolean
       ++ \spad{equal?(p, pos_p, q, pos_q)} checks, if the matrices
-      ++ pos_p in p are equal to the pos_q in q. Not spacified
+      ++ pos_p in p are equal to the pos_q in q. Not specified
       ++ matrices have to be zero.
 
     qequal? : (%, List(NNI), %, List(NNI), NNI) -> Boolean

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/liouv.spad

@@ -2,7 +2,6 @@
 ++ Author: Manuel Bronstein
 ++ Date Created: 1987
 ++ Keywords: liouvillian, function, primitive, exponential.
-++ Examples:  )r LF INPUT
 ++ Description:
 ++   This package provides liouvillian functions over an integral domain.
 LiouvillianFunction(R, F) : Exports == Implementation where