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