

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Some concept of Building Programming Experience are Trees, Square Limit Language, Special Forms, Quizanssheet, Professor Abstraction, Compound Procedure, Procedures And Recursion. Main points of this lecture are: Special Forms, Name Parameters, Form, Equivalent, Duration, More Expressions, Evaluated, Bindings, Value, Relevant Expressions
Typology: Slides
1 / 3
This page cannot be seen from the preview
Don't miss anything!


This form is equivalent to (define name (lambda (parameters) expressions)).
Binds the given bindings for the duration of the body. The bindings is a list of (name value) pairs. The body consists of one or more expressions which are evaluated in order and the value of last is returned.
(define (foo x) (+ x 3))
foo
(foo 5)
(define bar 5)
(define (baz) 5)
bar
baz
(bar)
(baz)
(let ((a 3) (b 5)) (+ a b))
(let ((+ ) ( +)) (+ 3 (* 4 5)))
(define m 3) (let ((m (+ m 1))) (+ m 1))
(define n 4) (let ((n 12) (o (+ n 2))) (* n o))
(list 1 2 3)