113 Decks Ordered By Love Count - Lowest First - Chse one - invert order

#	Title	Loves
1	ApplicativeError functions handling and recovering from errors: A mnemonic to recall their signatures from their names	5
2	Point-free or Die - Tacit Programming in Haskell	6
3	Test Doubles - Terminology, Definitions and Illustrations - with Examples - Part 1	6
4	Non-strict functions, bottom, and Scala by-name parameters	7
5	Drawing Heighway’s Dragon - Part 4 - Interactive and Animated Dragon Creation	12
6	The Open-Closed Principle - Part 2 - The Contemporary Version - An Introduction	12
7	Folding Cheat Sheet #9 - List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	13
8	Drawing Heighway’s Dragon - Part 3 - Simplification Through Separation of Concerns - Rotation Without Matrix Multiplication	13
9	The Nature of Complexity in John Ousterhout’s Philosophy of Software Design	14
10	De Morgan's Laws are Monoid Homomorphisms	14
11	Drawing Heighway’s Dragon - Part 2 - Recursive Function Simplification - From 2^n Recursive Invocations To n Tail-Recursive Invocations Exploiting Self-Similarity	14
12	List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	14
13	Function Composition - forward composition versus backward composition	18
14	Symmetry in the interrelation of flatMap/foldMap/traverse and flatten/fold/sequence	20
15	Monad as Functor with pair of Natural Transformations	20
16	The Open-Closed Principle - Part 1 - The Original Version	21
17	Addendum to `Monads do not Compose`	23
18	Functor Composition	25
19	Year when lambda functions were introduced in various languages	25
20	Fibonacci Function Gallery - Part 1	27
21	Monad Transformers - Part 1	27
22	Drawing Heighway’s Dragon - Part 1 - Recursive Function Rewrite - From Imperative Style in Pascal 64 To Functional Style in Scala 3	28
23	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 2	28
24	Folding Cheat Sheet Series Titles	29
25	Monads do not Compose	29
26	Fibonacci Function Gallery - Part 2	31
27	From Subtype Polymorphism To Typeclass-based Ad hoc Polymorphism - An Example	31
28	Sequence and Traverse - Part 1	35
29	Folding Unfolded - Part 5	35
30	Functional Effects - Part 1	37
31	Sequence and Traverse - Part 2	37
32	State Monad	38
33	Arrive at monads by going from composition of pure functions to composition of effectful functions	38
34	‘go-to’ general-purpose sequential collections - from Java To Scala	38
35	The Debt Metaphor - Ward Cunningham in his 2009 YouTube video	39
36	Folding Cheat Sheet #8 - Folding with monoids	40
37	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 2	41
38	Monoids - Part 2 - With examples using Scalaz and Cats	41
39	Monad Fact #5	41
40	Folding Unfolded - Part 3	41
41	Ad hoc Polymorphism using Type Classes and Cats	41
42	Fusing Transformations of Strict Scala Collections with Views	41
43	The Uniform Access Principle	42
44	Side by Side - Scala and Java Adaptations of Martin Fowler’s Javascript Refactoring Example	43
45	Monad Fact #4	43
46	Natural Transformations	43
47	Game of Life - Polyglot FP - Haskell and Scala - Part 3	43
48	The Monad Fact Series	44
49	Sierpinski Triangle - Polyglot FP for Fun and Profit - Haskell and Scala	44
50	Monad Fact #3	44
51	A sighting of sequence function in Practical FP in Scala	44
52	Algebraic Data Types for Data Oriented Programming - From Haskell and Scala to Java	44
53	Sequence and Traverse - Part 3	44
54	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 1	45
55	Folding Cheat Sheet #3 - The universal property of fold	45
56	Lambda Expressions and Java 8 - Lambda Calculus, Lambda Expressions, Syntactic Sugar, First Class Functions	45
57	The aggregate function - from sequential and parallel folds to parallel aggregation	46
58	Left and Right Folds - Comparison of a mathematical definition and a programmatic one	46
59	Functional Effects - Part 2	46
60	Game of Life - Polyglot FP - Haskell and Scala - Part 2	46
61	Writer Monad for logging execution of functions	48
62	Kleisli Composition	49
63	Folding Unfolded - Part 4	49
64	Applicative Functor - Part 3	50
65	Folding Unfolded - Part 1	50
66	The Expression Problem Part 2	50
67	Folding Cheat Sheet #2 - Programmatic and mathematical definitions of right fold and left fold	50
68	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 4	51
69	Folding Cheat Sheet #4 - For functions that can be defined both as a right fold and as a left fold, one may be more efficient than the other	51
70	Sum and Product Types - The Fruit Salad & Fruit Snack Example	51
71	The Sieve of Eratosthenes - Part 1	52
72	Monoids - Part 1 - With examples using Scalaz and Cats	52
73	Monad Fact #2	52
74	Function Applicative for Great Good of Palindrome Checker Function	53
75	A sighting of traverse_ in Practical FP in Scala	53
76	Folding Cheat Sheet #5 - Folding a list right and left using Cons and Nil results in the identity and reverse functions	53
77	Monad Fact #1	53
78	Functor Laws	53
79	Monad Fact #6	54
80	A sighting of traverseFilter and foldMap in Practical FP in Scala	55
81	The Functional Programming Triad of map, filter and fold	55
82	Applicative Functor - Part 2	57
83	Monad Laws Must Be Checked	57
84	Folding Cheat Sheet #7 - The three duality theorems of fold	58
85	Kleisli composition, flatMap, join, map, unit - implementation and interrelation - V2 updated for Scala 3	59
86	Function Applicative for Great Good of Leap Year Function	60
87	From Scala Monadic Effects to Unison Algebraic Effects	62
88	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Java	62
89	Folding Unfolded - Part 2	63
90	Game of Life - Polyglot FP - Haskell and Scala - Part 1	64
91	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Scala	66
92	The Functional Programming Triad of Folding, Scanning and Iteration - A first example in Scala and Haskell	69
93	Compositionality and Category Theory	69
94	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 3	71
95	Quicksort - a whistle-stop tour of the algorithm in five languages and four paradigms	72
96	Tagless Final Encoding - Algebras and Interpreters and also Programs	73
97	Computer Graphics in Java and Scala - Part 1	77
98	Applicative Functor - Part 1	78
99	Scala 3 enum for a terser Option Monad Algebraic Data Type	79
100	The Expression Problem Part 1	80
101	The Sieve of Eratosthenes - Part 2 - Genuine versus Unfaithful Sieve	83
102	Functional Core and Imperative Shell - Game of Life Example - Haskell and Scala	84
103	Hand Rolled Applicative User Validation Code Kata	84
104	Scala Left Fold Parallelisation - Three Approaches	86
105	Computer Graphics in Java and Scala - Part 1b	86
106	A Sighting of filterA in Typelevel Rite of Passage	88
107	Folding Cheat Sheet #1 - Folding over recursively defined data structures for natural numbers and lists	98
108	Nat, List and Option Monoids - From scratch - Combining and Folding - An example	111
109	Direct Style Effect Systems - The Print[A] Example - A Comprehension Aid	119
110	Definitions of Functional Programming	119
111	N-Queens Combinatorial Puzzle meets Cats	127
112	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 1	131
113	Folding Cheat Sheet #6 - Left and right folds and tail recursion	208