[O.Kullmann <at> swansea.ac.uk: Re: Maxima/Ecl on 32-bit machine cannot evaluate "apply(union, listify({{..}}))"]

> On 9/3/08, Oliver Kullmann <O.Kullmann <at> swansea.ac.uk> wrote:
> 
> >  We stopped using xreduce for big unions, since for some our applications
> >  it had a big effect --- 5 hours instead of 1 hour where you need to do a lot
> >  of experimentations is not good.
> 
> By the way, it sounds like you are working on some sizeable problems.
> I think that is terrific. I am glad to hear that you are using Maxima for
> some heavy-duty computing. We probably should try to collect links to
> such applications on the web site.
>

Sure, once the alpha version of the OKlibrary is out, hopefully it strengthens
Maxima.

Though I would be careful on the "sizeable problems":

For us, basically, Maxima is a high-level programming language,
used for "procedural specifications". The point is to map the
whole landscape of "generalised satisfiability problems" (and
beyond), with complete definitions of all problems, provided
procedurally through readable code.
So actually at this level in our library (which has several language
layers) efficiency is "essentially" ignored.

How does it come then that I "complain" about performance? On the one
hand, since we are having now the code in Maxima (only), and not at
the C++ level (this takes much more time), we also want to use it!
Still, we accept a big slowdown, but there seem many unnecessary
inefficiencies --- I'm glad to see e.g. some movement on the "union-front"!