Antonio Kam anto [at] berkeley [dot] edu
anto [at] berkeley [dot] edu
teaching.rouxl.es
while
for
scm> 1 1 scm> 2 2 scm> #t True scm> #f False
Remember this table?
False
True
None
0
[]
""
()
{}
#f
This is something you need to remember
define
(<keyword> [<arguments> ...])
>>> x = 3
scm> (define x 3) x
(<operator> [<operands> ...])
>>> add(1, 2) 3
scm> (+ 1 2) 3
if
(if <predicate> <if-true> [<if-false>])
<predicate>
<if-true>
<if-false>
scm> (if (> 4 3) 3 2) 3 scm> (if 0 3 2) 3 scm> (if #f 3 2) 2 scm> (if (= 3 2) (/ 1 0) 3) 3 scm> (if (= 3 3) (/ 1 0) 3) Error
cond
elif
(cond (<pred1> <if-pred1>) ; usually <pred> is something like (= x 2) (<pred2> <if-pred2>) ... (<predn> <if-predn>) [(else <else-expression>)] )
(cond ((= x 2) 3) ((= x 3) (+ x 1)) (else 'hello) )
and, or, not
and
or
not
(and 1 2 3)
3
(or 1 2 3)
1
(not 0)
Equivalence
=
eq?
is
equal?
==
lambda
(lambda ([<params> ...]) <body>) scm> (lambda (x) (+ x 2)) (lambda (x) (+ x 2)) scm> (define f (lambda (x) (+ x 2))) f scm> f (lambda (x) (+ x 2))
(define (<name> [<params> ...]) <body>) scm> (define (f x) (+ x 2)) f scm> f (lambda (x) (+ x 2))
(define (f x) (+ 1 2) ; doesn't get returned in the terminal (+ 2 x) ; this implicitly gets returned )
def f(x): 1 + 2 return 2 + x
lnk.first
lnk.rest
(car lnk)
(cdr lnk)
>>> Link(1, Link(2, Link(3))) Link(1, Link(2, Link(3)))
scm> (cons 1 (cons 2 (cons 3 nil))) (1 2 3) scm> (list 1 2 3) (1 2 3) scm> '(1 2 3) (1 2 3)
links.rouxl.es/disc
links.rouxl.es/feedback
Thanks for coming!
Please give me feedback on what to improve!