Re: [open-axiom-devel] [Axiom-mail] A little print problem

[Ralf Hemmecke]

Ooops. Anybody else experiencing this?
Clearly, I gave wrong input first, but the error message is frightening.

(I am not sure which revision I used when I built OA.)

Ralf

GCL (GNU Common Lisp)  2.6.8 CLtL1    Aug 23 2007 17:30:07
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License:  GPL due to GPL'ed components: (BFD UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter

Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files set to /tmp/hemmecke/
                        AXIOM Computer Algebra System
              Version: OpenAxiom 1.1.0 experimental 2007-09-10
            Timestamp: Wednesday September 26, 2007 at 19:30:12
-----------------------------------------------------------------------------
   Issue )copyright to view copyright notices.
   Issue )summary for a summary of useful system commands.
   Issue )quit to leave AXIOM and return to shell.
-----------------------------------------------------------------------------

(1) ->
(1) -> F:=FFP(PF 2,x3+x+1)

   Cannot convert from type Polynomial SparseUnivariatePolynomial
      PrimeField 2 to SparseUnivariatePolynomial PrimeField 2 for value
   x3 + x + 1

(1) -> F:=FFP(PF 2,x^3+x+1)


   >> System error:
   Caught fatal error [memory may be damaged]


On 10/16/2007 03:25 PM, Martin Rubey wrote:
> "Alasdair McAndrew" <address@hidden> writes:
>
> > Here it is:
> >
> > F:=FFP(PF 2,x^3+x+1)
> > x:=generator()$F
>
> (24) -> for i in 0..7 repeat print([i, x^i]$List Union(INT, F))
>    [0,1]
>    [1,%A]
>         2
>    [2,%A ]
>    [3,%A + 1]
>         2
>    [4,%A  + %A]
>         2
>    [5,%A  + %A + 1]
>         2
>    [6,%A  + 1]
>    [7,1]
>                                                                    Type: Void
>
>
> The "problem" is not print, but rather that the simplest signature for the
> constructor function in [i, x^i] the interpreter can find takes some F's and
> returns a List F.  Above I explicitly told the interpreter to use the
> constructor function that takes Union(INT, F)'s and returns a list of such
> elements. Compare with
>
> for i in 0..7 repeat print([i, x^i]::List Union(INT, F))
>
> Martin