[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Axiom-developer] axiom on cmu cl

From: root
Subject: Re: [Axiom-developer] axiom on cmu cl
Date: Mon, 28 Apr 2003 06:32:45 -0400

Sorry for the delay in reply. I was away in the real world. 

Awesome that you got it to compile. I'll look very carefully at what
you did. I tried expanding every possible value of GCL's memory 
control and it had no obvious effect. Perhaps I made a mistake and
I'll repeat the experiment. If that fixes the problem then it is a 
major breakthru.

I wonder if you could do me a favor. The way Axiom works with algebra
is that, during compile, it loads and calls the domain constructor.
This lives in a file called RING.NRLIB/code.lsp. The domain constructor
calls another function which is computed once and cached. It looks like:



(DEFUN |Ring| NIL 
 (LET (#:G121144) 
    (SETQ |Ring;AL| (|Ring;|)))))) 

(DEFUN |Ring;| NIL 
 (PROG (#1=#:G121142) 
    (LETT #1# 
        (|LeftModule| (QUOTE |$|))
          (QUOTE |domain|)
          (QUOTE (((|characteristic| ((|NonNegativeInteger|))) T)
                  ((|coerce| (|$| (|Integer|))) T)))
          (QUOTE ((|unitsKnown| T)))
          (QUOTE ((|Integer|) (|NonNegativeInteger|))) NIL))
    (SETELT #1# 0 (QUOTE (|Ring|))))))) 


Could you trace the function |Ring|, run the following compile,
and send me the console?

)co coerce
)lisp (trace '|Ring|)
)co xpoly )con XPR


reply via email to

[Prev in Thread] Current Thread [Next in Thread]