Short-circuiting in BRF+ Boolean expressions

In a Boolean expression like " <1> or <2> ", if <1> evaluates to TRUE, the result is true and an evaluation of the second operand is no more necessary. I have the impression that this kind of short circuiting, which improves performance, is not implied in Boolean expressions in BRF+ (it stopped at a break-point in a custom function in part <2>)? If not - can it be activated somehow?