[Axiom-developer] [#17 algebra BOOTSTRAP fixed point] fixnum optimization in new compiler

[anonymous]

I compleatly fine with the fixnum declaration. We just need to make
sure it is a rule programmers can rely on. Consider:

)abbrev package ITER Iter
Iter(): E == I where
  E == with
    iter: () -> Void
  I == add
    iter(): Void == 
      for i in 2.. repeat
         print(i::OutputForm)


The relavent lisp decalres we are using fixnums:

      (LETT |i| (QSADD1 |i|) |ITER;iter;V;1|)


Now compile the above with a lower bound of 3:

      for i in 3.. repeat
         print(i::OutputForm)


We get generic arithmetic:

      (LETT |i| (+ |i| 1) |ITER;iter;V;1|)


Baffled,
Steve



--
forwarded from http://page.axiom-developer.org/zope/mathaction/address@hidden