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

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