小さく始めて育てるコンパイラ

builderscon 2017 発表資料

Transcript

1. খ࢝͘͞ΊͯҭͯΔ
   ίϯύΠϥ
   builderscon 2017
   

   View Slide

2. @Linda_pp
   @rhysd
   
   • ࣗ࡞ݴޠͷίϯύΠϥΛͭͬͨ͘Γ
   • Electron ͰσεΫτοϓΞϓϦΛͭͬͨ͘Γ
   • Vim script Ͱ Vim ϓϥάΠϯΛͭͬͨ͘Γ͠
   ͯ·͢
   

   View Slide

3. ίϯύΠϥ͸࣮૷ྔ͕ଟ͍
   • ి୎ +α ͙Β͍ͷ͸ͭͬͨ͘͜ͱ͋Δ͚Ͳ…
   • ֤ػೳͷ࣮૷ͷ࢓ํͷղઆ͸ࡌ͍ͬͯΔ͚Ͳɼ
   Ͳ͏΍͍͚ͬͯͭͬͯ͘͹ྑ͍͔෼͔Βͳ͍
   • ࣗ෼ΦϦδφϧͷʰԶݴޠʱΛࢲ͕Ͳ͏΍ͬ
   ͍͔ͯͭͬͯ͘͘ʹ͍͓ͭͯ࿩͠͠·͢
   
   

   View Slide

4. ίϯύΠϥΛʰҭͯΔʱ
   • طଘݴޠͷ
   αϒηοτ
   ͱͯ͠࠷௿
   ݶͷػೳΛ
   ࣮૷
   • ΄͍͠ػೳ
   Λ֦ுͱ͠
   ࣮ͯ૷͢Δ
   • ΦϦδφϧ
   ͷߏจʹஔ
   ͖׵͑ͯԶ
   ݴޠʹ͢Δ
   
   

   View Slide

5. GoCaml ͱ͸
   • https://github.com/rhysd/gocaml
   • ϛχϚϧͳ OCaml ͷαϒηοτ
   • ࣮૷4000ߦఔ౓
   • ੩తܕ෇͚ɼܕਪ࿦ɼCݴޠ֦ு
   • MinCaml (※) ͷ࣮૷ϕʔε
   • ৄ͘͠͸ GoCon ͷࢿྉΛޚཡ͍ͩ͘͞ɿhttp://bit.ly/2wmG6Us
   ˞IUUQTHJUIVCDPNFTVNJJNJODBNM
   
   

   View Slide

6. GoCamlΛʰҭͯΔʱ
   • MinCaml Λ
   ࢀߟʹͯ͠
   ࠷௿ݶͷػ
   ೳ࣮૷
   • ΄͍͠ػೳΛ
   ֦ுɾ࣮૷͢
   Δʢଟ૬ܕɼ
   ந৅σʔλܕɼ
   ύλʔϯϚο
   νʣ
   • ΦϦδφϧ
   ͷߏจʹஔ
   ͖׵͑Δɹ
   ʢ·ͩʣ
   
   

   View Slide

7. let rec fizzbuzz max =
   let rec fb n =
   if n % 15 = 0 then println_str "fizzbuzz" else
   if n % 3 = 0 then println_str "fizz" else
   if n % 5 = 0 then println_str "buzz" else
   println_int n
   in
   let rec go n =
   if n = max then () else
   (fb n; go (n+1))
   in
   go 1
   in
   let max = 100 in
   fizzbuzz max
   ؔ਺ఆٛࣜ
   MFUSFDGYFJOF ωετͨؔ͠਺ఆٛ
   ϧʔϓ͸ແ͍ͷͰ࠶
   ؼؔ਺Λ࢖͏
   ৚݅෼ذͷJGࣜ
   JGFUIFOFFMTFF
   ؔ਺ݺͼग़͠
   GFFʜ
   ม਺ఆٛ
   MFUYFJOF
   ͦͷଞɼ഑ྻɼλϓϧɼ
   PQUJPOܕͳͲʜ
   Ϋϩʔδϟ
   
   

   View Slide

