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

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