Hi everyone,
When evaluating operators, does TLC memoize its results?
For example, the classic Fibonacci, we'd have recursive operators:
RECURSIVE Fibonacci(_)
Fibonacci(N) ==
IF N <= 1
THEN 1
ELSE Fibonacci(N - 1) + Fibonacci(N - 2)
Or, between actions:
Next1 ==
/\ SlowOperator()
/\ FALSE
/\ ...
Next2 == /\ SlowOperator()
/\ TRUE
/\ ...
Next == Next1 \/ Next2
This is an absurd example. I just wanted to have SlowOperator be applied in different actions.
Jones