On 2012-05-18, Steve Haflich <smh at franz.com> wrote:
> It is an interesting question whether, had generic functions and a
> discriminable and extensible class lattice existed in Lisp 40+ years
> ago, whether this would have been useful to the internal protocols of
> Ma[xi,csy]ma because each subexpression could be minutely subclassed
> about all it's internal propertes. That question is arguably still
> intellectually interesting, but alas any answer to that question is not
> relevant to current work on Maxima.
Hmm, that sounds interesting. How would that work? What is an example?
best
Robert Dodier