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