Exercise 5.2.1 from TAPL in Racket

5_2_1.rkt

#lang racket

;; tru = \t. \f. t
(define tru
  (lambda [t]
    (lambda [f] t)))

;; fls = \t. \f. f
(define fls
  (lambda [t]
    (lambda [f] f)))

;; l-and = \b. \c. b c fls
(define l-and
  (lambda [b]
    (lambda [c]
      ((b c) fls))))

;; l-or = \b. \c. b tru c
(define l-or
  (lambda [b]
    (lambda [c]
      ((b tru) c))))

;; l-not = \b. b fls tru
(define l-not
  (lambda [b]
    ((b fls) tru)))