1. No transcript needed
2. Just submit the code
3. No paper copy

STk> (load "~cs61a/lib/lazy.scm")
STk> (mce) ;; runs the lazy evaluator

(define error (let ((old-error error)) 
   (lambda args (old-error (car args)))))

1. #2: it should say ";; cdr to strip off 'or' tag"
2. #3: EVAL-DEFINITION should handle multiple desugared defines or one sugared define (as before). Here is an example of using the new DEFINE to create several variables in one go, all in desugared form:

   (define inc (lambda (x) (+ x 1)) 
           five (+ 2 3)
           factorial (lambda (n)
                         (if (= n 0)
                              1
                              (* n (factorial (- n 1))))))

   DEFINE should still support the sugared-up syntax for procedure definitions:

   (define (square x)                
        (* x x))
   

   But this sugared syntax cannot be used in combination with the multiple-variable form.

(define (stream-map proc. streams)
     ( ??
       (apply proc (map ?? streams))
       (apply stream-map 
              (cons proc (map ?? streams)))))

1. When evaluating a set! do not erase the old value. Instead cross it out the old value and write the new value beside it.
2. Number the frames in order of creation.
3. Do not erase any frames, even if the evaluator is done with that frame.

1. Homeworks will be graded by Tuesday/Wednesday. Check 'glookup' ASAP so you can sign up for regrades.
2. You may not get points back on problems that weren't attempted.
3. This is not a time to whine about your grade. The readers are there so that you understand the material and understand WHY you got the problem incorrect.

1. Due Tuesday, July 8th at 11:59pm.
2. Make sure you've implemented all the additions.
3. Paper Submissions will NOT be required for the project.
4. We will be expecting that you use Data Abstraction

1. Will be held in Pimentel, Friday July 11 at 12pm
2. The makeup midterm will be held on Sunday, July 13 at 3pm.