Slide 1

Slide 1 text

R7RS SCHEME C hr i st i an S t i gen Larsen 2013 - 08 - 29

Slide 2

Slide 2 text

«Programming languages should be designed not by piling feature on top of feature, but by removing the weaknesses and restrictions that make additional features appear necessary.» From the SC HEME standards

Slide 3

Slide 3 text

No content

Slide 4

Slide 4 text

No content

Slide 5

Slide 5 text

The entire language can be built with quote, if, lambda, set!  + variables, constants and procedure calls

Slide 6

Slide 6 text

It’s a symbolic, homoiconic language with strong metaprogramming features.

Slide 7

Slide 7 text

One standard, many implementations.

Slide 8

Slide 8 text

More than 70 implementations targeting native code, JVM, CLR, JS, micro-CPUs, etc.

Slide 9

Slide 9 text

ABSTRACT SYNTAX TREES

Slide 10

Slide 10 text

public static int fact(int n) { if ( n == 0 ) return 1; else return n*fact(n-1); }

Slide 11

Slide 11 text

if == n 0 1 n * fact - 1 n public static int fact(int n) { if ( n == 0 ) return 1; else return n*fact(n-1); }

Slide 12

Slide 12 text

if == n 0 1 n * fact - 1 n public static int fact(int n) { if ( n == 0 ) return 1; else return n*fact(n-1); } (if (equal? n 0) 1 (* n (fact (- n 1))))

Slide 13

Slide 13 text

Parse AST Codegen (if (equal? n 1 (* n (fact (- n 1)))) 0)

Slide 14

Slide 14 text

Parse AST Codegen (if (equal? n 1 (* n (fact (- n 1)))) 0)

Slide 15

Slide 15 text

PROPER TAIL RECURSION

Slide 16

Slide 16 text

(if (zero? n) 1 (* n (fact (- n 1))))

Slide 17

Slide 17 text

(define (fact n) (if (zero? n) 1 (* n (fact (- n 1)))))

Slide 18

Slide 18 text

(define (fact n) (if (zero? n) 1 (* n (fact (- n 1)))))

Slide 19

Slide 19 text

(define (fact n) (if (zero? n) 1 (* n (fact (- n 1))))) if == n 0 1 n * fact - 1 n

Slide 20

Slide 20 text

(define (fact n) (if (zero? n) 1 (* n (fact (- n 1))))) if == n 0 1 n * fact - 1 n

Slide 21

Slide 21 text

(define (fact n) (if (zero? n) 1 (* n (fact (- n 1))))) if == n 0 1 n * fact - 1 n

Slide 22

Slide 22 text

n * fact - 1 n

Slide 23

Slide 23 text

n * fact - 1 n

Slide 24

Slide 24 text

- 1 n fact n * NON-TAIL RECURSIVE

Slide 25

Slide 25 text

- 1 n fact n * acc TAIL RECURSIVE

Slide 26

Slide 26 text

- 1 n fact n * acc TAIL RECURSIVE (define (fact n acc) (if (zero? n) acc (fact (- n 1) (* n acc))))

Slide 27

Slide 27 text

- 1 n fact n * acc TAIL RECURSIVE (define (fact n acc) (if (zero? n) acc (fact (- n 1) (* n acc)))) (define (fact n acc) (if (zero? n) acc (fact (- n 1) (* n acc))))

Slide 28

Slide 28 text

QUOTATION

Slide 29

Slide 29 text

(quote (+ 1 2)) > (+ 1 2) ‘(+ 1 2)) > (+ 1 2)

Slide 30

Slide 30 text

