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

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