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

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