Can logical operators use tail-recursion

Question

(define (fast-prime? n times)
  (cond ((= times 0) true)
        ((fermat-test n) (fast-prime? n (- times 1)))
        (else false)))

This code is from SICP , chapter 1.2.6. The procedure uses tail-recursion , so it doesn't cause linear recursion when computed, in other words it's iterative . If I rewrite the procedure using or / and instead of cond , will it cause linear recursion ?

(define (fast-prime? n times)
  (or (= times 0)
      (and (fermat-test n) (fast-prime? n (- times 1)))))

Answer 1

and和or的右侧是尾部表达式（请参见R5RS第3.5节 ），因此可以安全地将其用于迭代目的。