anchor.diff:  
   (define (varrec-written? varrec)
     (eq? 'written (varrec-attr varrec 'access)))
  +(define (varrec-early-function? varrec)
  +  (eq? 'early-function (varrec-attr varrec 'access)))
   
   ;;; Make the closure list for each lambda (i.e. variables unbound
   ;;; within the lambda body).  After this, lambdas look like:
  
positive.code:   (update-varrec-state varrec varrec-set!-state-table))
  
  (define-classify-variables (define varrec val)
    (classify-variables val)
    (let* ((state-table (if (eq? 'lambda (car val))
                            (begin
                              (form-attr-set! val 'self varrec)
                              varrec-define-lambda-state-table)
                            varrec-define-state-table))
           (state (vector-ref state-table (varrec-attr varrec 'state))))
      (when (= state 2) (rplaca form 'set!))
      (varrec-attr-set! varrec 'state state)))
  
  (define (classify-block-variables varrecs init form)
    (dolist (varrec varrecs)
  
negative.code:                     (make-alloc-closure closure))))
  
  (define-decompose-lambdas (define varrec val)
    (if (varrec-early-function? varrec)
        (decompose-define-lambda form varrec val begin)
        (decompose-lambdas val begin)))
  
  