(quasiquote (* 2 ,(+ 1 2))) > ‘(* 2 3) `(* 2 ,(+ 1 2))) > ´(* 2 3)

Slide 31

Slide 31 text

HOMOICONICITY

Slide 32

Slide 32 text

Code is Data Data is Code

Slide 33

Slide 33 text

(define code ‘(let ((age 36)) (* age 365))) (print code) > ‘’(define ...)’’ (eval code) > 13140

Slide 34

Slide 34 text

(assert-equal (* 36 365) 1314) «Error: (* 36 365) returned 13140, which is not equal to 1314»

Slide 35

Slide 35 text

(asm (mov ax 1) (int #x10))

Slide 36

Slide 36 text

(select (age name) (from store))

Slide 37

Slide 37 text

(html (head (title «Foo»)) (body (h1 «Bar») (p (= color red) «Welcome»)))

Slide 38

Slide 38 text

(json (first-name «John») (last-name «Smith») (age 25))

Slide 39

Slide 39 text

CLOSURES

Slide 40

Slide 40 text

closure = code + environment

Slide 41

Slide 41 text

(let ((name ‘‘foo’’)) (lambda (title) (print title name))) (let ((name ‘‘foo’’)) (lambda (title) (print title name))) (let ((name ‘‘foo’’)) (lambda (title) (print title name)))

Slide 42

Slide 42 text

(let ((name ‘‘foo’’)) (lambda (title) (print title name))) (let ((name ‘‘foo’’)) (lambda (title) (print title name))) (let ((name ‘‘foo’’)) (lambda (title) (print title name)))

Slide 43

Slide 43 text

(define send #f) ; initialize (define recv #f) (let ((secret-message ‘‘none’’)) (set! send (lambda (str) (set! secret-message str))) (set! recv (lambda () secret-message))) (send ‘‘Meet me by the docks at midnight’’) (print (recv))

Slide 44

Slide 44 text

(define send #f) ; initialize (define recv #f) (let ((secret-message ‘‘none’’)) (set! send (lambda (str) (set! secret-message str))) (set! recv (lambda () secret-message))) (send ‘‘Meet me by the docks at midnight’’) (print (recv))

Slide 45

Slide 45 text

MACROS

Slide 46

Slide 46 text

A macro is a compile-time change in the AST. It is used to control evaluation.

Slide 47

Slide 47 text

(defmacro (when test do-stuff) `(if ,test ,do-stuff)) (when #false (format-disk))

Slide 48

Slide 48 text

(define-syntax when (syntax-rules () ((when test code ...) (if test (begin code ...))))) (define-syntax when (syntax-rules () ((when test code ...) (if test (begin code ...))))) (define-syntax when (syntax-rules () ((when test code ...) (if test (begin code ...))))) (define-syntax when (syntax-rules () ((when test code ...) (if test (begin code ...))))) (define-syntax when (syntax-rules () ((when test code ...) (if test (begin code ...))))) (define-syntax when (syntax-rules () ((when test code ...) (if test (begin code ...)))))

Slide 49

Slide 49 text

CONTINUATIONS

Slide 50

Slide 50 text

continuation = reified call-stack

Slide 51

Slide 51 text

(print (* 10 (call/cc (lambda (c) 12)))) (print (* 10 (call/cc (lambda (c) 12)))) (print (* 10 (call/cc (lambda (c) 12)))) (print (* 10 (call/cc (lambda (c) 12))))

Slide 52

Slide 52 text

(print (* 10 12))

Slide 53

Slide 53 text

(print (* 10 (call/cc (lambda (c) 12)))) (print (* 10 (call/cc (lambda (c) 12))))

Slide 54

Slide 54 text

(print (* 10 (call/cc (lambda (c) 12))))

Slide 55

Slide 55 text

(print (* 10 (call/cc (lambda (c) 12)))) print | * | 10 | ? Continuation

Slide 56

Slide 56 text

print | * | 10 | ? Continuation (lambda (val) (print (* 10 val))

Slide 57

Slide 57 text

(define redo #f) ; initialize (print «Result: » (* 10 (call/cc (lambda (cont) (set! redo cont) 0)))) (redo 10) (redo 12)

Slide 58

Slide 58 text

(define redo #f) ; initialize (print «Result: » (* 10 (call/cc (lambda (cont) (set! redo cont) 0)))) (redo 10) (redo 12) (define redo #f) ; initialize (print «Result: » (* 10 (call/cc (lambda (cont) (set! redo cont) 0)))) (redo 10) (redo 12)

Slide 59

Slide 59 text

(define redo #f) ; initialize (print «Result: » (* 10 (call/cc (lambda (cont) (set! redo cont) 0)))) (redo 10) (redo 12) (define redo #f) ; initialize (print «Result: » (* 10 (call/cc (lambda (cont) (set! redo cont) 0)))) (redo 10) (redo 12) (define redo #f) ; initialize (print «Result: » (* 10 (call/cc redo-val (lambda (cont) (set! redo cont) 0)))) (redo 10) ; redo-val (redo 12) ; redo-val

Slide 60

Slide 60 text

DEMO TIME