"Programming in Haskell (Second Edition)" / Graham Hutton
"Programming in Scala (Fourth Edition)" / artima / Martin Odersky, Lex Spoon, Bill Venners
"A Friendly Introduction to Number Theory" / Joseph H. Silverman
"情報科学における論理" / 日本評論社 / 小野寛晰
"計算理論の基礎 (原著第 2 版)" / 共立出版 / Michael Sipser
AtCoder
"りあクト！ TypeScript で始めるつらくない React 開発（第 3.1 版）【I. 言語・環境編】"
"りあクト！ TypeScript で始めるつらくない React 開発（第 3.1 版）【II. React 基礎編】"
"りあクト！ TypeScript で始めるつらくない React 開発（第 3.1 版）【III. React 応用編】" / 大岡 由佳
"体系的に学ぶ 安全な Web アプリケーションの作り方（第 2 版）" / 徳丸 浩
AtCoder Problems / BC4B / Hard 100 (2 nd)
"Programming in Haskell (2nd Edition)" / Grahm Hutton
Original: https://github.com/oukayuka/Riakuto-StartingReact-ja3.1
https://github.com/e5pe0n/rea-ct
e.g. insertion sort in Haskell
insert :: Ord a => a -> [a] -> [a]
insert x [] = [x]
insert x (y:ys)
| x <= y = x:y:ys
| otherwise = y:insert x ys
isort :: Ord a => [a] -> [a]
isort [] = []
isort (x:xs) = insert x (isort xs)
isort [3, 2, 1, 4]
= insert 3 (insert 2 (insert 1 (insert 4 [])))
= insert 3 (insert 2 (insert 1 [4]))
= insert 3 (insert 2 [1, 4])
= insert 3 [1, 2, 4]
= [1, 2, 3, 4]
qsort :: Ord a => [a] -> [a]
qsort [] = []
qsort (x:xs) = qsort smaller ++ [x] ++ qsort larger
where
smaller = [a | a <- xs, a <= x]
larger = [b | b <- xs, b > x]
add :: Int -> Int -> Int
add x y = x + y
-- means
add :: Int -> (Int -> Int)
add = \x -> (\y -> x + y)
-- Haskell
data Bool = False | True
// TypeScript
type Bool = true | false
e.g.
replicate :: Int -> a -> [a]
replicate 0 _ = []
replicate n x = x : replicate (n - 1) x
-- Base case:
length (replicate 0 x)
= { applying replicate }
length []
= { applying length }
0
-- Inductive case:
length (replicate (n + 1) x)
= { applying replicate }
length (x : replicate n x)
= { applying length }
1 + length (replicate n x)
= { induction hypothesis }
1 + n
= { commutativity of + }
n + 1