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

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