Share
Embed
TaPL 読書会 20. Recursive Types
スライド中の URL:
https://gist.github.com/4206577
http://d.hatena.ne.jp/goth_wrist_cut/20081204/1228374214
daimatz
December 05, 2012
Transcript
24 slides
-
3FDVSTJWF5ZQFT ‣ Ϧετߏ࣍ͷΑ͏ʹߟ͑Δ͜ͱ͕Ͱ͖Δ ‣ ͔͜͠͠Ε྆ลʹ/BU-JTUΛؚΉͨΊఆٛͱ͍͑ͳ͍ɻ ͜ͷΑ͏ͳ࠶ؼΛද͢ه߸ͱͯ͠Λ͍ɺ࣍ͷΑ͏ʹද͢ ‣ ײతʹʮ/BU-JTU ͱ͍͏ํఔࣜΛຬͨ͢Α͏ͳແݶͷܕͰ͋Δʯͱ͍͏͜ͱ 3
µ NatList = h nil : Unit, cons : { Nat, NatList }i NatList = µX. h nil : Unit, cons : { Nat, X }i X = h nil : Unit, cons : { Nat, X }i -
-JTUT ‣ ϦετઌͷྫͷΑ͏ʹॻ͚Δ 5 nil = h nil = unit
i as NatList cons = n : Nat. l : NatList. h cons = { n, l }i as NatList isnil = l : NatList. case l of h nil = u i ) true | h cons = p i ) false hd = l : NatList. case l of h nil = u i ) 0 | h cons = p i ) p. 1 tl = l : NatList. case l of h nil = u i ) 1 | h cons = p i ) p. 2 sumlist = fix ( s : NatList ! Nat. l : NatList. if isnil l then 0 else plus ( hd l ) ( s ( tl l ))) data NatList = Nil () | Cons (Nat, NatList) deriving (Eq, Show) nil :: NatList nil = Nil () cons :: Nat -> NatList -> NatList cons = \n -> \l -> Cons (n, l) isnil :: NatList -> Bool isnil = \l -> case l of Nil _ -> True Cons _ -> False hd :: NatList -> Nat hd = \l -> case l of Nil _ -> 0 Cons p -> fst p tl :: NatList -> NatList tl = \l -> case l of Nil _ -> l Cons p -> snd p sumlist :: NatList -> Nat sumlist = \l -> if isnil l then 0 else hd l + sumlist (tl l) -
)VOHSZ'VODUJPOT ‣ ҾΛ͍ͭ͘ͰऔΕΔؔ )BTLFMMͰॻ͚ͳ͍ͬΆ͍ 0DDVST$IFDL w 9G 9
ͷΑ͏ͳؔ࠶ؼ͕ࢭ·Βͳ͍ͷͰఆٛͰ͖ ͳ͍ w 1SPMPHͷ୯ҰԽ VOJpDBUJPO ͷͱ͖ʹΑ͘ى͜Δ 6 Hungry = µA. Nat ! A f = fix ( f : Nat ! Hungry. n : Nat. f) data Hungry = Hungry (Nat -> Hungry) -- hungry = \(Hungry n) -> hungry -
4USFBNT ‣ ҙͷVOJUܕͷΛҾʹऔΓɺͦͷͨͼʹࣗવͱετ ϦʔϜͷϖΞΛฦ͢ͷ ετϦʔϜʹର͢ΔIFBE UBJMͱɺҎ্ͷࣗવΛੜ ͢ΔແݶετϦʔϜVQGSPN 8 Stream
= µA. Unit ! { Nat, A } hd = s : Stream. ( s unit ) . 1 tl = s : Stream. ( s unit ) . 2 upfrom 0 = fix ( f : Nat ! Stream. n : Nat. : Unit. { n, f ( succ n )}) 0 data Stream a = Stream (() -> (Nat, Stream a)) hd_s :: Stream Nat -> Nat hd_s = \(Stream s) -> fst (s ()) tl_s :: Stream Nat -> Stream Nat tl_s = \(Stream s) -> snd (s ()) upfrom0 :: Stream Int upfrom0 = f 0 where f n = Stream (\_ -> (n, f (n+1))) -
1SPDFTT ‣ ετϦʔϜͷҰൠԽͱͯ͠ϓϩηε͕ߟ͑ΒΕΔ ϓϩηεࣗવΛड͚औΓࣗવͱ৽͍͠ϓϩηεͷϖ ΞΛฦ͢ ‣ ͦΕ·Ͱʹ༩͑ΒΕͨͷΛܭࢉ͢Δϓϩηε Process =
µA. Nat ! { Nat, A } curr = s : Process. ( s 0) . 1 send = n : Nat. s : Process. ( s n ) . 2 p = fix ( f : Nat ! Process. acc : Nat. n : Nat. { acc + n, f ( acc + n )}) 0 data Process a = Process (Nat -> (Nat, Process a)) curr :: Process a -> Nat curr = \(Process s) -> fst (s 0) send :: Nat -> Process a -> Process a send = \n -> \(Process s) -> snd (s n) process :: Process a process = f 0 where f acc = Process (\n -> (acc+n, f (acc+n))) -
1SPDFTT ‣ ϓϩηεͷ͍ํ ͷΑ͏ʹ͢Δ 10 curr (send 20 (send 3
(send 5 p))) -
0CKFDUT 12 data Counter = Counter { get :: Nat,
inc :: () -> Counter, dec :: () -> Counter } data X = X { x :: Nat } counter :: Counter counter = create $ X { x = 0 } where create s = Counter { get = x s, inc = \_ -> create $ X { x = x s + 1 }, dec = \_ -> create $ X { x = x s - 1 } } -
3FDVSTJWF7BMVFTGSPN 3FDVSTJWF5ZQFT ‣ ࠶ؼܕΛͬͯෆಈԋࢉࢠΛఆٛͰ͖Δɻ ʹܕΛ͚Δɻ YY ͱ͍͏ͱ͜Ζ͔ΒɺYؔܕ͔ͭͦͷҾͷܕͰͳ ͚Ε͍͚ͳ͍Θ͚͕ͩɺ͕ͦͪ͜ΐ͏Ͳ࠶ؼܕͷఆٛʹ ͯ·Δ
‣ ڧਖ਼نԽੑΛյ͢ྫ͕࡞ΕΔ ͜ͷؔʹVOJUΛ͢ͱධՁ͕ࢭ·Βͳ͍ɻ ‣ )BTLFMMͰ0DDVST$IFDLͷ͓͔͛Ͱ͜Μͳྫ ॻ͚ͳ͍ 13 fix = f. ( x. f ( x x )) ( x. f ( x x )) -
'PSNBMJUJFT ‣ ࠶ؼͷఆࣜԽͷํ๏ͭ͋Δɻ FRVJSFDVSTJWFBQQSPBDI JTPSFDVSTJWFBQQSPBDI ‣ ຊ࣭తͳҧ͍ʹ͍ͭͯͱͷؔΛߟ ͑Δ
۩ମతʹɺͱͦΕΛҰஈ֊؆ͨ͠ ͷؔ 15 µX.T [X 7! µX.T] T NatList NatList = < nil : Unit, cons : { Nat, NatList } > -
FRVJSFDVSTJWFBQQSPBDI ‣ ͱ ‣ ͭͷදݱ͕ఆٛͱͯ͠ಉ͡Ͱ͋Δ ৗʹೖΕସ͑Մೳ ͱ͢Δ ʮ͋Δܕͷ߲͕ɺҧ͏ܕͷ߲Λظ͢ΔؔͷҾͱͯ͠ڐ ͞ΕΔ͜ͱʯΛอূ͢ΔͷUZQFDIFDLFSͷׂͱ͢Δ
‣ རɿ͜Ε·Ͱݟ͖ͯͨܕγεςϜͱൺͯʮ࠶ؼܕʹΑͬͯ ܕͷදݱ͕࠶ؼతʹͰ͖ΔΑ͏ʹͳΔʯͱ͍͏͜ͱ͚͕ͩҧ͏ ܕͷؼೲ๏ʹΑΒͳ͍ఆٛఆཧɺূ໌͜Ε·Ͱͱಉ͡Α ͏ʹͰ͖Δ ‣ JOpOJUFTUSVDUVSFΛͦͷ··Ͱѻ͑ͳ͍ͨΊɺ UZQFDIFDLFSͷׂେมʹͳΔ ͞ΒʹଞͷܕγεςϜΛಋೖ͢ΔͱෳࡶʹͳΓɺཧ্͠ ͘ͳͬͨΓܕνΣοΫͷܾఆෆೳੑʹͭͳ͕Δ 16 µX.T [X 7! µX.T] T -
JTPSFDVSTJWFBQQSPBDI ‣ ͱ ‣ ͭͷදݱҟͳΔ͕ಉܕ JTPNPSQIJD Ͱ͋Δͱͯ͠ѻ͏ ‣ ܗࣜతʹͷల։ɺຊମͰ͋Δ5ͷதʹݱΕΔ͢ ͯͷ9ΛͰஔ͖͑ͨͷ
ʹͳΔ ྫ͑ɺ ʹల։Ͱ͖Δɻ 17 µX.T µX.T [X 7! µX.T] T µX. h nil : Unit, cons : { Nat, X }i µX.T [X 7! µX.T] T h nil : Unit, cons : { Nat, µX. h nil : Unit, cons : { Nat, X }i -
JTPSFDVSTJWFBQQSPBDI ‣ ࠶ؼܕʹର͢ΔͭͷؔΛಋೖ͢Δ ͭͷಉܕͰ͋ΔܕΛߦ͖དྷ͢ΔͷͰɺϓϦϛςΟϒͱ͠ ͯ༻ҙ͞ΕΔ 18 unfold [ µX.T
] : µX.T ! [ X 7! µX.T ] T fold [ µX.T ] : [ X 7! µX.T ] T ! µX.T µX.T -
JTPSFDVSTJWFBQQSPBDI ‣ GPMEͱVOGPME͕ରԠ͢Δ͜ͱنଇͰΘ͔Δ ରԠͨ͠VOGPMEʹૺ۰ͨ͠߹GPMEΛফ͢ w ͜ͷํ๏ͷ࣮ʹ৽ͨͳܕνΣοΫΞϧΰϦζϜ͕ඞ ཁ ষ
GPMEͱVOGPMEͷܕऍ͕ҧ͍͍ͬͯͷɺ࣮ߦ࣌ʹܕ νΣοΫΛ͢Δ͔Βɻͨͩ͠XFMMUZQFEͳϓϩάϥϜͷධ ՁͳΒɺ͜ͷنଇΛద༻͢Δͱ͖ʹͭͷܕಉ͡ͷͣ 20 E-Unfldfld -
JTPSFDVSTJWFBQQSPBDI ‣ ͜ͷํ๏࠶ؼܕΛ͏ͱ͖ʹGPMEͱVOGPMEΛ໌ࣔ͠ͳ͚ ΕͳΒͳ͍ ‣ ͔࣮͠͠ࡍʹɺଞͷه๏ʹࠞͥͯ͜ΕΒͷهड़ΛʮӅ͢ʯ ͜ͱ͕Ͱ͖Δɻ ྫ͑.-ͰEBUBUZQFఆٛ࠶ؼܕͷಋೖΛ҉ࣔ͢Δ w
ͦͷܕͷΛ࡞ΔͨΊʹίϯετϥΫλΛ͏ͱ͖ʹ શͯGPME͞ΕɺύλʔϯϚονʹݱΕΔͯ͢ͷίϯε τϥΫλVOGPME͞ΕΔ ಉ༷ʹ+BWBͰΫϥεఆ͕ٛ࠶ؼܕͷಋೖΛ҉ࣔ͢Δ w ΦϒδΣΫτͷϝιουݺͼग़͕͠VOGPMEΛߦ͏ 21 -
'PSNBMJUJFT ‣ .-Ͱॻ͍ͨ/BU-JTUͷྫͱ࣮ࡍͷҙຯΛࣔ͢ 22 type nlbody = Nil of unit
| Cons of int * nlbody let isnil l = match l with Nil (_) -> true | Cons (_) -> false let hd l = match l with Nil (_) -> 0 | Cons (i1, _) -> i1 let tl l = match l with Nil (_) -> l | Cons (_, tl) -> tl NLBody = h nil : Unit, cons : { Nat, NatList }i nil = fold [ NatList ](h nil = unit i as NLBody cons = n : Nat. l : NatList. fold [ NatList ]h cons = { n, l }i as NLBody isnil = l : NatList. case unfold [ NatList ] l of h nil = u i ) true | h cons = p i ) false hd = l : NatList. case unfold [ NatList ] l of h nil = u i ) 0 | h cons = p i ) p. 1 tl = ... -
4VCUZQJOH ‣ ࠶ؼܕͱଞͷϝδϟʔͳܕମܥͷΈ߹Θͤʁ ͜͜Ͱ෦ܕɻ/BUͷ෦ܕͰ͋Δ&WFOΛߟ͑ͯɺ ͱͷؔʁ ؆୯ʹߟ͑Δํ๏ɺFRVJSFDVSTJWFʹѻ͏͜ͱ 23 µX.Nat
! (Even ⇥ X) µX.Even ! (Nat ⇥ X) -
4VCUZQJOH ‣ ઌͷྫ྆ํͱϓϩηεͷܕͱݟΔ͜ͱ͕Ͱ͖Δ Λ༩͑ΒΕͯɺผͷͱ৽͍͠ϓϩηεΛฦ͢ ҙͷࣗવΛऔͬͯۮΛੜΈग़͢ ҙͷࣗવΛੜΈग़͕͢ɺۮΛ༩ ͑ΒΕΔͱظ͞ΕΔ
ؔͷ෦ܕͷΛߟ͑Δͱɺײతʹલऀޙऀͷαϒλ Πϓͱظ͞ΕΔɻৄ͘͠ষɻ 24 µX.Nat ! (Even ⇥ X) µX.Nat ! (Even ⇥ X)