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

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