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

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