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