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

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