120 Decks Ordered By Thumbs Up Count - Highest First - Chse one - invert order

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