8. MinCamlΛࢀߟʹͯ͠࠷௿ݶ
   ͷػೳ࣮૷
   ͭ͘Γ͍ͨݴޠʹ͍ۙطଘݴޠͷαϒηοτͱ
   ͯ͠·ͣ͸࣮૷͢Δ
   ݴޠ࢓༷͸ͳΔ΂͘γϯϓϧʹอ͍ͪͨ&ύ
   λʔϯϚον΍ܕਪ࿦͕΄͍͠ → MLܥݴޠʁ
   
   

   View Slide

9. ͳͥطଘݴޠͷαϒηοτͱ͠
   ͯ·ͣ͸࣮૷͢Δͷ͔
   • ߏจͷσβΠϯΛઌʹ΍Ζ͏ͱͯͭ͠·͔ͣͳ͍
   • ߏจղੳ͸ίϯύΠϥͷೖΓޱͰ͔͠ͳ͍ͷʹɼͦ͜ʹ
   ؾΛऔΒΕ͕ͪ
   • ʮͲ͏͍͏ߏจ͕ྑ͍ͷ͔͸࣮ࡍʹॻ͍ͯಈ͔ͯ͠Έͳ͍
   ͱͳ͔ͳ͔෼͔Βͳ͍ 㲗 ίϯύΠϥΛ࣮૷͠ͳ͍ͱಈ͔
   ͤͳ͍ʯͱ͍͏δϨϯϚΛղফ͢Δ
   • ·ͣ͸ಈ͘ίϯύΠϥΛ࣮૷͔ͯ͠Βɼಈ͔͠ͳ͕Βޙ͔
   Βࣗ෼ͷݴޠͷߏจΛσβΠϯ͍ͯ͘͠ํ਑
   
   

   View Slide

10. ͳͥطଘݴޠͷαϒηοτͱ͠
    ͯ·ͣ͸࣮૷͢Δͷ͔
    • طଘݴޠ͸طʹಈ͍͍ͯΔ࣮੷͕͋Δ
    • ઈରʹ࣮૷Ͱ͖Δ҆৺ײ͕͋Δ
    • ύʔαͷ࣮૷Λ·ͣ͸ྲྀ༻Ͱ͖Δ
    • ࣮૷ʹ٧·ͬͨ࣌ʹطଘݴޠͷॲཧܥʢGoCaml ͷ৔߹
    ͸ OCamlʣͷڍಈɾ࣮૷ΛࢀߟʹͰ͖Δ
    • ಈ͘࠷௿ݶͷ࣮૷Λૣ࣮֬͘ʹͭ͘Δͱ͜ΖΛୈҰʹ͢
    Δ
    
    

    View Slide

