(x: Boolean) and (y: Boolean): Boolean == if x then y else false;
(x: Boolean) or  (y: Boolean): Boolean == if not x then y else true;

Well, with definition above 'and' and 'or' would use normal
Spad evaluation rules, that is arguments would be evaluated
first, then passed to 'and'.  So it is impossible to get
short circuit evaluation that way.

Damn. Sure, you are right. I should have written a macro. But anyway, I wasn't really suggesting that.
"and" and "or" should be part of the language.

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.

Reply via email to