1
2
3
4
5
6
7
8
9
(define function4 (lambda () 
(display "function4")
(newline)
'()))
 
(define go (lambda ()
(display "running go...")
(newline)
(function4)))
 ...

1
2
(define wrap (l)(cons l '()))
(wrap '(a b c))

1
2
(define wrap (l)(cons l '())
(wrap '(a b c))

1
(cdr '(abc))

1
2
3
(define (transpose m)
  (apply map list m))
 

1
(define (triangle-sum lst) (define (shift-right lst) (cons 0 lst)) (define (shift-left lst) (append lst '(0))) (if (or (null? lst) (null? (cdr lst))) lst (let loop ((rest-lst (cdr lst)) (output (car lst))) (if (null? rest-lst) (apply max output) (loop (cdr rest-lst) (apply map max (map (lambda (S) (map (lambda (x y) (+ x y)) S (car rest-lst))) (list (shift-left output) (shift-right output))))))))) 

1
(define (triangle-sum lst) (define (shift-right lst) (cons 0 lst)) (define (shift-left lst) (append lst '(0))) (if (or (null? lst) (null? (cdr lst))) lst (let loop ((rest-lst (cdr lst)) (output (car lst))) (if (null? rest-lst) (apply max output) (loop (cdr rest-lst) (apply map max (map (lambda (S) (map (lambda (x y) (+ x y)) S (car rest-lst))) (list (shift-left output) (shift-right output))))))))) 

1
(define (triangle-sum lst) (define (shift-right lst) (cons 0 lst)) (define (shift-left lst) (append lst '(0))) (if (or (null? lst) (null? (cdr lst))) lst (let loop ((rest-lst (cdr lst)) (output (car lst))) (if (null? rest-lst) (apply max output) (loop (cdr rest-lst) (apply map max (map (lambda (S) (map (lambda (x y) (+ x y)) S (car rest-lst))) (list (shift-left output) (shift-right output))))))))) 

1
(define (triangle-sum lst) (define (shift-right lst) (cons 0 lst)) (define (shift-left lst) (append lst '(0))) (if (or (null? lst) (null? (cdr lst))) lst (let loop ((rest-lst (cdr lst)) (output (car lst))) (if (null? rest-lst) (apply max output) (loop (cdr rest-lst) (apply map max (map (lambda (S) (map (lambda (x y) (+ x y)) S (car rest-lst))) (list (shift-left output) (shift-right output))))))))) 

1
(define (triangle-sum lst) (define (shift-right lst) (cons 0 lst)) (define (shift-left lst) (append lst '(0))) (if (or (null? lst) (null? (cdr lst))) lst (let loop ((rest-lst (cdr lst)) (output (car lst))) (if (null? rest-lst) (apply max output) (loop (cdr rest-lst) (apply map max (map (lambda (S) (map (lambda (x y) (+ x y)) S (car rest-lst))) (list (shift-left output) (shift-right output))))))))) 

1
(define (triangle-sum lst) (define (shift-right lst) (cons 0 lst)) (define (shift-left lst) (append lst '(0))) (if (or (null? lst) (null? (cdr lst))) lst (let loop ((rest-lst (cdr lst)) (output (car lst))) (if (null? rest-lst) (apply max output) (loop (cdr rest-lst) (apply map max (map (lambda (S) (map (lambda (x y) (+ x y)) S (car rest-lst))) (list (shift-left output) (shift-right output))))))))) 

1
(sqrt 2)

1
2
(define x 2)
x

1
2
(define x 2)
(displayln x)

1
2
3
(for (<= i 1000) 
        (display i)
)

1
2
3
4
5
6
7
8
9
 (define replace
      (lambda (exp1 exp2 exp3)
        (cond
          ((equal? exp3 '()) '())
          ((equal? exp1 (car exp3)) 
           (cons exp2 (replace exp1 exp2 (cdr exp3)))) 
          ((list? (car exp3))
           (let ((x (car exp3))) 
             (cons (replace exp1 exp2 x) (replace exp1 exp2 (cdr exp3)))))
 ...

1
2
3
4
5
6
7
8
9
(define (f n)
        (if (< n 3)
                n
                (f-iter 2 1 0 (- n 3))))
 
(define (f-iter a b c count)
        (if (< count 0)
                a
                (f-iter (+ a (* 2 b) (* 3 c)) a b (- count 1))))
 ...

1
2
3
4
5
6
7
8
9
(define (f n)
        (if (< n 3)
                n
                (f-iter 2 1 0 (- n 3))))
 
(define (f-iter a b c count)
        (if (< count 0)
                a
                (f-iter (+ a (* 2 b) (* 3 c)) a b (- count 1))))
 ...

1
2
3
4
5
6
7
8
9
(define (f n)
        (if (< n 3)
                n
                (f-iter 2 1 0 (- n 3))))
 
(define (f-iter a b c count)
        (if (< count 0)
                a
                (f-iter (+ a (* 2 b) (* 3 c)) a b (- count 1)))))
 ...

1
2
3
4
5
6
7
8
9
(define (f n)
        (if (< n 3)
                n
                (f-iter 2 1 0 (- n 3))))
 
(define (f-iter f-val a b c count)
        (if (< count 0)
                a
                (f-iter (+ a (* 2 b) (* 3 c)) a b (- count 1)))))
 ...

1
2
3
4
5
6
7
8
9
<?xml version="1.0" ?>  
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
 "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 
                 
                                
<html xmlns="http://www.w3.org/1999/xhtml"><head>                               
<title>Geocache GC... F&uuml;r Informatiker -   2</title>                 
</head>                          
 ...

1
(+ 2 1000)

1
(exp 2 1000)

1
(print (cons `vsl `(not dead)))

1
(cons `vsl `(not dead))

1
2
3
4
5
(define (f n)
    (if (< n 3) n
        (+ (f (- n 1)) (* 2 (f (- n 2))) (* 3 (f (- n 3))))))
 
(display (f 3)) 

1
2
3
4
5
(define (f n)
    (if (< n 3) n
        (+ (f (- n 1)) (* 2 (f (- n 1))) (* 3 (f (- n 1))))))
 
(display (f 3)) 

1
2
3
4
5
6
7
8
(define (f n)
        (f-iter n (- n 3)))
 
(define (f-iter n count)
        (if (or (< count 0) (< n 3)) n
            (+ (f-iter (- n 1) (- count 1))
               (* 2 (f-iter (- n 2) (- count 2)))
               (* 3 (f-iter (- n 3) (- count 3))))))

1
2
3
4
5
6
7
8
(define (f n)
        (f-iter n (- n 3)))
 
(define (f-iter n count)
        (if (or (< count 0) (< n 3)) n
            (+ (f-iter (- n 1) (- count 1))
               (f-iter (- n 2) (- count 2))
               (f-iter (- n 3) (- count 3)))))

1
2
3
4
5
6
7
8
(define (f n)
        (f-iter n (- n 3)))
 
(define (f-iter n count)
        (if (or (< count 0) (< n 3)) n
            (+ (f-iter (- n 1) (- count 1))
               (f-iter (- n 2) (- count 2))
               (f-iter (- n 3) (- count 3)))))