Re: [Axiom-developer] axiom on cmu cl

[root]

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:


(|/VERSIONCHECK| 2) 

(SETQ |Ring;AL| (QUOTE NIL)) 

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

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

(MAKEPROP (QUOTE |Ring|) (QUOTE NILADIC) T) 

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

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

Tim
address@hidden