Scheme code that takes advantage of lexical scope with indefinite extent might qualify: The functions f, g and h use private variables x and y. (define f #f

Scheme code that takes advantage of lexical scope with indefinite extent might qualify: The functions f, g and h use private variables x and y. (define f #f) (define g #f) (define h #f) (let ((x #f) (y #f)) (set! f <<Lambda term for f>>) (set! g <<Lambda term for g>>) (set! h <<Lambda term for h>>)) F does whatever. <<Lambda term for f>>= (lambda (p q) (21 lines of code)) G does something else <<Lambda term for g>>= (20 lines of code) ...