関数型プログラミングの世界

Welcome to the world of the functional programming Kenta Murata 2011.06.11 #osc11doMonday, June 13, 2011 1

Monday, June 13, 2011 2

mrkn Ruby Rubyhttp://www.flickr.com/photos/koichiroo/5244581973/Monday, June 13, 2011 3

Monday, 12010 3 June 13, 2011 4

Welcome to the world of the functional programming Kenta Murata 2011.06.11 #osc11doMonday, June 13, 2011 5

Functional ProgrammingMonday, June 13, 2011 6

Imperative Programming Procedural ProgrammingMonday, June 13, 2011 7

Fortran Basic Cobol Algol C C++ Java LISPMonday, June 13, 2011 8

High-order Functions Lazy EvaluationMonday, June 13, 2011 11

Functions as Building Blocks for constructing programshttp://www.flickr.com/photos/stevendepolo/5597111652Monday, June 13, 2011 12

Functions as Glue for bonding functionshttp://www.flickr.com/photos/pseudoego/5417919481Monday, June 13, 2011 13

A lot of programming languages available for functional programminghttp://www.flickr.com/photos/32712959@N07/3222623206Monday, June 13, 2011 14

High-order FunctionsMonday, June 13, 2011 18

Haskell [ ] e.g. [] [1, 2, 3] (:) e.g. [1] => 1 : [] [1, 2, 3] => 1 : 2 : 3 : []Monday, June 13, 2011 21

(:) LISP cons cons Haskell cons :: a -> [a] -> [a] -- cons x [] = [x] -- cons x1 (x2:xs) = x1 : (cons x2 xs)Monday, June 13, 2011 22

cons :: a -> [a] -> [a] -- cons x [] = [x] -- cons x1 (x2:xs) = x1 : (cons x2 xs) // C++ template <typename a> std::list<a> cons(a const& x, std::list<a> const& xs);Monday, June 13, 2011 23

cons :: a -> [a] -> [a] -- cons x [] = [x] -- cons x1 (x2:xs) = x1 : (cons x2 xs) e.g. cons 0 [1,2,3,4] => x1 0, x2 1, xs [2,3,4]Monday, June 13, 2011 24

(Int) sum sum :: [Int] -> Int sum [] = 0 sum (n:ns) = n + (sum ns)Monday, June 13, 2011 25

cons sum cons :: a -> [a] -> [a] cons x [] = [x] cons x1 (x2:xs) = x1 : (cons x2 xs) sum :: [Int] -> Int sum [] = 0 sum (n:ns) = n + (sum ns)Monday, June 13, 2011 26

cons x [] = [x] sum [] = 0 cons x1 (x2:xs) = x1 : (cons x2 xs) sum (n :ns) = n + (sum ns)Monday, June 13, 2011 27

(Int) product product :: [Int] -> Int product [] = 1 product (n:ns) = n * product nsMonday, June 13, 2011 28

cons x [] = [x] sum [] = 0 product [] = 1 cons x1 (x2:xs) = x1 : (cons x2 xs) sum (n :ns) = n + (sum ns) product (n :ns) = n * (product ns)Monday, June 13, 2011 29

(Bool) allTrue allTrue :: [Bool] -> Bool allTrue [] = True allTrue (b:bs) = b && allTrue nsMonday, June 13, 2011 30

(Bool) anyTrue anyTrue :: [Bool] -> Bool anyTrue [] = False anyTrue (b:bs) = b || anyTrue nsMonday, June 13, 2011 31

cons x [] = [x] sum [] = 0 product [] = 1 allTrue [] = True anyTrue [] = False cons x1 (x2:xs) = x1 : (cons x2 xs) sum (n :ns) = n + (sum ns) product (n :ns) = n * (product ns) allTrue (b :bs) = b && (allTrue bs) anyTrue (b :bs) = b || (anyTrue bs)Monday, June 13, 2011 32

reduce :: (a -> [a] -> a) -> a -> [a] -> a reduce f x0 [] = x0 reduce f x0 (x1:xs) = f x1 (reduce f x0 xs) sum = reduce (+) 0 product = reduce (*) 1 allTrue = reduce (&&) True anyTrue = reduce (||) FalseMonday, June 13, 2011 33

cons reduce append :: [a] -> [a] -> [a] append xs ys = reduce (:) ys xs append [1,2] [3,4] -> reduce (:) [3,4] [1,2] -> reduce (:) [3,4] (1:2:[]) -> 1 : (reduce (:) [3,4] (2:[])) -> 1 : 2 : (reduce (:) [3,4] []) -> 1 : 2 : [3,4] -> [1,2,3,4]Monday, June 13, 2011 34

-- Haskell reduce (+) 0 [1..10] // C++ int ns[] = {1,2,3,4,5,6,7,8,9,10}; std::accumulate(ns, ns + 10, 0, &std::plus<int>); # Ruby [*1..10].inject(0, :+)Monday, June 13, 2011 41

Lazy EvaluationMonday, June 13, 2011 43

http://www.sampou.org/haskell/article/whyfp.htmlMonday, June 13, 2011 46

http://www.infoq.com/interviews/john-hughes-fpMonday, June 13, 2011 47

http://weblog.raganwald.com/2007/03/why-why-functional-programming-matters.htmlMonday, June 13, 2011 48

language evaluation pureness Haskell lazy pure Concurrent Clean lazy pure OCaml strict impure F# strict impure Scheme strict impureMonday, June 13, 2011 49

language evaluation pureness Haskell lazy pure Concurrent Clean lazy pure OCaml strict impure F# strict impure Scheme strict impureMonday, June 13, 2011 50

Monday, 12010 3 June 13, 2011 52

A lot of programming languages available for functional programminghttp://www.flickr.com/photos/32712959@N07/3222623206Monday, June 13, 2011 54

High-order FunctionsMonday, June 13, 2011 56

Lazy EvaluationMonday, June 13, 2011 59

http://d.hatena.ne.jp	72
http://coderwall.com	31
https://twimg0-a.akamaihd.net	16
http://paper.li	6
https://si0.twimg.com	6
https://twitter.com	5
http://twitter.com	3
url_unknown	2
http://us-w1.rockmelt.com	1
http://www.slideshare.net	1

関数型プログラミングの世界

by Kenta Murata on Jun 12, 2011

Accessibility

Categories

Tags

Upload Details

Usage Rights

10 Embeds 143

Statistics

関数型プログラミングの世界 — Presentation Transcript