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

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