120 Decks Ordered By Applause Count - Lowest First - Chse one - invert order

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