PLT-03 Haskell

Transcript

1. pineapple.cc ۚ୩Ұ࿕ʢ௕࡚େֶ৘ใσʔλՊֶ෦ʣ )BTLFMM ϓϩάϥϛϯάݴޠ࿦
2. pineapple.cc
3. pineapple.cc ϓϩάϥϛϯάݴޠ
4. pineapple.cc 5*0#&
   *OEFY April 2024  1ZUIPO
   
    $
   
    $
   
    +BWB
   
    $
   
    +BWB4DSJQU
   &$."4DSJQU
   
    (P
   
    7JTVBM
   #BTJD
   
    42-
   
    'PSUSBO
   
    %FMQIJ
   0CKFDU
   1BTDBM
   
    "TTFNCMZ
   MBOHVBHF
   
    3VCZ
   
    4XJGU
   
    4DSBUDI
   
    ."5-"#
   
    1)1
   
    ,PUMJO
   
    3VTU
   
    3
   
8. Paper Tuens
9. pineapple.cc ܁Γฦ͠ ৚݅෼ذ (1950-1960s) όονॲཧ ߏ଄Խ (1960-1970s) FORTRAN Pascal LISP ML ؔ਺ܕͱ͍͏ߟ͑ํ ΦϒδΣΫτࢦ޲ (1970-1980s) C++
11. pineapple.cc f(n) = n (mod 7) g(n) = 3f ( 7 ∑ k=1 kn ) Math
12. pineapple.cc program kyoto; uses math; function f(n: real): real; var r: real; d: real; begin r := floor(n / 7); d := r * 7; f := n - d end; { f } function g(n: integer): real; function expt(k, n: integer): real; var i: integer; r: real; begin r := 1; for i := 1 to n do r := r * k; expt := r end; var k: integer; a: real; begin a := 0; for k := 1 to 7 do a := a + expt(k, n); g := 3 * f(a) end; { g } var i: integer; begin for i := 1 to 11 do writeln(g(i)) end. Pascal
13. pineapple.cc (use srfi-1) (define (f n) (remainder n 7)) (define (g n) (* 3 (f (fold (lambda (k a) (+ a (expt k n))) 0 (iota 7 1))))) (print (map g (iota 13 1))) Scheme
14. pineapple.cc (0..13).each{|n| puts "g(#{n})=#{3*(((1..7).map{|k| k**n}.inject(0){|s,i| s+i})%7)}"} Ruby
15. pineapple.cc f :: Int -> Int f n = n `mod` 7 g :: Int -> Int g n = 3 * f (sum (map (\k -> k^n) [1..7])) main = print (map g [1..13]) f(n) = n (mod 7) g(n) = 3f ( 7 ∑ k=1 kn ) Haskell
16. pineapple.cc )BTLFMMͷ४උ
17. pineapple.cc %FNP
18. pineapple.cc (JU)VCͷ४උ
19. pineapple.cc %FNP
20. pineapple.cc @kanaya