Thank you for HyperDoc hint, it turned out to be not so scary. But if log is not log: P -> R how can the simplifications be done? Consider
log (x*y) and when I write it I mean log to be of type P -> R, however I can't say it to FriCAS. If I don't know anything about x and y (except the are both R, x*y is P) then I leave this expression. However I actually assume x and y to be in P and log x + log y can be used. How does FriCAS assure an expression to be valid if not by types used? >Ehm, what do you mean by that. In my understanding the union of all domains >and categories is called "constructors". I just thought that "constructor" requires an argument and so not a category buy itself, never mind this. -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/fricas-devel?hl=en.
