Download to read offline
![[1, 2, 3]
['a', 'b', 'c']
[ ]
[ [1, 2], [3, 4] ]
[ (1, 'a'), (2, 'b'), (3, 'c') ]
head :: [a] → a
head [4, 8, 15, 16, 23, 42] == 4
tail :: [a] → [a]
tail [4, 8, 15, 16, 23, 42] == [8, 15, 16, 23, 42]](https://image.slidesharecdn.com/fprog-160616125013/85/slide-59-320.jpg)
![head :: [a] → a
head [4, 8, 15, 16, 23, 42] == 4
tail :: [a] → [a]
tail [4, 8, 15, 16, 23, 42] == [8, 15, 16, 23, 42]
init :: [a] → [a]
init [4, 8, 15, 16, 23, 42] == [4, 8, 15, 16, 23]
last :: [a] → a
last [4, 8, 15, 16, 23, 42] == 42](https://image.slidesharecdn.com/fprog-160616125013/85/slide-60-320.jpg)
![length :: [a] → Int
length [4, 8, 15, 16, 23, 42] == 6
null :: [a] → Bool
null [ ] == True null [1, 2, 3] == False
reverse [1, 2, 3] == [3, 2, 1]
take 3 [1, 2, 3, 4, 5] == [1, 2, 3]
drop 3 [1, 2, 3, 4, 5] == [4, 5]
sum [1, 2, 3, 4, 5] == 15
[1, 2, 3] ++ [4, 5] == [1, 2, 3, 4, 5]](https://image.slidesharecdn.com/fprog-160616125013/85/slide-61-320.jpg)
![[ x * 2 | x ← [1, 2, 3] ] == [2, 4, 6]
pairs = [ (x, y) | x ← [1, 2], y ← ['a', 'b'] ]
pairs == [ (1,'a'), (1,'b'), (2,'a'), (2,'b') ]](https://image.slidesharecdn.com/fprog-160616125013/85/slide-63-320.jpg)
![[ x * 2 | x ← [1, 2, 3] ] == [2, 4, 6]
pairs = [ (x, y) | x ← [1, 2], y ← ['a', 'b'] ]
pairs == [ (1,'a'), (1,'b'), (2,'a'), (2,'b') ]
[1..5] == [1, 2, 3, 4, 5]
[2,4..10] == [2, 4, 6, 8, 10]
[1..] == [1, 2, 3, 4, 5, 6, 7, 8, 9, …]
take 3 [1..] == [1, 2, 3]](https://image.slidesharecdn.com/fprog-160616125013/85/slide-64-320.jpg)
![[ x * 2 | x ← [1, 2, 3] ] == [2, 4, 6]
pairs = [ (x, y) | x ← [1, 2], y ← ['a', 'b'] ]
pairs == [ (1,'a'), (1,'b'), (2,'a'), (2,'b') ]
[1..5] == [1, 2, 3, 4, 5]
[2,4..10] == [2, 4, 6, 8, 10]
[1..] == [1, 2, 3, 4, 5, 6, 7, 8, 9, …]
take 3 [1..] == [1, 2, 3]
cycle [1, 2, 3] == [1, 2, 3, 1, 2, 3, 1, 2, 3, … ]
take 5 $ cycle [1, 2, 3] == [1, 2, 3, 1, 2]](https://image.slidesharecdn.com/fprog-160616125013/85/slide-65-320.jpg)
![filter :: (a -> Bool) -> [a] -> [a]](https://image.slidesharecdn.com/fprog-160616125013/85/slide-68-320.jpg)
![filter :: (a -> Bool) -> [a] -> [a]
filter (x -> x `mod` 2 == 0) [1..10] == [2, 4, 8, 10]](https://image.slidesharecdn.com/fprog-160616125013/85/slide-69-320.jpg)
![filter :: (a -> Bool) -> [a] -> [a]
filter (x -> x `mod` 2 == 0) [1..10] == [2, 4, 8, 10]
map :: (a -> b) -> [a] -> [b]](https://image.slidesharecdn.com/fprog-160616125013/85/slide-70-320.jpg)
![filter :: (a -> Bool) -> [a] -> [a]
filter (x -> x `mod` 2 == 0) [1..10] == [2, 4, 8, 10]
map :: (a -> b) -> [a] -> [b]
map (x → x + 5) [1,2,3] == [6,7,8]](https://image.slidesharecdn.com/fprog-160616125013/85/slide-71-320.jpg)
![filter :: (a -> Bool) -> [a] -> [a]
filter (x -> x `mod` 2 == 0) [1..10] == [2, 4, 8, 10]
map :: (a -> b) -> [a] -> [b]
map (+5) [1,2,3] == [6,7,8]](https://image.slidesharecdn.com/fprog-160616125013/85/slide-72-320.jpg)
![filter :: (a -> Bool) -> [a] -> [a]
filter (x -> x `mod` 2 == 0) [1..10] == [2, 4, 8, 10]
map :: (a -> b) -> [a] -> [b]
map (+5) [1,2,3] == [6,7,8]
foldl :: (a -> b -> a) -> a -> [b] -> a](https://image.slidesharecdn.com/fprog-160616125013/85/slide-73-320.jpg)
![filter :: (a -> Bool) -> [a] -> [a]
filter (x -> x `mod` 2 == 0) [1..10] == [2, 4, 8, 10]
map :: (a -> b) -> [a] -> [b]
map (+5) [1,2,3] == [6,7,8]
foldl :: (a -> b -> a) -> a -> [b] -> a
foldl (s x -> x + s) 0 [1, 2, 3] == 6](https://image.slidesharecdn.com/fprog-160616125013/85/slide-74-320.jpg)
![filter :: (a -> Bool) -> [a] -> [a]
filter (x -> x `mod` 2 == 0) [1..10] == [2, 4, 8, 10]
map :: (a -> b) -> [a] -> [b]
map (+5) [1,2,3] == [6,7,8]
foldl :: (a -> b -> a) -> a -> [b] -> a
foldl (s x -> x + s) 0 [1, 2, 3] == 6
sum = foldl (s x -> x + s) 0](https://image.slidesharecdn.com/fprog-160616125013/85/slide-75-320.jpg)
![null' :: [a] → Bool](https://image.slidesharecdn.com/fprog-160616125013/85/slide-77-320.jpg)
![null' :: [a] → Bool
null' [ ] = True](https://image.slidesharecdn.com/fprog-160616125013/85/slide-78-320.jpg)
![null' :: [a] → Bool
null' [ ] = True
null' _ = False](https://image.slidesharecdn.com/fprog-160616125013/85/slide-79-320.jpg)
![null' :: [a] → Bool
null' [ ] = True
null' _ = False
head' :: [a] → a](https://image.slidesharecdn.com/fprog-160616125013/85/slide-80-320.jpg)
![null' :: [a] → Bool
null' [ ] = True
null' _ = False
head' :: [a] → a
head' (x:xs) = x](https://image.slidesharecdn.com/fprog-160616125013/85/slide-81-320.jpg)
![null' :: [a] → Bool
null' [ ] = True
null' _ = False
head' :: [a] → a
head' (x:xs) = x
head' _ = error 'Empty list!'](https://image.slidesharecdn.com/fprog-160616125013/85/slide-82-320.jpg)
![null' :: [a] → Bool
null' [ ] = True
null' _ = False
head' :: [a] → a
head' (x:xs) = x
head' _ = error 'Empty list!'
[1, 2, 3] == (1:(2:(3:[])))](https://image.slidesharecdn.com/fprog-160616125013/85/slide-83-320.jpg)
![foldl' :: (a -> b -> a) -> a -> [b] -> a](https://image.slidesharecdn.com/fprog-160616125013/85/slide-84-320.jpg)
![foldl' :: (a -> b -> a) -> a -> [b] -> a
foldl' func acc (x:xs) = foldl' func (func acc x) xs](https://image.slidesharecdn.com/fprog-160616125013/85/slide-85-320.jpg)
![foldl' :: (a -> b -> a) -> a -> [b] -> a
foldl' func acc (x:xs) = foldl' func (func acc x) xs
foldl' _ acc _ = acc](https://image.slidesharecdn.com/fprog-160616125013/85/slide-86-320.jpg)
![foldl' :: (a -> b -> a) -> a -> [b] -> a
foldl' func acc (x:xs) = foldl' func (func acc x) xs
foldl' _ acc _ = acc
elem' :: Eq a => a -> [a] -> Bool](https://image.slidesharecdn.com/fprog-160616125013/85/slide-87-320.jpg)
![foldl' :: (a -> b -> a) -> a -> [b] -> a
foldl' func acc (x:xs) = foldl' func (func acc x) xs
foldl' _ acc _ = acc
elem' :: Eq a => a -> [a] -> Bool
elem' x (y:yx)
| x == y = True
| ...](https://image.slidesharecdn.com/fprog-160616125013/85/slide-88-320.jpg)
![foldl' :: (a -> b -> a) -> a -> [b] -> a
foldl' func acc (x:xs) = foldl' func (func acc x) xs
foldl' _ acc _ = acc
elem' :: Eq a => a -> [a] -> Bool
elem' x (y:yx)
| x == y = True
| otherwise = elem' x yx](https://image.slidesharecdn.com/fprog-160616125013/85/slide-89-320.jpg)
![foldl' :: (a -> b -> a) -> a -> [b] -> a
foldl' func acc (x:xs) = foldl' func (func acc x) xs
foldl' _ acc _ = acc
elem' :: Eq a => a -> [a] -> Bool
elem' x (y:yx)
| x == y = True
| otherwise = elem' x yx
elem' _ _ = False](https://image.slidesharecdn.com/fprog-160616125013/85/slide-90-320.jpg)
![foldl' :: (a -> b -> a) -> a -> [b] -> a
foldl' func acc (x:xs) = foldl' func (func acc x) xs
foldl' _ acc _ = acc
elem' :: Eq a => a -> [a] -> Bool
elem' x (y:yx)
| x == y = True
| otherwise = elem' x yx
elem' _ _ = False
elem' 1 [1, 2, 3] == True](https://image.slidesharecdn.com/fprog-160616125013/85/slide-91-320.jpg)
![foldl' :: (a -> b -> a) -> a -> [b] -> a
foldl' func acc (x:xs) = foldl' func (func acc x) xs
foldl' _ acc _ = acc
elem' :: Eq a => a -> [a] -> Bool
elem' x (y:yx)
| x == y = True
| otherwise = elem' x yx
elem' _ _ = False
elem' 1 [1, 2, 3] == True elem' 7 [1, 2, 3] == False](https://image.slidesharecdn.com/fprog-160616125013/85/slide-92-320.jpg)
Uploaded byAleksander Alekseev
Функциональное программирование - Александр Алексеев
Документ представляет собой обзор функционального программирования, описывая его парадигму и основы на языке Haskell. В нем рассматриваются различные концепции, такие как каррирование, лямбда-функции, кортежи, списки и функции высшего порядка. Также содержится информация о создании собственных функций и примерах применения в языках программирования.
More Related Content
Similar to Функциональное программирование - Александр Алексеев
Функциональное программирование - Александр Алексеев
- 1.
- 2.
- 3. – Процедурное программирование –Объектно-ориентированное программирование – Функциональное программирование – Логическое программирование – и другие...
- 4.
- 6. – Pascal – Си –и другие... Языки процедурного программирования:
- 7.
- 9. – Java – C# –Delphi (Object Pascal) – C++ – Python – Perl, Perl 6 – PHP5 – и многие другие ООП-языки:
- 10.
- 11.
- 13.
- 14. data Bool =True | False
- 15. data Bool =True | False positive :: Int → Bool positive x = x > 0
- 16. data Bool =True | False positive :: Int → Bool positive x = x > 0 max :: (Ord a) => a → a → a max x y | x > y = x | otherwise = y
- 17. data Person =Person { firstName :: String, lastName :: String, birthYear :: Int } deriving (Show)
- 18. data Person =Person { firstName :: String, lastName :: String, birthYear :: Int } deriving (Show) alex = Person { firstName = "Александр", lastName = "Алексеев", birthYear = 1988 }
- 19. class Eq awhere (==), (/=) :: a -> a -> Bool x /= y = not (x == y) x == y = not (x /= y)
- 20. class Eq awhere (==), (/=) :: a -> a -> Bool x /= y = not (x == y) x == y = not (x /= y) instance Eq Person where x == y = birthYear x == birthYear y
- 21. class Eq awhere (==), (/=) :: a -> a -> Bool x /= y = not (x == y) x == y = not (x /= y) instance Eq Person where x == y = birthYear x == birthYear y x /= y = not (x == y)
- 22. anton = Person{ firstName = "Антон", lastName = "Алексеев", birthYear = 1991 }
- 23. anton = Person{ firstName = "Антон", lastName = "Алексеев", birthYear = 1991 } alex == anton False
- 24. anton = Person{ firstName = "Антон", lastName = "Алексеев", birthYear = 1991 } alex == anton False alex == alex True
- 25. anton = Person{ firstName = "Антон", lastName = "Алексеев", birthYear = 1991 } alex == anton False alex == alex True anton == alex False
- 26. anton = Person{ firstName = "Антон", lastName = "Алексеев", birthYear = 1991 } alex == anton False alex == alex True anton == alex False anton /= alex True
- 27. instance Ord Personwhere compare x y = compare (birthYear y) (birthYear x)
- 28. instance Ord Personwhere compare x y = compare (birthYear y) (birthYear x) instance Ord Person where x `compare` y = birthYear y `compare` birthYear x
- 29. instance Ord Personwhere compare x y = compare (birthYear y) (birthYear x) instance Ord Person where x `compare` y = birthYear y `compare` birthYear x max :: (Ord a) => a → a → a
- 30. instance Ord Personwhere compare x y = compare (birthYear y) (birthYear x) instance Ord Person where x `compare` y = birthYear y `compare` birthYear x max :: (Ord a) => a → a → a max alex anton
- 31. instance Ord Personwhere compare x y = compare (birthYear y) (birthYear x) instance Ord Person where x `compare` y = birthYear y `compare` birthYear x max :: (Ord a) => a → a → a max alex anton birthYear (max alex anton) == 1988
- 32.
- 33. max :: (Orda) => a → a → a
- 34. max :: (Orda) => a → a → a max :: (Ord a) => a → (a → a)
- 35. max :: (Orda) => a → a → a max :: (Ord a) => a → (a → a) max' = max alex
- 36. max :: (Orda) => a → a → a max :: (Ord a) => a → (a → a) max' = max alex max' :: Person → Person
- 37. max :: (Orda) => a → a → a max :: (Ord a) => a → (a → a) max' = max alex max' :: Person → Person max' anton :: Person
- 38. max :: (Orda) => a → a → a max :: (Ord a) => a → (a → a) max' = max alex max' :: Person → Person max' anton :: Person birthYear (max' anton) == 1988
- 39.
- 40.
- 42. (x y →x + y)
- 43. (x y →x + y) (x y → x + y) :: ?
- 44. (x y →x + y) (x y → x + y) :: Num a => a → a → a
- 45. (x y →x + y) (x y → x + y) :: Num a => a → a → a (x y → x + y) 3 4
- 46. (x y →x + y) (x y → x + y) :: Num a => a → a → a (x y → x + y) 3 4 (x y → x + y) 3 4 == 7
- 47.
- 48.
- 49.
- 50. (1, 2) ('a', 'b') (1,2, 3, 4)
- 51. (1, 2) ('a', 'b') (1,2, 3, 4) (1, 'a')
- 52. (1, 2) ('a', 'b') (1,2, 3, 4) (1, 'a') ('a')
- 53. (1, 2) ('a', 'b') (1,2, 3, 4) (1, 'a') ('a') ( )
- 54. (1, 2) ('a', 'b') (1,2, 3, 4) (1, 'a') ('a') ( ) (1, (2, 'a'), 3)
- 55. (1, 2) ('a', 'b') (1,2, 3, 4) (1, 'a') ('a') ( ) (1, (2, 'a'), 3) fst (1, 2) == 1
- 56. (1, 2) ('a', 'b') (1,2, 3, 4) (1, 'a') ('a') ( ) (1, (2, 'a'), 3) fst (1, 2) == 1 snd (1, 2) == 2
- 57. (1, 2) ('a', 'b') (1,2, 3, 4) (1, 'a') ('a') ( ) (1, (2, 'a'), 3) fst (1, 2) == 1 snd (1, 2) == 2 snd (1, (2, 'a'), 3) == (2, 'a')
- 58.
- 59. [1, 2, 3] ['a','b', 'c'] [ ] [ [1, 2], [3, 4] ] [ (1, 'a'), (2, 'b'), (3, 'c') ] head :: [a] → a head [4, 8, 15, 16, 23, 42] == 4 tail :: [a] → [a] tail [4, 8, 15, 16, 23, 42] == [8, 15, 16, 23, 42]
- 60. head :: [a]→ a head [4, 8, 15, 16, 23, 42] == 4 tail :: [a] → [a] tail [4, 8, 15, 16, 23, 42] == [8, 15, 16, 23, 42] init :: [a] → [a] init [4, 8, 15, 16, 23, 42] == [4, 8, 15, 16, 23] last :: [a] → a last [4, 8, 15, 16, 23, 42] == 42
- 61. length :: [a]→ Int length [4, 8, 15, 16, 23, 42] == 6 null :: [a] → Bool null [ ] == True null [1, 2, 3] == False reverse [1, 2, 3] == [3, 2, 1] take 3 [1, 2, 3, 4, 5] == [1, 2, 3] drop 3 [1, 2, 3, 4, 5] == [4, 5] sum [1, 2, 3, 4, 5] == 15 [1, 2, 3] ++ [4, 5] == [1, 2, 3, 4, 5]
- 62.
- 63. [ x *2 | x ← [1, 2, 3] ] == [2, 4, 6] pairs = [ (x, y) | x ← [1, 2], y ← ['a', 'b'] ] pairs == [ (1,'a'), (1,'b'), (2,'a'), (2,'b') ]
- 64. [ x *2 | x ← [1, 2, 3] ] == [2, 4, 6] pairs = [ (x, y) | x ← [1, 2], y ← ['a', 'b'] ] pairs == [ (1,'a'), (1,'b'), (2,'a'), (2,'b') ] [1..5] == [1, 2, 3, 4, 5] [2,4..10] == [2, 4, 6, 8, 10] [1..] == [1, 2, 3, 4, 5, 6, 7, 8, 9, …] take 3 [1..] == [1, 2, 3]
- 65. [ x *2 | x ← [1, 2, 3] ] == [2, 4, 6] pairs = [ (x, y) | x ← [1, 2], y ← ['a', 'b'] ] pairs == [ (1,'a'), (1,'b'), (2,'a'), (2,'b') ] [1..5] == [1, 2, 3, 4, 5] [2,4..10] == [2, 4, 6, 8, 10] [1..] == [1, 2, 3, 4, 5, 6, 7, 8, 9, …] take 3 [1..] == [1, 2, 3] cycle [1, 2, 3] == [1, 2, 3, 1, 2, 3, 1, 2, 3, … ] take 5 $ cycle [1, 2, 3] == [1, 2, 3, 1, 2]
- 66.
- 68. filter :: (a-> Bool) -> [a] -> [a]
- 69. filter :: (a-> Bool) -> [a] -> [a] filter (x -> x `mod` 2 == 0) [1..10] == [2, 4, 8, 10]
- 70. filter :: (a-> Bool) -> [a] -> [a] filter (x -> x `mod` 2 == 0) [1..10] == [2, 4, 8, 10] map :: (a -> b) -> [a] -> [b]
- 71. filter :: (a-> Bool) -> [a] -> [a] filter (x -> x `mod` 2 == 0) [1..10] == [2, 4, 8, 10] map :: (a -> b) -> [a] -> [b] map (x → x + 5) [1,2,3] == [6,7,8]
- 72. filter :: (a-> Bool) -> [a] -> [a] filter (x -> x `mod` 2 == 0) [1..10] == [2, 4, 8, 10] map :: (a -> b) -> [a] -> [b] map (+5) [1,2,3] == [6,7,8]
- 73. filter :: (a-> Bool) -> [a] -> [a] filter (x -> x `mod` 2 == 0) [1..10] == [2, 4, 8, 10] map :: (a -> b) -> [a] -> [b] map (+5) [1,2,3] == [6,7,8] foldl :: (a -> b -> a) -> a -> [b] -> a
- 74. filter :: (a-> Bool) -> [a] -> [a] filter (x -> x `mod` 2 == 0) [1..10] == [2, 4, 8, 10] map :: (a -> b) -> [a] -> [b] map (+5) [1,2,3] == [6,7,8] foldl :: (a -> b -> a) -> a -> [b] -> a foldl (s x -> x + s) 0 [1, 2, 3] == 6
- 75. filter :: (a-> Bool) -> [a] -> [a] filter (x -> x `mod` 2 == 0) [1..10] == [2, 4, 8, 10] map :: (a -> b) -> [a] -> [b] map (+5) [1,2,3] == [6,7,8] foldl :: (a -> b -> a) -> a -> [b] -> a foldl (s x -> x + s) 0 [1, 2, 3] == 6 sum = foldl (s x -> x + s) 0
- 76.
- 77. null' :: [a]→ Bool
- 78. null' :: [a]→ Bool null' [ ] = True
- 79. null' :: [a]→ Bool null' [ ] = True null' _ = False
- 80. null' :: [a]→ Bool null' [ ] = True null' _ = False head' :: [a] → a
- 81. null' :: [a]→ Bool null' [ ] = True null' _ = False head' :: [a] → a head' (x:xs) = x
- 82. null' :: [a]→ Bool null' [ ] = True null' _ = False head' :: [a] → a head' (x:xs) = x head' _ = error 'Empty list!'
- 83. null' :: [a]→ Bool null' [ ] = True null' _ = False head' :: [a] → a head' (x:xs) = x head' _ = error 'Empty list!' [1, 2, 3] == (1:(2:(3:[])))
- 84. foldl' :: (a-> b -> a) -> a -> [b] -> a
- 85. foldl' :: (a-> b -> a) -> a -> [b] -> a foldl' func acc (x:xs) = foldl' func (func acc x) xs
- 86. foldl' :: (a-> b -> a) -> a -> [b] -> a foldl' func acc (x:xs) = foldl' func (func acc x) xs foldl' _ acc _ = acc
- 87. foldl' :: (a-> b -> a) -> a -> [b] -> a foldl' func acc (x:xs) = foldl' func (func acc x) xs foldl' _ acc _ = acc elem' :: Eq a => a -> [a] -> Bool
- 88. foldl' :: (a-> b -> a) -> a -> [b] -> a foldl' func acc (x:xs) = foldl' func (func acc x) xs foldl' _ acc _ = acc elem' :: Eq a => a -> [a] -> Bool elem' x (y:yx) | x == y = True | ...
- 89. foldl' :: (a-> b -> a) -> a -> [b] -> a foldl' func acc (x:xs) = foldl' func (func acc x) xs foldl' _ acc _ = acc elem' :: Eq a => a -> [a] -> Bool elem' x (y:yx) | x == y = True | otherwise = elem' x yx
- 90. foldl' :: (a-> b -> a) -> a -> [b] -> a foldl' func acc (x:xs) = foldl' func (func acc x) xs foldl' _ acc _ = acc elem' :: Eq a => a -> [a] -> Bool elem' x (y:yx) | x == y = True | otherwise = elem' x yx elem' _ _ = False
- 91. foldl' :: (a-> b -> a) -> a -> [b] -> a foldl' func acc (x:xs) = foldl' func (func acc x) xs foldl' _ acc _ = acc elem' :: Eq a => a -> [a] -> Bool elem' x (y:yx) | x == y = True | otherwise = elem' x yx elem' _ _ = False elem' 1 [1, 2, 3] == True
- 92. foldl' :: (a-> b -> a) -> a -> [b] -> a foldl' func acc (x:xs) = foldl' func (func acc x) xs foldl' _ acc _ = acc elem' :: Eq a => a -> [a] -> Bool elem' x (y:yx) | x == y = True | otherwise = elem' x yx elem' _ _ = False elem' 1 [1, 2, 3] == True elem' 7 [1, 2, 3] == False
- 93.
- 94. За кадром остались: –параметризованные типы
- 95. За кадром остались: –параметризованные типы – монады
- 96. За кадром остались: –параметризованные типы – монады – ввод/вывод
- 97. За кадром остались: –параметризованные типы – монады – ввод/вывод – аппликативные функторы
- 98. За кадром остались: –параметризованные типы – монады – ввод/вывод – аппликативные функторы – застежки
- 99. Зачем все этонужно:
- 100. Зачем все этонужно: – Настоящая кроссплатформенность
- 101. Зачем все этонужно: – Настоящая кроссплатформенность – Автоматическое управление памятью
- 102. Зачем все этонужно: – Настоящая кроссплатформенность – Автоматическое управление памятью – Отсутсвие побочных эффектов
- 103. Зачем все этонужно: – Настоящая кроссплатформенность – Автоматическое управление памятью – Отсутсвие побочных эффектов – Автоматическое распараллеливание
- 104. Зачем все этонужно: – Настоящая кроссплатформенность – Автоматическое управление памятью – Отсутсвие побочных эффектов – Автоматическое распараллеливание – Строгая типизация
- 105. Зачем все этонужно: – Настоящая кроссплатформенность – Автоматическое управление памятью – Отсутсвие побочных эффектов – Автоматическое распараллеливание – Строгая типизация – и не только
- 106.
- 107.
- 108. Что можно написатьна Haskell?
- 109. Что можно написатьна Haskell? – CLI-приложения (например, Darcs)
- 110. Что можно написатьна Haskell? – CLI-приложения (например, Darcs) – GUI-приложения (wxHaskell, gtk2hs, etc)
- 111. Что можно написатьна Haskell? – CLI-приложения (например, Darcs) – GUI-приложения (wxHaskell, gtk2hs, etc) – веб-приложения (Yesod, Happstack, etc)
- 112. Что можно написатьна Haskell? – CLI-приложения (например, Darcs) – GUI-приложения (wxHaskell, gtk2hs, etc) – веб-приложения (Yesod, Happstack, etc) – компиляторы, парсеры (Alex, Happy)
- 113. Что можно написатьна Haskell? – CLI-приложения (например, Darcs) – GUI-приложения (wxHaskell, gtk2hs, etc) – веб-приложения (Yesod, Happstack, etc) – компиляторы, парсеры (Alex, Happy) – модули ядра Linux
- 114. Что можно написатьна Haskell? – CLI-приложения (например, Darcs) – GUI-приложения (wxHaskell, gtk2hs, etc) – веб-приложения (Yesod, Happstack, etc) – компиляторы, парсеры (Alex, Happy) – модули ядра Linux – и многое другое
- 115.
- 116.
- 117.
- 118. Другие ФП-языки: – Erlang –OCaml – Standart ML
- 119. Другие ФП-языки: – Erlang –OCaml – Standart ML – Common Lisp
- 120. Другие ФП-языки: – Erlang –OCaml – Standart ML – Common Lisp – Scheme, Racket
- 121. Другие ФП-языки: – Erlang –OCaml – Standart ML – Common Lisp – Scheme, Racket – Clojure
- 122. Другие ФП-языки: – Erlang –OCaml – Standart ML – Common Lisp – Scheme, Racket – Clojure – и другие
- 123.
- 127.
- 128.
- 129. Подборка ссылок: – http://fprog.ru/planet/ –http://erlanger.ru/
- 130. Подборка ссылок: – http://fprog.ru/planet/ –http://erlanger.ru/ – http://it-talk.org/
- 131. Подборка ссылок: – http://fprog.ru/planet/ –http://erlanger.ru/ – http://it-talk.org/ – http://groups.google.ru/group/haskell-russian
- 132. Подборка ссылок: – http://fprog.ru/planet/ –http://erlanger.ru/ – http://it-talk.org/ – http://groups.google.ru/group/haskell-russian – http://groups.google.ru/group/erlang-russian
- 133. Подборка ссылок: – http://fprog.ru/planet/ –http://erlanger.ru/ – http://it-talk.org/ – http://groups.google.ru/group/haskell-russian – http://groups.google.ru/group/erlang-russian – http://groups.google.ru/group/clojure-russian
- 134. Подборка ссылок: – http://fprog.ru/planet/ –http://erlanger.ru/ – http://it-talk.org/ – http://groups.google.ru/group/haskell-russian – http://groups.google.ru/group/erlang-russian – http://groups.google.ru/group/clojure-russian – http://habrahabr.ru/hub/haskell
- 135. Подборка ссылок: – http://fprog.ru/planet/ –http://erlanger.ru/ – http://it-talk.org/ – http://groups.google.ru/group/haskell-russian – http://groups.google.ru/group/erlang-russian – http://groups.google.ru/group/clojure-russian – http://habrahabr.ru/hub/haskell – http://goo.gl/VUvjk (эта презентация)
- 136. Спасибо за внимание! АлександрАлексеев http://eax.me/