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

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