det mM = 0
Clearly, Haskell (being lazy) sees the full expression and thus can take
short-cuts. Usually in computer algebra, the above means evaluation of
det on mM before the result is handed over to the = function.
Now, in FriCAS, one cannot even hope for a short-cut. = is a function
like any other. So, if I have two functions
det: X -> Z and =: (Z, Z)->Boolean
then it is not actually clear what = actually is. One cannot decide just
by the name. So the only way to get a proper result is to evaluate det
for it's input and then apply =. That would probably be the same in a
lazy language in which one has the freedom to define what = is.
Ralf
--
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.
