Slide 1
Slide 1 text
খ࢝͘͞ΊͯҭͯΔ
ίϯύΠϥ
builderscon 2017
Slide 2
Slide 2 text
@Linda_pp
@rhysd
• ࣗ࡞ݴޠͷίϯύΠϥΛͭͬͨ͘Γ
• Electron ͰσεΫτοϓΞϓϦΛͭͬͨ͘Γ
• Vim script Ͱ Vim ϓϥάΠϯΛͭͬͨ͘Γ͠
ͯ·͢
Slide 3
Slide 3 text
ίϯύΠϥ࣮ྔ͕ଟ͍
• ి +α ͙Β͍ͷͭͬͨ͘͜ͱ͋Δ͚Ͳ…
• ֤ػೳͷ࣮ͷํͷղઆࡌ͍ͬͯΔ͚Ͳɼ
Ͳ͏͍͚ͬͯͭͬͯ͘ྑ͍͔͔Βͳ͍
• ࣗΦϦδφϧͷʰԶݴޠʱΛࢲ͕Ͳ͏ͬ
͍͔ͯͭͬͯ͘͘ʹ͍͓ͭͯ͠͠·͢
Slide 4
Slide 4 text
ίϯύΠϥΛʰҭͯΔʱ
• طଘݴޠͷ
αϒηοτ
ͱͯ͠࠷
ݶͷػೳΛ
࣮
• ΄͍͠ػೳ
Λ֦ுͱ͠
࣮ͯ͢Δ
• ΦϦδφϧ
ͷߏจʹஔ
͖͑ͯԶ
ݴޠʹ͢Δ
Slide 5
Slide 5 text
GoCaml ͱ
• https://github.com/rhysd/gocaml
• ϛχϚϧͳ OCaml ͷαϒηοτ
• ࣮4000ߦఔ
• ੩తܕ͚ɼܕਪɼCݴޠ֦ு
• MinCaml (※) ͷ࣮ϕʔε
• ৄ͘͠ GoCon ͷࢿྉΛޚཡ͍ͩ͘͞ɿhttp://bit.ly/2wmG6Us
˞IUUQTHJUIVCDPNFTVNJJNJODBNM
Slide 6
Slide 6 text
GoCamlΛʰҭͯΔʱ
• MinCaml Λ
ࢀߟʹͯ͠
࠷ݶͷػ
ೳ࣮
• ΄͍͠ػೳΛ
֦ுɾ࣮͢
Δʢଟ૬ܕɼ
நσʔλܕɼ
ύλʔϯϚο
νʣ
• ΦϦδφϧ
ͷߏจʹஔ
͖͑Δɹ
ʢ·ͩʣ
Slide 7
Slide 7 text
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
ؔఆٛࣜ
MFUSFDGY FJOF ωετͨؔ͠ఆٛ
ϧʔϓແ͍ͷͰ࠶
ؼؔΛ͏
݅ذͷJGࣜ
JGFUIFOFFMTFF
ؔݺͼग़͠
GFFʜ
มఆٛ
MFUY FJOF
ͦͷଞɼྻɼλϓϧɼ
PQUJPOܕͳͲʜ
Ϋϩʔδϟ
Slide 8
Slide 8 text
MinCamlΛࢀߟʹͯ͠࠷ݶ
ͷػೳ࣮
ͭ͘Γ͍ͨݴޠʹ͍ۙطଘݴޠͷαϒηοτͱ
ͯ͠·࣮ͣ͢Δ
ݴޠ༷ͳΔ͘γϯϓϧʹอ͍ͪͨ&ύ
λʔϯϚονܕਪ͕΄͍͠ → MLܥݴޠʁ
Slide 9
Slide 9 text
ͳͥطଘݴޠͷαϒηοτͱ͠
ͯ·࣮ͣ͢Δͷ͔
• ߏจͷσβΠϯΛઌʹΖ͏ͱͯͭ͠·͔ͣͳ͍
• ߏจղੳίϯύΠϥͷೖΓޱͰ͔͠ͳ͍ͷʹɼͦ͜ʹ
ؾΛऔΒΕ͕ͪ
• ʮͲ͏͍͏ߏจ͕ྑ͍ͷ͔࣮ࡍʹॻ͍ͯಈ͔ͯ͠Έͳ͍
ͱͳ͔ͳ͔͔Βͳ͍ 㲗 ίϯύΠϥΛ࣮͠ͳ͍ͱಈ͔
ͤͳ͍ʯͱ͍͏δϨϯϚΛղফ͢Δ
• ·ͣಈ͘ίϯύΠϥΛ࣮͔ͯ͠Βɼಈ͔͠ͳ͕Βޙ͔
ΒࣗͷݴޠͷߏจΛσβΠϯ͍ͯ͘͠ํ
Slide 10
Slide 10 text
ͳͥطଘݴޠͷαϒηοτͱ͠
ͯ·࣮ͣ͢Δͷ͔
• طଘݴޠطʹಈ͍͍ͯΔ࣮͕͋Δ
• ઈରʹ࣮Ͱ͖Δ҆৺ײ͕͋Δ
• ύʔαͷ࣮Λ·ͣྲྀ༻Ͱ͖Δ
• ࣮ʹ٧·ͬͨ࣌ʹطଘݴޠͷॲཧܥʢGoCaml ͷ߹
OCamlʣͷڍಈɾ࣮ΛࢀߟʹͰ͖Δ
• ಈ͘࠷ݶͷ࣮Λૣ࣮֬͘ʹͭ͘Δͱ͜ΖΛୈҰʹ͢
Δ
Slide 11
Slide 11 text
GoCaml ͷίϯύΠϥ֓ཁ
ιʔε
ίʔυ
τʔΫ
ϯྻ
நߏ
จ
தؒද
ݱ
--7.
*3
Ξηϯ
ϒϦ T
ΦϒδΣ
Ϋτ P
࣮ߦϑΝ
Πϧ
ϥϯλ
ΠϜ P
ϥϯλ
ΠϜ D
ϦϯΧ
ࣈ۟ղੳ ߏจղੳ
Ћม
ܕਪ
,ਖ਼نԽ
Ϋϩʔδϟม
(PͰࣗલ࣮
--7.͕όοΫΤϯυ
$Ͱ࣮
MJCHD
ৄ͘͠IUUQCJUMZXN(6T
࠷దԽ
Slide 12
Slide 12 text
ߏจ
Ћม
ܕਪ
ʢܕνΣοΫʣ
தؒදݱͷϑΥʔ
Ϛοτม
Ϋϩʔδϟ
ม
ιʔείʔυΛߏจʹύʔε͢Δ
ʢgoyaccʣ
શͯͷγϯϘϧʹҰҙͷ ID ΛৼΔɽείʔ
ϓΛղܾ
୯૬ܕͷγϯϓϧͳܕγεςϜɽHMܕਪ
ΞϧΰϦζϜΛͬͯਪ
ߏ͔ΒSSAʢ୯Ұೖʣܗࣜͷ໋ྩྻ
ม͢Δ
ωετͨؔ͠ɾΫϩʔδϟͷղܾ
Slide 13
Slide 13 text
GoCaml ୈ1ஈ֊ͷ࣮
• ϕʔεͱͳΔ࠷ݶͷػೳΛ࣋ͬͨݴޠΛૣ࣮֬͘ʹͭ͘Δ
• MinCaml ڭҭ༻ݴޠͳͷͰ࣮͕γϯϓϧͰࢀߟʹ͍͢͠ɽόοΫ
ΤϯυLLVMΛ͏
• ΞϧϑΝมɼܕਪɼΫϩʔδϟมɼதؒݴޠมɼLLVM IRมͳ
Ͳͷ֤ஈ֊Ͱ͔ͬ͠ΓςετΛॻ͘ʢ4000ߦͷίʔυϕʔεʹରͯ͠477
ςετέʔεʣ
• ಈ͘Α͏ʹͳͬͨΒ࣮ࡍʹॻ͍ͯΈͯυοάϑʔσΟϯά͢Δ
ʢquicksort, brainfxxk, n-queens, xorshift128+, …)
• ৄ͘͠ GoCon2017 ͷεϥΠυ: http://bit.ly/2wmG6Us
Slide 14
Slide 14 text
΄͍͠ػೳΛ֦ுɾ࣮͢Δ
࠷ݶͷػೳΛ࣮ͨ͠ίϯύΠϥΛϕʔεʹ΄͍͠ػ
ೳΛ֦ு͍ͯ͘͠
ɾଟ૬ܕʢˡࠓճ͜ͷ࣮ʹ͍ͭͯհ͠·͢ʣ
ɾநσʔλܕ
ɾύλʔϯϚον
ɾ…
Slide 15
Slide 15 text
ଟ૬ͳܕγεςϜͱ
ͲΜͳܕʹஔ͖͑ͯྑ͍ϓϨʔεϗϧμ
ͳܕΛѻ͑ΔܕγεςϜ
(* ܕ '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 -> ();
ͭͷ͕ෳͷܕΛ࣋ͯΔΑ͏ʹͳΔ
bB bB
ˣ
JOU JOU
CPPM CPPM
ʜ
Slide 16
Slide 16 text
ଟ૬తͳܕγεςϜͷ࣮
• ܕਪث͕ଟ૬తͳܕΛਪͰ͖ΔΑ͏ʹ֦ு
• MinCaml ͷܕਪ୯૬ܕ
• ଟ૬ͳܕͷͷίʔυੜΛͰ͖ΔΑ͏ʹ֦ு
• LLVM IR ʹଟ૬ܕແ͍
• ͳΜΒ͔ͷํ๏Ͱଟ૬తͳΛੜ͞ΕΔΞη
ϯϒϦίʔυͰදݱ͢Δඞཁ͕͋Δ
Slide 17
Slide 17 text
ଟ૬తͳܕਪΞϧΰϦζϜΛ
ௐࠪ
• Algorithm W
• Ұ൪ΦʔιυοΫε
• ܕू߹ͱଋറ͞ΕͨܕมͷஔදΛͬͯ୯ҰԽ͢Δ
• Algorithm M
• ߏΛϘτϜΞοϓʹḷͬͯਪ͢Δ Algorithm W Λτοϓμϯʹվྑ
ͨ͠ͷɽޮΤϥʔϝοηʔδ͕վળʢW ͷٯͳͷͰ Mʣ
• Level-based Algorithm W
• ܕมʹϨϕϧʢfreshnessʣΛಋೖ͢Δ͜ͱͰ Algorhtim W ͷΞϧΰϦζϜ
Λγϯϓϧʹ͠ɼޮతʹ͢ΔɽOCaml Ͱ࠾༻͞Ε͍ͯΔ
Slide 18
Slide 18 text
Level-based Algorithm W
• let ࣜͰͷมଋറͰͷΈ͕ଟ૬ʹͳΔ͜ͱ
ʹண͠ɼ͋Δܕม͕ʮͲΕ͚ͩ࠷ۙͷ let
ࣜͰଋറ͞Εͨͷ͔ʯΛද͢Ϩϕϧͱ͍͏
Λ֤ܕมʹ࣋ͨͤΔɽ͕େ͖͍΄Ͳ࠷
ۙଋറ͞Εͨͷ
• paper: http://gallium.inria.fr/~remy/ftp/eq-
theory-on-types.pdf
Slide 19
Slide 19 text
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ΛճผͷܕͷҾͰݺͼ
ग़ͯ͠ΈΔ
Slide 20
Slide 20 text
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
()
Slide 21
Slide 21 text
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
࠷ॳϨϕϧ͔Βελʔτ
Slide 22
Slide 22 text
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Ҿͷؔ
ͱ͍͏͜ͱ͔͔͠Βͳ͍
Slide 23
Slide 23 text
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
Slide 24
Slide 24 text
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
ʢ୯ҰԽʣ
Slide 25
Slide 25 text
൚ԽʢGeneralizationʣ
มΛఆٛͨ͠ let ࣜͷϨϕϧΑΓେ͖͍Ϩϕϧͷ
ܕมҙͷܕ͕ೖΔଟ૬ܕͱͯ֬͠ఆͤ͞Δ
?c(2) -> ?a(1) * ?c(2)ɹɹɹ'c -> ?a(1) * 'c
ʢݱࡏͷϨϕϧ: 1ʣ
Slide 26
Slide 26 text
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ʣΛฦ͢
Slide 27
Slide 27 text
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
ʢ୯ҰԽʣ
Slide 28
Slide 28 text
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ࣜͷϨϕϧͳͷͰશͯ
ͷະ֬ఆͳܕมΛଟ૬ܕʹ֬ఆ͢Δ
Slide 29
Slide 29 text
ΠϯελϯεԽ
ʢ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 *)
Slide 30
Slide 30 text
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 bD bB bD
ΛΠϯελϯεԽ
ҾJOUͳͷͰ F
JOU
ͰɼΓܕ͔ΒQBJSͷܕ
G
JOU G
ɽ͜Ε
Λ൚Խ
Slide 31
Slide 31 text
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
bG JOU bGΛΠϯελϯεԽ
ҾCPPMͳͷͰ F
CPPMͰɼΓܕ͔ΒQͷܕ
JOU CPPMɽࠓճະ֬ఆͷ
ܕม͕ແ͍ͷͰ൚Խෆཁ
Slide 32
Slide 32 text
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 bD bB bD
ΛΠϯελϯεԽ
ͭͷNBLF@QBJSݺͼ
ग़͔͠Β
Slide 33
Slide 33 text
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
bG JOU bGΛΠϯελϯεԽ
QBJSݺͼग़͔͠Β
Slide 34
Slide 34 text
ଟ૬ܕܕਪͷ࣮·ͱΊ
• จͷࢀর࣮Λݟͳ͕Β࣮ʢଞʹ occur check ͰϨ
ϕϧΛௐઅ͢ΔͳͲͷॲཧ͕͋Δʣ
• ଞͷܕਪͷ࣮ͷςετσʔλΛྲྀ༻͢Δ
• ޒेཛྷઌੜͷ՝ͷςετέʔεͳͲ(※1)
• ͳ͔ͥ ML ͕ଟ͍ͷͰͦͷ··͑Δ
• ࠷ॳͷஈ֊Ͱ͔ͬ͠ΓςετΛॻ͍͓ͯ͘ͱ֦ுָʹͳ
Δ
IUUQTXXXGPTLVJTLZPUPVBDKQdJHBSBTIJDMBTTJTMFXUFTUDBTFTIUNM
Slide 35
Slide 35 text
δΣωϦΫεͷίʔυੜͷ࣮
Λௐࠪ
• શͯͷΛ1ϫʔυͰදݱ͢ΔʢOCaml, SML/NJ ͳͲʣ
• int float ͦͷ··ɼͦΕҎ֎ͷώʔϓͳͲʹͱͬͯϙΠϯλͰѻ͏
• ਖ਼֬ͳ GC ͷͨΊɼϙΠϯλ͔ͦ͏Ͱͳ͍͔அ͢ΔͷʹԼҐ̍ϏοτʹλάΛೖΕΔ
ඞཁ͕͋Δ
• ଟ૬ͳ͕औΔܕ͝ͱʹίʔυΛෳ͢Δʢmlton, Crystal, C++ (, Rust) ͳͲʣ
• i.e. id: ‘a -> ‘a ͕ int -> int ͰΠϯελϯεԽ͞Ε͍ͯΔͳΒ id_int: int -> int Λੜ
• ࣮ߦ࣌ͷΦʔόʔϔουগͳ͍͕ίʔυαΠζ͕രൃ͠͏ΔɽׂίϯύΠϧ͕͍͠
• ܕΫϥεΛఆٛ͠ɼܕΫϥε͝ͱͷ࣮ΛؔͷࣙॻͰ͢ʢHaskell (,Rust) ͳͲʣ
• ࣙॻ͔Βݺͼग़ؔ͢ΛҾ͍ͯ͘ΔΦʔόʔϔου͕͋Δ͕ɼ͍ؔΠϯϥΠϯԽʹ
ΑΓίʔυෳͱಉ͡ޮՌ͕ظͰ͖Δ
Slide 36
Slide 36 text
ίʔυෳʹΑΔδΣωϦΫ
ε࣮ʢ୯૬Խʣ
ΠϯελϯεԽ͝ͱʹͬͨܕΛ໊લͷඌ
ʹ͚ͭͯඃΒͳ͍Α͏ʹ͢Δ
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;
Slide 37
Slide 37 text
ΦϦδφϧͷߏจʹஔ͖͑
Δ
طଘݴޠͷαϒηοτͱ࣮͍ͯͨ͠͠ػೳ
͕࣮͖ͬͨ͠ΒΦϦδφϧͷߏจʹ͔͛͢
͑Δ
Slide 38
Slide 38 text
GoCaml ͷߏจΛஔ͖͑Δ
• Ҏલ C++ Ͱ͍ͭͬͯͨ͘ݴޠ Dachs ͷߏจΛ
revise ͯ͠࠷ऴతʹஔ͖͍͑ͨ
• ࢼ࡞ɿhttps://github.com/rhysd/Dachs/blob/
master/next/compiler/syntax/grammar.go.y
• Ruby inspired ͳߏจʢʴ JavaScript ͷ Object ͷΑ͏ͳϨ
ίʔυܕͷߏจʣ
Slide 39
Slide 39 text
·ͱΊ
• ֤ஈ֊Ͱ͔ͬ͠ΓςετΛॻ͍ͯɼςετ͕௨ΔίϯύΠ
ϥ͕ಈ͘ঢ়ଶΛҡ֦࣋ͯ͠ுɾ࣮͍ͯ͘͠
• ࣮ࡍʹͭ͘ΓதͷίϯύΠϥΛͬͯίʔυΛॻ͍ͯΈΔ
• ΄͍͠ػೳ
Λ֦ுͱ͠
࣮ͯ͢Δ
• ΦϦδφϧ
ͷߏจʹஔ
͖͑ͯԶ
ݴޠʹ͢Δ
• طଘݴޠͷ
αϒηοτ
ͱͯ͠࠷
ݶͷػೳΛ
࣮