Purely Functional Data Structures chap.10.1

Transcript

1. Purely Functional Data Structures chap.10.1 Structural Decomposition @shtaag 2012೥11݄3೔౔༵೔
2. Data-Structural Bootstrappingͷ࿩ 2012೥11݄3೔౔༵೔
3. ͱΓ͋͑ͣ͜Μͳͷ ʢStructural Decompositionͷྫʣ data Seq a = NIL | CONS’ a (Seq (a , a)) 2012೥11݄3೔౔༵೔
4. ͱΓ͋͑ͣ͜Μͳͷ ʢStructural Decompositionͷྫʣ data Seq a = NIL | CONS’ a (Seq (a , a)) ܕaͷSeqͩͬͨ͸͕ͣ ܕ(a,a)ʹมΘͬͯΔʂ 2012೥11݄3೔౔༵೔
5. CONS’ a (Seq (a, a)) CONS’ (a, a) (Seq ((a, a), (a, a)) CONS’ ((a, a), (a, a)) (Seq (((a, a), (a, a)), ((a, a), (a, a))) CONS’ (((a, a), (a, a)), ((a, a), (a, a))) (Seq ((((a, a), (a, a)), ((a, a), (a, a))), (((a, a), (a, a)), ((a, a), (a, a)))) Polymorphic Recursion 2012೥11݄3೔౔༵೔
6. ҎԼɺ༻ޠ 2012೥11݄3೔౔༵೔
7. BootStrapping bootstrapping a complete solution from an incomplete solution 2012೥11݄3೔౔༵೔
8. structural decomposition incompleteͳσʔλߏ଄͔Β completeͳ΋ͷΛbootstrap structural abstraction inefficientͳσʔλߏ଄͔Β efficientͳߏ଄Λbootstrap 2012೥11݄3೔౔༵೔
9. uniform recursion data List a = NIL | CONS a (List a) non-uniform recursion data Seq a = NIL | CONS’ a (Seq (a , a)) 2012೥11݄3೔౔༵೔
10. Կ͕خ͍͠ʁ ܕͰߏ଄ΛറΔ͜ͱͰΞϧΰϦζϜ͕෼͔Γ΍͘͢ ͳΔ ઌఔͷseq͸ϊʔυ͸ཁૉΛ2ͭ࣋ͭ͜ͱΛอূ ͍ͯ͠Δ sizeS (CONS’ (x, ps)) = 1 + 2 * sizeS ps 2012೥11݄3೔౔༵೔