11. GoCaml ͷίϯύΠϥ֓ཁ
    ιʔε
    ίʔυ
    τʔΫ
    ϯྻ
    ந৅ߏ
    จ໦
    தؒද
    ݱ
    --7.
    *3
    Ξηϯ
    ϒϦ T
    
    ΦϒδΣ
    Ϋτ P
    
    ࣮ߦϑΝ
    Πϧ
    ϥϯλ
    ΠϜ P
    
    ϥϯλ
    ΠϜ D
    
    ϦϯΧ
    ࣈ۟ղੳ ߏจղੳ
    Ћม׵
    ܕਪ࿦
    ,ਖ਼نԽ
    Ϋϩʔδϟม׵
    (PͰࣗલ࣮૷
    --7.͕όοΫΤϯυ
    $Ͱ࣮૷
    MJCHD
    ৄ͘͠͸IUUQCJUMZXN(6T
    
    ࠷దԽ
    

    View Slide

12. ߏจ໦
    Ћม׵
    ܕਪ࿦
    ʢܕνΣοΫʣ
    தؒදݱ΁ͷϑΥʔ
    Ϛοτม׵
    Ϋϩʔδϟ
    ม׵
    ιʔείʔυΛߏจ໦ʹύʔε͢Δ
    ʢgoyaccʣ
    શͯͷγϯϘϧʹҰҙͷ ID ΛৼΔɽείʔ
    ϓΛղܾ
    ୯૬ܕͷγϯϓϧͳܕγεςϜɽHMܕਪ࿦
    ΞϧΰϦζϜΛ࢖ͬͯਪ࿦
    ໦ߏ଄͔ΒSSAʢ୯Ұ୅ೖʣܗࣜͷ໋ྩྻ΁
    ม׵͢Δ
    ωετͨؔ͠਺ɾΫϩʔδϟͷղܾ
    
    

    View Slide

13. GoCaml ୈ1ஈ֊ͷ࣮૷
    • ϕʔεͱͳΔ࠷௿ݶͷػೳΛ࣋ͬͨݴޠΛૣ࣮֬͘ʹͭ͘Δ
    • MinCaml ͸ڭҭ༻ݴޠͳͷͰ࣮૷͕γϯϓϧͰࢀߟʹ͠΍͍͢ɽόοΫ
    Τϯυ͸LLVMΛ࢖͏
    • ΞϧϑΝม׵ɼܕਪ࿦ɼΫϩʔδϟม׵ɼதؒݴޠม׵ɼLLVM IRม׵ͳ
    Ͳͷ֤ஈ֊Ͱ͔ͬ͠ΓςετΛॻ͘ʢ4000ߦͷίʔυϕʔεʹରͯ͠477
    ςετέʔεʣ
    • ಈ͘Α͏ʹͳͬͨΒ࣮ࡍʹॻ͍ͯΈͯυοάϑʔσΟϯά͢Δ
    ʢquicksort, brainfxxk, n-queens, xorshift128+, …)
    • ৄ͘͠͸ GoCon2017 ͷεϥΠυ: http://bit.ly/2wmG6Us
    
    

    View Slide

14. ΄͍͠ػೳΛ֦ுɾ࣮૷͢Δ
    ࠷௿ݶͷػೳΛ࣮૷ͨ͠ίϯύΠϥΛϕʔεʹ΄͍͠ػ
    ೳΛ֦ு͍ͯ͘͠
    ɾଟ૬ܕʢˡࠓճ͸͜ͷ࣮૷ʹ͍ͭͯ঺հ͠·͢ʣ
    ɾந৅σʔλܕ
    ɾύλʔϯϚον
    ɾ…
    
    

    View Slide

15. ଟ૬ͳܕγεςϜͱ͸
    ͲΜͳܕʹஔ͖׵͑ͯ΋ྑ͍ϓϨʔεϗϧμ
    ͳܕΛѻ͑ΔܕγεςϜ
    (* ܕ͸ 'a -> 'a: 'a ʹ͸೚ҙͷܕ͕ೖΔ *)
    let rec id x = x in
    (* 'a ʹ int ΛೖΕΔ *)
    print_int (id 10);
    (* 'a ʹ bool ΛೖΕΔ *)
    print_bool (id false);
    (* ܕ͸ 'a option *)
    let o = None in
    (* 'a ʹ int ΛೖΕΔ *)
    match o with Some(i) -> print_int i | None -> ();
    (* 'a ʹ bool ΛೖΕΔ *)
    match o with Some(b) -> print_bool b | None -> ();
    ͭͷ஋͕ෳ਺ͷܕΛ࣋ͯΔΑ͏ʹͳΔ
    bBbB
    ˣ
    JOUJOU
    CPPMCPPM
    ʜ
    
    

    View Slide

16. ଟ૬తͳܕγεςϜͷ࣮૷
    • ܕਪ࿦ث͕ଟ૬తͳܕΛਪ࿦Ͱ͖ΔΑ͏ʹ֦ு
    • MinCaml ͷܕਪ࿦͸୯૬ܕ
    • ଟ૬ͳܕͷ஋ͷίʔυੜ੒ΛͰ͖ΔΑ͏ʹ֦ு
    • LLVM IR ʹ͸ଟ૬ܕ͸ແ͍
    • ͳΜΒ͔ͷํ๏Ͱଟ૬తͳ஋Λੜ੒͞ΕΔΞη
    ϯϒϦίʔυͰදݱ͢Δඞཁ͕͋Δ
    
    

    View Slide

17. ଟ૬తͳܕਪ࿦ΞϧΰϦζϜΛ
    ௐࠪ
    • Algorithm W
    • Ұ൪ΦʔιυοΫε
    • ܕू߹ͱଋറ͞Εͨܕม਺ͷஔ׵දΛ࢖ͬͯ୯ҰԽ͢Δ
    • Algorithm M
    • ໦ߏ଄ΛϘτϜΞοϓʹḷͬͯਪ࿦͢Δ Algorithm W Λτοϓμ΢ϯʹվྑ
    ͨ͠΋ͷɽޮ཰΍Τϥʔϝοηʔδ͕վળʢW ͷٯͳͷͰ Mʣ
    • Level-based Algorithm W
    • ܕม਺ʹϨϕϧʢfreshnessʣΛಋೖ͢Δ͜ͱͰ Algorhtim W ͷΞϧΰϦζϜ
    Λγϯϓϧʹ͠ɼޮ཰తʹ͢ΔɽOCaml Ͱ࠾༻͞Ε͍ͯΔ
    
    

    View Slide

18. Level-based Algorithm W
    • let ࣜͰͷม਺ଋറͰͷΈ஋͕ଟ૬ʹͳΔ͜ͱ
    ʹண໨͠ɼ͋Δܕม਺͕ʮͲΕ͚ͩ࠷ۙͷ let
    ࣜͰଋറ͞Εͨ΋ͷ͔ʯΛද͢Ϩϕϧͱ͍͏
    ஋Λ֤ܕม਺ʹ࣋ͨͤΔɽ஋͕େ͖͍΄Ͳ࠷
    ۙଋറ͞Εͨ΋ͷ
    • paper: http://gallium.inria.fr/~remy/ftp/eq-
    theory-on-types.pdf
    
    

    View Slide

19. Level-based Algorithm W
    let rec make_pair x =
    let rec f y =
    (x, y)
    in
    f
    in
    let pair = make_pair 42 in
    let p = pair true in
    let pair2= make_pair 3.0 in
    let p = pair2 "aaa" in
    ()
    NBLF@QBJS͸Ҿ਺ΛYΛͱΓɼʮҾ
    ਺ZΛऔͬͯYͱZͷϖΞΛฦ͢
    ؔ਺ʯΛฦ͢
    YΛΩϟϓνϟͨ͠ΫϩʔδϟΛͭ
    ͘ΓɼͦΕΛฦ͢
    NBLF@QBJSΛճผͷܕͷҾ਺Ͱݺͼ
    ग़ͯ͠ΈΔ
    
    

    View Slide

20. Level-based Algorithm W
    • ຌྫ
    • ɹ :ண໨͍ͯ͠ΔՕॴ
    • ?a(n): Ϩϕϧ n ͷܕม਺ɽ
    ·ͩܕ͕֬ఆ͍ͯ͠ͳ͍
    ʢະଋറʣ
    • ‘a: ଋറࡁΈͷܕม਺ʢ೚
    ҙͷܕ͕ೖΕΔʣ
    let rec make_pair x =
    let rec f y =
    (x, y)
    in
    f
    in
    let pair = make_pair 42 in
    let p = pair true in
    let pair2= make_pair 3.0 in
    let p = pair2 "aaa" in
    ()
    
    

    View Slide

21. Level-based Algorithm W
    let rec make_pair x =
    let rec f y =
    (x, y)
    in
    f
    in
    let pair = make_pair 42 in
    let p = pair true in
    let pair2= make_pair 3.0 in
    let p = pair2 "aaa" in
    ()
    MFWFM
    $VSSFOU-FWFM
    ࠷ॳ͸Ϩϕϧ͔Βελʔτ
    
    

    View Slide

22. Level-based Algorithm W
    • make_pair: ?a(1) -> ?b(1)
    • x: ?a(1)
    let rec make_pair x =
    let rec f y =
    (x, y)
    in
    f
    in
    let pair = make_pair 42 in
    let p = pair true in
    let pair2= make_pair 3.0 in
    let p = pair2 "aaa" in
    ()
    MFWFM
    MFWFM
    $VSSFOU-FWFM
    MFUࣜͰ৽͍͠ม਺͕ಋೖ͞ΕΔͱɼଋറ
    ͞ΕΔࣜͷதͰϨϕϧ্͕͕Δ
    ͜ͷ࣌఺Ͱ͸NBLF@QBJS͸Ҿ਺ͷؔ
    ਺ͱ͍͏͜ͱ͔͠෼͔Βͳ͍
    
    

    View Slide

23. Level-based Algorithm W
    • make_pair: ?a(1) -> ?b(1)
    • x: ?a(1)
    • f: ?c(2) -> ?d(2)
    • y: ?c(2)
    let rec make_pair x =
    let rec f y =
    (x, y)
    in
    f
    in
    let pair = make_pair 42 in
    let p = pair true in
    let pair2= make_pair 3.0 in
    let p = pair2 "aaa" in
    ()
    MFWFM
    MFWFM
    MFWFM
    $VSSFOU-FWFM
    
    

    View Slide

24. Level-based Algorithm W
    • make_pair: ?a(1) -> ?b(1)
    • x: ?a(1)
    • f: ?c(2) -> ?a(1) * ?c(2)
    • y: ?c(2)
    let rec make_pair x =
    let rec f y =
    (x, y)
    in
    f
    in
    let pair = make_pair 42 in
    let p = pair true in
    let pair2= make_pair 3.0 in
    let p = pair2 "aaa" in
    ()
    MFWFM
    MFWFM
    MFWFM
    $VSSFOU-FWFM
    ࣜ Y Z
    ͔Β໭Γ஋͸YͱZͷλϓϧ
    ͩͱ෼͔Δˠ E
    B
    D
    
    ʢ୯ҰԽʣ
    
    

    View Slide

25. ൚ԽʢGeneralizationʣ
    ม਺Λఆٛͨ͠ let ࣜͷϨϕϧΑΓେ͖͍Ϩϕϧͷ
    ܕม਺͸೚ҙͷܕ͕ೖΔଟ૬ܕͱͯ֬͠ఆͤ͞Δ
    ?c(2) -> ?a(1) * ?c(2)ɹɹɹ'c -> ?a(1) * 'c
    ʢݱࡏͷϨϕϧ: 1ʣ
    
    

    View Slide

26. Level-based Algorithm W
    • make_pair: ?a(1) -> ?b(1)
    • x: ?a(1)
    • f: ‘c -> ?a(1) * 'c
    • y: 'c
    let rec make_pair x =
    let rec f y =
    (x, y)
    in
    f
    in
    let pair = make_pair 42 in
    let p = pair true in
    let pair2= make_pair 3.0 in
    let p = pair2 "aaa" in
    ()
    MFWFM
    MFWFM
    MFWFM
    $VSSFOU-FWFM
    MFUࣜʹଋറ͞Ε͍ͯΔࣜͷܕਪ࿦͕ऴ
    Θͬͨ࣌ʹɼର৅ͷม਺ͷܕΛ൚Խ͢Δ
    G͸೚ҙͷܕ D
    ͷҾ਺ΛͭऔΓɼͦ
    ͷܕͷ஋ͱະ஌ͷܕͷ஋ͷϖΞʢ B
    
    bDʣΛฦ͢
    
    

    View Slide

27. Level-based Algorithm W
    • make_pair: ?a(1) -> ('c -> ?a(1) * 'c)
    • x: ?a(1)
    • f: 'c -> ?a(1) * 'c
    • y: 'c
    let rec make_pair x =
    let rec f y =
    (x, y)
    in
    f
    in
    let pair = make_pair 42 in
    let p = pair true in
    let pair2= make_pair 3.0 in
    let p = pair2 "aaa" in
    ()
    MFWFM
    MFWFM
    MFWFM
    $VSSFOU-FWFM
    ࣜG͔ΒNBLF@QBJSͷ໭Γ஋ͷܕ͸G
    ͱಉ͡ܕͩͱ෼͔Δ
    C
    bD B
    bD
    ʢ୯ҰԽʣ
    
    

    View Slide

28. Level-based Algorithm W
    • make_pair: 'a -> ('c -> 'a * 'c)
    • x: 'a
    • f: 'c -> 'a * 'c
    • y: 'c
    let rec make_pair x =
    let rec f y =
    (x, y)
    in
    f
    in
    let pair = make_pair 42 in
    let p = pair true in
    let pair2= make_pair 3.0 in
    let p = pair2 "aaa" in
    ()
    MFWFM
    MFWFM
    MFWFM
    $VSSFOU-FWFM
    NBLF@QBJSͷܕΛ൚Խ͢ΔɽҰ൪֎ଆ
    ͷMFUSFDࣜͷϨϕϧ͸ͳͷͰશͯ
    ͷະ֬ఆͳܕม਺Λଟ૬ܕʹ֬ఆ͢Δ
    
    

    View Slide

29. ΠϯελϯεԽ
    ʢinstantiation)
    ଟ૬ܕͷม਺͸ෳ਺ͷܕΛऔΔ͜ͱ͕Ͱ͖Δɽଟ૬ܕͷม਺͕
    ࢀর͞ΕΔͨͼʹ৽͍͠ܕม਺Λಋೖ͢Δ
    2ߦ໨Ͱ͸ม਺ id ͷࢀরͷܕ͸ ?b -> ?bɼint ΛҾ਺ʹͨ͠ݺ
    ͼग़͠Ͱ int -> int ʹͳΔɽ
    3ߦ໨Ͱ͸ม਺ id ͷࢀরͷܕ͸ ?c -> ?cɼbool ΛҾ਺ʹͨ͠ݺ
    ͼग़͠Ͱ bool -> bool ʹͳΔɽ
    let rec id x = x in (* 'a -> 'a *)
    id 10; (* int -> int *)
    id true; (* bool -> bool *)
    
    

    View Slide

30. Level-based Algorithm W
    • make_pair: 'a -> ('c -> 'a * 'c)
    • x: 'a
    • f: 'c -> 'a * 'c
    • y: 'c
    • pair: 'f -> int * ‘f
    let rec make_pair x =
    let rec f y =
    (x, y)
    in
    f
    in
    let pair = make_pair 42 in
    let p = pair true in
    let pair2= make_pair 3.0 in
    let p = pair2 "aaa" in
    ()
    MFWFM
    MFWFM
    MFWFM
    $VSSFOU-FWFM
    F
    G
    F
    G
    
    
    bB bDbBbD
    ΛΠϯελϯεԽ
    Ҿ਺͸JOUͳͷͰ F
    JOU
    Ͱɼ໭Γ஋ܕ͔ΒQBJSͷܕ
    ͸ G
    JOU G
    ɽ͜Ε
    Λ൚Խ
    
    

    View Slide

31. Level-based Algorithm W
    • make_pair: 'a -> ('c -> 'a * 'c)
    • x: 'a
    • f: 'c -> 'a * 'c
    • y: 'c
    • pair: 'f -> int * ‘f
    • p: int * bool
    let rec make_pair x =
    let rec f y =
    (x, y)
    in
    f
    in
    let pair = make_pair 42 in
    let p = pair true in
    let pair2= make_pair 3.0 in
    let p = pair2 "aaa" in
    ()
    MFWFM
    MFWFM
    MFWFM
    $VSSFOU-FWFM
    H
    JOU H
    
    
    bGJOUbGΛΠϯελϯεԽ
    Ҿ਺͸CPPMͳͷͰ F
    
    CPPMͰɼ໭Γ஋ܕ͔ΒQͷܕ
    ͸JOUCPPMɽࠓճ͸ະ֬ఆͷ
    ܕม਺͕ແ͍ͷͰ൚Խ͸ෆཁ
    
    

    View Slide

32. Level-based Algorithm W
    • make_pair: 'a -> ('c -> 'a * 'c)
    • x: 'a
    • f: 'c -> 'a * 'c
    • y: 'c
    • pair: 'f -> int * ‘f
    • p: int * bool
    • pair2: ‘i -> float * ‘i
    let rec make_pair x =
    let rec f y =
    (x, y)
    in
    f
    in
    let pair = make_pair 42 in
    let p = pair true in
    let pair2= make_pair 3.0 in
    let p = pair2 "aaa" in
    ()
    MFWFM
    MFWFM
    MFWFM
    $VSSFOU-FWFM
    I
    J
    I
    J
    
    
    ಉ༷ʹbB bDbBbD
    ΛΠϯελϯεԽ
    ͭ໨ͷNBLF@QBJSݺͼ
    ग़͔͠Β
    
    

    View Slide

33. Level-based Algorithm W
    • make_pair: 'a -> ('c -> 'a * 'c)
    • x: 'a
    • f: 'c -> 'a * 'c
    • y: 'c
    • pair: 'f -> int * ‘f
    • p: int * bool
    • pair2: ‘i -> float * ‘i
    • p: float * string
    let rec make_pair x =
    let rec f y =
    (x, y)
    in
    f
    in
    let pair = make_pair 42 in
    let p = pair true in
    let pair2= make_pair 3.0 in
    let p = pair2 "aaa" in
    ()
    MFWFM
    MFWFM
    MFWFM
    $VSSFOU-FWFM
    K
    qPBU K
    
    
    bGJOUbGΛΠϯελϯεԽ
    QBJSݺͼग़͔͠Β
    
    

    View Slide

34. ଟ૬ܕܕਪ࿦ͷ࣮૷·ͱΊ
    • ࿦จͷࢀর࣮૷Λݟͳ͕Β࣮૷ʢଞʹ΋ occur check ͰϨ
    ϕϧΛௐઅ͢ΔͳͲͷॲཧ͕͋Δʣ
    • ଞͷܕਪ࿦ͷ࣮૷ͷςετσʔλΛྲྀ༻͢Δ
    • ޒेཛྷઌੜͷ՝୊ͷςετέʔεͳͲ(※1)
    • ͳ͔ͥ ML ͕ଟ͍ͷͰͦͷ··࢖͑Δ
    • ࠷ॳͷஈ֊Ͱ͔ͬ͠ΓςετΛॻ͍͓ͯ͘ͱ֦ு΋ָʹͳ
    Δ
    IUUQTXXXGPTLVJTLZPUPVBDKQdJHBSBTIJDMBTTJTMFXUFTUDBTFTIUNM
    
    

    View Slide

35. δΣωϦΫεͷίʔυੜ੒ͷ࣮
    ૷Λௐࠪ
    • શͯͷ஋Λ1ϫʔυͰදݱ͢ΔʢOCaml, SML/NJ ͳͲʣ
    • int ΍ float ͸ͦͷ··ɼͦΕҎ֎ͷ஋͸ώʔϓͳͲʹͱͬͯϙΠϯλͰѻ͏
    • ਖ਼֬ͳ GC ͷͨΊɼϙΠϯλ͔ͦ͏Ͱͳ͍͔൑அ͢ΔͷʹԼҐ̍ϏοτʹλάΛೖΕΔ
    ඞཁ͕͋Δ
    • ଟ૬ͳ஋͕औΔܕ͝ͱʹίʔυΛෳ੡͢Δʢmlton, Crystal, C++ (, Rust) ͳͲʣ
    • i.e. id: ‘a -> ‘a ͕ int -> int ͰΠϯελϯεԽ͞Ε͍ͯΔͳΒ id_int: int -> int Λੜ੒
    • ࣮ߦ࣌ͷΦʔόʔϔου͸গͳ͍͕ίʔυαΠζ͕രൃ͠͏Δɽ෼ׂίϯύΠϧ͕೉͍͠
    • ܕΫϥεΛఆٛ͠ɼܕΫϥε͝ͱͷ࣮૷Λؔ਺ͷࣙॻͰ౉͢ʢHaskell (,Rust) ͳͲʣ
    • ࣙॻ͔Βݺͼग़ؔ͢਺ΛҾ͍ͯ͘ΔΦʔόʔϔου͕͋Δ͕ɼ୹͍ؔ਺͸ΠϯϥΠϯԽʹ
    ΑΓίʔυෳ੡ͱಉ͡ޮՌ͕ظ଴Ͱ͖Δ
    
    

    View Slide

36. ίʔυෳ੡ʹΑΔδΣωϦΫ
    ε࣮૷ʢ୯૬Խʣ
    ΠϯελϯεԽ͝ͱʹ࢖ͬͨܕΛ໊લͷ຤ඌ
    ʹ͚ͭͯඃΒͳ͍Α͏ʹ͢Δ
    let rec id x = x in
    let f = id in
    id 10;
    id "foo";
    f 3.0;
    f true;
    let rec id_int x = x in
    let rec id_string x = x in
    let rec id_float x = x in
    let rec id_bool x = x in
    let f_float = id_float in
    let f_bool = id_bool in
    id_int 10;
    id_string "foo";
    f_float 3.0;
    f_bool true;
    
    

    View Slide

37. ΦϦδφϧͷߏจʹஔ͖׵͑
    Δ
    طଘݴޠͷαϒηοτͱ࣮ͯ͠૷͍ͨ͠ػೳ
    ͕࣮૷͖ͬͨ͠ΒΦϦδφϧͷߏจʹ͔͛͢
    ͑Δ
    
    

    View Slide

38. GoCaml ͷߏจΛஔ͖׵͑Δ
    • Ҏલ C++ Ͱ͍ͭͬͯͨ͘ݴޠ Dachs ͷߏจΛ
    revise ͯ͠࠷ऴతʹ͸ஔ͖׵͍͑ͨ
    • ࢼ࡞ɿhttps://github.com/rhysd/Dachs/blob/
    master/next/compiler/syntax/grammar.go.y
    • Ruby inspired ͳߏจʢʴ JavaScript ͷ Object ͷΑ͏ͳϨ
    ίʔυܕͷߏจʣ
    
    

    View Slide

39. ·ͱΊ
    • ֤ஈ֊Ͱ͔ͬ͠ΓςετΛॻ͍ͯɼςετ͕௨ΔίϯύΠ
    ϥ͕ಈ͘ঢ়ଶΛҡ֦࣋ͯ͠ுɾ࣮૷͍ͯ͘͠
    • ࣮ࡍʹͭ͘ΓதͷίϯύΠϥΛ࢖ͬͯίʔυΛॻ͍ͯΈΔ
    • ΄͍͠ػೳ
    Λ֦ுͱ͠
    ࣮ͯ૷͢Δ
    • ΦϦδφϧ
    ͷߏจʹஔ
    ͖׵͑ͯԶ
    ݴޠʹ͢Δ
    • طଘݴޠͷ
    αϒηοτ
    ͱͯ͠࠷௿
    ݶͷػೳΛ
    ࣮૷
    
    

    View Slide