Upgrade to Pro — share decks privately, control downloads, hide ads and more …

Lisp (laraconeu)

Lisp (laraconeu)

Igor Wiedler

August 30, 2014
Tweet

More Decks by Igor Wiedler

Other Decks in Programming

Transcript

  1. View Slide

  2. View Slide

  3. Computers

    View Slide

  4. What are they even?

    View Slide

  5. @igorwhiletrue

    View Slide

  6. A little history

    View Slide

  7. brb inventing
    programming

    View Slide

  8. computers
    they’re so
    great <3
    Alonzo Church

    View Slide

  9. View Slide

  10. John

    McCarthy

    View Slide

  11. I <3
    computers but hate
    assembly
    language

    View Slide

  12. View Slide

  13. View Slide

  14. (

    View Slide

  15. View Slide

  16. ( )
    parentheses

    are
    hugs

    View Slide


  17. ( )

    View Slide

  18. How to read lisp code,
    in one easy step

    View Slide

  19. foo(1, 2)

    View Slide

  20. (foo 1 2)

    View Slide

  21. (+ 1 2)

    View Slide

  22. 3

    View Slide

  23. Growing a
    language

    View Slide

  24. a
    bar
    foo
    atom

    View Slide

  25. View Slide

  26. cons

    View Slide

  27. first

    View Slide

  28. rest

    View Slide

  29. a
    b

    View Slide

  30. (a . b)

    View Slide

  31. a

    View Slide

  32. (a . nil)

    View Slide

  33. a b c

    View Slide

  34. (a . (b . (c . nil)))

    View Slide

  35. (a b c)

    View Slide

  36. (foo (bar) (baz qux))

    View Slide

  37. foo
    bar baz qux

    View Slide

  38. foo(bar(), baz(qux))

    View Slide

  39. foo
    bar baz qux
    fn arg 0 arg 1
    fn fn arg 0
    call
    call call

    View Slide

  40. (foo (bar) (baz qux))

    View Slide

  41. (foo (bar) (baz qux))
    fn arg 0 arg 1

    View Slide

  42. (foo (bar) (baz qux))
    fn arg 0
    fn

    View Slide

  43. (quote (a b c))

    View Slide

  44. '(a b c)

    View Slide

  45. (first '(a b c))
    !

    View Slide

  46. (first '(a b c))
    !
    'a

    View Slide

  47. a b c

    View Slide

  48. (rest '(a b c))
    !

    View Slide

  49. (rest '(a b c))
    !
    '(b c)

    View Slide

  50. a b c

    View Slide

  51. (cons 'a '(b c))
    !

    View Slide

  52. (cons 'a '(b c))
    !
    '(a b c)

    View Slide

  53. a b c

    View Slide

  54. 5
    3.14
    "fubar"
    variable
    :keyword

    View Slide

  55. (fn [x] x)

    View Slide

  56. (fn [x] x)
    arguments

    View Slide

  57. (fn [x] x)
    body

    View Slide

  58. (def answer 42)

    View Slide

  59. (def hello
    (fn [name]
    (str "Hello " name)))

    View Slide

  60. (hello “Laracon”)

    View Slide

  61. No loops

    View Slide

  62. Recursive functions

    View Slide

  63. in order
    to understand rec
    ursion, one must
    first understand re
    cursion,

    View Slide

  64. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))

    View Slide

  65. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))

    View Slide

  66. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))

    View Slide

  67. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))

    View Slide

  68. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))

    View Slide

  69. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))

    View Slide

  70. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))

    View Slide

  71. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))

    View Slide

  72. (member? 'c '(a b c d))

    View Slide

  73. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))
    !
    (member? 'c '(a b c d))

    View Slide

  74. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))
    !
    (member? 'c '(a b c d))

    View Slide

  75. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))
    !
    (member? 'c '(a b c d))

    View Slide

  76. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))
    !
    (member? 'c '(a b c d))

    View Slide

  77. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))
    !
    (member? 'c '(a b c d))
    (member? 'c '(b c d))

    View Slide

  78. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))
    !
    (member? 'c '(a b c d))
    (member? 'c '(b c d))

    View Slide

  79. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))
    !
    (member? 'c '(a b c d))
    (member? 'c '(b c d))

    View Slide

  80. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))
    !
    (member? 'c '(a b c d))
    (member? 'c '(b c d))

    View Slide

  81. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))
    !
    (member? 'c '(a b c d))
    (member? 'c '(b c d))
    (member? 'c '(c d))

    View Slide

  82. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))
    !
    (member? 'c '(a b c d))
    (member? 'c '(b c d))
    (member? 'c '(c d))

    View Slide

  83. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))
    !
    (member? 'c '(a b c d))
    (member? 'c '(b c d))
    (member? 'c '(c d))

    View Slide

  84. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))
    !
    (member? 'c '(a b c d))
    (member? 'c '(b c d))
    (member? 'c '(c d)) => true

    View Slide

  85. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))
    !
    (member? 'c '(a b c d))
    (member? 'c '(b c d)) => true

    View Slide

  86. (defn member? [x coll]
    (cond
    (empty? coll) false
    :else (or (= (first coll) x)
    (member? x (rest coll)))))
    !
    (member? 'c '(a b c d)) => true

    View Slide

  87. true

    View Slide

  88. Macros

    View Slide

  89. (foo (bar) (baz qux))

    View Slide

  90. "(+ 1 2)" Reader
    +
    1 2
    +
    1 2
    Eval 3
    Compile-time
    Runtime
    x 0
    y 1
    z 2

    View Slide

  91. "(a 1 2)" Reader
    a
    1 2
    Compile-time
    Macro
    b
    5 6
    a
    1 2

    View Slide

  92. (defn id [x] x)
    !
    (def id (fn [x] x))
    =>

    View Slide

  93. (-> '(foo bar baz)
    reverse
    first
    name
    string/reverse)
    (string/reverse
    (name
    (first
    (reverse '(foo bar baz))))
    =>

    View Slide

  94. class Foo ($bar) {
    }
    class Foo {
    private $bar;
    function __construct($bar) {
    $this->bar = $bar;
    }
    }
    =>

    View Slide

  95. Backporting?

    View Slide

  96. function () use ($foo) {
    return qux($foo);
    }
    =>
    () ==> qux($foo)

    View Slide

  97. hhvm 5.6 5.5 5.4 FI
    ...

    View Slide

  98. Computer
    Science

    View Slide

  99. Computer
    Science

    View Slide

  100. Computer
    Science

    View Slide

  101. Y-Combinator

    View Slide

  102. (defn Y [le]
    ((fn [f] (f f))
    (fn [f]
    (le #((f f) %)))))

    View Slide

  103. (defn fac [f]
    (fn [x]
    (if (zero? x)
    1
    (* x (f (dec x))))))

    View Slide

  104. ((Y fac) 5)

    View Slide

  105. ((Y ) 5)
    (fn [f]
    (fn [x]
    (if (zero? x)
    1
    (* x (f (dec x))))))

    View Slide

  106. (( ) 5)
    (fn [f]
    (fn [x]
    (if (zero? x)
    1
    (* x (f (dec x))))))
    (fn [le]
    ((fn [f] (f f))
    (fn [f]
    (le #((f f) %)))))

    View Slide

  107. Lambda Calculus

    View Slide

  108. 0: (fn [f] identity)
    1: (fn [f] f)
    2: (fn [f] #(f (f %)))
    3: (fn [f] #(f (f (f %))))

    View Slide

  109. ((n inc) 0)

    View Slide

  110. (( inc) 0)
    (fn [f] identity)

    View Slide

  111. ( 0)
    identity

    View Slide

  112. 0

    View Slide

  113. (( inc) 0)
    (fn [f] f)

    View Slide

  114. ( 0)
    inc

    View Slide

  115. 1

    View Slide

  116. (( inc) 0)
    (fn [f] #(f (f %)))

    View Slide

  117. ( 0)
    #(inc (inc %))

    View Slide

  118. 2

    View Slide

  119. (defn INC [n]
    (fn [p]
    (fn [x]
    (p ((n p) x)))))
    !
    !
    (defn DEC [n]
    (fn [f]
    (fn [x]
    (((n (fn [g] (fn [h] (h (g f)))))
    (fn [y] x))
    (fn [y] y)))))
    !
    !
    (defn ADD [m]
    (fn [n]
    ((n INC) m)))
    !
    !
    (defn MUL [m]
    (fn [n]
    ((n (ADD m)) ZERO)))

    View Slide

  120. Meta-circular
    evaluator

    View Slide

  121. (defun null. (x)
    (eq x '()))
    !
    (defun and. (x y)
    (cond (x (cond (y 't) ('t '())))
    ('t '())))
    !
    (defun not. (x)
    (cond (x '())
    ('t 't)))
    !
    (defun append. (x y)
    (cond ((null. x) y)
    ('t (cons (car x) (append. (cdr x) y)))))
    !
    (defun list. (x y)
    (cons x (cons y '())))
    !
    (defun pair. (x y)
    (cond ((and. (null. x) (null. y)) '())
    ((and. (not. (atom x)) (not. (atom y)))
    (cons (list. (car x) (car y))
    (pair. (cdr x) (cdr y))))))
    !
    (defun assoc. (x y)
    (cond ((eq (caar y) x) (cadar y))
    ('t (assoc. x (cdr y)))))
    (defun eval. (e a)
    (cond
    ((atom e) (assoc. e a))
    ((atom (car e))
    (cond
    ((eq (car e) 'quote) (cadr e))
    ((eq (car e) 'atom) (atom (eval. (cadr e) a)))
    ((eq (car e) 'eq) (eq (eval. (cadr e) a)
    (eval. (caddr e) a)))
    ((eq (car e) 'car) (car (eval. (cadr e) a)))
    ((eq (car e) 'cdr) (cdr (eval. (cadr e) a)))
    ((eq (car e) 'cons) (cons (eval. (cadr e) a)
    (eval. (caddr e) a)))
    ((eq (car e) 'cond) (evcon. (cdr e) a))
    ('t (eval. (cons (assoc. (car e) a)
    (cdr e))
    a))))
    ((eq (caar e) 'label)
    (eval. (cons (caddar e) (cdr e))
    (cons (list. (cadar e) (car e)) a)))
    ((eq (caar e) 'lambda)
    (eval. (caddar e)
    (append. (pair. (cadar e) (evlis. (cdr e) a))
    a)))))
    !
    (defun evcon. (c a)
    (cond ((eval. (caar c) a)
    (eval. (cadar c) a))
    ('t (evcon. (cdr c) a))))
    (defun evlis. (m a)
    (cond ((null. m) '())
    ('t (cons (eval. (car m) a)
    (evlis. (cdr m) a)))))

    View Slide

  122. 62 LOC

    View Slide

  123. function evaluate($expr, $env = []) {
    if (is_string($expr)) {
    if (is_numeric($expr)) {
    $val = (float) $expr;
    return [$val, $env];
    }
    if ('true' === $expr) {
    return [true, $env];
    }
    if ('false' === $expr) {
    return [false, $env];
    }
    if ('null' === $expr) {
    return [null, $env];
    }
    $var = $expr;
    return [$env[$var], $env];
    }
    $fn = array_shift($expr);
    $args = $expr;
    if ('define' === $fn) {
    list($var, $val) = $args;
    list($val, $env) = evaluate($val, $env);
    $env = array_merge($env, [$var => $val]);
    return [null, $env];
    }
    if ('lambda' === $fn) {
    list($lambda_args, $code) = $args;
    $closure = ['closure', $lambda_args, $code, $env];
    return [$closure, $env];
    }
    if ('if' === $fn) {
    list($cond, $then, $else) = $args;
    $cond = evaluate($cond, $env)[0];
    if ($cond === true) {
    $val = evaluate($then, $env)[0];
    } else {
    $val = evaluate($else, $env)[0];
    }
    return [$val, $env];
    }
    !
    $fn = evaluate($fn, $env)[0];
    $args = array_map(function ($arg) use ($env) {
    return evaluate($arg, $env)[0];
    }, $args);
    return apply($fn, $args, $env);
    }
    !
    function apply($fn, $args, $env) {
    list($_, $lambda_args, $code, $closure_env) = $fn;
    !
    $env = array_merge($env, $closure_env);
    $env = array_merge($env, array_combine($lambda_args, $args));
    return evaluate_code($code, $env);
    }
    function evaluate_code($code, $env = []) {
    foreach ($code as $expr) {
    list($val, $env) = evaluate($expr, $env);
    }
    return [$val, $env];
    }

    View Slide

  124. 68 LOC

    View Slide

  125. PHPPHP: 6208 LOC
    github.com/ircmaxell/PHPPHP

    View Slide

  126. PHPPHP: 6208 LOC
    github.com/ircmaxell/PHPPHP
    (parser +6169 LOC)

    View Slide

  127. )

    View Slide

  128. View Slide

  129. View Slide

  130. View Slide

  131. View Slide

  132. Questions?
    • joind.in/11697

    • github.com/igorw

    • lambda-php

    • lusp

    • ilias

    • galapagos

    • @igorwhiletrue

    View Slide

  133. View Slide

  134. References
    • Lisp Logo by Conrad Barski

    lisperati.com/logo.html

    • Jesus bleibet meine Freude by Jeffrey Campbell

    • Programming with Nothing by Tom Stuart

    codon.com/programming-with-nothing

    • The Magnificent Seven by Michael Fogus

    fogus.me/static/preso/magnificent7/

    View Slide

  135. • Recursive functions of symbolic expressions and their
    computation by machine, Part I by John McCarthy

    www-formal.stanford.edu/jmc/recursive.pdf

    • Growing a Language by Guy Steele

    youtube.com/watch?v=_ahvzDzKdB0

    • The Lambda Papers by Guy Steele and Gerald
    Sussman

    library.readscheme.org/page1.html

    • SICP lectures by Hal Abelson and Gerald Sussman

    groups.csail.mit.edu/mac/classes/6.001/abelson-
    sussman-lectures/

    View Slide