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

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