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

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