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

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