0704.315 Programming Languages

Due Date

Section 1: Wednesday Oct 17, 18:30

Section 2: Wednesday Oct 17, 12:30

Form of Submission

Homework can submitted via email or printout by deadline.

Assignment

1. Using the following implementation of positive integers:

        (define zero '())
        (define (zero? n) (null? n))
        (define (add1 n) (cons 'a n))
        (define (sub1 n) (cdr n))
        

   Restricting yourself to the interface (zero, zero?, add1, sub1), provide definitions for the following:
   1. The value one
   2. The binary addition procedure, i.e.,

      	(define (add a b)
      	  ;; insert body here
              )
           

   3. The binary subtraction procedure

2. What is the difference between the following two Scheme definitions?

   	(define (increment n) (+ n 1))
        

   	(define increment (lambda (n) (+ n 1)))
        

3. The next few questions will use the following procedure:

   	(define (accumulate op init r)
   	    (if (null? r)
   		init
   		(op (first r) (accumulate op init (rest r)))))
   	

   1. What is value of (accumulate + 0 '(1 2 3 4)) ?
   2. What is value of (accumulate - 0 '(1 2 3 4)) ?
   3. What is value of (accumulate * 0 '(1 2 3 4)) ?

4. Using accumulate and the following binary operator, write a procedure that takes a list of any number of elements and multiplies them all together

   	(define (product a b)
   	    (if (= a 1)
   		b
   		(+ b (product (- a 1) b))))
   	

5. Write a definition for list-append (as seen last homework) in terms of accumulate.

6. Write a definition for list-length (as seen last homework) in terms of accumulate.