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

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