Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
Functional Programming and Ruby - EuRuKo
Search
Pat Shaughnessy
June 28, 2013
Technology
2
730
Functional Programming and Ruby - EuRuKo
Slides from Athens, June 2013
Pat Shaughnessy
June 28, 2013
Tweet
Share
More Decks by Pat Shaughnessy
See All by Pat Shaughnessy
20000 Leagues Under ActiveRecord
pat_shaughnessy
0
110
Visualizing Garbage Collection in Rubinius, JRuby and Ruby 2.0
pat_shaughnessy
8
690
Functional Programming and Ruby
pat_shaughnessy
6
1.3k
Dissecting a Ruby Block
pat_shaughnessy
10
440
Other Decks in Technology
See All in Technology
PdMはどのように全てのスピードを上げられるか ~ 非連続進化のための具体的な取り組み ~
sansantech
PRO
4
1.4k
テスト”ケース”駆動開発 で手戻りをなくそう
ryohma0510
0
340
OCI で始める!! Red Hat OpenShift / Get Started OpenShift on OCI
oracle4engineer
PRO
1
200
PDF Viewer作成の今までとこれから
hunachi
0
480
技術的負債解消の取り組みと専門チームのお話
bengo4com
0
340
【株式会社ELYZA】|GENIAC成果報告会 自社開発モデルプレゼンテーション
elyza
1
420
Technical Writing Meetup vol.35
soracom
PRO
2
130
とあるOSSを継続可能にするための取り組みについて / OSS Refactoring Process
bun913
1
220
効果的なオンコール対応と障害対応
ryuichi1208
6
3.1k
DroidKaigi 2024 たすけて!ViewModel
mhidaka
5
1.1k
再考 アクターモデル/ reconsider actor model
ytake
0
380
Agile in Automotive Industry, puzzles and lights.
hiranabe
3
1.4k
Featured
See All Featured
Cheating the UX When There Is Nothing More to Optimize - PixelPioneers
stephaniewalter
278
13k
Reflections from 52 weeks, 52 projects
jeffersonlam
346
20k
Pencils Down: Stop Designing & Start Developing
hursman
119
11k
The Art of Delivering Value - GDevCon NA Keynote
reverentgeek
1
55
Fight the Zombie Pattern Library - RWD Summit 2016
marcelosomers
230
17k
Building Flexible Design Systems
yeseniaperezcruz
325
38k
Helping Users Find Their Own Way: Creating Modern Search Experiences
danielanewman
29
2.2k
The MySQL Ecosystem @ GitHub 2015
samlambert
250
12k
A Modern Web Designer's Workflow
chriscoyier
692
190k
GraphQLとの向き合い方2022年版
quramy
43
13k
Product Roadmaps are Hard
iamctodd
PRO
48
10k
jQuery: Nuts, Bolts and Bling
dougneiner
61
7.4k
Transcript
foo :: Ord a => [a] -> [a] foo []
= [] foo (p:xs) = (foo lesser) ++ [p] ++ (foo greater) where lesser = filter (< p) xs greater = filter (>= p) xs
None
Ruby is a language designed in the following steps: *
take a simple lisp language * add blocks, inspired by higher order functions * add methods found in Smalltalk * add functionality found in Perl So, Ruby was a Lisp originally, in theory. Let's call it MatzLisp from now on. ;-) ! ! ! ! ! ! ! matz.
None
None
None
None
Haskell... is a polymorphically statically typed, lazy, purely functional language,
quite different from most other programming languages. The language is named for Haskell Brooks Curry, ...
- what is “functional programming?” - higher order functions -
lazy evaluation - memoization
None
higher order functions
[1..10] =>[1, 2, 3, 4, 5, 6, 7, 8, 9,
10] (1..10).to_a
[ x*x | x <- [1..10]] (1..10).collect { |x| x*x
} =>[1, 4, 9, 16, 25, 36, 49, 64, 81, 100] (1..10).map { |x| x*x }
None
map (\x -> x*x) [1..10] (1..10).map &lambda { |x| x*x
} =>[1, 4, 9, 16, 25, 36, 49, 64, 81, 100] (1..10).map &(->(x) { x*x })
lazy evaluation
[1..] =>[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28, 29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54, 55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80, 81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,1 05,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123, etc...
take 10 [1..] =>[1,2,3,4,5,6,7,8,9,10]
take 10 [ x+1 | x <- [ x*x |
x <- [1..]]] =>[2,5,10,17,26,37,50,65,82,101]
(1..Float::INFINITY) .lazy .collect { |x| x*x } .collect { |x|
x+1 } .take(10).force =>[2,5,10,17,26,37,50,65,82,101]
=>[2,5,10,17,26,37,50,65,82,101] (1..Float::INFINITY) .lazy .collect { |x| x*x } .collect {
|x| x+1 } .first(10)
(1..10).collect { |x| x*x } each Range Enumerable #collect Enumerable#collect
enum = Enumerator.new do |y| y.yield 1 y.yield 2 end
p enum.collect { |x| x*x } => [1, 4] Enumerator
enum = Enumerator.new do |y| y.yield 1 y.yield 2 end
enum.collect do |x| x*x end
Enumerator Yielder yields Generator do |y| y.yield 1 y.yield 2
end
Enumerator::Lazy calls each yields Enumerator::Lazy calls each yields my block
my block yields yields
=>[2,5,10,17,26,37,50,65,82,101] (1..Float::INFINITY) .lazy .collect { |x| x*x } .collect {
|x| x+1 } .first(10)
Step 1: Call "each" Lazy Lazy x*x x+1 yield yield
Infinite range first(10) Step 2: yield to the blocks, one at a time
memoization
slow_fib 0 = 0 slow_fib 1 = 1 slow_fib n
= slow_fib (n-2) + slow_fib (n-1) map slow_fib [1..10] => [1,1,2,3,5,8,13,21,34,55] http://www.haskell.org/haskellwiki/Memoization
None
memoized_fib = (map fib [0 ..] !!) where fib 0
= 0 fib 1 = 1 fib n = memoized_fib (n-2) + memoized_fib (n-1) Typical Haskell magic! http://www.haskell.org/haskellwiki/Memoization
(map fib [0 ..] !!) Infinite, lazy list of return
values A curried function to return the requested fib
[0 ..] (0..Float::INFINITY)
map fib [0 ..] (0..Float::INFINITY) .lazy.map {|x| fib(x) }
(map fib [0 ..] !!) cache = (0..Float::INFINITY) .lazy.map {|x|
fib(x) } nth_element_from_list = lambda { |ary, n| ary[n]} nth_fib = nth_element_from_list.curry[cache]
map memoized_fib [1..10] => [1,1,2,3,5,8,13,21,34,55] `block in <main>': undefined method
`[]' for #<Enumerator::Lazy: #<Enumerator::Lazy: 0..Infinity>:map> (NoMethodError)
each Range Enumerable #collect (0..Float::INFINITY) .lazy.map {|x| fib(x) } nth_element_from_list
= lambda { |ary, n| ary[n]}
@cache = {} @cache[1] = 1 @cache[2] = 1 def
memoized_fib(n) @cache[n] ||= memoized_fib(n-1) + memoized_fib(n-2) end
learn by studying other languages... and acquire a different perspective
on Ruby
Ruby has many functional features, but is not a functional
language