Re: [q-lang-users] Strong examples of Q equational programming wanted

[Albert G. <Dr....@t-...>]

Greg Buchholz wrote:
>     Hmm, I don't know if I see what you are saying.  The simplification
> routine is interleaved with the recursive differentiation relation.
> Every time we reconstruct a term, we see if there is a simplification
> that applies.  And I don't think any of the current reconstructions
> require more than one simplification to get rid of the extra 1 and 0
> terms.  Of course, if we tried to implement a fancier CAS this might not
> hold. 

I guess you're right. It's hard to see through all the possible
interactions even between only a handful of rules...

-- 
Dr. Albert Gr"af
Dept. of Music-Informatics, University of Mainz, Germany
Email:  Dr....@t-..., ag...@mu...
WWW:    http://www.musikinformatik.uni-mainz.de/ag