Re: [Maxima-discuss] Permutations & Permutation Group Theory

[Raymond T. <toy...@gm...>]

>>>>> "Robert" == Robert Smith <qu...@sy...> writes:

    Robert> Hey all:

    Robert> I wanted to let everyone know about the existence of the
    Robert> portable Common Lisp library called CL-PERMUTATION that
    Robert> I've been chipping away at for a while now. It allows for
    Robert> computations on permutations and permutation
    Robert> groups. CL-PERMUTATION is located here:
    Robert> https://bitbucket.org/tarballs_are_good/cl-permutation/
    Robert> and it is licensed as BSD 3-clause, so plenty permissive.

I started integrating this into maxima.  I notice that cl-permutation
needs these packages: alexandria, iterate, cl-algebraic-data-type and
closer-mop.  I'm not sure exactly how to satisfy these dependencies.
Ideally, we would use quicklisp and asdf to load these dependencies,
but that's probably not the best way since I don't think quicklisp
supports gcl.

We could include some random version of these packages (whatever is
current in quicklisp) into maxima. but I'm not sure about that
either.

Or we can just punt and produce an error if these packages aren't
otherwise available when cl-permutation is loaded.  That's not so
appealing either.

Need to make some decisions here....

--
Ray