120 Decks Ordered By Applause Count - Highest First - Chse one - invert order

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