Hi Michael:
Out of curiosity, I visited the ECL home page.
I would be fairly surprised if this worked well for Maxima, for SAGE, in
spite of some signs of life.
It is based on "a bytecodes compiler and interpreter". with a translator to
C. It uses the Gnu Multiprecision
Library, which suggests to me that all short-integer arithmetic, the most
common kind,
will be slow and bulky.
The benchmark section says the competitive CLISP is astonishingly fast in
comparison with ECL.
It has a "simple conservative mark & sweep garbage collector" which means
it will be very bad for
long-running jobs.
It seems to be lacking tools for collecting information on memory use etc.
Of course, with enough effort anything can be made from anything in a Turing
sense.
Regards
RJF
> -----Original Message-----
> From: maxima-bounces at math.utexas.edu
> [mailto:maxima-bounces at math.utexas.edu] On Behalf Of Michael.Abshoff
> Sent: Saturday, April 26, 2008 8:53 PM
> To: sage-devel at googlegroups.com
> Cc: ecls-list at lists.sourceforge.net; maxima list
> Subject: Re: [Maxima] [sage-devel] compiling Maxima by ECL
>
> Robert Dodier wrote:
> > Hello,
>
> Hi,
>
> > I have gotten Maxima (current CVS head + ECL-specific changes)
> > compiled by ECL (current CVS head, release 0.9j won't work).
> > I committed the ECL-specific stuff on the branch
>.... snip