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

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