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

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